About the Execution of ITS-Tools for PolyORBLF-PT-S04J04T06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16205.464 | 3600000.00 | 5976558.00 | 69264.50 | FTFFFF??TF??FFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r168-tall-165277017000636.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 PolyORBLF-PT-S04J04T06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017000636
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.1M
-rw-r--r-- 1 mcc users 21K Apr 29 14:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 29 14:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 45K Apr 29 14:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 203K Apr 29 14:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.0K May 9 08:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K May 9 08:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 9 08:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 9 08:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K May 9 08:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K May 9 08:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 2.5M 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 PolyORBLF-PT-S04J04T06-LTLFireability-00
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-01
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-02
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-03
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-04
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-05
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-06
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-07
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-08
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-09
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-10
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-11
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-12
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-13
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-14
FORMULA_NAME PolyORBLF-PT-S04J04T06-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652901233163
Running Version 202205111006
[2022-05-18 19:13: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-18 19:13:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 19:13:54] [INFO ] Load time of PNML (sax parser for PT used): 308 ms
[2022-05-18 19:13:54] [INFO ] Transformed 554 places.
[2022-05-18 19:13:54] [INFO ] Transformed 2998 transitions.
[2022-05-18 19:13:54] [INFO ] Parsed PT model containing 554 places and 2998 transitions in 438 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
[2022-05-18 19:13:54] [INFO ] Reduced 36 identical enabling conditions.
[2022-05-18 19:13:54] [INFO ] Reduced 36 identical enabling conditions.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 217 out of 554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 550 transition count 1372
Applied a total of 4 rules in 80 ms. Remains 550 /554 variables (removed 4) and now considering 1372/1372 (removed 0) transitions.
[2022-05-18 19:13:55] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 550 cols
[2022-05-18 19:13:55] [INFO ] Computed 46 place invariants in 84 ms
[2022-05-18 19:13:56] [INFO ] Dead Transitions using invariants and state equation in 1493 ms found 324 transitions.
Found 324 dead transitions using SMT.
Drop transitions removed 324 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 324 transitions.
[2022-05-18 19:13:56] [INFO ] Flow matrix only has 1024 transitions (discarded 24 similar events)
// Phase 1: matrix 1024 rows 550 cols
[2022-05-18 19:13:56] [INFO ] Computed 46 place invariants in 31 ms
[2022-05-18 19:13:56] [INFO ] Implicit Places using invariants in 349 ms returned []
[2022-05-18 19:13:56] [INFO ] Flow matrix only has 1024 transitions (discarded 24 similar events)
// Phase 1: matrix 1024 rows 550 cols
[2022-05-18 19:13:56] [INFO ] Computed 46 place invariants in 20 ms
[2022-05-18 19:13:57] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:14:00] [INFO ] Implicit Places using invariants and state equation in 4056 ms returned []
Implicit Place search using SMT with State Equation took 4414 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 550/554 places, 1048/1372 transitions.
Applied a total of 0 rules in 26 ms. Remains 550 /550 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 550/554 places, 1048/1372 transitions.
Support contains 217 out of 550 places after structural reductions.
[2022-05-18 19:14:01] [INFO ] Flatten gal took : 151 ms
[2022-05-18 19:14:01] [INFO ] Flatten gal took : 115 ms
[2022-05-18 19:14:01] [INFO ] Input system was already deterministic with 1048 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 495 ms. (steps per millisecond=20 ) properties (out of 36) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
[2022-05-18 19:14:02] [INFO ] Flow matrix only has 1024 transitions (discarded 24 similar events)
// Phase 1: matrix 1024 rows 550 cols
[2022-05-18 19:14:02] [INFO ] Computed 46 place invariants in 19 ms
[2022-05-18 19:14:02] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-18 19:14:02] [INFO ] [Real]Absence check using 13 positive and 33 generalized place invariants in 25 ms returned sat
[2022-05-18 19:14:03] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:1
[2022-05-18 19:14:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2022-05-18 19:14:03] [INFO ] [Nat]Absence check using 13 positive and 33 generalized place invariants in 26 ms returned sat
[2022-05-18 19:14:05] [INFO ] After 2240ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2022-05-18 19:14:05] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:14:06] [INFO ] After 1322ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :3 sat :1
[2022-05-18 19:14:07] [INFO ] Deduced a trap composed of 15 places in 314 ms of which 5 ms to minimize.
[2022-05-18 19:14:07] [INFO ] Deduced a trap composed of 320 places in 317 ms of which 2 ms to minimize.
[2022-05-18 19:14:07] [INFO ] Deduced a trap composed of 342 places in 278 ms of which 1 ms to minimize.
[2022-05-18 19:14:08] [INFO ] Deduced a trap composed of 311 places in 265 ms of which 2 ms to minimize.
[2022-05-18 19:14:08] [INFO ] Deduced a trap composed of 329 places in 229 ms of which 1 ms to minimize.
[2022-05-18 19:14:09] [INFO ] Deduced a trap composed of 301 places in 221 ms of which 0 ms to minimize.
[2022-05-18 19:14:09] [INFO ] Deduced a trap composed of 289 places in 232 ms of which 0 ms to minimize.
[2022-05-18 19:14:09] [INFO ] Deduced a trap composed of 343 places in 237 ms of which 0 ms to minimize.
[2022-05-18 19:14:10] [INFO ] Deduced a trap composed of 289 places in 215 ms of which 0 ms to minimize.
[2022-05-18 19:14:10] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 0 ms to minimize.
[2022-05-18 19:14:11] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4416 ms
[2022-05-18 19:14:11] [INFO ] After 5918ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 298 ms.
[2022-05-18 19:14:11] [INFO ] After 8592ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 550 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 550 transition count 994
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 496 transition count 994
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 108 place count 496 transition count 934
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 228 place count 436 transition count 934
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 344 place count 378 transition count 876
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 356 place count 378 transition count 864
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 368 place count 366 transition count 864
Applied a total of 368 rules in 152 ms. Remains 366 /550 variables (removed 184) and now considering 864/1048 (removed 184) transitions.
[2022-05-18 19:14:11] [INFO ] Flow matrix only has 840 transitions (discarded 24 similar events)
// Phase 1: matrix 840 rows 366 cols
[2022-05-18 19:14:11] [INFO ] Computed 46 place invariants in 11 ms
[2022-05-18 19:14:12] [INFO ] Dead Transitions using invariants and state equation in 654 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 366/550 places, 864/1048 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 254599 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 254599 steps, saw 179619 distinct states, run finished after 3002 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 19:14:15] [INFO ] Flow matrix only has 840 transitions (discarded 24 similar events)
// Phase 1: matrix 840 rows 366 cols
[2022-05-18 19:14:15] [INFO ] Computed 46 place invariants in 20 ms
[2022-05-18 19:14:15] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2022-05-18 19:14:15] [INFO ] [Real]Absence check using 15 positive and 31 generalized place invariants in 22 ms returned sat
[2022-05-18 19:14:15] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 19:14:15] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2022-05-18 19:14:15] [INFO ] [Nat]Absence check using 15 positive and 31 generalized place invariants in 28 ms returned sat
[2022-05-18 19:14:17] [INFO ] After 2138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 19:14:17] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:14:18] [INFO ] After 798ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 19:14:18] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 1 ms to minimize.
[2022-05-18 19:14:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 462 ms
[2022-05-18 19:14:19] [INFO ] After 1297ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2022-05-18 19:14:19] [INFO ] After 3575ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 366 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 366/366 places, 864/864 transitions.
Applied a total of 0 rules in 26 ms. Remains 366 /366 variables (removed 0) and now considering 864/864 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 366/366 places, 864/864 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 366/366 places, 864/864 transitions.
Applied a total of 0 rules in 24 ms. Remains 366 /366 variables (removed 0) and now considering 864/864 (removed 0) transitions.
[2022-05-18 19:14:19] [INFO ] Flow matrix only has 840 transitions (discarded 24 similar events)
// Phase 1: matrix 840 rows 366 cols
[2022-05-18 19:14:19] [INFO ] Computed 46 place invariants in 17 ms
[2022-05-18 19:14:19] [INFO ] Implicit Places using invariants in 410 ms returned [62, 158, 180, 236, 252, 322]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 423 ms to find 6 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 360/366 places, 864/864 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 358 transition count 862
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 358 transition count 862
Applied a total of 4 rules in 46 ms. Remains 358 /360 variables (removed 2) and now considering 862/864 (removed 2) transitions.
[2022-05-18 19:14:19] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 358 cols
[2022-05-18 19:14:19] [INFO ] Computed 40 place invariants in 20 ms
[2022-05-18 19:14:20] [INFO ] Implicit Places using invariants in 416 ms returned []
[2022-05-18 19:14:20] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 358 cols
[2022-05-18 19:14:20] [INFO ] Computed 40 place invariants in 15 ms
[2022-05-18 19:14:20] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:14:26] [INFO ] Implicit Places using invariants and state equation in 6571 ms returned []
Implicit Place search using SMT with State Equation took 6991 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 358/366 places, 862/864 transitions.
Finished structural reductions, in 2 iterations. Remains : 358/366 places, 862/864 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 272741 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 272741 steps, saw 188330 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 19:14:29] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 358 cols
[2022-05-18 19:14:29] [INFO ] Computed 40 place invariants in 31 ms
[2022-05-18 19:14:29] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-18 19:14:29] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 17 ms returned sat
[2022-05-18 19:14:29] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 19:14:29] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-18 19:14:30] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 38 ms returned sat
[2022-05-18 19:14:31] [INFO ] After 1839ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 19:14:31] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:14:33] [INFO ] After 1681ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 19:14:33] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 0 ms to minimize.
[2022-05-18 19:14:33] [INFO ] Deduced a trap composed of 146 places in 173 ms of which 0 ms to minimize.
[2022-05-18 19:14:34] [INFO ] Deduced a trap composed of 175 places in 182 ms of which 1 ms to minimize.
[2022-05-18 19:14:34] [INFO ] Deduced a trap composed of 140 places in 154 ms of which 0 ms to minimize.
[2022-05-18 19:14:35] [INFO ] Deduced a trap composed of 170 places in 168 ms of which 0 ms to minimize.
[2022-05-18 19:14:35] [INFO ] Deduced a trap composed of 139 places in 173 ms of which 0 ms to minimize.
[2022-05-18 19:14:35] [INFO ] Deduced a trap composed of 160 places in 173 ms of which 1 ms to minimize.
[2022-05-18 19:14:36] [INFO ] Deduced a trap composed of 171 places in 179 ms of which 0 ms to minimize.
[2022-05-18 19:14:36] [INFO ] Deduced a trap composed of 185 places in 153 ms of which 0 ms to minimize.
[2022-05-18 19:14:36] [INFO ] Deduced a trap composed of 185 places in 163 ms of which 1 ms to minimize.
[2022-05-18 19:14:36] [INFO ] Deduced a trap composed of 150 places in 214 ms of which 2 ms to minimize.
[2022-05-18 19:14:36] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3275 ms
[2022-05-18 19:14:36] [INFO ] After 5023ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 168 ms.
[2022-05-18 19:14:37] [INFO ] After 7145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 358 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 358/358 places, 862/862 transitions.
Applied a total of 0 rules in 32 ms. Remains 358 /358 variables (removed 0) and now considering 862/862 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 358/358 places, 862/862 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 358/358 places, 862/862 transitions.
Applied a total of 0 rules in 36 ms. Remains 358 /358 variables (removed 0) and now considering 862/862 (removed 0) transitions.
[2022-05-18 19:14:37] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 358 cols
[2022-05-18 19:14:37] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-18 19:14:38] [INFO ] Implicit Places using invariants in 1074 ms returned []
[2022-05-18 19:14:38] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 358 cols
[2022-05-18 19:14:38] [INFO ] Computed 40 place invariants in 25 ms
[2022-05-18 19:14:38] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:14:43] [INFO ] Implicit Places using invariants and state equation in 5404 ms returned []
Implicit Place search using SMT with State Equation took 6484 ms to find 0 implicit places.
[2022-05-18 19:14:43] [INFO ] Redundant transitions in 54 ms returned []
[2022-05-18 19:14:43] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 358 cols
[2022-05-18 19:14:43] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-18 19:14:44] [INFO ] Dead Transitions using invariants and state equation in 601 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 358/358 places, 862/862 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 358 transition count 838
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 34 place count 353 transition count 888
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 1 with 44 rules applied. Total rules applied 78 place count 353 transition count 844
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 353 transition count 838
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 90 place count 347 transition count 838
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 101 place count 347 transition count 827
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 112 place count 336 transition count 827
Applied a total of 112 rules in 202 ms. Remains 336 /358 variables (removed 22) and now considering 827/862 (removed 35) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 827 rows 336 cols
[2022-05-18 19:14:44] [INFO ] Computed 40 place invariants in 9 ms
[2022-05-18 19:14:44] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-18 19:14:44] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 18 ms returned sat
[2022-05-18 19:14:45] [INFO ] After 1120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 19:14:45] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-18 19:14:45] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 17 ms returned sat
[2022-05-18 19:14:46] [INFO ] After 679ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 19:14:46] [INFO ] After 820ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-05-18 19:14:46] [INFO ] After 936ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-18 19:14:46] [INFO ] Flatten gal took : 55 ms
[2022-05-18 19:14:46] [INFO ] Flatten gal took : 92 ms
[2022-05-18 19:14:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9478536269343305403.gal : 43 ms
[2022-05-18 19:14:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5535858984988155205.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16328162291568305991;'/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/ReachabilityCardinality9478536269343305403.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5535858984988155205.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...319
Loading property file /tmp/ReachabilityCardinality5535858984988155205.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 27
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :27 after 182
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :182 after 449
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :449 after 797
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :797 after 1137
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1137 after 1702
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1702 after 2652
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2652 after 7972
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :7972 after 91056
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :91056 after 2.89346e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.9795e+06 after 2.98287e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.98287e+06 after 2.99689e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.99689e+06 after 3.31616e+06
Detected timeout of ITS tools.
[2022-05-18 19:15:01] [INFO ] Flatten gal took : 53 ms
[2022-05-18 19:15:01] [INFO ] Applying decomposition
[2022-05-18 19:15:02] [INFO ] Flatten gal took : 88 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/graph3904619611151649090.txt' '-o' '/tmp/graph3904619611151649090.bin' '-w' '/tmp/graph3904619611151649090.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3904619611151649090.bin' '-l' '-1' '-v' '-w' '/tmp/graph3904619611151649090.weights' '-q' '0' '-e' '0.001'
[2022-05-18 19:15:02] [INFO ] Decomposing Gal with order
[2022-05-18 19:15:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 19:15:02] [INFO ] Removed a total of 1001 redundant transitions.
[2022-05-18 19:15:03] [INFO ] Flatten gal took : 321 ms
[2022-05-18 19:15:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 237 labels/synchronizations in 33 ms.
[2022-05-18 19:15:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3610848441761317390.gal : 22 ms
[2022-05-18 19:15:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15771286970683697227.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16328162291568305991;'/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/ReachabilityCardinality3610848441761317390.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15771286970683697227.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/ReachabilityCardinality15771286970683697227.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 :1 after 1
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1 after 232
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :232 after 232
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :232 after 232
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :232 after 1408
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1408 after 9652
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :9652 after 10780
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :10780 after 18268
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :18268 after 165228
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8765522170823820056
[2022-05-18 19:15:18] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8765522170823820056
Running compilation step : cd /tmp/ltsmin8765522170823820056;'/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 1481 ms.
Running link step : cd /tmp/ltsmin8765522170823820056;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin8765522170823820056;'/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' 'AtomicPropp27==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(G(X((X(p0)||X(X(p1)))))))))'
Support contains 25 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 544 transition count 1042
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 544 transition count 1042
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 538 transition count 1036
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 538 transition count 1036
Applied a total of 24 rules in 22 ms. Remains 538 /550 variables (removed 12) and now considering 1036/1048 (removed 12) transitions.
[2022-05-18 19:15:33] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 19:15:33] [INFO ] Computed 46 place invariants in 20 ms
[2022-05-18 19:15:34] [INFO ] Dead Transitions using invariants and state equation in 1118 ms found 0 transitions.
[2022-05-18 19:15:34] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 19:15:34] [INFO ] Computed 46 place invariants in 17 ms
[2022-05-18 19:15:35] [INFO ] Implicit Places using invariants in 526 ms returned []
[2022-05-18 19:15:35] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 19:15:35] [INFO ] Computed 46 place invariants in 22 ms
[2022-05-18 19:15:35] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:15:50] [INFO ] Implicit Places using invariants and state equation in 15230 ms returned []
Implicit Place search using SMT with State Equation took 15781 ms to find 0 implicit places.
[2022-05-18 19:15:50] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 19:15:50] [INFO ] Computed 46 place invariants in 18 ms
[2022-05-18 19:15:51] [INFO ] Dead Transitions using invariants and state equation in 997 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 538/550 places, 1036/1048 transitions.
Finished structural reductions, in 1 iterations. Remains : 538/550 places, 1036/1048 transitions.
Stuttering acceptance computed with spot in 377 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p1:(OR (AND (GEQ s280 1) (GEQ s303 1) (GEQ s377 1)) (AND (GEQ s227 1) (GEQ s280 1) (GEQ s474 1)) (AND (GEQ s271 1) (GEQ s280 1) (GEQ s464 1)) (AND (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 5 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-00 finished in 18380 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((F(p0)&&p1) U p2)||X(!p2)))'
Support contains 99 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 544 transition count 1042
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 544 transition count 1042
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 538 transition count 1036
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 538 transition count 1036
Applied a total of 24 rules in 37 ms. Remains 538 /550 variables (removed 12) and now considering 1036/1048 (removed 12) transitions.
[2022-05-18 19:15:52] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 19:15:52] [INFO ] Computed 46 place invariants in 17 ms
[2022-05-18 19:15:53] [INFO ] Dead Transitions using invariants and state equation in 1161 ms found 0 transitions.
[2022-05-18 19:15:53] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 19:15:53] [INFO ] Computed 46 place invariants in 26 ms
[2022-05-18 19:15:53] [INFO ] Implicit Places using invariants in 395 ms returned [88, 242, 271, 356, 377, 474]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 397 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 532/550 places, 1036/1048 transitions.
Applied a total of 0 rules in 6 ms. Remains 532 /532 variables (removed 0) and now considering 1036/1036 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 532/550 places, 1036/1048 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), false, p2, (AND (NOT p0) p2)]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 0}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 1}]], initial=2, aps=[p0:(OR (NOT (OR (AND (GEQ s32 1) (GEQ s366 1)) (AND (GEQ s366 1) (GEQ s437 1)) (AND (GEQ s254 1) (GEQ s366 1)) (AND (GEQ s8 1) (GEQ s366 1)) (AND (GEQ s79...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1192 ms.
Product exploration explored 100000 steps with 50000 reset in 1048 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), true, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p2))
Knowledge based reduction with 5 factoid took 89 ms. Reduced automaton from 5 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-01 finished in 4182 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(!F(G(p0))) U G((G(p1)&&!p2))))'
Support contains 37 out of 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 550 transition count 1012
Reduce places removed 36 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 42 rules applied. Total rules applied 78 place count 514 transition count 1006
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 508 transition count 1006
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 84 place count 508 transition count 970
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 156 place count 472 transition count 970
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 264 place count 418 transition count 916
Applied a total of 264 rules in 127 ms. Remains 418 /550 variables (removed 132) and now considering 916/1048 (removed 132) transitions.
[2022-05-18 19:15:56] [INFO ] Flow matrix only has 892 transitions (discarded 24 similar events)
// Phase 1: matrix 892 rows 418 cols
[2022-05-18 19:15:56] [INFO ] Computed 46 place invariants in 12 ms
[2022-05-18 19:15:57] [INFO ] Dead Transitions using invariants and state equation in 702 ms found 0 transitions.
[2022-05-18 19:15:57] [INFO ] Flow matrix only has 892 transitions (discarded 24 similar events)
// Phase 1: matrix 892 rows 418 cols
[2022-05-18 19:15:57] [INFO ] Computed 46 place invariants in 12 ms
[2022-05-18 19:15:57] [INFO ] Implicit Places using invariants in 478 ms returned [70, 182, 206, 270, 289, 364]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 489 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 412/550 places, 916/1048 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 410 transition count 914
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 410 transition count 914
Applied a total of 4 rules in 29 ms. Remains 410 /412 variables (removed 2) and now considering 914/916 (removed 2) transitions.
[2022-05-18 19:15:57] [INFO ] Flow matrix only has 890 transitions (discarded 24 similar events)
// Phase 1: matrix 890 rows 410 cols
[2022-05-18 19:15:57] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-18 19:15:58] [INFO ] Implicit Places using invariants in 518 ms returned []
[2022-05-18 19:15:58] [INFO ] Flow matrix only has 890 transitions (discarded 24 similar events)
// Phase 1: matrix 890 rows 410 cols
[2022-05-18 19:15:58] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-18 19:15:58] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:16:04] [INFO ] Implicit Places using invariants and state equation in 6225 ms returned []
Implicit Place search using SMT with State Equation took 6773 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 410/550 places, 914/1048 transitions.
Finished structural reductions, in 2 iterations. Remains : 410/550 places, 914/1048 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) p2), p0, (AND p0 p1 (NOT p2))]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) p2), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p1)) (AND p0 p2)), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s398 1) (GEQ s120 1) (GEQ s81 1) (GEQ s392 1) (GEQ s379 1) (GEQ s299 1)), p2:(OR (GEQ s167 1) (GEQ s191 1) (GEQ s75 1) (GEQ s335 1) (GEQ s118 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 33268 reset in 558 ms.
Product exploration explored 100000 steps with 33398 reset in 608 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p0)), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 504 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p1) p2), p0, (AND p0 p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-18 19:16:06] [INFO ] Flow matrix only has 890 transitions (discarded 24 similar events)
// Phase 1: matrix 890 rows 410 cols
[2022-05-18 19:16:06] [INFO ] Computed 40 place invariants in 12 ms
[2022-05-18 19:16:06] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2022-05-18 19:16:06] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 27 ms returned sat
[2022-05-18 19:16:06] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p0)), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p0))), (G (NOT (AND p1 (NOT p2) p0)))]
False Knowledge obtained : [(F p0), (F (AND p1 (NOT p2))), (F (OR (AND (NOT p1) p0) (AND p2 p0))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 12 factoid took 719 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 34 ms :[(OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 31 ms :[(OR (NOT p1) p2)]
[2022-05-18 19:16:07] [INFO ] Flow matrix only has 890 transitions (discarded 24 similar events)
// Phase 1: matrix 890 rows 410 cols
[2022-05-18 19:16:07] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-18 19:16:07] [INFO ] [Real]Absence check using 15 positive place invariants in 19 ms returned sat
[2022-05-18 19:16:07] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 39 ms returned sat
[2022-05-18 19:16:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 19:16:09] [INFO ] [Real]Absence check using state equation in 1177 ms returned sat
[2022-05-18 19:16:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 19:16:09] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2022-05-18 19:16:09] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 27 ms returned sat
[2022-05-18 19:16:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 19:16:11] [INFO ] [Nat]Absence check using state equation in 2313 ms returned sat
[2022-05-18 19:16:11] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:16:14] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 19:16:17] [INFO ] [Nat]Added 120 Read/Feed constraints in 6020 ms returned unknown
Could not prove EG (NOT p1)
Support contains 30 out of 410 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 410/410 places, 914/914 transitions.
Applied a total of 0 rules in 33 ms. Remains 410 /410 variables (removed 0) and now considering 914/914 (removed 0) transitions.
[2022-05-18 19:16:17] [INFO ] Flow matrix only has 890 transitions (discarded 24 similar events)
// Phase 1: matrix 890 rows 410 cols
[2022-05-18 19:16:17] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-18 19:16:18] [INFO ] Dead Transitions using invariants and state equation in 973 ms found 0 transitions.
[2022-05-18 19:16:18] [INFO ] Flow matrix only has 890 transitions (discarded 24 similar events)
// Phase 1: matrix 890 rows 410 cols
[2022-05-18 19:16:18] [INFO ] Computed 40 place invariants in 14 ms
[2022-05-18 19:16:19] [INFO ] Implicit Places using invariants in 417 ms returned []
[2022-05-18 19:16:19] [INFO ] Flow matrix only has 890 transitions (discarded 24 similar events)
// Phase 1: matrix 890 rows 410 cols
[2022-05-18 19:16:19] [INFO ] Computed 40 place invariants in 12 ms
[2022-05-18 19:16:19] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:16:25] [INFO ] Implicit Places using invariants and state equation in 6613 ms returned []
Implicit Place search using SMT with State Equation took 7058 ms to find 0 implicit places.
[2022-05-18 19:16:25] [INFO ] Redundant transitions in 19 ms returned []
[2022-05-18 19:16:25] [INFO ] Flow matrix only has 890 transitions (discarded 24 similar events)
// Phase 1: matrix 890 rows 410 cols
[2022-05-18 19:16:25] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-18 19:16:26] [INFO ] Dead Transitions using invariants and state equation in 656 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 914/914 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 34 ms :[(OR (NOT p1) p2)]
Finished random walk after 43 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (OR (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 28 ms :[(OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 36 ms :[(OR (NOT p1) p2)]
[2022-05-18 19:16:27] [INFO ] Flow matrix only has 890 transitions (discarded 24 similar events)
// Phase 1: matrix 890 rows 410 cols
[2022-05-18 19:16:27] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-18 19:16:27] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2022-05-18 19:16:27] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 43 ms returned sat
[2022-05-18 19:16:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 19:16:28] [INFO ] [Real]Absence check using state equation in 1106 ms returned sat
[2022-05-18 19:16:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 19:16:29] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2022-05-18 19:16:29] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 29 ms returned sat
[2022-05-18 19:16:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 19:16:31] [INFO ] [Nat]Absence check using state equation in 2334 ms returned sat
[2022-05-18 19:16:31] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:16:34] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 19:16:37] [INFO ] [Nat]Added 120 Read/Feed constraints in 6029 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 34 ms :[(OR (NOT p1) p2)]
Stuttering criterion allowed to conclude after 33311 steps with 0 reset in 135 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-02 finished in 41466 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
Support contains 17 out of 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 550 transition count 1000
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 502 transition count 1000
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 96 place count 502 transition count 940
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 216 place count 442 transition count 940
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 336 place count 382 transition count 880
Applied a total of 336 rules in 62 ms. Remains 382 /550 variables (removed 168) and now considering 880/1048 (removed 168) transitions.
[2022-05-18 19:16:37] [INFO ] Flow matrix only has 856 transitions (discarded 24 similar events)
// Phase 1: matrix 856 rows 382 cols
[2022-05-18 19:16:37] [INFO ] Computed 46 place invariants in 10 ms
[2022-05-18 19:16:38] [INFO ] Dead Transitions using invariants and state equation in 872 ms found 0 transitions.
[2022-05-18 19:16:38] [INFO ] Flow matrix only has 856 transitions (discarded 24 similar events)
// Phase 1: matrix 856 rows 382 cols
[2022-05-18 19:16:38] [INFO ] Computed 46 place invariants in 13 ms
[2022-05-18 19:16:39] [INFO ] Implicit Places using invariants in 398 ms returned [65, 165, 188, 246, 263, 334]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 400 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 376/550 places, 880/1048 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 374 transition count 878
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 374 transition count 878
Applied a total of 4 rules in 20 ms. Remains 374 /376 variables (removed 2) and now considering 878/880 (removed 2) transitions.
[2022-05-18 19:16:39] [INFO ] Flow matrix only has 854 transitions (discarded 24 similar events)
// Phase 1: matrix 854 rows 374 cols
[2022-05-18 19:16:39] [INFO ] Computed 40 place invariants in 9 ms
[2022-05-18 19:16:39] [INFO ] Implicit Places using invariants in 474 ms returned []
[2022-05-18 19:16:39] [INFO ] Flow matrix only has 854 transitions (discarded 24 similar events)
// Phase 1: matrix 854 rows 374 cols
[2022-05-18 19:16:39] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-18 19:16:39] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:16:47] [INFO ] Implicit Places using invariants and state equation in 8249 ms returned []
Implicit Place search using SMT with State Equation took 8731 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 374/550 places, 878/1048 transitions.
Finished structural reductions, in 2 iterations. Remains : 374/550 places, 878/1048 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s8 1) (GEQ s81 9) (GEQ s324 1)) (AND (GEQ s81 9) (GEQ s330 1) (GEQ s363 1)) (AND (GEQ s81 9) (GEQ s119 1) (GEQ s196 1)) (AND (GEQ s8 1) (...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2237 steps with 3 reset in 15 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-03 finished in 10209 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X((X(p1)||p2))||p0))&&F(p3)))'
Support contains 51 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 544 transition count 1042
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 544 transition count 1042
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 538 transition count 1036
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 538 transition count 1036
Applied a total of 24 rules in 32 ms. Remains 538 /550 variables (removed 12) and now considering 1036/1048 (removed 12) transitions.
[2022-05-18 19:16:47] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 19:16:47] [INFO ] Computed 46 place invariants in 26 ms
[2022-05-18 19:16:48] [INFO ] Dead Transitions using invariants and state equation in 1061 ms found 0 transitions.
[2022-05-18 19:16:48] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 19:16:49] [INFO ] Computed 46 place invariants in 17 ms
[2022-05-18 19:16:49] [INFO ] Implicit Places using invariants in 450 ms returned [88, 242, 271, 356, 377, 474]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 455 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 532/550 places, 1036/1048 transitions.
Applied a total of 0 rules in 14 ms. Remains 532 /532 variables (removed 0) and now considering 1036/1036 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 532/550 places, 1036/1048 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p3), (NOT p1), true]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s349 1) (GEQ s386 1)) (AND (GEQ s203 1) (GEQ s349 1)) (AND (GEQ s105 1) (GEQ s349 1)) (AND (GEQ s349 1) (GEQ s488 1)) (AND (GEQ s54 1) (G...], 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33271 reset in 582 ms.
Product exploration explored 100000 steps with 33382 reset in 591 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p3 p2 (NOT p1)), (X (NOT p0)), (X p2), (X p3), true, (X (X (NOT p0))), (X (X (NOT p1))), (X (X p2)), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 391 ms. Reduced automaton from 6 states, 9 edges and 4 AP to 5 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), true]
Finished random walk after 347 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=69 )
Knowledge obtained : [(AND (NOT p0) p3 p2 (NOT p1)), (X (NOT p0)), (X p2), (X p3), true, (X (X (NOT p0))), (X (X (NOT p1))), (X (X p2)), (X (X p3))]
False Knowledge obtained : [(F (NOT p2)), (F p1), (F p0)]
Knowledge based reduction with 9 factoid took 394 ms. Reduced automaton from 5 states, 6 edges and 3 AP to 5 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), true]
Support contains 20 out of 532 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 1036/1036 transitions.
Applied a total of 0 rules in 9 ms. Remains 532 /532 variables (removed 0) and now considering 1036/1036 (removed 0) transitions.
[2022-05-18 19:16:52] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 532 cols
[2022-05-18 19:16:52] [INFO ] Computed 40 place invariants in 18 ms
[2022-05-18 19:16:53] [INFO ] Dead Transitions using invariants and state equation in 1097 ms found 0 transitions.
[2022-05-18 19:16:53] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 532 cols
[2022-05-18 19:16:53] [INFO ] Computed 40 place invariants in 21 ms
[2022-05-18 19:16:53] [INFO ] Implicit Places using invariants in 491 ms returned []
[2022-05-18 19:16:53] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 532 cols
[2022-05-18 19:16:53] [INFO ] Computed 40 place invariants in 21 ms
[2022-05-18 19:16:54] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:17:03] [INFO ] Implicit Places using invariants and state equation in 9658 ms returned []
Implicit Place search using SMT with State Equation took 10152 ms to find 0 implicit places.
[2022-05-18 19:17:03] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 532 cols
[2022-05-18 19:17:03] [INFO ] Computed 40 place invariants in 21 ms
[2022-05-18 19:17:04] [INFO ] Dead Transitions using invariants and state equation in 1089 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 532/532 places, 1036/1036 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 193 ms. Reduced automaton from 5 states, 6 edges and 3 AP to 5 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), true]
Finished random walk after 602 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=120 )
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0))), (X (X p2))]
False Knowledge obtained : [(F (NOT p2)), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 248 ms. Reduced automaton from 5 states, 6 edges and 3 AP to 5 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), true]
Product exploration explored 100000 steps with 25025 reset in 531 ms.
Product exploration explored 100000 steps with 24923 reset in 545 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), true]
Support contains 20 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 1036/1036 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 532 transition count 1036
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 36 Pre rules applied. Total rules applied 24 place count 532 transition count 1084
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 60 place count 532 transition count 1084
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 72 place count 520 transition count 1072
Deduced a syphon composed of 48 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 84 place count 520 transition count 1072
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 132 places in 1 ms
Iterating global reduction 1 with 84 rules applied. Total rules applied 168 place count 520 transition count 1072
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 188 place count 500 transition count 1052
Deduced a syphon composed of 114 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 208 place count 500 transition count 1052
Deduced a syphon composed of 114 places in 0 ms
Applied a total of 208 rules in 84 ms. Remains 500 /532 variables (removed 32) and now considering 1052/1036 (removed -16) transitions.
[2022-05-18 19:17:07] [INFO ] Flow matrix only has 1028 transitions (discarded 24 similar events)
// Phase 1: matrix 1028 rows 500 cols
[2022-05-18 19:17:07] [INFO ] Computed 40 place invariants in 14 ms
[2022-05-18 19:17:07] [INFO ] Dead Transitions using invariants and state equation in 775 ms found 0 transitions.
[2022-05-18 19:17:07] [INFO ] Redundant transitions in 18 ms returned []
[2022-05-18 19:17:07] [INFO ] Flow matrix only has 1028 transitions (discarded 24 similar events)
// Phase 1: matrix 1028 rows 500 cols
[2022-05-18 19:17:08] [INFO ] Computed 40 place invariants in 17 ms
[2022-05-18 19:17:08] [INFO ] Dead Transitions using invariants and state equation in 807 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/532 places, 1052/1036 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/532 places, 1052/1036 transitions.
Product exploration explored 100000 steps with 25054 reset in 540 ms.
Product exploration explored 100000 steps with 25042 reset in 491 ms.
Built C files in :
/tmp/ltsmin11616489136870339743
[2022-05-18 19:17:09] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11616489136870339743
Running compilation step : cd /tmp/ltsmin11616489136870339743;'/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 1723 ms.
Running link step : cd /tmp/ltsmin11616489136870339743;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin11616489136870339743;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1990795371193370704.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 20 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 1036/1036 transitions.
Applied a total of 0 rules in 8 ms. Remains 532 /532 variables (removed 0) and now considering 1036/1036 (removed 0) transitions.
[2022-05-18 19:17:24] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 532 cols
[2022-05-18 19:17:24] [INFO ] Computed 40 place invariants in 25 ms
[2022-05-18 19:17:25] [INFO ] Dead Transitions using invariants and state equation in 1013 ms found 0 transitions.
[2022-05-18 19:17:25] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 532 cols
[2022-05-18 19:17:25] [INFO ] Computed 40 place invariants in 16 ms
[2022-05-18 19:17:26] [INFO ] Implicit Places using invariants in 479 ms returned []
[2022-05-18 19:17:26] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 532 cols
[2022-05-18 19:17:26] [INFO ] Computed 40 place invariants in 16 ms
[2022-05-18 19:17:26] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:17:34] [INFO ] Implicit Places using invariants and state equation in 8367 ms returned []
Implicit Place search using SMT with State Equation took 8853 ms to find 0 implicit places.
[2022-05-18 19:17:34] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 532 cols
[2022-05-18 19:17:34] [INFO ] Computed 40 place invariants in 16 ms
[2022-05-18 19:17:35] [INFO ] Dead Transitions using invariants and state equation in 1044 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 532/532 places, 1036/1036 transitions.
Built C files in :
/tmp/ltsmin13758149290952862795
[2022-05-18 19:17:35] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13758149290952862795
Running compilation step : cd /tmp/ltsmin13758149290952862795;'/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 1788 ms.
Running link step : cd /tmp/ltsmin13758149290952862795;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin13758149290952862795;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1957230384920204821.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-18 19:17:51] [INFO ] Flatten gal took : 43 ms
[2022-05-18 19:17:51] [INFO ] Flatten gal took : 41 ms
[2022-05-18 19:17:51] [INFO ] Time to serialize gal into /tmp/LTL12919297585103320614.gal : 6 ms
[2022-05-18 19:17:51] [INFO ] Time to serialize properties into /tmp/LTL4224751128221822142.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/LTL12919297585103320614.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4224751128221822142.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/LTL1291929...267
Read 1 LTL properties
Checking formula 0 : !(((G((((X((X("((((P_1155_6>=1)||(P_1155_1>=1))||((P_1155_4>=1)||(P_1155_5>=1)))||((P_1155_2>=1)||(P_1155_3>=1)))"))||("(((((SigAbort<...1682
Formula 0 simplified : !(G("((((P_1099>=1)&&(P_1113_6>=1))||((P_1113_4>=1)&&(P_1099>=1)))||((P_1099>=1)&&(P_1113_3>=1)))" | "(((P_1113_2>=1)&&(P_1099>=1))|...1663
Detected timeout of ITS tools.
[2022-05-18 19:18:06] [INFO ] Flatten gal took : 39 ms
[2022-05-18 19:18:06] [INFO ] Applying decomposition
[2022-05-18 19:18:06] [INFO ] Flatten gal took : 39 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/graph8150168413769642131.txt' '-o' '/tmp/graph8150168413769642131.bin' '-w' '/tmp/graph8150168413769642131.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8150168413769642131.bin' '-l' '-1' '-v' '-w' '/tmp/graph8150168413769642131.weights' '-q' '0' '-e' '0.001'
[2022-05-18 19:18:06] [INFO ] Decomposing Gal with order
[2022-05-18 19:18:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 19:18:06] [INFO ] Removed a total of 965 redundant transitions.
[2022-05-18 19:18:06] [INFO ] Flatten gal took : 109 ms
[2022-05-18 19:18:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 144 labels/synchronizations in 18 ms.
[2022-05-18 19:18:06] [INFO ] Time to serialize gal into /tmp/LTL17704329013964484841.gal : 7 ms
[2022-05-18 19:18:06] [INFO ] Time to serialize properties into /tmp/LTL5857640579896159702.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/LTL17704329013964484841.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5857640579896159702.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/LTL1770432...246
Read 1 LTL properties
Checking formula 0 : !(((G((((X((X("((((u92.P_1155_6>=1)||(u92.P_1155_1>=1))||((u92.P_1155_4>=1)||(u92.P_1155_5>=1)))||((u92.P_1155_2>=1)||(u92.P_1155_3>=1...2306
Formula 0 simplified : !(G("((((u92.P_1099>=1)&&(u92.P_1113_6>=1))||((u92.P_1113_4>=1)&&(u92.P_1099>=1)))||((u92.P_1099>=1)&&(u92.P_1113_3>=1)))" | "(((u92...2287
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5851559744573930181
[2022-05-18 19:18:21] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5851559744573930181
Running compilation step : cd /tmp/ltsmin5851559744573930181;'/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 1822 ms.
Running link step : cd /tmp/ltsmin5851559744573930181;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin5851559744573930181;'/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((X((LTLAPp1==true))||(LTLAPp2==true)))||(LTLAPp0==true)))&&<>((LTLAPp3==true)))' '--buchi-type=spotba'
LTSmin run took 719 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-04 finished in 96344 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1)||!(F(p2) U (F(p3)&&p3))))'
Support contains 68 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 544 transition count 1042
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 544 transition count 1042
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 538 transition count 1036
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 538 transition count 1036
Applied a total of 24 rules in 21 ms. Remains 538 /550 variables (removed 12) and now considering 1036/1048 (removed 12) transitions.
[2022-05-18 19:18:24] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 19:18:24] [INFO ] Computed 46 place invariants in 24 ms
[2022-05-18 19:18:25] [INFO ] Dead Transitions using invariants and state equation in 1068 ms found 0 transitions.
[2022-05-18 19:18:25] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 19:18:25] [INFO ] Computed 46 place invariants in 18 ms
[2022-05-18 19:18:25] [INFO ] Implicit Places using invariants in 438 ms returned [88, 242, 271, 356, 377, 474]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 459 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 532/550 places, 1036/1048 transitions.
Applied a total of 0 rules in 6 ms. Remains 532 /532 variables (removed 0) and now considering 1036/1036 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 532/550 places, 1036/1048 transitions.
Stuttering acceptance computed with spot in 307 ms :[true, (OR (NOT p0) (NOT p1)), (AND (NOT p1) p3), (OR (AND (NOT p0) p2 p3) (AND (NOT p1) p2 p3)), (OR (AND (NOT p0) p3) (AND (NOT p1) p3)), p2, p3, (AND p2 p3), (OR (AND (NOT p0) p2) (AND (NOT p1) p2))]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p3), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 p3 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2 p3 p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p1) (NOT p2) p3 p0), acceptance={} source=3 dest: 8}], [{ cond=(AND p3 (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p3 p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=p2, acceptance={} source=5 dest: 0}, { cond=(NOT p2), acceptance={} source=5 dest: 5}], [{ cond=p3, acceptance={} source=6 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=6 dest: 7}], [{ cond=(AND p2 p3), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={} source=7 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=7 dest: 7}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=8 dest: 8}]], initial=2, aps=[p0:(OR (GEQ s222 1) (GEQ s253 1) (GEQ s93 1) (GEQ s439 1) (GEQ s160 1) (GEQ s157 1) (GEQ s220 1) (GEQ s98 1) (GEQ s312 1) (GEQ s194 1) (GEQ s39 1) (GEQ s4...], 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, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 101 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-05 finished in 1888 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(X(X(p0))))||G(F(p1)))))'
Support contains 13 out of 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 550 transition count 1024
Reduce places removed 24 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 30 rules applied. Total rules applied 54 place count 526 transition count 1018
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 60 place count 520 transition count 1018
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 60 place count 520 transition count 946
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 204 place count 448 transition count 946
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 210 place count 442 transition count 940
Iterating global reduction 3 with 6 rules applied. Total rules applied 216 place count 442 transition count 940
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 312 place count 394 transition count 892
Applied a total of 312 rules in 66 ms. Remains 394 /550 variables (removed 156) and now considering 892/1048 (removed 156) transitions.
[2022-05-18 19:18:26] [INFO ] Flow matrix only has 868 transitions (discarded 24 similar events)
// Phase 1: matrix 868 rows 394 cols
[2022-05-18 19:18:26] [INFO ] Computed 46 place invariants in 11 ms
[2022-05-18 19:18:26] [INFO ] Dead Transitions using invariants and state equation in 617 ms found 0 transitions.
[2022-05-18 19:18:26] [INFO ] Flow matrix only has 868 transitions (discarded 24 similar events)
// Phase 1: matrix 868 rows 394 cols
[2022-05-18 19:18:26] [INFO ] Computed 46 place invariants in 17 ms
[2022-05-18 19:18:27] [INFO ] Implicit Places using invariants in 401 ms returned [67, 174, 198, 256, 272, 346]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 411 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 388/550 places, 892/1048 transitions.
Applied a total of 0 rules in 14 ms. Remains 388 /388 variables (removed 0) and now considering 892/892 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 388/550 places, 892/1048 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s2 1) (GEQ s171 1) (GEQ s85 1) (GEQ s322 1) (GEQ s129 1) (GEQ s385 1)), p1:(AND (OR (LT s55 1) (LT s382 1)) (OR (LT s11 1) (LT s382 1)) (OR (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1593 reset in 387 ms.
Product exploration explored 100000 steps with 1532 reset in 399 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 168 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-18 19:18:28] [INFO ] Flow matrix only has 868 transitions (discarded 24 similar events)
// Phase 1: matrix 868 rows 388 cols
[2022-05-18 19:18:28] [INFO ] Computed 40 place invariants in 21 ms
[2022-05-18 19:18:28] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-18 19:18:28] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 15 ms returned sat
[2022-05-18 19:18:28] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 313 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p1), (NOT p1)]
Support contains 7 out of 388 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 388/388 places, 892/892 transitions.
Applied a total of 0 rules in 17 ms. Remains 388 /388 variables (removed 0) and now considering 892/892 (removed 0) transitions.
[2022-05-18 19:18:28] [INFO ] Flow matrix only has 868 transitions (discarded 24 similar events)
// Phase 1: matrix 868 rows 388 cols
[2022-05-18 19:18:28] [INFO ] Computed 40 place invariants in 14 ms
[2022-05-18 19:18:29] [INFO ] Dead Transitions using invariants and state equation in 627 ms found 0 transitions.
[2022-05-18 19:18:29] [INFO ] Flow matrix only has 868 transitions (discarded 24 similar events)
// Phase 1: matrix 868 rows 388 cols
[2022-05-18 19:18:29] [INFO ] Computed 40 place invariants in 21 ms
[2022-05-18 19:18:30] [INFO ] Implicit Places using invariants in 414 ms returned []
[2022-05-18 19:18:30] [INFO ] Flow matrix only has 868 transitions (discarded 24 similar events)
// Phase 1: matrix 868 rows 388 cols
[2022-05-18 19:18:30] [INFO ] Computed 40 place invariants in 19 ms
[2022-05-18 19:18:30] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:18:38] [INFO ] Implicit Places using invariants and state equation in 8029 ms returned []
Implicit Place search using SMT with State Equation took 8445 ms to find 0 implicit places.
[2022-05-18 19:18:38] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-18 19:18:38] [INFO ] Flow matrix only has 868 transitions (discarded 24 similar events)
// Phase 1: matrix 868 rows 388 cols
[2022-05-18 19:18:38] [INFO ] Computed 40 place invariants in 18 ms
[2022-05-18 19:18:38] [INFO ] Dead Transitions using invariants and state equation in 585 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 388/388 places, 892/892 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (NOT p1)]
Finished random walk after 54 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=27 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1552 reset in 368 ms.
Product exploration explored 100000 steps with 1578 reset in 409 ms.
Built C files in :
/tmp/ltsmin3988442541735161234
[2022-05-18 19:18:39] [INFO ] Computing symmetric may disable matrix : 892 transitions.
[2022-05-18 19:18:39] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 19:18:39] [INFO ] Computing symmetric may enable matrix : 892 transitions.
[2022-05-18 19:18:39] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 19:18:40] [INFO ] Computing Do-Not-Accords matrix : 892 transitions.
[2022-05-18 19:18:40] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 19:18:40] [INFO ] Built C files in 154ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3988442541735161234
Running compilation step : cd /tmp/ltsmin3988442541735161234;'/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 2501 ms.
Running link step : cd /tmp/ltsmin3988442541735161234;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin3988442541735161234;'/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/stateBased17301251138364699295.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 388 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 388/388 places, 892/892 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 388 transition count 886
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 382 transition count 886
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 376 transition count 880
Applied a total of 24 rules in 22 ms. Remains 376 /388 variables (removed 12) and now considering 880/892 (removed 12) transitions.
[2022-05-18 19:18:55] [INFO ] Flow matrix only has 856 transitions (discarded 24 similar events)
// Phase 1: matrix 856 rows 376 cols
[2022-05-18 19:18:55] [INFO ] Computed 40 place invariants in 10 ms
[2022-05-18 19:18:55] [INFO ] Dead Transitions using invariants and state equation in 623 ms found 0 transitions.
[2022-05-18 19:18:55] [INFO ] Flow matrix only has 856 transitions (discarded 24 similar events)
// Phase 1: matrix 856 rows 376 cols
[2022-05-18 19:18:55] [INFO ] Computed 40 place invariants in 15 ms
[2022-05-18 19:18:56] [INFO ] Implicit Places using invariants in 404 ms returned []
[2022-05-18 19:18:56] [INFO ] Flow matrix only has 856 transitions (discarded 24 similar events)
// Phase 1: matrix 856 rows 376 cols
[2022-05-18 19:18:56] [INFO ] Computed 40 place invariants in 18 ms
[2022-05-18 19:18:56] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:19:04] [INFO ] Implicit Places using invariants and state equation in 8202 ms returned []
Implicit Place search using SMT with State Equation took 8607 ms to find 0 implicit places.
[2022-05-18 19:19:04] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-18 19:19:04] [INFO ] Flow matrix only has 856 transitions (discarded 24 similar events)
// Phase 1: matrix 856 rows 376 cols
[2022-05-18 19:19:04] [INFO ] Computed 40 place invariants in 18 ms
[2022-05-18 19:19:04] [INFO ] Dead Transitions using invariants and state equation in 598 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 376/388 places, 880/892 transitions.
Finished structural reductions, in 1 iterations. Remains : 376/388 places, 880/892 transitions.
Built C files in :
/tmp/ltsmin9045212714151562959
[2022-05-18 19:19:04] [INFO ] Computing symmetric may disable matrix : 880 transitions.
[2022-05-18 19:19:04] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 19:19:04] [INFO ] Computing symmetric may enable matrix : 880 transitions.
[2022-05-18 19:19:04] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 19:19:05] [INFO ] Computing Do-Not-Accords matrix : 880 transitions.
[2022-05-18 19:19:05] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 19:19:05] [INFO ] Built C files in 165ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9045212714151562959
Running compilation step : cd /tmp/ltsmin9045212714151562959;'/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 2462 ms.
Running link step : cd /tmp/ltsmin9045212714151562959;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin9045212714151562959;'/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/stateBased16138753593020010460.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-18 19:19:20] [INFO ] Flatten gal took : 35 ms
[2022-05-18 19:19:20] [INFO ] Flatten gal took : 65 ms
[2022-05-18 19:19:20] [INFO ] Time to serialize gal into /tmp/LTL13327878197296936480.gal : 4 ms
[2022-05-18 19:19:20] [INFO ] Time to serialize properties into /tmp/LTL11218983843011128081.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/LTL13327878197296936480.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11218983843011128081.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/LTL1332787...268
Read 1 LTL properties
Checking formula 0 : !((F((F(G(X(X("((((NotifyEventSourceAddedE_4>=1)||(NotifyEventSourceAddedE_1>=1))||((NotifyEventSourceAddedE_3>=1)||(NotifyEventSource...511
Formula 0 simplified : !F(FGXX"((((NotifyEventSourceAddedE_4>=1)||(NotifyEventSourceAddedE_1>=1))||((NotifyEventSourceAddedE_3>=1)||(NotifyEventSourceAdded...494
Detected timeout of ITS tools.
[2022-05-18 19:19:35] [INFO ] Flatten gal took : 34 ms
[2022-05-18 19:19:35] [INFO ] Applying decomposition
[2022-05-18 19:19:35] [INFO ] Flatten gal took : 32 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/graph17871946094102980018.txt' '-o' '/tmp/graph17871946094102980018.bin' '-w' '/tmp/graph17871946094102980018.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17871946094102980018.bin' '-l' '-1' '-v' '-w' '/tmp/graph17871946094102980018.weights' '-q' '0' '-e' '0.001'
[2022-05-18 19:19:35] [INFO ] Decomposing Gal with order
[2022-05-18 19:19:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 19:19:35] [INFO ] Removed a total of 714 redundant transitions.
[2022-05-18 19:19:35] [INFO ] Flatten gal took : 88 ms
[2022-05-18 19:19:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 187 labels/synchronizations in 16 ms.
[2022-05-18 19:19:35] [INFO ] Time to serialize gal into /tmp/LTL9089629340672647603.gal : 7 ms
[2022-05-18 19:19:35] [INFO ] Time to serialize properties into /tmp/LTL2593167989887364939.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/LTL9089629340672647603.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2593167989887364939.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/LTL9089629...245
Read 1 LTL properties
Checking formula 0 : !((F((F(G(X(X("((((i3.u2.NotifyEventSourceAddedE_4>=1)||(i3.u13.NotifyEventSourceAddedE_1>=1))||((i3.u9.NotifyEventSourceAddedE_3>=1)|...633
Formula 0 simplified : !F(FGXX"((((i3.u2.NotifyEventSourceAddedE_4>=1)||(i3.u13.NotifyEventSourceAddedE_1>=1))||((i3.u9.NotifyEventSourceAddedE_3>=1)||(i3....616
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5732316501351835679
[2022-05-18 19:19:50] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5732316501351835679
Running compilation step : cd /tmp/ltsmin5732316501351835679;'/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 1514 ms.
Running link step : cd /tmp/ltsmin5732316501351835679;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin5732316501351835679;'/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(X((LTLAPp0==true)))))||[](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-06 finished in 99591 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p1 U p2)||p0))))'
Support contains 12 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 544 transition count 1042
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 544 transition count 1042
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 538 transition count 1036
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 538 transition count 1036
Applied a total of 24 rules in 43 ms. Remains 538 /550 variables (removed 12) and now considering 1036/1048 (removed 12) transitions.
[2022-05-18 19:20:05] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 19:20:05] [INFO ] Computed 46 place invariants in 22 ms
[2022-05-18 19:20:06] [INFO ] Dead Transitions using invariants and state equation in 1052 ms found 0 transitions.
[2022-05-18 19:20:06] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 19:20:06] [INFO ] Computed 46 place invariants in 21 ms
[2022-05-18 19:20:07] [INFO ] Implicit Places using invariants in 508 ms returned [88, 242, 271, 356, 377, 474]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 510 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 532/550 places, 1036/1048 transitions.
Applied a total of 0 rules in 9 ms. Remains 532 /532 variables (removed 0) and now considering 1036/1036 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 532/550 places, 1036/1048 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s94 1) (GEQ s177 1) (GEQ s161 1) (GEQ s463 1) (GEQ s473 1) (GEQ s121 1)), p2:(OR (GEQ s471 1) (GEQ s302 1) (GEQ s372 1) (GEQ s101 1) (GEQ s246...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1379 reset in 376 ms.
Product exploration explored 100000 steps with 1338 reset in 382 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 90 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p2))]
[2022-05-18 19:20:08] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 532 cols
[2022-05-18 19:20:08] [INFO ] Computed 40 place invariants in 22 ms
[2022-05-18 19:20:09] [INFO ] [Real]Absence check using 16 positive place invariants in 34 ms returned sat
[2022-05-18 19:20:09] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 73 ms returned sat
[2022-05-18 19:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 19:20:11] [INFO ] [Real]Absence check using state equation in 1890 ms returned sat
[2022-05-18 19:20:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 19:20:11] [INFO ] [Nat]Absence check using 16 positive place invariants in 19 ms returned sat
[2022-05-18 19:20:11] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 31 ms returned sat
[2022-05-18 19:20:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 19:20:17] [INFO ] [Nat]Absence check using state equation in 5570 ms returned sat
[2022-05-18 19:20:17] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:20:18] [INFO ] [Nat]Added 120 Read/Feed constraints in 1259 ms returned sat
[2022-05-18 19:20:18] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 1 ms to minimize.
[2022-05-18 19:20:18] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 1 ms to minimize.
[2022-05-18 19:20:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1491 ms
[2022-05-18 19:20:20] [INFO ] Computed and/alt/rep : 804/3679/786 causal constraints (skipped 222 transitions) in 71 ms.
[2022-05-18 19:20:26] [INFO ] Added : 240 causal constraints over 48 iterations in 6163 ms. Result :unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 12 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 1036/1036 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 532 transition count 1006
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 502 transition count 1006
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 60 place count 502 transition count 946
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 180 place count 442 transition count 946
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 300 place count 382 transition count 886
Applied a total of 300 rules in 38 ms. Remains 382 /532 variables (removed 150) and now considering 886/1036 (removed 150) transitions.
[2022-05-18 19:20:26] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 19:20:26] [INFO ] Computed 40 place invariants in 18 ms
[2022-05-18 19:20:26] [INFO ] Dead Transitions using invariants and state equation in 599 ms found 0 transitions.
[2022-05-18 19:20:26] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 19:20:26] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-18 19:20:27] [INFO ] Implicit Places using invariants in 405 ms returned []
[2022-05-18 19:20:27] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 19:20:27] [INFO ] Computed 40 place invariants in 15 ms
[2022-05-18 19:20:27] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:20:38] [INFO ] Implicit Places using invariants and state equation in 11757 ms returned []
Implicit Place search using SMT with State Equation took 12164 ms to find 0 implicit places.
[2022-05-18 19:20:38] [INFO ] Redundant transitions in 19 ms returned []
[2022-05-18 19:20:38] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 19:20:38] [INFO ] Computed 40 place invariants in 13 ms
[2022-05-18 19:20:39] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 382/532 places, 886/1036 transitions.
Finished structural reductions, in 1 iterations. Remains : 382/532 places, 886/1036 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p2))]
[2022-05-18 19:20:39] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 19:20:39] [INFO ] Computed 40 place invariants in 14 ms
[2022-05-18 19:20:40] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2022-05-18 19:20:40] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 43 ms returned sat
[2022-05-18 19:20:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 19:20:41] [INFO ] [Real]Absence check using state equation in 854 ms returned sat
[2022-05-18 19:20:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 19:20:41] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2022-05-18 19:20:41] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 80 ms returned sat
[2022-05-18 19:20:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 19:20:43] [INFO ] [Nat]Absence check using state equation in 1839 ms returned sat
[2022-05-18 19:20:43] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:20:43] [INFO ] [Nat]Added 120 Read/Feed constraints in 314 ms returned sat
[2022-05-18 19:20:43] [INFO ] Computed and/alt/rep : 588/3349/570 causal constraints (skipped 288 transitions) in 61 ms.
[2022-05-18 19:20:48] [INFO ] Added : 207 causal constraints over 42 iterations in 4254 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 2060 reset in 397 ms.
Product exploration explored 100000 steps with 2107 reset in 408 ms.
Built C files in :
/tmp/ltsmin12543688152881209500
[2022-05-18 19:20:48] [INFO ] Computing symmetric may disable matrix : 886 transitions.
[2022-05-18 19:20:48] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 19:20:48] [INFO ] Computing symmetric may enable matrix : 886 transitions.
[2022-05-18 19:20:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 19:20:48] [INFO ] Computing Do-Not-Accords matrix : 886 transitions.
[2022-05-18 19:20:49] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 19:20:49] [INFO ] Built C files in 114ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12543688152881209500
Running compilation step : cd /tmp/ltsmin12543688152881209500;'/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 2544 ms.
Running link step : cd /tmp/ltsmin12543688152881209500;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin12543688152881209500;'/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/stateBased15222761865234571515.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 12 out of 382 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 382/382 places, 886/886 transitions.
Applied a total of 0 rules in 16 ms. Remains 382 /382 variables (removed 0) and now considering 886/886 (removed 0) transitions.
[2022-05-18 19:21:04] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 19:21:04] [INFO ] Computed 40 place invariants in 18 ms
[2022-05-18 19:21:04] [INFO ] Dead Transitions using invariants and state equation in 583 ms found 0 transitions.
[2022-05-18 19:21:04] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 19:21:04] [INFO ] Computed 40 place invariants in 16 ms
[2022-05-18 19:21:04] [INFO ] Implicit Places using invariants in 409 ms returned []
[2022-05-18 19:21:05] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 19:21:05] [INFO ] Computed 40 place invariants in 10 ms
[2022-05-18 19:21:05] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:21:16] [INFO ] Implicit Places using invariants and state equation in 11952 ms returned []
Implicit Place search using SMT with State Equation took 12363 ms to find 0 implicit places.
[2022-05-18 19:21:16] [INFO ] Redundant transitions in 14 ms returned []
[2022-05-18 19:21:16] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 19:21:16] [INFO ] Computed 40 place invariants in 16 ms
[2022-05-18 19:21:17] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 382/382 places, 886/886 transitions.
Built C files in :
/tmp/ltsmin4755261045223564766
[2022-05-18 19:21:17] [INFO ] Computing symmetric may disable matrix : 886 transitions.
[2022-05-18 19:21:17] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 19:21:17] [INFO ] Computing symmetric may enable matrix : 886 transitions.
[2022-05-18 19:21:17] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 19:21:17] [INFO ] Computing Do-Not-Accords matrix : 886 transitions.
[2022-05-18 19:21:17] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 19:21:17] [INFO ] Built C files in 98ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4755261045223564766
Running compilation step : cd /tmp/ltsmin4755261045223564766;'/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 2521 ms.
Running link step : cd /tmp/ltsmin4755261045223564766;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin4755261045223564766;'/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/stateBased8418167956268531350.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-18 19:21:32] [INFO ] Flatten gal took : 34 ms
[2022-05-18 19:21:32] [INFO ] Flatten gal took : 33 ms
[2022-05-18 19:21:32] [INFO ] Time to serialize gal into /tmp/LTL15257867900250128413.gal : 4 ms
[2022-05-18 19:21:32] [INFO ] Time to serialize properties into /tmp/LTL14641830968042086566.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/LTL15257867900250128413.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14641830968042086566.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/LTL1525786...268
Read 1 LTL properties
Checking formula 0 : !((X(F((((("((((NotifyEventJobCompletedB_1>=1)||(NotifyEventJobCompletedB_5>=1))||((NotifyEventJobCompletedB_2>=1)||(NotifyEventJobCom...549
Formula 0 simplified : !XF("(((NotifyEventJobCompletedB_3>=1)||(NotifyEventJobCompletedB_4>=1))||(NotifyEventJobCompletedB_6>=1))" | "((NotifyEventJobCompl...536
Detected timeout of ITS tools.
[2022-05-18 19:21:47] [INFO ] Flatten gal took : 34 ms
[2022-05-18 19:21:47] [INFO ] Applying decomposition
[2022-05-18 19:21:47] [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/graph17395040123795946273.txt' '-o' '/tmp/graph17395040123795946273.bin' '-w' '/tmp/graph17395040123795946273.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17395040123795946273.bin' '-l' '-1' '-v' '-w' '/tmp/graph17395040123795946273.weights' '-q' '0' '-e' '0.001'
[2022-05-18 19:21:47] [INFO ] Decomposing Gal with order
[2022-05-18 19:21:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 19:21:48] [INFO ] Removed a total of 715 redundant transitions.
[2022-05-18 19:21:48] [INFO ] Flatten gal took : 80 ms
[2022-05-18 19:21:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 139 labels/synchronizations in 16 ms.
[2022-05-18 19:21:48] [INFO ] Time to serialize gal into /tmp/LTL4462770927428565722.gal : 6 ms
[2022-05-18 19:21:48] [INFO ] Time to serialize properties into /tmp/LTL6150661082889389586.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/LTL4462770927428565722.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6150661082889389586.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/LTL4462770...245
Read 1 LTL properties
Checking formula 0 : !((X(F((((("((((i5.u1.NotifyEventJobCompletedB_1>=1)||(i5.u12.NotifyEventJobCompletedB_5>=1))||((i5.u16.NotifyEventJobCompletedB_2>=1)...667
Formula 0 simplified : !XF("(((i5.u18.NotifyEventJobCompletedB_3>=1)||(i5.u8.NotifyEventJobCompletedB_4>=1))||(i5.u13.NotifyEventJobCompletedB_6>=1))" | "(...654
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16362452161651028025
[2022-05-18 19:22:03] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16362452161651028025
Running compilation step : cd /tmp/ltsmin16362452161651028025;'/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 1489 ms.
Running link step : cd /tmp/ltsmin16362452161651028025;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin16362452161651028025;'/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(<>((((LTLAPp1==true) U (LTLAPp2==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-07 finished in 132548 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((false U X(!p0)))'
Support contains 2 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 544 transition count 1042
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 544 transition count 1042
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 538 transition count 1036
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 538 transition count 1036
Applied a total of 24 rules in 29 ms. Remains 538 /550 variables (removed 12) and now considering 1036/1048 (removed 12) transitions.
[2022-05-18 19:22:18] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 19:22:18] [INFO ] Computed 46 place invariants in 22 ms
[2022-05-18 19:22:19] [INFO ] Dead Transitions using invariants and state equation in 1095 ms found 0 transitions.
[2022-05-18 19:22:19] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 19:22:19] [INFO ] Computed 46 place invariants in 24 ms
[2022-05-18 19:22:19] [INFO ] Implicit Places using invariants in 509 ms returned [88, 242, 271, 356, 377, 474]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 511 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 532/550 places, 1036/1048 transitions.
Applied a total of 0 rules in 10 ms. Remains 532 /532 variables (removed 0) and now considering 1036/1036 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 532/550 places, 1036/1048 transitions.
Stuttering acceptance computed with spot in 100 ms :[p0, p0, true]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s55 1) (GEQ s521 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 587 ms.
Product exploration explored 100000 steps with 50000 reset in 587 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), (X (NOT p0)), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-08 finished in 3029 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X((G(p1)||F(p0))))&&X(p2)))'
Support contains 10 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 544 transition count 1042
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 544 transition count 1042
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 538 transition count 1036
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 538 transition count 1036
Applied a total of 24 rules in 23 ms. Remains 538 /550 variables (removed 12) and now considering 1036/1048 (removed 12) transitions.
[2022-05-18 19:22:21] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 19:22:21] [INFO ] Computed 46 place invariants in 26 ms
[2022-05-18 19:22:22] [INFO ] Dead Transitions using invariants and state equation in 1006 ms found 0 transitions.
[2022-05-18 19:22:22] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 19:22:22] [INFO ] Computed 46 place invariants in 17 ms
[2022-05-18 19:22:22] [INFO ] Implicit Places using invariants in 452 ms returned [88, 242, 271, 356, 377, 474]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 455 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 532/550 places, 1036/1048 transitions.
Applied a total of 0 rules in 14 ms. Remains 532 /532 variables (removed 0) and now considering 1036/1036 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 532/550 places, 1036/1048 transitions.
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p0), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(AND (GEQ s10 1) (GEQ s165 1) (GEQ s497 1)), p2:(AND (GEQ s4 10) (GEQ s214 1) (GEQ s223 1) (GEQ s277 1) (GEQ s524 1)), p1:(AND (GEQ s363 1) (GEQ s504 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-09 finished in 1714 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(X((!G(p1)||p0)))))'
Support contains 4 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 544 transition count 1042
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 544 transition count 1042
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 538 transition count 1036
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 538 transition count 1036
Applied a total of 24 rules in 22 ms. Remains 538 /550 variables (removed 12) and now considering 1036/1048 (removed 12) transitions.
[2022-05-18 19:22:23] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 19:22:23] [INFO ] Computed 46 place invariants in 23 ms
[2022-05-18 19:22:24] [INFO ] Dead Transitions using invariants and state equation in 1009 ms found 0 transitions.
[2022-05-18 19:22:24] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 538 cols
[2022-05-18 19:22:24] [INFO ] Computed 46 place invariants in 22 ms
[2022-05-18 19:22:24] [INFO ] Implicit Places using invariants in 524 ms returned [88, 242, 271, 356, 377, 474]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 527 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 532/550 places, 1036/1048 transitions.
Applied a total of 0 rules in 7 ms. Remains 532 /532 variables (removed 0) and now considering 1036/1036 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 532/550 places, 1036/1048 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s318 1) (GEQ s404 1)), p1:(AND (GEQ s294 1) (GEQ s314 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3 reset in 286 ms.
Product exploration explored 100000 steps with 6 reset in 340 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 206 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 135664 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 135664 steps, saw 87542 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-18 19:22:28] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 532 cols
[2022-05-18 19:22:28] [INFO ] Computed 40 place invariants in 22 ms
[2022-05-18 19:22:28] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2022-05-18 19:22:28] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 21 ms returned sat
[2022-05-18 19:22:30] [INFO ] After 1840ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 19:22:30] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2022-05-18 19:22:30] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 21 ms returned sat
[2022-05-18 19:22:35] [INFO ] After 4455ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 19:22:35] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:22:39] [INFO ] After 3813ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-18 19:22:39] [INFO ] Deduced a trap composed of 292 places in 250 ms of which 1 ms to minimize.
[2022-05-18 19:22:40] [INFO ] Deduced a trap composed of 304 places in 230 ms of which 1 ms to minimize.
[2022-05-18 19:22:40] [INFO ] Deduced a trap composed of 303 places in 227 ms of which 0 ms to minimize.
[2022-05-18 19:22:41] [INFO ] Deduced a trap composed of 352 places in 225 ms of which 1 ms to minimize.
[2022-05-18 19:22:41] [INFO ] Deduced a trap composed of 310 places in 408 ms of which 1 ms to minimize.
[2022-05-18 19:22:42] [INFO ] Deduced a trap composed of 288 places in 276 ms of which 1 ms to minimize.
[2022-05-18 19:22:43] [INFO ] Deduced a trap composed of 335 places in 263 ms of which 2 ms to minimize.
[2022-05-18 19:22:43] [INFO ] Deduced a trap composed of 323 places in 229 ms of which 1 ms to minimize.
[2022-05-18 19:22:44] [INFO ] Deduced a trap composed of 352 places in 1028 ms of which 0 ms to minimize.
[2022-05-18 19:22:45] [INFO ] Deduced a trap composed of 333 places in 404 ms of which 1 ms to minimize.
[2022-05-18 19:22:45] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 1 ms to minimize.
[2022-05-18 19:22:45] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 0 ms to minimize.
[2022-05-18 19:22:46] [INFO ] Deduced a trap composed of 339 places in 219 ms of which 3 ms to minimize.
[2022-05-18 19:22:47] [INFO ] Deduced a trap composed of 338 places in 230 ms of which 0 ms to minimize.
[2022-05-18 19:22:47] [INFO ] Deduced a trap composed of 337 places in 227 ms of which 5 ms to minimize.
[2022-05-18 19:22:47] [INFO ] Deduced a trap composed of 343 places in 231 ms of which 1 ms to minimize.
[2022-05-18 19:22:48] [INFO ] Deduced a trap composed of 314 places in 234 ms of which 1 ms to minimize.
[2022-05-18 19:22:49] [INFO ] Deduced a trap composed of 343 places in 227 ms of which 0 ms to minimize.
[2022-05-18 19:22:49] [INFO ] Deduced a trap composed of 321 places in 228 ms of which 0 ms to minimize.
[2022-05-18 19:22:49] [INFO ] Deduced a trap composed of 328 places in 243 ms of which 0 ms to minimize.
[2022-05-18 19:22:50] [INFO ] Deduced a trap composed of 317 places in 215 ms of which 1 ms to minimize.
[2022-05-18 19:22:50] [INFO ] Deduced a trap composed of 352 places in 220 ms of which 0 ms to minimize.
[2022-05-18 19:22:50] [INFO ] Deduced a trap composed of 317 places in 228 ms of which 1 ms to minimize.
[2022-05-18 19:22:51] [INFO ] Deduced a trap composed of 325 places in 224 ms of which 0 ms to minimize.
[2022-05-18 19:22:52] [INFO ] Deduced a trap composed of 314 places in 210 ms of which 1 ms to minimize.
[2022-05-18 19:22:55] [INFO ] Trap strengthening (SAT) tested/added 25/25 trap constraints in 16303 ms
[2022-05-18 19:22:55] [INFO ] After 20431ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-18 19:22:55] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 532 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 532/532 places, 1036/1036 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 532 transition count 994
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 490 transition count 994
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 84 place count 490 transition count 934
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 204 place count 430 transition count 934
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 320 place count 372 transition count 876
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 322 place count 370 transition count 874
Iterating global reduction 2 with 2 rules applied. Total rules applied 324 place count 370 transition count 874
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 336 place count 370 transition count 862
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 348 place count 358 transition count 862
Applied a total of 348 rules in 79 ms. Remains 358 /532 variables (removed 174) and now considering 862/1036 (removed 174) transitions.
[2022-05-18 19:22:55] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 358 cols
[2022-05-18 19:22:55] [INFO ] Computed 40 place invariants in 14 ms
[2022-05-18 19:22:56] [INFO ] Dead Transitions using invariants and state equation in 613 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 358/532 places, 862/1036 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 176959 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 176959 steps, saw 122139 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-18 19:22:59] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 358 cols
[2022-05-18 19:22:59] [INFO ] Computed 40 place invariants in 17 ms
[2022-05-18 19:22:59] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-18 19:22:59] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 18 ms returned sat
[2022-05-18 19:22:59] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 19:22:59] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-18 19:22:59] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 45 ms returned sat
[2022-05-18 19:23:19] [INFO ] After 19539ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 19:23:19] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:23:21] [INFO ] After 1606ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 19:23:21] [INFO ] Deduced a trap composed of 150 places in 192 ms of which 1 ms to minimize.
[2022-05-18 19:23:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2022-05-18 19:23:21] [INFO ] After 1956ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 191 ms.
[2022-05-18 19:23:21] [INFO ] After 21837ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 358 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 358/358 places, 862/862 transitions.
Applied a total of 0 rules in 18 ms. Remains 358 /358 variables (removed 0) and now considering 862/862 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 358/358 places, 862/862 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 358/358 places, 862/862 transitions.
Applied a total of 0 rules in 12 ms. Remains 358 /358 variables (removed 0) and now considering 862/862 (removed 0) transitions.
[2022-05-18 19:23:21] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 358 cols
[2022-05-18 19:23:21] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-18 19:23:22] [INFO ] Implicit Places using invariants in 413 ms returned []
[2022-05-18 19:23:22] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 358 cols
[2022-05-18 19:23:22] [INFO ] Computed 40 place invariants in 10 ms
[2022-05-18 19:23:22] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:23:33] [INFO ] Implicit Places using invariants and state equation in 11923 ms returned []
Implicit Place search using SMT with State Equation took 12358 ms to find 0 implicit places.
[2022-05-18 19:23:34] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-18 19:23:34] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 358 cols
[2022-05-18 19:23:34] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-18 19:23:34] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 358/358 places, 862/862 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 358 transition count 838
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 34 place count 353 transition count 888
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 1 with 44 rules applied. Total rules applied 78 place count 353 transition count 844
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 353 transition count 838
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 90 place count 347 transition count 838
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 101 place count 347 transition count 827
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 112 place count 336 transition count 827
Applied a total of 112 rules in 58 ms. Remains 336 /358 variables (removed 22) and now considering 827/862 (removed 35) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 827 rows 336 cols
[2022-05-18 19:23:34] [INFO ] Computed 40 place invariants in 9 ms
[2022-05-18 19:23:34] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-18 19:23:34] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 35 ms returned sat
[2022-05-18 19:23:34] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 19:23:34] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-18 19:23:34] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 34 ms returned sat
[2022-05-18 19:23:37] [INFO ] After 2144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 19:23:38] [INFO ] Deduced a trap composed of 149 places in 163 ms of which 1 ms to minimize.
[2022-05-18 19:23:38] [INFO ] Deduced a trap composed of 163 places in 164 ms of which 1 ms to minimize.
[2022-05-18 19:23:38] [INFO ] Deduced a trap composed of 148 places in 164 ms of which 0 ms to minimize.
[2022-05-18 19:23:38] [INFO ] Deduced a trap composed of 125 places in 191 ms of which 0 ms to minimize.
[2022-05-18 19:23:39] [INFO ] Deduced a trap composed of 127 places in 169 ms of which 0 ms to minimize.
[2022-05-18 19:23:39] [INFO ] Deduced a trap composed of 66 places in 182 ms of which 0 ms to minimize.
[2022-05-18 19:23:39] [INFO ] Deduced a trap composed of 78 places in 181 ms of which 0 ms to minimize.
[2022-05-18 19:23:39] [INFO ] Deduced a trap composed of 147 places in 174 ms of which 1 ms to minimize.
[2022-05-18 19:23:39] [INFO ] Deduced a trap composed of 63 places in 177 ms of which 0 ms to minimize.
[2022-05-18 19:23:40] [INFO ] Deduced a trap composed of 67 places in 166 ms of which 0 ms to minimize.
[2022-05-18 19:23:41] [INFO ] Deduced a trap composed of 118 places in 205 ms of which 16 ms to minimize.
[2022-05-18 19:23:41] [INFO ] Deduced a trap composed of 122 places in 154 ms of which 0 ms to minimize.
[2022-05-18 19:23:41] [INFO ] Deduced a trap composed of 139 places in 152 ms of which 0 ms to minimize.
[2022-05-18 19:23:41] [INFO ] Deduced a trap composed of 131 places in 168 ms of which 0 ms to minimize.
[2022-05-18 19:23:42] [INFO ] Deduced a trap composed of 122 places in 176 ms of which 2 ms to minimize.
[2022-05-18 19:23:42] [INFO ] Deduced a trap composed of 133 places in 178 ms of which 0 ms to minimize.
[2022-05-18 19:23:42] [INFO ] Deduced a trap composed of 128 places in 171 ms of which 0 ms to minimize.
[2022-05-18 19:23:42] [INFO ] Deduced a trap composed of 131 places in 181 ms of which 1 ms to minimize.
[2022-05-18 19:23:43] [INFO ] Deduced a trap composed of 127 places in 178 ms of which 1 ms to minimize.
[2022-05-18 19:23:43] [INFO ] Deduced a trap composed of 65 places in 175 ms of which 0 ms to minimize.
[2022-05-18 19:23:43] [INFO ] Deduced a trap composed of 123 places in 175 ms of which 1 ms to minimize.
[2022-05-18 19:23:43] [INFO ] Deduced a trap composed of 154 places in 180 ms of which 1 ms to minimize.
[2022-05-18 19:23:43] [INFO ] Deduced a trap composed of 140 places in 179 ms of which 0 ms to minimize.
[2022-05-18 19:23:44] [INFO ] Deduced a trap composed of 146 places in 177 ms of which 0 ms to minimize.
[2022-05-18 19:23:44] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 0 ms to minimize.
[2022-05-18 19:23:44] [INFO ] Deduced a trap composed of 150 places in 161 ms of which 1 ms to minimize.
[2022-05-18 19:23:46] [INFO ] Deduced a trap composed of 63 places in 154 ms of which 0 ms to minimize.
[2022-05-18 19:23:46] [INFO ] Deduced a trap composed of 130 places in 178 ms of which 0 ms to minimize.
[2022-05-18 19:23:46] [INFO ] Deduced a trap composed of 138 places in 175 ms of which 1 ms to minimize.
[2022-05-18 19:23:46] [INFO ] Deduced a trap composed of 155 places in 169 ms of which 0 ms to minimize.
[2022-05-18 19:23:47] [INFO ] Deduced a trap composed of 53 places in 161 ms of which 0 ms to minimize.
[2022-05-18 19:23:47] [INFO ] Deduced a trap composed of 156 places in 166 ms of which 0 ms to minimize.
[2022-05-18 19:23:47] [INFO ] Deduced a trap composed of 70 places in 196 ms of which 1 ms to minimize.
[2022-05-18 19:23:47] [INFO ] Deduced a trap composed of 70 places in 172 ms of which 0 ms to minimize.
[2022-05-18 19:23:48] [INFO ] Deduced a trap composed of 130 places in 206 ms of which 0 ms to minimize.
[2022-05-18 19:23:48] [INFO ] Deduced a trap composed of 145 places in 178 ms of which 0 ms to minimize.
[2022-05-18 19:23:48] [INFO ] Deduced a trap composed of 131 places in 175 ms of which 0 ms to minimize.
[2022-05-18 19:23:49] [INFO ] Deduced a trap composed of 122 places in 166 ms of which 0 ms to minimize.
[2022-05-18 19:23:49] [INFO ] Deduced a trap composed of 138 places in 201 ms of which 1 ms to minimize.
[2022-05-18 19:23:49] [INFO ] Deduced a trap composed of 123 places in 176 ms of which 1 ms to minimize.
[2022-05-18 19:23:49] [INFO ] Deduced a trap composed of 138 places in 172 ms of which 0 ms to minimize.
[2022-05-18 19:23:49] [INFO ] Deduced a trap composed of 113 places in 172 ms of which 0 ms to minimize.
[2022-05-18 19:23:50] [INFO ] Deduced a trap composed of 148 places in 168 ms of which 1 ms to minimize.
[2022-05-18 19:23:50] [INFO ] Deduced a trap composed of 146 places in 171 ms of which 1 ms to minimize.
[2022-05-18 19:23:50] [INFO ] Deduced a trap composed of 138 places in 162 ms of which 1 ms to minimize.
[2022-05-18 19:23:51] [INFO ] Deduced a trap composed of 122 places in 162 ms of which 0 ms to minimize.
[2022-05-18 19:23:51] [INFO ] Deduced a trap composed of 125 places in 167 ms of which 1 ms to minimize.
[2022-05-18 19:23:52] [INFO ] Deduced a trap composed of 115 places in 167 ms of which 1 ms to minimize.
[2022-05-18 19:23:52] [INFO ] Deduced a trap composed of 140 places in 172 ms of which 0 ms to minimize.
[2022-05-18 19:23:52] [INFO ] Deduced a trap composed of 144 places in 177 ms of which 0 ms to minimize.
[2022-05-18 19:23:53] [INFO ] Deduced a trap composed of 144 places in 204 ms of which 0 ms to minimize.
[2022-05-18 19:23:53] [INFO ] Deduced a trap composed of 42 places in 177 ms of which 0 ms to minimize.
[2022-05-18 19:23:53] [INFO ] Deduced a trap composed of 140 places in 175 ms of which 0 ms to minimize.
[2022-05-18 19:23:53] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 0 ms to minimize.
[2022-05-18 19:23:54] [INFO ] Deduced a trap composed of 145 places in 175 ms of which 0 ms to minimize.
[2022-05-18 19:23:54] [INFO ] Deduced a trap composed of 142 places in 172 ms of which 1 ms to minimize.
[2022-05-18 19:23:54] [INFO ] Deduced a trap composed of 117 places in 153 ms of which 0 ms to minimize.
[2022-05-18 19:23:54] [INFO ] Deduced a trap composed of 133 places in 174 ms of which 1 ms to minimize.
[2022-05-18 19:23:55] [INFO ] Deduced a trap composed of 142 places in 161 ms of which 1 ms to minimize.
[2022-05-18 19:23:55] [INFO ] Deduced a trap composed of 157 places in 157 ms of which 1 ms to minimize.
[2022-05-18 19:23:56] [INFO ] Deduced a trap composed of 41 places in 174 ms of which 0 ms to minimize.
[2022-05-18 19:23:56] [INFO ] Deduced a trap composed of 171 places in 161 ms of which 0 ms to minimize.
[2022-05-18 19:23:56] [INFO ] Deduced a trap composed of 142 places in 178 ms of which 0 ms to minimize.
[2022-05-18 19:23:57] [INFO ] Deduced a trap composed of 122 places in 169 ms of which 0 ms to minimize.
[2022-05-18 19:23:57] [INFO ] Deduced a trap composed of 128 places in 162 ms of which 0 ms to minimize.
[2022-05-18 19:23:57] [INFO ] Deduced a trap composed of 150 places in 174 ms of which 0 ms to minimize.
[2022-05-18 19:23:59] [INFO ] Deduced a trap composed of 148 places in 159 ms of which 0 ms to minimize.
[2022-05-18 19:24:00] [INFO ] Deduced a trap composed of 118 places in 155 ms of which 0 ms to minimize.
[2022-05-18 19:24:00] [INFO ] Deduced a trap composed of 129 places in 162 ms of which 1 ms to minimize.
[2022-05-18 19:24:01] [INFO ] Deduced a trap composed of 165 places in 167 ms of which 0 ms to minimize.
[2022-05-18 19:24:01] [INFO ] Deduced a trap composed of 147 places in 183 ms of which 0 ms to minimize.
[2022-05-18 19:24:01] [INFO ] Deduced a trap composed of 166 places in 169 ms of which 1 ms to minimize.
[2022-05-18 19:24:01] [INFO ] Deduced a trap composed of 174 places in 183 ms of which 1 ms to minimize.
[2022-05-18 19:24:01] [INFO ] Deduced a trap composed of 127 places in 156 ms of which 1 ms to minimize.
[2022-05-18 19:24:02] [INFO ] Deduced a trap composed of 136 places in 170 ms of which 1 ms to minimize.
[2022-05-18 19:24:02] [INFO ] Deduced a trap composed of 146 places in 187 ms of which 0 ms to minimize.
[2022-05-18 19:24:02] [INFO ] Deduced a trap composed of 115 places in 162 ms of which 0 ms to minimize.
[2022-05-18 19:24:04] [INFO ] Deduced a trap composed of 145 places in 155 ms of which 0 ms to minimize.
[2022-05-18 19:24:04] [INFO ] Deduced a trap composed of 118 places in 159 ms of which 1 ms to minimize.
[2022-05-18 19:24:13] [INFO ] Trap strengthening (SAT) tested/added 79/79 trap constraints in 35468 ms
[2022-05-18 19:24:13] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 1 ms to minimize.
[2022-05-18 19:24:14] [INFO ] Deduced a trap composed of 131 places in 154 ms of which 1 ms to minimize.
[2022-05-18 19:24:14] [INFO ] Deduced a trap composed of 120 places in 160 ms of which 0 ms to minimize.
[2022-05-18 19:24:14] [INFO ] Deduced a trap composed of 125 places in 152 ms of which 0 ms to minimize.
[2022-05-18 19:24:14] [INFO ] Deduced a trap composed of 143 places in 162 ms of which 0 ms to minimize.
[2022-05-18 19:24:15] [INFO ] Deduced a trap composed of 130 places in 217 ms of which 1 ms to minimize.
[2022-05-18 19:24:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1421 ms
[2022-05-18 19:24:15] [INFO ] After 40203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 202 ms.
[2022-05-18 19:24:15] [INFO ] After 40550ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-18 19:24:15] [INFO ] Flatten gal took : 29 ms
[2022-05-18 19:24:15] [INFO ] Flatten gal took : 29 ms
[2022-05-18 19:24:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8906389076509954876.gal : 4 ms
[2022-05-18 19:24:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18374423245526851635.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms4607583829592750943;'/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/ReachabilityCardinality8906389076509954876.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18374423245526851635.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/ReachabilityCardinality18374423245526851635.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 27
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :27 after 182
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :182 after 449
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :449 after 797
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :797 after 1137
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1137 after 1702
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1702 after 2652
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2652 after 7972
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :7972 after 91056
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :91056 after 2.89346e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.9795e+06 after 2.98287e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.98287e+06 after 2.99689e+06
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.99689e+06 after 3.31616e+06
Detected timeout of ITS tools.
[2022-05-18 19:24:30] [INFO ] Flatten gal took : 29 ms
[2022-05-18 19:24:30] [INFO ] Applying decomposition
[2022-05-18 19:24:30] [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/graph2164521952851528578.txt' '-o' '/tmp/graph2164521952851528578.bin' '-w' '/tmp/graph2164521952851528578.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2164521952851528578.bin' '-l' '-1' '-v' '-w' '/tmp/graph2164521952851528578.weights' '-q' '0' '-e' '0.001'
[2022-05-18 19:24:30] [INFO ] Decomposing Gal with order
[2022-05-18 19:24:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 19:24:30] [INFO ] Removed a total of 806 redundant transitions.
[2022-05-18 19:24:30] [INFO ] Flatten gal took : 78 ms
[2022-05-18 19:24:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 307 labels/synchronizations in 36 ms.
[2022-05-18 19:24:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3256528642708449725.gal : 6 ms
[2022-05-18 19:24:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16120037011226669335.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms4607583829592750943;'/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/ReachabilityCardinality3256528642708449725.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16120037011226669335.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/ReachabilityCardinality16120037011226669335.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1 after 16
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :16 after 1366
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1366 after 3964
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3964 after 4174
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4174 after 4174
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4174 after 4174
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4174 after 60776
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :60776 after 75364
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15817776753146982537
[2022-05-18 19:24:46] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15817776753146982537
Running compilation step : cd /tmp/ltsmin15817776753146982537;'/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 1356 ms.
Running link step : cd /tmp/ltsmin15817776753146982537;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin15817776753146982537;'/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' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 195 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Support contains 4 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 1036/1036 transitions.
Applied a total of 0 rules in 8 ms. Remains 532 /532 variables (removed 0) and now considering 1036/1036 (removed 0) transitions.
[2022-05-18 19:25:01] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 532 cols
[2022-05-18 19:25:01] [INFO ] Computed 40 place invariants in 22 ms
[2022-05-18 19:25:02] [INFO ] Dead Transitions using invariants and state equation in 1044 ms found 0 transitions.
[2022-05-18 19:25:02] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 532 cols
[2022-05-18 19:25:02] [INFO ] Computed 40 place invariants in 14 ms
[2022-05-18 19:25:03] [INFO ] Implicit Places using invariants in 476 ms returned []
[2022-05-18 19:25:03] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 532 cols
[2022-05-18 19:25:03] [INFO ] Computed 40 place invariants in 29 ms
[2022-05-18 19:25:03] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:25:11] [INFO ] Implicit Places using invariants and state equation in 8439 ms returned []
Implicit Place search using SMT with State Equation took 8917 ms to find 0 implicit places.
[2022-05-18 19:25:11] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 532 cols
[2022-05-18 19:25:11] [INFO ] Computed 40 place invariants in 20 ms
[2022-05-18 19:25:12] [INFO ] Dead Transitions using invariants and state equation in 1015 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 532/532 places, 1036/1036 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 153 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 138334 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 138334 steps, saw 89270 distinct states, run finished after 3003 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-18 19:25:16] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 532 cols
[2022-05-18 19:25:16] [INFO ] Computed 40 place invariants in 24 ms
[2022-05-18 19:25:16] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2022-05-18 19:25:16] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 21 ms returned sat
[2022-05-18 19:25:17] [INFO ] After 1872ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 19:25:18] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2022-05-18 19:25:18] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 20 ms returned sat
[2022-05-18 19:25:22] [INFO ] After 4312ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 19:25:22] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:25:26] [INFO ] After 3771ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-18 19:25:26] [INFO ] Deduced a trap composed of 292 places in 234 ms of which 0 ms to minimize.
[2022-05-18 19:25:27] [INFO ] Deduced a trap composed of 304 places in 236 ms of which 1 ms to minimize.
[2022-05-18 19:25:27] [INFO ] Deduced a trap composed of 303 places in 226 ms of which 1 ms to minimize.
[2022-05-18 19:25:28] [INFO ] Deduced a trap composed of 352 places in 234 ms of which 1 ms to minimize.
[2022-05-18 19:25:28] [INFO ] Deduced a trap composed of 310 places in 229 ms of which 1 ms to minimize.
[2022-05-18 19:25:29] [INFO ] Deduced a trap composed of 288 places in 247 ms of which 0 ms to minimize.
[2022-05-18 19:25:30] [INFO ] Deduced a trap composed of 335 places in 227 ms of which 1 ms to minimize.
[2022-05-18 19:25:30] [INFO ] Deduced a trap composed of 323 places in 216 ms of which 1 ms to minimize.
[2022-05-18 19:25:30] [INFO ] Deduced a trap composed of 352 places in 212 ms of which 1 ms to minimize.
[2022-05-18 19:25:30] [INFO ] Deduced a trap composed of 333 places in 224 ms of which 0 ms to minimize.
[2022-05-18 19:25:31] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 0 ms to minimize.
[2022-05-18 19:25:31] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 0 ms to minimize.
[2022-05-18 19:25:31] [INFO ] Deduced a trap composed of 339 places in 222 ms of which 0 ms to minimize.
[2022-05-18 19:25:32] [INFO ] Deduced a trap composed of 338 places in 226 ms of which 0 ms to minimize.
[2022-05-18 19:25:33] [INFO ] Deduced a trap composed of 337 places in 212 ms of which 0 ms to minimize.
[2022-05-18 19:25:33] [INFO ] Deduced a trap composed of 343 places in 227 ms of which 1 ms to minimize.
[2022-05-18 19:25:33] [INFO ] Deduced a trap composed of 314 places in 225 ms of which 1 ms to minimize.
[2022-05-18 19:25:34] [INFO ] Deduced a trap composed of 343 places in 226 ms of which 0 ms to minimize.
[2022-05-18 19:25:35] [INFO ] Deduced a trap composed of 321 places in 222 ms of which 0 ms to minimize.
[2022-05-18 19:25:35] [INFO ] Deduced a trap composed of 328 places in 226 ms of which 0 ms to minimize.
[2022-05-18 19:25:35] [INFO ] Deduced a trap composed of 317 places in 238 ms of which 0 ms to minimize.
[2022-05-18 19:25:36] [INFO ] Deduced a trap composed of 352 places in 220 ms of which 1 ms to minimize.
[2022-05-18 19:25:36] [INFO ] Deduced a trap composed of 317 places in 232 ms of which 1 ms to minimize.
[2022-05-18 19:25:36] [INFO ] Deduced a trap composed of 325 places in 230 ms of which 0 ms to minimize.
[2022-05-18 19:25:37] [INFO ] Deduced a trap composed of 314 places in 222 ms of which 1 ms to minimize.
[2022-05-18 19:25:42] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 15704 ms
[2022-05-18 19:25:42] [INFO ] After 20054ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 527 ms.
[2022-05-18 19:25:42] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 24 ms.
Support contains 4 out of 532 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 532/532 places, 1036/1036 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 532 transition count 994
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 490 transition count 994
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 84 place count 490 transition count 934
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 204 place count 430 transition count 934
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 320 place count 372 transition count 876
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 322 place count 370 transition count 874
Iterating global reduction 2 with 2 rules applied. Total rules applied 324 place count 370 transition count 874
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 336 place count 370 transition count 862
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 348 place count 358 transition count 862
Applied a total of 348 rules in 59 ms. Remains 358 /532 variables (removed 174) and now considering 862/1036 (removed 174) transitions.
[2022-05-18 19:25:43] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 358 cols
[2022-05-18 19:25:43] [INFO ] Computed 40 place invariants in 18 ms
[2022-05-18 19:25:43] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 358/532 places, 862/1036 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 175740 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 175740 steps, saw 121316 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-18 19:25:46] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 358 cols
[2022-05-18 19:25:46] [INFO ] Computed 40 place invariants in 19 ms
[2022-05-18 19:25:46] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-18 19:25:46] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 19 ms returned sat
[2022-05-18 19:25:46] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 19:25:47] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-18 19:25:47] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 40 ms returned sat
[2022-05-18 19:26:06] [INFO ] After 19347ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 19:26:06] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:26:07] [INFO ] After 1366ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 19:26:07] [INFO ] After 1525ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2022-05-18 19:26:08] [INFO ] After 21091ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 358 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 358/358 places, 862/862 transitions.
Applied a total of 0 rules in 14 ms. Remains 358 /358 variables (removed 0) and now considering 862/862 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 358/358 places, 862/862 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 358/358 places, 862/862 transitions.
Applied a total of 0 rules in 13 ms. Remains 358 /358 variables (removed 0) and now considering 862/862 (removed 0) transitions.
[2022-05-18 19:26:08] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 358 cols
[2022-05-18 19:26:08] [INFO ] Computed 40 place invariants in 19 ms
[2022-05-18 19:26:08] [INFO ] Implicit Places using invariants in 398 ms returned []
[2022-05-18 19:26:08] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 358 cols
[2022-05-18 19:26:08] [INFO ] Computed 40 place invariants in 14 ms
[2022-05-18 19:26:08] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:26:17] [INFO ] Implicit Places using invariants and state equation in 9478 ms returned []
Implicit Place search using SMT with State Equation took 9878 ms to find 0 implicit places.
[2022-05-18 19:26:17] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-18 19:26:17] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 358 cols
[2022-05-18 19:26:17] [INFO ] Computed 40 place invariants in 16 ms
[2022-05-18 19:26:18] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 358/358 places, 862/862 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 358 transition count 838
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 34 place count 353 transition count 888
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 1 with 44 rules applied. Total rules applied 78 place count 353 transition count 844
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 353 transition count 838
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 90 place count 347 transition count 838
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 101 place count 347 transition count 827
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 112 place count 336 transition count 827
Applied a total of 112 rules in 64 ms. Remains 336 /358 variables (removed 22) and now considering 827/862 (removed 35) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 827 rows 336 cols
[2022-05-18 19:26:18] [INFO ] Computed 40 place invariants in 16 ms
[2022-05-18 19:26:18] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-18 19:26:18] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 20 ms returned sat
[2022-05-18 19:26:18] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 19:26:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-18 19:26:18] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 19 ms returned sat
[2022-05-18 19:26:20] [INFO ] After 2022ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 19:26:21] [INFO ] Deduced a trap composed of 149 places in 154 ms of which 0 ms to minimize.
[2022-05-18 19:26:22] [INFO ] Deduced a trap composed of 163 places in 154 ms of which 0 ms to minimize.
[2022-05-18 19:26:22] [INFO ] Deduced a trap composed of 148 places in 151 ms of which 0 ms to minimize.
[2022-05-18 19:26:22] [INFO ] Deduced a trap composed of 125 places in 145 ms of which 1 ms to minimize.
[2022-05-18 19:26:22] [INFO ] Deduced a trap composed of 127 places in 163 ms of which 0 ms to minimize.
[2022-05-18 19:26:22] [INFO ] Deduced a trap composed of 66 places in 168 ms of which 0 ms to minimize.
[2022-05-18 19:26:23] [INFO ] Deduced a trap composed of 78 places in 168 ms of which 1 ms to minimize.
[2022-05-18 19:26:23] [INFO ] Deduced a trap composed of 147 places in 169 ms of which 1 ms to minimize.
[2022-05-18 19:26:23] [INFO ] Deduced a trap composed of 63 places in 178 ms of which 1 ms to minimize.
[2022-05-18 19:26:24] [INFO ] Deduced a trap composed of 67 places in 163 ms of which 0 ms to minimize.
[2022-05-18 19:26:24] [INFO ] Deduced a trap composed of 118 places in 155 ms of which 1 ms to minimize.
[2022-05-18 19:26:24] [INFO ] Deduced a trap composed of 122 places in 149 ms of which 0 ms to minimize.
[2022-05-18 19:26:25] [INFO ] Deduced a trap composed of 139 places in 165 ms of which 0 ms to minimize.
[2022-05-18 19:26:25] [INFO ] Deduced a trap composed of 131 places in 166 ms of which 0 ms to minimize.
[2022-05-18 19:26:25] [INFO ] Deduced a trap composed of 122 places in 168 ms of which 0 ms to minimize.
[2022-05-18 19:26:26] [INFO ] Deduced a trap composed of 133 places in 168 ms of which 0 ms to minimize.
[2022-05-18 19:26:26] [INFO ] Deduced a trap composed of 128 places in 173 ms of which 0 ms to minimize.
[2022-05-18 19:26:26] [INFO ] Deduced a trap composed of 131 places in 161 ms of which 0 ms to minimize.
[2022-05-18 19:26:26] [INFO ] Deduced a trap composed of 127 places in 166 ms of which 0 ms to minimize.
[2022-05-18 19:26:26] [INFO ] Deduced a trap composed of 65 places in 168 ms of which 0 ms to minimize.
[2022-05-18 19:26:27] [INFO ] Deduced a trap composed of 123 places in 170 ms of which 0 ms to minimize.
[2022-05-18 19:26:27] [INFO ] Deduced a trap composed of 154 places in 170 ms of which 1 ms to minimize.
[2022-05-18 19:26:27] [INFO ] Deduced a trap composed of 140 places in 168 ms of which 0 ms to minimize.
[2022-05-18 19:26:27] [INFO ] Deduced a trap composed of 146 places in 167 ms of which 0 ms to minimize.
[2022-05-18 19:26:28] [INFO ] Deduced a trap composed of 41 places in 180 ms of which 1 ms to minimize.
[2022-05-18 19:26:28] [INFO ] Deduced a trap composed of 150 places in 164 ms of which 0 ms to minimize.
[2022-05-18 19:26:29] [INFO ] Deduced a trap composed of 63 places in 166 ms of which 0 ms to minimize.
[2022-05-18 19:26:29] [INFO ] Deduced a trap composed of 130 places in 172 ms of which 0 ms to minimize.
[2022-05-18 19:26:30] [INFO ] Deduced a trap composed of 138 places in 163 ms of which 0 ms to minimize.
[2022-05-18 19:26:30] [INFO ] Deduced a trap composed of 155 places in 170 ms of which 1 ms to minimize.
[2022-05-18 19:26:30] [INFO ] Deduced a trap composed of 53 places in 158 ms of which 0 ms to minimize.
[2022-05-18 19:26:31] [INFO ] Deduced a trap composed of 156 places in 169 ms of which 1 ms to minimize.
[2022-05-18 19:26:31] [INFO ] Deduced a trap composed of 70 places in 167 ms of which 0 ms to minimize.
[2022-05-18 19:26:31] [INFO ] Deduced a trap composed of 70 places in 162 ms of which 1 ms to minimize.
[2022-05-18 19:26:31] [INFO ] Deduced a trap composed of 130 places in 163 ms of which 1 ms to minimize.
[2022-05-18 19:26:32] [INFO ] Deduced a trap composed of 145 places in 167 ms of which 1 ms to minimize.
[2022-05-18 19:26:32] [INFO ] Deduced a trap composed of 131 places in 165 ms of which 0 ms to minimize.
[2022-05-18 19:26:32] [INFO ] Deduced a trap composed of 122 places in 152 ms of which 0 ms to minimize.
[2022-05-18 19:26:32] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 0 ms to minimize.
[2022-05-18 19:26:33] [INFO ] Deduced a trap composed of 123 places in 167 ms of which 1 ms to minimize.
[2022-05-18 19:26:33] [INFO ] Deduced a trap composed of 138 places in 169 ms of which 0 ms to minimize.
[2022-05-18 19:26:33] [INFO ] Deduced a trap composed of 113 places in 186 ms of which 1 ms to minimize.
[2022-05-18 19:26:33] [INFO ] Deduced a trap composed of 148 places in 167 ms of which 0 ms to minimize.
[2022-05-18 19:26:34] [INFO ] Deduced a trap composed of 146 places in 165 ms of which 0 ms to minimize.
[2022-05-18 19:26:34] [INFO ] Deduced a trap composed of 138 places in 177 ms of which 1 ms to minimize.
[2022-05-18 19:26:34] [INFO ] Deduced a trap composed of 122 places in 171 ms of which 1 ms to minimize.
[2022-05-18 19:26:35] [INFO ] Deduced a trap composed of 125 places in 171 ms of which 0 ms to minimize.
[2022-05-18 19:26:35] [INFO ] Deduced a trap composed of 115 places in 173 ms of which 0 ms to minimize.
[2022-05-18 19:26:36] [INFO ] Deduced a trap composed of 140 places in 169 ms of which 1 ms to minimize.
[2022-05-18 19:26:36] [INFO ] Deduced a trap composed of 144 places in 170 ms of which 0 ms to minimize.
[2022-05-18 19:26:36] [INFO ] Deduced a trap composed of 144 places in 180 ms of which 0 ms to minimize.
[2022-05-18 19:26:36] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 0 ms to minimize.
[2022-05-18 19:26:37] [INFO ] Deduced a trap composed of 140 places in 170 ms of which 1 ms to minimize.
[2022-05-18 19:26:37] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 1 ms to minimize.
[2022-05-18 19:26:37] [INFO ] Deduced a trap composed of 145 places in 168 ms of which 0 ms to minimize.
[2022-05-18 19:26:37] [INFO ] Deduced a trap composed of 142 places in 171 ms of which 0 ms to minimize.
[2022-05-18 19:26:38] [INFO ] Deduced a trap composed of 117 places in 141 ms of which 0 ms to minimize.
[2022-05-18 19:26:38] [INFO ] Deduced a trap composed of 133 places in 150 ms of which 0 ms to minimize.
[2022-05-18 19:26:38] [INFO ] Deduced a trap composed of 142 places in 158 ms of which 1 ms to minimize.
[2022-05-18 19:26:39] [INFO ] Deduced a trap composed of 157 places in 171 ms of which 0 ms to minimize.
[2022-05-18 19:26:39] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 0 ms to minimize.
[2022-05-18 19:26:40] [INFO ] Deduced a trap composed of 171 places in 164 ms of which 0 ms to minimize.
[2022-05-18 19:26:40] [INFO ] Deduced a trap composed of 142 places in 171 ms of which 0 ms to minimize.
[2022-05-18 19:26:40] [INFO ] Deduced a trap composed of 122 places in 148 ms of which 0 ms to minimize.
[2022-05-18 19:26:41] [INFO ] Deduced a trap composed of 128 places in 144 ms of which 1 ms to minimize.
[2022-05-18 19:26:41] [INFO ] Deduced a trap composed of 150 places in 154 ms of which 0 ms to minimize.
[2022-05-18 19:26:42] [INFO ] Deduced a trap composed of 148 places in 154 ms of which 0 ms to minimize.
[2022-05-18 19:26:43] [INFO ] Deduced a trap composed of 118 places in 171 ms of which 1 ms to minimize.
[2022-05-18 19:26:44] [INFO ] Deduced a trap composed of 129 places in 173 ms of which 1 ms to minimize.
[2022-05-18 19:26:44] [INFO ] Deduced a trap composed of 165 places in 180 ms of which 1 ms to minimize.
[2022-05-18 19:26:44] [INFO ] Deduced a trap composed of 147 places in 157 ms of which 1 ms to minimize.
[2022-05-18 19:26:45] [INFO ] Deduced a trap composed of 166 places in 166 ms of which 0 ms to minimize.
[2022-05-18 19:26:45] [INFO ] Deduced a trap composed of 174 places in 155 ms of which 0 ms to minimize.
[2022-05-18 19:26:45] [INFO ] Deduced a trap composed of 127 places in 156 ms of which 1 ms to minimize.
[2022-05-18 19:26:45] [INFO ] Deduced a trap composed of 136 places in 166 ms of which 0 ms to minimize.
[2022-05-18 19:26:46] [INFO ] Deduced a trap composed of 146 places in 171 ms of which 2 ms to minimize.
[2022-05-18 19:26:46] [INFO ] Deduced a trap composed of 115 places in 160 ms of which 0 ms to minimize.
[2022-05-18 19:26:47] [INFO ] Deduced a trap composed of 145 places in 157 ms of which 1 ms to minimize.
[2022-05-18 19:26:48] [INFO ] Deduced a trap composed of 118 places in 164 ms of which 1 ms to minimize.
[2022-05-18 19:26:57] [INFO ] Trap strengthening (SAT) tested/added 79/79 trap constraints in 35302 ms
[2022-05-18 19:26:57] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2022-05-18 19:26:57] [INFO ] Deduced a trap composed of 107 places in 174 ms of which 0 ms to minimize.
[2022-05-18 19:26:58] [INFO ] Deduced a trap composed of 99 places in 171 ms of which 1 ms to minimize.
[2022-05-18 19:26:58] [INFO ] Deduced a trap composed of 134 places in 167 ms of which 0 ms to minimize.
[2022-05-18 19:26:58] [INFO ] Deduced a trap composed of 169 places in 163 ms of which 0 ms to minimize.
[2022-05-18 19:26:59] [INFO ] Deduced a trap composed of 120 places in 160 ms of which 0 ms to minimize.
[2022-05-18 19:26:59] [INFO ] Deduced a trap composed of 131 places in 161 ms of which 0 ms to minimize.
[2022-05-18 19:26:59] [INFO ] Deduced a trap composed of 114 places in 168 ms of which 1 ms to minimize.
[2022-05-18 19:26:59] [INFO ] Deduced a trap composed of 116 places in 183 ms of which 17 ms to minimize.
[2022-05-18 19:27:00] [INFO ] Deduced a trap composed of 152 places in 165 ms of which 1 ms to minimize.
[2022-05-18 19:27:00] [INFO ] Deduced a trap composed of 64 places in 146 ms of which 0 ms to minimize.
[2022-05-18 19:27:00] [INFO ] Deduced a trap composed of 99 places in 168 ms of which 1 ms to minimize.
[2022-05-18 19:27:01] [INFO ] Deduced a trap composed of 133 places in 163 ms of which 0 ms to minimize.
[2022-05-18 19:27:01] [INFO ] Deduced a trap composed of 108 places in 168 ms of which 0 ms to minimize.
[2022-05-18 19:27:02] [INFO ] Deduced a trap composed of 106 places in 163 ms of which 1 ms to minimize.
[2022-05-18 19:27:03] [INFO ] Deduced a trap composed of 118 places in 154 ms of which 0 ms to minimize.
[2022-05-18 19:27:03] [INFO ] Deduced a trap composed of 116 places in 162 ms of which 1 ms to minimize.
[2022-05-18 19:27:03] [INFO ] Deduced a trap composed of 108 places in 183 ms of which 0 ms to minimize.
[2022-05-18 19:27:04] [INFO ] Deduced a trap composed of 73 places in 172 ms of which 0 ms to minimize.
[2022-05-18 19:27:04] [INFO ] Deduced a trap composed of 63 places in 164 ms of which 1 ms to minimize.
[2022-05-18 19:27:05] [INFO ] Deduced a trap composed of 112 places in 160 ms of which 1 ms to minimize.
[2022-05-18 19:27:05] [INFO ] Deduced a trap composed of 109 places in 158 ms of which 0 ms to minimize.
[2022-05-18 19:27:05] [INFO ] Deduced a trap composed of 122 places in 156 ms of which 0 ms to minimize.
[2022-05-18 19:27:06] [INFO ] Deduced a trap composed of 97 places in 161 ms of which 1 ms to minimize.
[2022-05-18 19:27:07] [INFO ] Deduced a trap composed of 82 places in 166 ms of which 0 ms to minimize.
[2022-05-18 19:27:07] [INFO ] Deduced a trap composed of 76 places in 181 ms of which 1 ms to minimize.
[2022-05-18 19:27:07] [INFO ] Deduced a trap composed of 65 places in 171 ms of which 1 ms to minimize.
[2022-05-18 19:27:08] [INFO ] Deduced a trap composed of 64 places in 180 ms of which 1 ms to minimize.
[2022-05-18 19:27:08] [INFO ] Deduced a trap composed of 64 places in 176 ms of which 1 ms to minimize.
[2022-05-18 19:27:08] [INFO ] Deduced a trap composed of 65 places in 171 ms of which 1 ms to minimize.
[2022-05-18 19:27:09] [INFO ] Deduced a trap composed of 64 places in 166 ms of which 0 ms to minimize.
[2022-05-18 19:27:09] [INFO ] Deduced a trap composed of 64 places in 168 ms of which 0 ms to minimize.
[2022-05-18 19:27:09] [INFO ] Deduced a trap composed of 108 places in 165 ms of which 0 ms to minimize.
[2022-05-18 19:27:10] [INFO ] Deduced a trap composed of 142 places in 168 ms of which 0 ms to minimize.
[2022-05-18 19:27:10] [INFO ] Deduced a trap composed of 138 places in 179 ms of which 0 ms to minimize.
[2022-05-18 19:27:10] [INFO ] Deduced a trap composed of 65 places in 168 ms of which 1 ms to minimize.
[2022-05-18 19:27:11] [INFO ] Deduced a trap composed of 64 places in 168 ms of which 0 ms to minimize.
[2022-05-18 19:27:11] [INFO ] Deduced a trap composed of 70 places in 173 ms of which 1 ms to minimize.
[2022-05-18 19:27:12] [INFO ] Deduced a trap composed of 80 places in 176 ms of which 1 ms to minimize.
[2022-05-18 19:27:12] [INFO ] Deduced a trap composed of 64 places in 174 ms of which 0 ms to minimize.
[2022-05-18 19:27:14] [INFO ] Deduced a trap composed of 64 places in 162 ms of which 0 ms to minimize.
[2022-05-18 19:27:14] [INFO ] Deduced a trap composed of 70 places in 177 ms of which 1 ms to minimize.
[2022-05-18 19:27:14] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 17557 ms
[2022-05-18 19:27:15] [INFO ] After 56231ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 423 ms.
[2022-05-18 19:27:15] [INFO ] After 56758ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-18 19:27:15] [INFO ] Flatten gal took : 29 ms
[2022-05-18 19:27:15] [INFO ] Flatten gal took : 34 ms
[2022-05-18 19:27:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18359004435843215053.gal : 15 ms
[2022-05-18 19:27:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14854133893224416708.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14065838269721039162;'/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/ReachabilityCardinality18359004435843215053.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14854133893224416708.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...321
Loading property file /tmp/ReachabilityCardinality14854133893224416708.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 27
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :27 after 182
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :182 after 449
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :449 after 797
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :797 after 1137
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1137 after 1702
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1702 after 2652
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2652 after 7972
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :7972 after 91056
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :91056 after 2.89346e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.9795e+06 after 2.98287e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.98287e+06 after 2.99689e+06
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.99689e+06 after 3.31616e+06
Detected timeout of ITS tools.
[2022-05-18 19:27:30] [INFO ] Flatten gal took : 30 ms
[2022-05-18 19:27:30] [INFO ] Applying decomposition
[2022-05-18 19:27:30] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5009575905446039657.txt' '-o' '/tmp/graph5009575905446039657.bin' '-w' '/tmp/graph5009575905446039657.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5009575905446039657.bin' '-l' '-1' '-v' '-w' '/tmp/graph5009575905446039657.weights' '-q' '0' '-e' '0.001'
[2022-05-18 19:27:30] [INFO ] Decomposing Gal with order
[2022-05-18 19:27:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 19:27:30] [INFO ] Removed a total of 907 redundant transitions.
[2022-05-18 19:27:30] [INFO ] Flatten gal took : 132 ms
[2022-05-18 19:27:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 351 labels/synchronizations in 10 ms.
[2022-05-18 19:27:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2314515853151611682.gal : 5 ms
[2022-05-18 19:27:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10500371079215300693.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14065838269721039162;'/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/ReachabilityCardinality2314515853151611682.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10500371079215300693.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/ReachabilityCardinality10500371079215300693.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1 after 56
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :56 after 88
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :88 after 392
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :392 after 596
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :596 after 9106
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :9106 after 13555
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :13555 after 13831
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15764226064656218614
[2022-05-18 19:27:46] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15764226064656218614
Running compilation step : cd /tmp/ltsmin15764226064656218614;'/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 1384 ms.
Running link step : cd /tmp/ltsmin15764226064656218614;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin15764226064656218614;'/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' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 179 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Product exploration explored 100000 steps with 5 reset in 289 ms.
Product exploration explored 100000 steps with 5 reset in 333 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Support contains 4 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 1036/1036 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 532 transition count 1036
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 36 Pre rules applied. Total rules applied 36 place count 532 transition count 1084
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 72 place count 532 transition count 1084
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 84 place count 520 transition count 1072
Deduced a syphon composed of 60 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 96 place count 520 transition count 1072
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 148 places in 1 ms
Iterating global reduction 1 with 88 rules applied. Total rules applied 184 place count 520 transition count 1072
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 204 place count 500 transition count 1052
Deduced a syphon composed of 130 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 224 place count 500 transition count 1052
Deduced a syphon composed of 130 places in 1 ms
Applied a total of 224 rules in 59 ms. Remains 500 /532 variables (removed 32) and now considering 1052/1036 (removed -16) transitions.
[2022-05-18 19:28:02] [INFO ] Flow matrix only has 1028 transitions (discarded 24 similar events)
// Phase 1: matrix 1028 rows 500 cols
[2022-05-18 19:28:02] [INFO ] Computed 40 place invariants in 19 ms
[2022-05-18 19:28:03] [INFO ] Dead Transitions using invariants and state equation in 832 ms found 0 transitions.
[2022-05-18 19:28:03] [INFO ] Redundant transitions in 20 ms returned []
[2022-05-18 19:28:03] [INFO ] Flow matrix only has 1028 transitions (discarded 24 similar events)
// Phase 1: matrix 1028 rows 500 cols
[2022-05-18 19:28:03] [INFO ] Computed 40 place invariants in 19 ms
[2022-05-18 19:28:04] [INFO ] Dead Transitions using invariants and state equation in 827 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/532 places, 1052/1036 transitions.
Finished structural reductions, in 1 iterations. Remains : 500/532 places, 1052/1036 transitions.
Product exploration explored 100000 steps with 15 reset in 402 ms.
Product exploration explored 100000 steps with 8 reset in 444 ms.
Built C files in :
/tmp/ltsmin2496440234072046986
[2022-05-18 19:28:05] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2496440234072046986
Running compilation step : cd /tmp/ltsmin2496440234072046986;'/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 1817 ms.
Running link step : cd /tmp/ltsmin2496440234072046986;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2496440234072046986;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14081335246143511390.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 1036/1036 transitions.
Applied a total of 0 rules in 13 ms. Remains 532 /532 variables (removed 0) and now considering 1036/1036 (removed 0) transitions.
[2022-05-18 19:28:20] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 532 cols
[2022-05-18 19:28:20] [INFO ] Computed 40 place invariants in 23 ms
[2022-05-18 19:28:21] [INFO ] Dead Transitions using invariants and state equation in 971 ms found 0 transitions.
[2022-05-18 19:28:21] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 532 cols
[2022-05-18 19:28:21] [INFO ] Computed 40 place invariants in 14 ms
[2022-05-18 19:28:21] [INFO ] Implicit Places using invariants in 484 ms returned []
[2022-05-18 19:28:21] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 532 cols
[2022-05-18 19:28:21] [INFO ] Computed 40 place invariants in 32 ms
[2022-05-18 19:28:22] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:28:30] [INFO ] Implicit Places using invariants and state equation in 8370 ms returned []
Implicit Place search using SMT with State Equation took 8855 ms to find 0 implicit places.
[2022-05-18 19:28:30] [INFO ] Flow matrix only has 1012 transitions (discarded 24 similar events)
// Phase 1: matrix 1012 rows 532 cols
[2022-05-18 19:28:30] [INFO ] Computed 40 place invariants in 18 ms
[2022-05-18 19:28:31] [INFO ] Dead Transitions using invariants and state equation in 1049 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 532/532 places, 1036/1036 transitions.
Built C files in :
/tmp/ltsmin2136875784372454881
[2022-05-18 19:28:31] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2136875784372454881
Running compilation step : cd /tmp/ltsmin2136875784372454881;'/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 1821 ms.
Running link step : cd /tmp/ltsmin2136875784372454881;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin2136875784372454881;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11254529197329835466.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-18 19:28:46] [INFO ] Flatten gal took : 34 ms
[2022-05-18 19:28:46] [INFO ] Flatten gal took : 34 ms
[2022-05-18 19:28:46] [INFO ] Time to serialize gal into /tmp/LTL3242241677070795812.gal : 4 ms
[2022-05-18 19:28:46] [INFO ] Time to serialize properties into /tmp/LTL13364811195427996511.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/LTL3242241677070795812.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13364811195427996511.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/LTL3242241...267
Read 1 LTL properties
Checking formula 0 : !((("((MarkerWrite>=1)&&(QueueJobB_4_2>=1))")U(G(X((!(G("((TryAllocateOneTaskB_2>=1)&&(IdleTasks_2>=1))")))||("((MarkerWrite>=1)&&(Que...177
Formula 0 simplified : !("((MarkerWrite>=1)&&(QueueJobB_4_2>=1))" U GX("((MarkerWrite>=1)&&(QueueJobB_4_2>=1))" | !G"((TryAllocateOneTaskB_2>=1)&&(IdleTask...166
Detected timeout of ITS tools.
[2022-05-18 19:29:01] [INFO ] Flatten gal took : 44 ms
[2022-05-18 19:29:01] [INFO ] Applying decomposition
[2022-05-18 19:29:01] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18399662768534296285.txt' '-o' '/tmp/graph18399662768534296285.bin' '-w' '/tmp/graph18399662768534296285.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18399662768534296285.bin' '-l' '-1' '-v' '-w' '/tmp/graph18399662768534296285.weights' '-q' '0' '-e' '0.001'
[2022-05-18 19:29:01] [INFO ] Decomposing Gal with order
[2022-05-18 19:29:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 19:29:01] [INFO ] Removed a total of 731 redundant transitions.
[2022-05-18 19:29:01] [INFO ] Flatten gal took : 96 ms
[2022-05-18 19:29:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 276 labels/synchronizations in 11 ms.
[2022-05-18 19:29:01] [INFO ] Time to serialize gal into /tmp/LTL11120051454681346054.gal : 7 ms
[2022-05-18 19:29:01] [INFO ] Time to serialize properties into /tmp/LTL27404933315824606.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/LTL11120051454681346054.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL27404933315824606.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/LTL1112005...244
Read 1 LTL properties
Checking formula 0 : !((("((i10.u72.MarkerWrite>=1)&&(i10.u72.QueueJobB_4_2>=1))")U(G(X((!(G("((i2.i0.u54.TryAllocateOneTaskB_2>=1)&&(i2.i0.u83.IdleTasks_2...229
Formula 0 simplified : !("((i10.u72.MarkerWrite>=1)&&(i10.u72.QueueJobB_4_2>=1))" U GX("((i10.u72.MarkerWrite>=1)&&(i10.u72.QueueJobB_4_2>=1))" | !G"((i2.i...218
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13724208771867366210
[2022-05-18 19:29:16] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13724208771867366210
Running compilation step : cd /tmp/ltsmin13724208771867366210;'/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 1838 ms.
Running link step : cd /tmp/ltsmin13724208771867366210;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin13724208771867366210;'/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) U [](X(()||(LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-10 finished in 428865 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(p0))))'
Support contains 2 out of 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 550 transition count 994
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 496 transition count 994
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 59 Pre rules applied. Total rules applied 108 place count 496 transition count 935
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 226 place count 437 transition count 935
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 346 place count 377 transition count 875
Applied a total of 346 rules in 38 ms. Remains 377 /550 variables (removed 173) and now considering 875/1048 (removed 173) transitions.
[2022-05-18 19:29:33] [INFO ] Flow matrix only has 851 transitions (discarded 24 similar events)
// Phase 1: matrix 851 rows 377 cols
[2022-05-18 19:29:33] [INFO ] Computed 46 place invariants in 26 ms
[2022-05-18 19:29:33] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
[2022-05-18 19:29:33] [INFO ] Flow matrix only has 851 transitions (discarded 24 similar events)
// Phase 1: matrix 851 rows 377 cols
[2022-05-18 19:29:33] [INFO ] Computed 46 place invariants in 10 ms
[2022-05-18 19:29:34] [INFO ] Implicit Places using invariants in 401 ms returned [65, 164, 186, 243, 259, 330]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 402 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 371/550 places, 875/1048 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 369 transition count 873
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 369 transition count 873
Applied a total of 4 rules in 18 ms. Remains 369 /371 variables (removed 2) and now considering 873/875 (removed 2) transitions.
[2022-05-18 19:29:34] [INFO ] Flow matrix only has 849 transitions (discarded 24 similar events)
// Phase 1: matrix 849 rows 369 cols
[2022-05-18 19:29:34] [INFO ] Computed 40 place invariants in 19 ms
[2022-05-18 19:29:34] [INFO ] Implicit Places using invariants in 378 ms returned []
[2022-05-18 19:29:34] [INFO ] Flow matrix only has 849 transitions (discarded 24 similar events)
// Phase 1: matrix 849 rows 369 cols
[2022-05-18 19:29:34] [INFO ] Computed 40 place invariants in 18 ms
[2022-05-18 19:29:34] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:29:46] [INFO ] Implicit Places using invariants and state equation in 12348 ms returned []
Implicit Place search using SMT with State Equation took 12730 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 369/550 places, 873/1048 transitions.
Finished structural reductions, in 2 iterations. Remains : 369/550 places, 873/1048 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s3 10) (LT s140 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 57 reset in 343 ms.
Product exploration explored 100000 steps with 52 reset in 354 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1163 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=145 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 369 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 369/369 places, 873/873 transitions.
Applied a total of 0 rules in 18 ms. Remains 369 /369 variables (removed 0) and now considering 873/873 (removed 0) transitions.
[2022-05-18 19:29:48] [INFO ] Flow matrix only has 849 transitions (discarded 24 similar events)
// Phase 1: matrix 849 rows 369 cols
[2022-05-18 19:29:48] [INFO ] Computed 40 place invariants in 16 ms
[2022-05-18 19:29:48] [INFO ] Dead Transitions using invariants and state equation in 610 ms found 0 transitions.
[2022-05-18 19:29:48] [INFO ] Flow matrix only has 849 transitions (discarded 24 similar events)
// Phase 1: matrix 849 rows 369 cols
[2022-05-18 19:29:48] [INFO ] Computed 40 place invariants in 12 ms
[2022-05-18 19:29:49] [INFO ] Implicit Places using invariants in 370 ms returned []
[2022-05-18 19:29:49] [INFO ] Flow matrix only has 849 transitions (discarded 24 similar events)
// Phase 1: matrix 849 rows 369 cols
[2022-05-18 19:29:49] [INFO ] Computed 40 place invariants in 12 ms
[2022-05-18 19:29:49] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:29:57] [INFO ] Implicit Places using invariants and state equation in 8221 ms returned []
Implicit Place search using SMT with State Equation took 8593 ms to find 0 implicit places.
[2022-05-18 19:29:57] [INFO ] Redundant transitions in 18 ms returned []
[2022-05-18 19:29:57] [INFO ] Flow matrix only has 849 transitions (discarded 24 similar events)
// Phase 1: matrix 849 rows 369 cols
[2022-05-18 19:29:57] [INFO ] Computed 40 place invariants in 22 ms
[2022-05-18 19:29:57] [INFO ] Dead Transitions using invariants and state equation in 614 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 369/369 places, 873/873 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Finished random walk after 720 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=144 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 41 reset in 343 ms.
Product exploration explored 100000 steps with 47 reset in 368 ms.
Built C files in :
/tmp/ltsmin16293399465628413827
[2022-05-18 19:29:59] [INFO ] Computing symmetric may disable matrix : 873 transitions.
[2022-05-18 19:29:59] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 19:29:59] [INFO ] Computing symmetric may enable matrix : 873 transitions.
[2022-05-18 19:29:59] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 19:29:59] [INFO ] Computing Do-Not-Accords matrix : 873 transitions.
[2022-05-18 19:29:59] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 19:29:59] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16293399465628413827
Running compilation step : cd /tmp/ltsmin16293399465628413827;'/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 2515 ms.
Running link step : cd /tmp/ltsmin16293399465628413827;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin16293399465628413827;'/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/stateBased15407677639618281759.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 369 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 369/369 places, 873/873 transitions.
Applied a total of 0 rules in 16 ms. Remains 369 /369 variables (removed 0) and now considering 873/873 (removed 0) transitions.
[2022-05-18 19:30:14] [INFO ] Flow matrix only has 849 transitions (discarded 24 similar events)
// Phase 1: matrix 849 rows 369 cols
[2022-05-18 19:30:14] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-18 19:30:14] [INFO ] Dead Transitions using invariants and state equation in 597 ms found 0 transitions.
[2022-05-18 19:30:14] [INFO ] Flow matrix only has 849 transitions (discarded 24 similar events)
// Phase 1: matrix 849 rows 369 cols
[2022-05-18 19:30:14] [INFO ] Computed 40 place invariants in 12 ms
[2022-05-18 19:30:15] [INFO ] Implicit Places using invariants in 363 ms returned []
[2022-05-18 19:30:15] [INFO ] Flow matrix only has 849 transitions (discarded 24 similar events)
// Phase 1: matrix 849 rows 369 cols
[2022-05-18 19:30:15] [INFO ] Computed 40 place invariants in 26 ms
[2022-05-18 19:30:15] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:30:23] [INFO ] Implicit Places using invariants and state equation in 8128 ms returned []
Implicit Place search using SMT with State Equation took 8514 ms to find 0 implicit places.
[2022-05-18 19:30:23] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-18 19:30:23] [INFO ] Flow matrix only has 849 transitions (discarded 24 similar events)
// Phase 1: matrix 849 rows 369 cols
[2022-05-18 19:30:23] [INFO ] Computed 40 place invariants in 17 ms
[2022-05-18 19:30:24] [INFO ] Dead Transitions using invariants and state equation in 605 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 369/369 places, 873/873 transitions.
Built C files in :
/tmp/ltsmin15030314872145504983
[2022-05-18 19:30:24] [INFO ] Computing symmetric may disable matrix : 873 transitions.
[2022-05-18 19:30:24] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 19:30:24] [INFO ] Computing symmetric may enable matrix : 873 transitions.
[2022-05-18 19:30:24] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 19:30:24] [INFO ] Computing Do-Not-Accords matrix : 873 transitions.
[2022-05-18 19:30:24] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 19:30:24] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15030314872145504983
Running compilation step : cd /tmp/ltsmin15030314872145504983;'/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 2428 ms.
Running link step : cd /tmp/ltsmin15030314872145504983;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin15030314872145504983;'/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/stateBased7849352685904439724.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-18 19:30:39] [INFO ] Flatten gal took : 30 ms
[2022-05-18 19:30:39] [INFO ] Flatten gal took : 30 ms
[2022-05-18 19:30:39] [INFO ] Time to serialize gal into /tmp/LTL416138208992141956.gal : 5 ms
[2022-05-18 19:30:39] [INFO ] Time to serialize properties into /tmp/LTL5313486263044559296.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/LTL416138208992141956.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5313486263044559296.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/LTL4161382...265
Read 1 LTL properties
Checking formula 0 : !((X(G(F("((cBlockedTasks<10)||(DisablePollingB_6_4<1))")))))
Formula 0 simplified : !XGF"((cBlockedTasks<10)||(DisablePollingB_6_4<1))"
Detected timeout of ITS tools.
[2022-05-18 19:30:54] [INFO ] Flatten gal took : 34 ms
[2022-05-18 19:30:54] [INFO ] Applying decomposition
[2022-05-18 19:30:54] [INFO ] Flatten gal took : 29 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/graph12302524668099269809.txt' '-o' '/tmp/graph12302524668099269809.bin' '-w' '/tmp/graph12302524668099269809.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12302524668099269809.bin' '-l' '-1' '-v' '-w' '/tmp/graph12302524668099269809.weights' '-q' '0' '-e' '0.001'
[2022-05-18 19:30:54] [INFO ] Decomposing Gal with order
[2022-05-18 19:30:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 19:30:54] [INFO ] Removed a total of 783 redundant transitions.
[2022-05-18 19:30:54] [INFO ] Flatten gal took : 67 ms
[2022-05-18 19:30:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 5 ms.
[2022-05-18 19:30:54] [INFO ] Time to serialize gal into /tmp/LTL3215905126684238794.gal : 6 ms
[2022-05-18 19:30:54] [INFO ] Time to serialize properties into /tmp/LTL1207515648156723930.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/LTL3215905126684238794.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1207515648156723930.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/LTL3215905...245
Read 1 LTL properties
Checking formula 0 : !((X(G(F("((i5.u0.cBlockedTasks<10)||(i2.u13.DisablePollingB_6_4<1))")))))
Formula 0 simplified : !XGF"((i5.u0.cBlockedTasks<10)||(i2.u13.DisablePollingB_6_4<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7250074436678831962
[2022-05-18 19:31:09] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7250074436678831962
Running compilation step : cd /tmp/ltsmin7250074436678831962;'/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 1415 ms.
Running link step : cd /tmp/ltsmin7250074436678831962;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7250074436678831962;'/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))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-11 finished in 112869 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Support contains 3 out of 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 550 transition count 995
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 106 place count 497 transition count 995
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 106 place count 497 transition count 935
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 226 place count 437 transition count 935
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 344 place count 378 transition count 876
Applied a total of 344 rules in 35 ms. Remains 378 /550 variables (removed 172) and now considering 876/1048 (removed 172) transitions.
[2022-05-18 19:31:24] [INFO ] Flow matrix only has 852 transitions (discarded 24 similar events)
// Phase 1: matrix 852 rows 378 cols
[2022-05-18 19:31:24] [INFO ] Computed 46 place invariants in 11 ms
[2022-05-18 19:31:25] [INFO ] Dead Transitions using invariants and state equation in 574 ms found 0 transitions.
[2022-05-18 19:31:25] [INFO ] Flow matrix only has 852 transitions (discarded 24 similar events)
// Phase 1: matrix 852 rows 378 cols
[2022-05-18 19:31:25] [INFO ] Computed 46 place invariants in 12 ms
[2022-05-18 19:31:25] [INFO ] Implicit Places using invariants in 414 ms returned [65, 163, 185, 242, 259, 330]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 415 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 372/550 places, 876/1048 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 370 transition count 874
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 370 transition count 874
Applied a total of 4 rules in 19 ms. Remains 370 /372 variables (removed 2) and now considering 874/876 (removed 2) transitions.
[2022-05-18 19:31:25] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
// Phase 1: matrix 850 rows 370 cols
[2022-05-18 19:31:25] [INFO ] Computed 40 place invariants in 16 ms
[2022-05-18 19:31:26] [INFO ] Implicit Places using invariants in 395 ms returned []
[2022-05-18 19:31:26] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
// Phase 1: matrix 850 rows 370 cols
[2022-05-18 19:31:26] [INFO ] Computed 40 place invariants in 16 ms
[2022-05-18 19:31:26] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:31:31] [INFO ] Implicit Places using invariants and state equation in 5472 ms returned []
Implicit Place search using SMT with State Equation took 5879 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 370/550 places, 874/1048 transitions.
Finished structural reductions, in 2 iterations. Remains : 370/550 places, 874/1048 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s355 1), p0:(OR (LT s248 1) (LT s268 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 15 reset in 364 ms.
Stack based approach found an accepted trace after 3488 steps with 1 reset with depth 1781 and stack size 1775 in 12 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-12 finished in 7424 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(p1))))'
Support contains 2 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 544 transition count 1042
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 544 transition count 1042
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 539 transition count 1037
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 539 transition count 1037
Applied a total of 22 rules in 21 ms. Remains 539 /550 variables (removed 11) and now considering 1037/1048 (removed 11) transitions.
[2022-05-18 19:31:32] [INFO ] Flow matrix only has 1013 transitions (discarded 24 similar events)
// Phase 1: matrix 1013 rows 539 cols
[2022-05-18 19:31:32] [INFO ] Computed 46 place invariants in 28 ms
[2022-05-18 19:31:33] [INFO ] Dead Transitions using invariants and state equation in 1028 ms found 0 transitions.
[2022-05-18 19:31:33] [INFO ] Flow matrix only has 1013 transitions (discarded 24 similar events)
// Phase 1: matrix 1013 rows 539 cols
[2022-05-18 19:31:33] [INFO ] Computed 46 place invariants in 22 ms
[2022-05-18 19:31:33] [INFO ] Implicit Places using invariants in 501 ms returned [88, 242, 271, 356, 377, 475]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 515 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 533/550 places, 1037/1048 transitions.
Applied a total of 0 rules in 5 ms. Remains 533 /533 variables (removed 0) and now considering 1037/1037 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 533/550 places, 1037/1048 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(LT s147 1), p0:(GEQ s427 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 135 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-13 finished in 1730 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(F((F(p0)||G(p1))))&&X(!p0)))))'
Support contains 6 out of 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 550 transition count 1000
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 502 transition count 1000
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 59 Pre rules applied. Total rules applied 96 place count 502 transition count 941
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 214 place count 443 transition count 941
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 334 place count 383 transition count 881
Applied a total of 334 rules in 49 ms. Remains 383 /550 variables (removed 167) and now considering 881/1048 (removed 167) transitions.
[2022-05-18 19:31:33] [INFO ] Flow matrix only has 857 transitions (discarded 24 similar events)
// Phase 1: matrix 857 rows 383 cols
[2022-05-18 19:31:33] [INFO ] Computed 46 place invariants in 21 ms
[2022-05-18 19:31:34] [INFO ] Dead Transitions using invariants and state equation in 616 ms found 0 transitions.
[2022-05-18 19:31:34] [INFO ] Flow matrix only has 857 transitions (discarded 24 similar events)
// Phase 1: matrix 857 rows 383 cols
[2022-05-18 19:31:34] [INFO ] Computed 46 place invariants in 18 ms
[2022-05-18 19:31:34] [INFO ] Implicit Places using invariants in 423 ms returned [65, 165, 188, 247, 264, 335]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 424 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 377/550 places, 881/1048 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 375 transition count 879
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 375 transition count 879
Applied a total of 4 rules in 18 ms. Remains 375 /377 variables (removed 2) and now considering 879/881 (removed 2) transitions.
[2022-05-18 19:31:35] [INFO ] Flow matrix only has 855 transitions (discarded 24 similar events)
// Phase 1: matrix 855 rows 375 cols
[2022-05-18 19:31:35] [INFO ] Computed 40 place invariants in 18 ms
[2022-05-18 19:31:35] [INFO ] Implicit Places using invariants in 382 ms returned []
[2022-05-18 19:31:35] [INFO ] Flow matrix only has 855 transitions (discarded 24 similar events)
// Phase 1: matrix 855 rows 375 cols
[2022-05-18 19:31:35] [INFO ] Computed 40 place invariants in 19 ms
[2022-05-18 19:31:35] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:31:47] [INFO ] Implicit Places using invariants and state equation in 12188 ms returned []
Implicit Place search using SMT with State Equation took 12572 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 375/550 places, 879/1048 transitions.
Finished structural reductions, in 2 iterations. Remains : 375/550 places, 879/1048 transitions.
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s46 1) (GEQ s81 8) (GEQ s196 1) (GEQ s331 1)), p1:(OR (LT s3 10) (LT s218 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 20 reset in 369 ms.
Stack based approach found an accepted trace after 6066 steps with 0 reset with depth 6067 and stack size 6051 in 25 ms.
FORMULA PolyORBLF-PT-S04J04T06-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-15 finished in 14200 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(X(X(p0))))||G(F(p1)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p1 U p2)||p0))))'
Found a CL insensitive property : PolyORBLF-PT-S04J04T06-LTLFireability-07
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 12 out of 550 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 550 transition count 1012
Reduce places removed 36 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 42 rules applied. Total rules applied 78 place count 514 transition count 1006
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 508 transition count 1006
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 84 place count 508 transition count 946
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 204 place count 448 transition count 946
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 324 place count 388 transition count 886
Applied a total of 324 rules in 45 ms. Remains 388 /550 variables (removed 162) and now considering 886/1048 (removed 162) transitions.
[2022-05-18 19:31:48] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 388 cols
[2022-05-18 19:31:48] [INFO ] Computed 46 place invariants in 16 ms
[2022-05-18 19:31:48] [INFO ] Dead Transitions using invariants and state equation in 601 ms found 0 transitions.
[2022-05-18 19:31:48] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 388 cols
[2022-05-18 19:31:48] [INFO ] Computed 46 place invariants in 13 ms
[2022-05-18 19:31:49] [INFO ] Implicit Places using invariants in 414 ms returned [65, 169, 192, 250, 267, 339]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 416 ms to find 6 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 382/550 places, 886/1048 transitions.
Applied a total of 0 rules in 12 ms. Remains 382 /382 variables (removed 0) and now considering 886/886 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 382/550 places, 886/1048 transitions.
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s71 1) (GEQ s123 1) (GEQ s112 1) (GEQ s330 1) (GEQ s338 1) (GEQ s86 1)), p2:(OR (GEQ s336 1) (GEQ s212 1) (GEQ s262 1) (GEQ s75 1) (GEQ s172 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2113 reset in 391 ms.
Product exploration explored 100000 steps with 2067 reset in 407 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 299 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 68 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p2))]
[2022-05-18 19:31:50] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 19:31:50] [INFO ] Computed 40 place invariants in 14 ms
[2022-05-18 19:31:51] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2022-05-18 19:31:51] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 70 ms returned sat
[2022-05-18 19:31:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 19:31:52] [INFO ] [Real]Absence check using state equation in 1025 ms returned sat
[2022-05-18 19:31:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 19:31:52] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2022-05-18 19:31:52] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 50 ms returned sat
[2022-05-18 19:31:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 19:31:55] [INFO ] [Nat]Absence check using state equation in 2859 ms returned sat
[2022-05-18 19:31:55] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:31:56] [INFO ] [Nat]Added 120 Read/Feed constraints in 1057 ms returned sat
[2022-05-18 19:31:56] [INFO ] Deduced a trap composed of 49 places in 166 ms of which 1 ms to minimize.
[2022-05-18 19:31:57] [INFO ] Deduced a trap composed of 52 places in 166 ms of which 1 ms to minimize.
[2022-05-18 19:31:57] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 0 ms to minimize.
[2022-05-18 19:31:58] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 0 ms to minimize.
[2022-05-18 19:31:59] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
[2022-05-18 19:31:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3091 ms
[2022-05-18 19:31:59] [INFO ] Computed and/alt/rep : 588/3349/570 causal constraints (skipped 288 transitions) in 50 ms.
[2022-05-18 19:32:06] [INFO ] Added : 423 causal constraints over 85 iterations in 6718 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 12 out of 382 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 382/382 places, 886/886 transitions.
Applied a total of 0 rules in 16 ms. Remains 382 /382 variables (removed 0) and now considering 886/886 (removed 0) transitions.
[2022-05-18 19:32:06] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 19:32:06] [INFO ] Computed 40 place invariants in 14 ms
[2022-05-18 19:32:06] [INFO ] Dead Transitions using invariants and state equation in 597 ms found 0 transitions.
[2022-05-18 19:32:06] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 19:32:06] [INFO ] Computed 40 place invariants in 10 ms
[2022-05-18 19:32:07] [INFO ] Implicit Places using invariants in 386 ms returned []
[2022-05-18 19:32:07] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 19:32:07] [INFO ] Computed 40 place invariants in 15 ms
[2022-05-18 19:32:07] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:32:13] [INFO ] Implicit Places using invariants and state equation in 5669 ms returned []
Implicit Place search using SMT with State Equation took 6056 ms to find 0 implicit places.
[2022-05-18 19:32:13] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-18 19:32:13] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 19:32:13] [INFO ] Computed 40 place invariants in 15 ms
[2022-05-18 19:32:13] [INFO ] Dead Transitions using invariants and state equation in 591 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 382/382 places, 886/886 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 52 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p2))]
[2022-05-18 19:32:13] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 19:32:14] [INFO ] Computed 40 place invariants in 18 ms
[2022-05-18 19:32:14] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2022-05-18 19:32:14] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 71 ms returned sat
[2022-05-18 19:32:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 19:32:15] [INFO ] [Real]Absence check using state equation in 1037 ms returned sat
[2022-05-18 19:32:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 19:32:15] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2022-05-18 19:32:15] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 55 ms returned sat
[2022-05-18 19:32:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 19:32:18] [INFO ] [Nat]Absence check using state equation in 2885 ms returned sat
[2022-05-18 19:32:18] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:32:19] [INFO ] [Nat]Added 120 Read/Feed constraints in 1048 ms returned sat
[2022-05-18 19:32:19] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 0 ms to minimize.
[2022-05-18 19:32:20] [INFO ] Deduced a trap composed of 52 places in 164 ms of which 0 ms to minimize.
[2022-05-18 19:32:20] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 0 ms to minimize.
[2022-05-18 19:32:21] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
[2022-05-18 19:32:22] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2022-05-18 19:32:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3022 ms
[2022-05-18 19:32:22] [INFO ] Computed and/alt/rep : 588/3349/570 causal constraints (skipped 288 transitions) in 43 ms.
[2022-05-18 19:32:29] [INFO ] Added : 423 causal constraints over 85 iterations in 6702 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 2123 reset in 388 ms.
Product exploration explored 100000 steps with 2085 reset in 427 ms.
Built C files in :
/tmp/ltsmin18135312943407917328
[2022-05-18 19:32:30] [INFO ] Computing symmetric may disable matrix : 886 transitions.
[2022-05-18 19:32:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 19:32:30] [INFO ] Computing symmetric may enable matrix : 886 transitions.
[2022-05-18 19:32:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 19:32:30] [INFO ] Computing Do-Not-Accords matrix : 886 transitions.
[2022-05-18 19:32:30] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 19:32:30] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18135312943407917328
Running compilation step : cd /tmp/ltsmin18135312943407917328;'/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 2635 ms.
Running link step : cd /tmp/ltsmin18135312943407917328;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin18135312943407917328;'/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/stateBased8207130667549528794.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 12 out of 382 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 382/382 places, 886/886 transitions.
Applied a total of 0 rules in 13 ms. Remains 382 /382 variables (removed 0) and now considering 886/886 (removed 0) transitions.
[2022-05-18 19:32:45] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 19:32:45] [INFO ] Computed 40 place invariants in 17 ms
[2022-05-18 19:32:46] [INFO ] Dead Transitions using invariants and state equation in 591 ms found 0 transitions.
[2022-05-18 19:32:46] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 19:32:46] [INFO ] Computed 40 place invariants in 12 ms
[2022-05-18 19:32:46] [INFO ] Implicit Places using invariants in 393 ms returned []
[2022-05-18 19:32:46] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 19:32:46] [INFO ] Computed 40 place invariants in 10 ms
[2022-05-18 19:32:46] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:32:52] [INFO ] Implicit Places using invariants and state equation in 5699 ms returned []
Implicit Place search using SMT with State Equation took 6095 ms to find 0 implicit places.
[2022-05-18 19:32:52] [INFO ] Redundant transitions in 19 ms returned []
[2022-05-18 19:32:52] [INFO ] Flow matrix only has 862 transitions (discarded 24 similar events)
// Phase 1: matrix 862 rows 382 cols
[2022-05-18 19:32:52] [INFO ] Computed 40 place invariants in 16 ms
[2022-05-18 19:32:52] [INFO ] Dead Transitions using invariants and state equation in 585 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 382/382 places, 886/886 transitions.
Built C files in :
/tmp/ltsmin16650637300925269493
[2022-05-18 19:32:52] [INFO ] Computing symmetric may disable matrix : 886 transitions.
[2022-05-18 19:32:52] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 19:32:52] [INFO ] Computing symmetric may enable matrix : 886 transitions.
[2022-05-18 19:32:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 19:32:52] [INFO ] Computing Do-Not-Accords matrix : 886 transitions.
[2022-05-18 19:32:52] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 19:32:52] [INFO ] Built C files in 103ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16650637300925269493
Running compilation step : cd /tmp/ltsmin16650637300925269493;'/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 2627 ms.
Running link step : cd /tmp/ltsmin16650637300925269493;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin16650637300925269493;'/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/stateBased2348129614198547450.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-18 19:33:07] [INFO ] Flatten gal took : 35 ms
[2022-05-18 19:33:07] [INFO ] Flatten gal took : 40 ms
[2022-05-18 19:33:07] [INFO ] Time to serialize gal into /tmp/LTL16030140152999626013.gal : 3 ms
[2022-05-18 19:33:07] [INFO ] Time to serialize properties into /tmp/LTL15868110761669469474.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/LTL16030140152999626013.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15868110761669469474.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/LTL1603014...268
Read 1 LTL properties
Checking formula 0 : !((X(F((((("((((NotifyEventJobCompletedB_1>=1)||(NotifyEventJobCompletedB_5>=1))||((NotifyEventJobCompletedB_2>=1)||(NotifyEventJobCom...549
Formula 0 simplified : !XF("(((NotifyEventJobCompletedB_3>=1)||(NotifyEventJobCompletedB_4>=1))||(NotifyEventJobCompletedB_6>=1))" | "((NotifyEventJobCompl...536
Detected timeout of ITS tools.
[2022-05-18 19:33:23] [INFO ] Flatten gal took : 33 ms
[2022-05-18 19:33:23] [INFO ] Applying decomposition
[2022-05-18 19:33:23] [INFO ] Flatten gal took : 31 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/graph3782754017009925648.txt' '-o' '/tmp/graph3782754017009925648.bin' '-w' '/tmp/graph3782754017009925648.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3782754017009925648.bin' '-l' '-1' '-v' '-w' '/tmp/graph3782754017009925648.weights' '-q' '0' '-e' '0.001'
[2022-05-18 19:33:23] [INFO ] Decomposing Gal with order
[2022-05-18 19:33:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 19:33:23] [INFO ] Removed a total of 666 redundant transitions.
[2022-05-18 19:33:23] [INFO ] Flatten gal took : 75 ms
[2022-05-18 19:33:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 169 labels/synchronizations in 9 ms.
[2022-05-18 19:33:23] [INFO ] Time to serialize gal into /tmp/LTL12106693016946742374.gal : 6 ms
[2022-05-18 19:33:23] [INFO ] Time to serialize properties into /tmp/LTL352885799855650866.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/LTL12106693016946742374.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL352885799855650866.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/LTL1210669...245
Read 1 LTL properties
Checking formula 0 : !((X(F((((("((((i4.u5.NotifyEventJobCompletedB_1>=1)||(i4.u12.NotifyEventJobCompletedB_5>=1))||((i4.u14.NotifyEventJobCompletedB_2>=1)...663
Formula 0 simplified : !XF("(((i4.u16.NotifyEventJobCompletedB_3>=1)||(i4.u9.NotifyEventJobCompletedB_4>=1))||(i4.u7.NotifyEventJobCompletedB_6>=1))" | "((...650
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10894079072327751793
[2022-05-18 19:33:38] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10894079072327751793
Running compilation step : cd /tmp/ltsmin10894079072327751793;'/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 1542 ms.
Running link step : cd /tmp/ltsmin10894079072327751793;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10894079072327751793;'/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(<>((((LTLAPp1==true) U (LTLAPp2==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-07 finished in 125249 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(X((!G(p1)||p0)))))'
Found a SL insensitive property : PolyORBLF-PT-S04J04T06-LTLFireability-10
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Support contains 4 out of 550 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 550/550 places, 1048/1048 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 550 transition count 994
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 496 transition count 994
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 108 place count 496 transition count 934
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 228 place count 436 transition count 934
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 344 place count 378 transition count 876
Applied a total of 344 rules in 35 ms. Remains 378 /550 variables (removed 172) and now considering 876/1048 (removed 172) transitions.
[2022-05-18 19:33:53] [INFO ] Flow matrix only has 852 transitions (discarded 24 similar events)
// Phase 1: matrix 852 rows 378 cols
[2022-05-18 19:33:53] [INFO ] Computed 46 place invariants in 16 ms
[2022-05-18 19:33:54] [INFO ] Dead Transitions using invariants and state equation in 615 ms found 0 transitions.
[2022-05-18 19:33:54] [INFO ] Flow matrix only has 852 transitions (discarded 24 similar events)
// Phase 1: matrix 852 rows 378 cols
[2022-05-18 19:33:54] [INFO ] Computed 46 place invariants in 11 ms
[2022-05-18 19:33:54] [INFO ] Implicit Places using invariants in 395 ms returned [65, 164, 186, 243, 259, 331]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 396 ms to find 6 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 372/550 places, 876/1048 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 370 transition count 874
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 370 transition count 874
Applied a total of 4 rules in 16 ms. Remains 370 /372 variables (removed 2) and now considering 874/876 (removed 2) transitions.
[2022-05-18 19:33:54] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
// Phase 1: matrix 850 rows 370 cols
[2022-05-18 19:33:54] [INFO ] Computed 40 place invariants in 17 ms
[2022-05-18 19:33:55] [INFO ] Implicit Places using invariants in 393 ms returned []
[2022-05-18 19:33:55] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
// Phase 1: matrix 850 rows 370 cols
[2022-05-18 19:33:55] [INFO ] Computed 40 place invariants in 16 ms
[2022-05-18 19:33:55] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:33:58] [INFO ] Implicit Places using invariants and state equation in 3894 ms returned []
Implicit Place search using SMT with State Equation took 4288 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 370/550 places, 874/1048 transitions.
Finished structural reductions, in 2 iterations. Remains : 370/550 places, 874/1048 transitions.
Running random walk in product with property : PolyORBLF-PT-S04J04T06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s214 1) (GEQ s275 1)), p1:(AND (GEQ s200 1) (GEQ s212 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 16 reset in 350 ms.
Product exploration explored 100000 steps with 14 reset in 366 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 197 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 180234 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 180234 steps, saw 125472 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-18 19:34:03] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
// Phase 1: matrix 850 rows 370 cols
[2022-05-18 19:34:03] [INFO ] Computed 40 place invariants in 20 ms
[2022-05-18 19:34:03] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2022-05-18 19:34:03] [INFO ] [Real]Absence check using 13 positive and 27 generalized place invariants in 17 ms returned sat
[2022-05-18 19:34:03] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 19:34:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2022-05-18 19:34:03] [INFO ] [Nat]Absence check using 13 positive and 27 generalized place invariants in 17 ms returned sat
[2022-05-18 19:34:07] [INFO ] After 3806ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 19:34:07] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:34:09] [INFO ] After 1935ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-18 19:34:09] [INFO ] Deduced a trap composed of 161 places in 166 ms of which 0 ms to minimize.
[2022-05-18 19:34:09] [INFO ] Deduced a trap composed of 140 places in 166 ms of which 0 ms to minimize.
[2022-05-18 19:34:10] [INFO ] Deduced a trap composed of 161 places in 169 ms of which 0 ms to minimize.
[2022-05-18 19:34:10] [INFO ] Deduced a trap composed of 173 places in 169 ms of which 0 ms to minimize.
[2022-05-18 19:34:10] [INFO ] Deduced a trap composed of 163 places in 167 ms of which 0 ms to minimize.
[2022-05-18 19:34:11] [INFO ] Deduced a trap composed of 174 places in 173 ms of which 1 ms to minimize.
[2022-05-18 19:34:13] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 1 ms to minimize.
[2022-05-18 19:34:22] [INFO ] Trap strengthening (SAT) tested/added 7/7 trap constraints in 12865 ms
[2022-05-18 19:34:22] [INFO ] Deduced a trap composed of 155 places in 185 ms of which 0 ms to minimize.
[2022-05-18 19:34:22] [INFO ] Deduced a trap composed of 146 places in 174 ms of which 0 ms to minimize.
[2022-05-18 19:34:23] [INFO ] Deduced a trap composed of 177 places in 175 ms of which 0 ms to minimize.
[2022-05-18 19:34:23] [INFO ] Deduced a trap composed of 158 places in 173 ms of which 0 ms to minimize.
[2022-05-18 19:34:23] [INFO ] Deduced a trap composed of 163 places in 169 ms of which 1 ms to minimize.
[2022-05-18 19:34:23] [INFO ] Deduced a trap composed of 202 places in 178 ms of which 0 ms to minimize.
[2022-05-18 19:34:24] [INFO ] Deduced a trap composed of 172 places in 173 ms of which 0 ms to minimize.
[2022-05-18 19:34:24] [INFO ] Deduced a trap composed of 212 places in 172 ms of which 1 ms to minimize.
[2022-05-18 19:34:25] [INFO ] Deduced a trap composed of 190 places in 177 ms of which 0 ms to minimize.
[2022-05-18 19:34:25] [INFO ] Deduced a trap composed of 199 places in 155 ms of which 1 ms to minimize.
[2022-05-18 19:34:25] [INFO ] Deduced a trap composed of 193 places in 158 ms of which 0 ms to minimize.
[2022-05-18 19:34:25] [INFO ] Deduced a trap composed of 204 places in 182 ms of which 0 ms to minimize.
[2022-05-18 19:34:25] [INFO ] Deduced a trap composed of 198 places in 173 ms of which 0 ms to minimize.
[2022-05-18 19:34:26] [INFO ] Deduced a trap composed of 195 places in 174 ms of which 1 ms to minimize.
[2022-05-18 19:34:26] [INFO ] Deduced a trap composed of 180 places in 176 ms of which 0 ms to minimize.
[2022-05-18 19:34:26] [INFO ] Deduced a trap composed of 175 places in 165 ms of which 1 ms to minimize.
[2022-05-18 19:34:27] [INFO ] Deduced a trap composed of 204 places in 174 ms of which 0 ms to minimize.
[2022-05-18 19:34:27] [INFO ] Deduced a trap composed of 165 places in 167 ms of which 1 ms to minimize.
[2022-05-18 19:34:27] [INFO ] Deduced a trap composed of 170 places in 164 ms of which 0 ms to minimize.
[2022-05-18 19:34:28] [INFO ] Deduced a trap composed of 188 places in 164 ms of which 0 ms to minimize.
[2022-05-18 19:34:28] [INFO ] Deduced a trap composed of 170 places in 170 ms of which 1 ms to minimize.
[2022-05-18 19:34:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 19:34:28] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 370 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 370/370 places, 874/874 transitions.
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 370 transition count 862
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 24 place count 358 transition count 862
Applied a total of 24 rules in 26 ms. Remains 358 /370 variables (removed 12) and now considering 862/874 (removed 12) transitions.
[2022-05-18 19:34:28] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 358 cols
[2022-05-18 19:34:28] [INFO ] Computed 40 place invariants in 19 ms
[2022-05-18 19:34:28] [INFO ] Dead Transitions using invariants and state equation in 593 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 358/370 places, 862/874 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 194472 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 194472 steps, saw 135342 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-18 19:34:32] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 358 cols
[2022-05-18 19:34:32] [INFO ] Computed 40 place invariants in 19 ms
[2022-05-18 19:34:32] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-18 19:34:32] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 18 ms returned sat
[2022-05-18 19:34:32] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 19:34:32] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-18 19:34:32] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 39 ms returned sat
[2022-05-18 19:34:36] [INFO ] After 4448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 19:34:36] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:34:38] [INFO ] After 1327ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-18 19:34:38] [INFO ] Deduced a trap composed of 144 places in 174 ms of which 1 ms to minimize.
[2022-05-18 19:34:39] [INFO ] Deduced a trap composed of 159 places in 171 ms of which 0 ms to minimize.
[2022-05-18 19:34:39] [INFO ] Deduced a trap composed of 172 places in 172 ms of which 0 ms to minimize.
[2022-05-18 19:34:39] [INFO ] Deduced a trap composed of 149 places in 170 ms of which 0 ms to minimize.
[2022-05-18 19:34:39] [INFO ] Deduced a trap composed of 127 places in 182 ms of which 0 ms to minimize.
[2022-05-18 19:34:39] [INFO ] Deduced a trap composed of 159 places in 173 ms of which 0 ms to minimize.
[2022-05-18 19:34:40] [INFO ] Deduced a trap composed of 152 places in 176 ms of which 0 ms to minimize.
[2022-05-18 19:34:40] [INFO ] Deduced a trap composed of 161 places in 176 ms of which 1 ms to minimize.
[2022-05-18 19:34:40] [INFO ] Deduced a trap composed of 175 places in 170 ms of which 1 ms to minimize.
[2022-05-18 19:34:40] [INFO ] Deduced a trap composed of 151 places in 174 ms of which 0 ms to minimize.
[2022-05-18 19:34:40] [INFO ] Deduced a trap composed of 177 places in 175 ms of which 0 ms to minimize.
[2022-05-18 19:34:41] [INFO ] Deduced a trap composed of 142 places in 170 ms of which 0 ms to minimize.
[2022-05-18 19:34:41] [INFO ] Deduced a trap composed of 150 places in 165 ms of which 0 ms to minimize.
[2022-05-18 19:34:41] [INFO ] Deduced a trap composed of 149 places in 175 ms of which 1 ms to minimize.
[2022-05-18 19:34:41] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3171 ms
[2022-05-18 19:34:42] [INFO ] After 5169ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1433 ms.
[2022-05-18 19:34:43] [INFO ] After 11177ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 32 ms.
Support contains 4 out of 358 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 358/358 places, 862/862 transitions.
Applied a total of 0 rules in 14 ms. Remains 358 /358 variables (removed 0) and now considering 862/862 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 358/358 places, 862/862 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 358/358 places, 862/862 transitions.
Applied a total of 0 rules in 13 ms. Remains 358 /358 variables (removed 0) and now considering 862/862 (removed 0) transitions.
[2022-05-18 19:34:43] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 358 cols
[2022-05-18 19:34:43] [INFO ] Computed 40 place invariants in 17 ms
[2022-05-18 19:34:43] [INFO ] Implicit Places using invariants in 393 ms returned []
[2022-05-18 19:34:43] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 358 cols
[2022-05-18 19:34:43] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-18 19:34:44] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:34:50] [INFO ] Implicit Places using invariants and state equation in 6335 ms returned []
Implicit Place search using SMT with State Equation took 6729 ms to find 0 implicit places.
[2022-05-18 19:34:50] [INFO ] Redundant transitions in 17 ms returned []
[2022-05-18 19:34:50] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 358 cols
[2022-05-18 19:34:50] [INFO ] Computed 40 place invariants in 17 ms
[2022-05-18 19:34:50] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 358/358 places, 862/862 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 358 transition count 838
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 34 place count 353 transition count 888
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 1 with 44 rules applied. Total rules applied 78 place count 353 transition count 844
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 353 transition count 838
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 90 place count 347 transition count 838
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 101 place count 347 transition count 827
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 112 place count 336 transition count 827
Applied a total of 112 rules in 61 ms. Remains 336 /358 variables (removed 22) and now considering 827/862 (removed 35) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 827 rows 336 cols
[2022-05-18 19:34:50] [INFO ] Computed 40 place invariants in 20 ms
[2022-05-18 19:34:51] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-18 19:34:51] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 19 ms returned sat
[2022-05-18 19:34:51] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 19:34:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-18 19:34:51] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 18 ms returned sat
[2022-05-18 19:34:53] [INFO ] After 2171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 19:34:53] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2022-05-18 19:34:53] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2022-05-18 19:34:53] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 0 ms to minimize.
[2022-05-18 19:34:54] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 0 ms to minimize.
[2022-05-18 19:34:54] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 0 ms to minimize.
[2022-05-18 19:34:54] [INFO ] Deduced a trap composed of 119 places in 163 ms of which 1 ms to minimize.
[2022-05-18 19:34:54] [INFO ] Deduced a trap composed of 131 places in 172 ms of which 0 ms to minimize.
[2022-05-18 19:34:54] [INFO ] Deduced a trap composed of 113 places in 167 ms of which 1 ms to minimize.
[2022-05-18 19:34:55] [INFO ] Deduced a trap composed of 138 places in 171 ms of which 1 ms to minimize.
[2022-05-18 19:34:55] [INFO ] Deduced a trap composed of 53 places in 171 ms of which 0 ms to minimize.
[2022-05-18 19:34:55] [INFO ] Deduced a trap composed of 134 places in 161 ms of which 0 ms to minimize.
[2022-05-18 19:34:55] [INFO ] Deduced a trap composed of 148 places in 159 ms of which 0 ms to minimize.
[2022-05-18 19:34:56] [INFO ] Deduced a trap composed of 131 places in 160 ms of which 1 ms to minimize.
[2022-05-18 19:34:56] [INFO ] Deduced a trap composed of 136 places in 156 ms of which 0 ms to minimize.
[2022-05-18 19:34:56] [INFO ] Deduced a trap composed of 165 places in 158 ms of which 0 ms to minimize.
[2022-05-18 19:34:56] [INFO ] Deduced a trap composed of 141 places in 159 ms of which 0 ms to minimize.
[2022-05-18 19:34:56] [INFO ] Deduced a trap composed of 60 places in 165 ms of which 0 ms to minimize.
[2022-05-18 19:34:57] [INFO ] Deduced a trap composed of 146 places in 157 ms of which 1 ms to minimize.
[2022-05-18 19:34:57] [INFO ] Deduced a trap composed of 138 places in 162 ms of which 0 ms to minimize.
[2022-05-18 19:34:57] [INFO ] Deduced a trap composed of 148 places in 159 ms of which 0 ms to minimize.
[2022-05-18 19:34:57] [INFO ] Deduced a trap composed of 132 places in 161 ms of which 0 ms to minimize.
[2022-05-18 19:34:57] [INFO ] Deduced a trap composed of 166 places in 155 ms of which 0 ms to minimize.
[2022-05-18 19:34:58] [INFO ] Deduced a trap composed of 141 places in 160 ms of which 0 ms to minimize.
[2022-05-18 19:34:58] [INFO ] Deduced a trap composed of 159 places in 174 ms of which 1 ms to minimize.
[2022-05-18 19:34:58] [INFO ] Deduced a trap composed of 138 places in 166 ms of which 1 ms to minimize.
[2022-05-18 19:34:58] [INFO ] Deduced a trap composed of 133 places in 154 ms of which 0 ms to minimize.
[2022-05-18 19:34:58] [INFO ] Deduced a trap composed of 136 places in 198 ms of which 1 ms to minimize.
[2022-05-18 19:34:59] [INFO ] Deduced a trap composed of 132 places in 158 ms of which 1 ms to minimize.
[2022-05-18 19:34:59] [INFO ] Deduced a trap composed of 66 places in 158 ms of which 1 ms to minimize.
[2022-05-18 19:34:59] [INFO ] Deduced a trap composed of 130 places in 164 ms of which 0 ms to minimize.
[2022-05-18 19:35:00] [INFO ] Deduced a trap composed of 126 places in 169 ms of which 1 ms to minimize.
[2022-05-18 19:35:00] [INFO ] Deduced a trap composed of 127 places in 170 ms of which 0 ms to minimize.
[2022-05-18 19:35:00] [INFO ] Deduced a trap composed of 65 places in 158 ms of which 1 ms to minimize.
[2022-05-18 19:35:00] [INFO ] Deduced a trap composed of 82 places in 155 ms of which 1 ms to minimize.
[2022-05-18 19:35:00] [INFO ] Deduced a trap composed of 141 places in 162 ms of which 1 ms to minimize.
[2022-05-18 19:35:01] [INFO ] Deduced a trap composed of 63 places in 178 ms of which 1 ms to minimize.
[2022-05-18 19:35:01] [INFO ] Deduced a trap composed of 67 places in 175 ms of which 1 ms to minimize.
[2022-05-18 19:35:01] [INFO ] Deduced a trap composed of 145 places in 175 ms of which 0 ms to minimize.
[2022-05-18 19:35:01] [INFO ] Deduced a trap composed of 128 places in 154 ms of which 0 ms to minimize.
[2022-05-18 19:35:02] [INFO ] Deduced a trap composed of 53 places in 157 ms of which 0 ms to minimize.
[2022-05-18 19:35:02] [INFO ] Deduced a trap composed of 73 places in 157 ms of which 1 ms to minimize.
[2022-05-18 19:35:02] [INFO ] Deduced a trap composed of 65 places in 160 ms of which 0 ms to minimize.
[2022-05-18 19:35:02] [INFO ] Deduced a trap composed of 128 places in 153 ms of which 0 ms to minimize.
[2022-05-18 19:35:02] [INFO ] Deduced a trap composed of 127 places in 162 ms of which 0 ms to minimize.
[2022-05-18 19:35:03] [INFO ] Deduced a trap composed of 131 places in 173 ms of which 1 ms to minimize.
[2022-05-18 19:35:03] [INFO ] Deduced a trap composed of 137 places in 177 ms of which 0 ms to minimize.
[2022-05-18 19:35:03] [INFO ] Deduced a trap composed of 53 places in 168 ms of which 0 ms to minimize.
[2022-05-18 19:35:03] [INFO ] Deduced a trap composed of 53 places in 170 ms of which 1 ms to minimize.
[2022-05-18 19:35:04] [INFO ] Deduced a trap composed of 140 places in 170 ms of which 1 ms to minimize.
[2022-05-18 19:35:04] [INFO ] Deduced a trap composed of 139 places in 175 ms of which 1 ms to minimize.
[2022-05-18 19:35:04] [INFO ] Deduced a trap composed of 115 places in 171 ms of which 1 ms to minimize.
[2022-05-18 19:35:04] [INFO ] Deduced a trap composed of 129 places in 179 ms of which 1 ms to minimize.
[2022-05-18 19:35:05] [INFO ] Deduced a trap composed of 53 places in 168 ms of which 0 ms to minimize.
[2022-05-18 19:35:05] [INFO ] Deduced a trap composed of 139 places in 166 ms of which 0 ms to minimize.
[2022-05-18 19:35:05] [INFO ] Deduced a trap composed of 131 places in 161 ms of which 0 ms to minimize.
[2022-05-18 19:35:05] [INFO ] Deduced a trap composed of 128 places in 164 ms of which 1 ms to minimize.
[2022-05-18 19:35:05] [INFO ] Deduced a trap composed of 137 places in 161 ms of which 0 ms to minimize.
[2022-05-18 19:35:06] [INFO ] Deduced a trap composed of 132 places in 167 ms of which 0 ms to minimize.
[2022-05-18 19:35:06] [INFO ] Deduced a trap composed of 129 places in 159 ms of which 0 ms to minimize.
[2022-05-18 19:35:06] [INFO ] Deduced a trap composed of 127 places in 164 ms of which 1 ms to minimize.
[2022-05-18 19:35:06] [INFO ] Deduced a trap composed of 134 places in 174 ms of which 0 ms to minimize.
[2022-05-18 19:35:07] [INFO ] Deduced a trap composed of 133 places in 173 ms of which 0 ms to minimize.
[2022-05-18 19:35:07] [INFO ] Deduced a trap composed of 124 places in 173 ms of which 0 ms to minimize.
[2022-05-18 19:35:07] [INFO ] Deduced a trap composed of 118 places in 182 ms of which 1 ms to minimize.
[2022-05-18 19:35:07] [INFO ] Deduced a trap composed of 135 places in 174 ms of which 0 ms to minimize.
[2022-05-18 19:35:08] [INFO ] Deduced a trap composed of 145 places in 168 ms of which 0 ms to minimize.
[2022-05-18 19:35:08] [INFO ] Deduced a trap composed of 163 places in 175 ms of which 0 ms to minimize.
[2022-05-18 19:35:08] [INFO ] Deduced a trap composed of 150 places in 166 ms of which 0 ms to minimize.
[2022-05-18 19:35:08] [INFO ] Deduced a trap composed of 117 places in 162 ms of which 1 ms to minimize.
[2022-05-18 19:35:08] [INFO ] Deduced a trap composed of 126 places in 152 ms of which 0 ms to minimize.
[2022-05-18 19:35:10] [INFO ] Deduced a trap composed of 139 places in 157 ms of which 0 ms to minimize.
[2022-05-18 19:35:10] [INFO ] Deduced a trap composed of 166 places in 166 ms of which 0 ms to minimize.
[2022-05-18 19:35:11] [INFO ] Deduced a trap composed of 129 places in 166 ms of which 0 ms to minimize.
[2022-05-18 19:35:11] [INFO ] Deduced a trap composed of 130 places in 176 ms of which 0 ms to minimize.
[2022-05-18 19:35:11] [INFO ] Deduced a trap composed of 63 places in 175 ms of which 0 ms to minimize.
[2022-05-18 19:35:11] [INFO ] Deduced a trap composed of 172 places in 166 ms of which 1 ms to minimize.
[2022-05-18 19:35:12] [INFO ] Deduced a trap composed of 151 places in 168 ms of which 0 ms to minimize.
[2022-05-18 19:35:12] [INFO ] Deduced a trap composed of 146 places in 168 ms of which 0 ms to minimize.
[2022-05-18 19:35:12] [INFO ] Deduced a trap composed of 71 places in 168 ms of which 0 ms to minimize.
[2022-05-18 19:35:12] [INFO ] Deduced a trap composed of 141 places in 174 ms of which 1 ms to minimize.
[2022-05-18 19:35:13] [INFO ] Deduced a trap composed of 66 places in 166 ms of which 0 ms to minimize.
[2022-05-18 19:35:13] [INFO ] Deduced a trap composed of 67 places in 162 ms of which 0 ms to minimize.
[2022-05-18 19:35:13] [INFO ] Deduced a trap composed of 130 places in 171 ms of which 0 ms to minimize.
[2022-05-18 19:35:13] [INFO ] Deduced a trap composed of 71 places in 179 ms of which 1 ms to minimize.
[2022-05-18 19:35:13] [INFO ] Deduced a trap composed of 66 places in 164 ms of which 0 ms to minimize.
[2022-05-18 19:35:14] [INFO ] Deduced a trap composed of 133 places in 152 ms of which 0 ms to minimize.
[2022-05-18 19:35:14] [INFO ] Deduced a trap composed of 147 places in 165 ms of which 1 ms to minimize.
[2022-05-18 19:35:14] [INFO ] Deduced a trap composed of 136 places in 172 ms of which 0 ms to minimize.
[2022-05-18 19:35:15] [INFO ] Deduced a trap composed of 153 places in 179 ms of which 0 ms to minimize.
[2022-05-18 19:35:15] [INFO ] Deduced a trap composed of 140 places in 169 ms of which 0 ms to minimize.
[2022-05-18 19:35:16] [INFO ] Deduced a trap composed of 155 places in 166 ms of which 0 ms to minimize.
[2022-05-18 19:35:16] [INFO ] Deduced a trap composed of 141 places in 174 ms of which 1 ms to minimize.
[2022-05-18 19:35:17] [INFO ] Deduced a trap composed of 134 places in 179 ms of which 1 ms to minimize.
[2022-05-18 19:35:17] [INFO ] Deduced a trap composed of 146 places in 175 ms of which 1 ms to minimize.
[2022-05-18 19:35:17] [INFO ] Deduced a trap composed of 149 places in 172 ms of which 0 ms to minimize.
[2022-05-18 19:35:17] [INFO ] Deduced a trap composed of 153 places in 180 ms of which 0 ms to minimize.
[2022-05-18 19:35:19] [INFO ] Deduced a trap composed of 142 places in 164 ms of which 0 ms to minimize.
[2022-05-18 19:35:22] [INFO ] Deduced a trap composed of 134 places in 173 ms of which 0 ms to minimize.
[2022-05-18 19:35:23] [INFO ] Deduced a trap composed of 121 places in 163 ms of which 0 ms to minimize.
[2022-05-18 19:35:23] [INFO ] Deduced a trap composed of 138 places in 149 ms of which 1 ms to minimize.
[2022-05-18 19:35:26] [INFO ] Deduced a trap composed of 144 places in 153 ms of which 0 ms to minimize.
[2022-05-18 19:35:31] [INFO ] Deduced a trap composed of 137 places in 168 ms of which 0 ms to minimize.
[2022-05-18 19:35:33] [INFO ] Deduced a trap composed of 138 places in 182 ms of which 0 ms to minimize.
[2022-05-18 19:35:33] [INFO ] Deduced a trap composed of 150 places in 171 ms of which 0 ms to minimize.
[2022-05-18 19:35:34] [INFO ] Deduced a trap composed of 175 places in 178 ms of which 0 ms to minimize.
[2022-05-18 19:35:34] [INFO ] Deduced a trap composed of 137 places in 177 ms of which 0 ms to minimize.
[2022-05-18 19:35:34] [INFO ] Deduced a trap composed of 131 places in 177 ms of which 1 ms to minimize.
[2022-05-18 19:35:34] [INFO ] Deduced a trap composed of 131 places in 173 ms of which 1 ms to minimize.
[2022-05-18 19:35:35] [INFO ] Deduced a trap composed of 125 places in 173 ms of which 0 ms to minimize.
[2022-05-18 19:35:38] [INFO ] Deduced a trap composed of 163 places in 178 ms of which 0 ms to minimize.
[2022-05-18 19:35:38] [INFO ] Deduced a trap composed of 142 places in 168 ms of which 0 ms to minimize.
[2022-05-18 19:35:39] [INFO ] Deduced a trap composed of 141 places in 169 ms of which 0 ms to minimize.
[2022-05-18 19:35:48] [INFO ] Trap strengthening (SAT) tested/added 112/112 trap constraints in 54531 ms
[2022-05-18 19:35:48] [INFO ] Deduced a trap composed of 156 places in 147 ms of which 0 ms to minimize.
[2022-05-18 19:35:48] [INFO ] Deduced a trap composed of 155 places in 158 ms of which 1 ms to minimize.
[2022-05-18 19:35:49] [INFO ] Deduced a trap composed of 125 places in 176 ms of which 0 ms to minimize.
[2022-05-18 19:35:49] [INFO ] Deduced a trap composed of 118 places in 165 ms of which 1 ms to minimize.
[2022-05-18 19:35:49] [INFO ] Deduced a trap composed of 132 places in 158 ms of which 0 ms to minimize.
[2022-05-18 19:35:49] [INFO ] Deduced a trap composed of 127 places in 164 ms of which 0 ms to minimize.
[2022-05-18 19:35:49] [INFO ] Deduced a trap composed of 127 places in 166 ms of which 1 ms to minimize.
[2022-05-18 19:35:50] [INFO ] Deduced a trap composed of 75 places in 169 ms of which 0 ms to minimize.
[2022-05-18 19:35:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1745 ms
[2022-05-18 19:35:50] [INFO ] After 59021ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 95 ms.
[2022-05-18 19:35:50] [INFO ] After 59211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-18 19:35:50] [INFO ] Flatten gal took : 30 ms
[2022-05-18 19:35:50] [INFO ] Flatten gal took : 29 ms
[2022-05-18 19:35:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15265381559596233626.gal : 4 ms
[2022-05-18 19:35:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8233863392913526828.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms11543779024495152327;'/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/ReachabilityCardinality15265381559596233626.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8233863392913526828.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/ReachabilityCardinality8233863392913526828.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 27
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :27 after 182
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :182 after 449
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :449 after 797
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :797 after 1137
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1137 after 1702
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1702 after 2652
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2652 after 7972
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :7972 after 91056
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :91056 after 2.89346e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.9795e+06 after 2.98287e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.98287e+06 after 2.99689e+06
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.99689e+06 after 3.31616e+06
Detected timeout of ITS tools.
[2022-05-18 19:36:05] [INFO ] Flatten gal took : 29 ms
[2022-05-18 19:36:05] [INFO ] Applying decomposition
[2022-05-18 19:36:05] [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/graph8094648268272555911.txt' '-o' '/tmp/graph8094648268272555911.bin' '-w' '/tmp/graph8094648268272555911.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8094648268272555911.bin' '-l' '-1' '-v' '-w' '/tmp/graph8094648268272555911.weights' '-q' '0' '-e' '0.001'
[2022-05-18 19:36:05] [INFO ] Decomposing Gal with order
[2022-05-18 19:36:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 19:36:05] [INFO ] Removed a total of 943 redundant transitions.
[2022-05-18 19:36:05] [INFO ] Flatten gal took : 70 ms
[2022-05-18 19:36:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 324 labels/synchronizations in 13 ms.
[2022-05-18 19:36:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4198013206022833673.gal : 7 ms
[2022-05-18 19:36:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17995014072229149082.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms11543779024495152327;'/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/ReachabilityCardinality4198013206022833673.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17995014072229149082.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/ReachabilityCardinality17995014072229149082.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1 after 88
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :88 after 148
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :148 after 896
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :896 after 1584
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1584 after 18992
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :18992 after 97847
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :97847 after 119679
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :119679 after 121883
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18187619620716868608
[2022-05-18 19:36:20] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18187619620716868608
Running compilation step : cd /tmp/ltsmin18187619620716868608;'/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 1382 ms.
Running link step : cd /tmp/ltsmin18187619620716868608;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin18187619620716868608;'/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' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 255 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Support contains 4 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 874/874 transitions.
Applied a total of 0 rules in 9 ms. Remains 370 /370 variables (removed 0) and now considering 874/874 (removed 0) transitions.
[2022-05-18 19:36:36] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
// Phase 1: matrix 850 rows 370 cols
[2022-05-18 19:36:36] [INFO ] Computed 40 place invariants in 15 ms
[2022-05-18 19:36:36] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
[2022-05-18 19:36:36] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
// Phase 1: matrix 850 rows 370 cols
[2022-05-18 19:36:36] [INFO ] Computed 40 place invariants in 10 ms
[2022-05-18 19:36:37] [INFO ] Implicit Places using invariants in 378 ms returned []
[2022-05-18 19:36:37] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
// Phase 1: matrix 850 rows 370 cols
[2022-05-18 19:36:37] [INFO ] Computed 40 place invariants in 17 ms
[2022-05-18 19:36:37] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:36:39] [INFO ] Implicit Places using invariants and state equation in 2688 ms returned []
Implicit Place search using SMT with State Equation took 3068 ms to find 0 implicit places.
[2022-05-18 19:36:39] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
// Phase 1: matrix 850 rows 370 cols
[2022-05-18 19:36:39] [INFO ] Computed 40 place invariants in 11 ms
[2022-05-18 19:36:40] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 370/370 places, 874/874 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 187 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 171134 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 171134 steps, saw 119424 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-18 19:36:44] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
// Phase 1: matrix 850 rows 370 cols
[2022-05-18 19:36:44] [INFO ] Computed 40 place invariants in 17 ms
[2022-05-18 19:36:44] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2022-05-18 19:36:44] [INFO ] [Real]Absence check using 13 positive and 27 generalized place invariants in 17 ms returned sat
[2022-05-18 19:36:44] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 19:36:44] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2022-05-18 19:36:44] [INFO ] [Nat]Absence check using 13 positive and 27 generalized place invariants in 19 ms returned sat
[2022-05-18 19:36:48] [INFO ] After 3774ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 19:36:48] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:36:50] [INFO ] After 1991ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-18 19:36:50] [INFO ] Deduced a trap composed of 161 places in 177 ms of which 1 ms to minimize.
[2022-05-18 19:36:50] [INFO ] Deduced a trap composed of 140 places in 172 ms of which 0 ms to minimize.
[2022-05-18 19:36:50] [INFO ] Deduced a trap composed of 161 places in 167 ms of which 1 ms to minimize.
[2022-05-18 19:36:51] [INFO ] Deduced a trap composed of 173 places in 178 ms of which 0 ms to minimize.
[2022-05-18 19:36:51] [INFO ] Deduced a trap composed of 163 places in 180 ms of which 0 ms to minimize.
[2022-05-18 19:36:51] [INFO ] Deduced a trap composed of 174 places in 155 ms of which 0 ms to minimize.
[2022-05-18 19:36:54] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 0 ms to minimize.
[2022-05-18 19:37:03] [INFO ] Trap strengthening (SAT) tested/added 7/7 trap constraints in 12957 ms
[2022-05-18 19:37:03] [INFO ] Deduced a trap composed of 208 places in 170 ms of which 0 ms to minimize.
[2022-05-18 19:37:03] [INFO ] Deduced a trap composed of 188 places in 187 ms of which 1 ms to minimize.
[2022-05-18 19:37:04] [INFO ] Deduced a trap composed of 169 places in 198 ms of which 0 ms to minimize.
[2022-05-18 19:37:04] [INFO ] Deduced a trap composed of 47 places in 188 ms of which 1 ms to minimize.
[2022-05-18 19:37:04] [INFO ] Deduced a trap composed of 146 places in 206 ms of which 0 ms to minimize.
[2022-05-18 19:37:04] [INFO ] Deduced a trap composed of 46 places in 184 ms of which 0 ms to minimize.
[2022-05-18 19:37:05] [INFO ] Deduced a trap composed of 161 places in 177 ms of which 0 ms to minimize.
[2022-05-18 19:37:05] [INFO ] Deduced a trap composed of 160 places in 176 ms of which 1 ms to minimize.
[2022-05-18 19:37:05] [INFO ] Deduced a trap composed of 143 places in 215 ms of which 1 ms to minimize.
[2022-05-18 19:37:05] [INFO ] Deduced a trap composed of 157 places in 177 ms of which 0 ms to minimize.
[2022-05-18 19:37:06] [INFO ] Deduced a trap composed of 144 places in 172 ms of which 1 ms to minimize.
[2022-05-18 19:37:06] [INFO ] Deduced a trap composed of 156 places in 162 ms of which 0 ms to minimize.
[2022-05-18 19:37:07] [INFO ] Deduced a trap composed of 172 places in 149 ms of which 0 ms to minimize.
[2022-05-18 19:37:07] [INFO ] Deduced a trap composed of 158 places in 207 ms of which 0 ms to minimize.
[2022-05-18 19:37:07] [INFO ] Deduced a trap composed of 143 places in 171 ms of which 1 ms to minimize.
[2022-05-18 19:37:08] [INFO ] Deduced a trap composed of 180 places in 165 ms of which 1 ms to minimize.
[2022-05-18 19:37:08] [INFO ] Deduced a trap composed of 184 places in 175 ms of which 1 ms to minimize.
[2022-05-18 19:37:09] [INFO ] Deduced a trap composed of 174 places in 201 ms of which 0 ms to minimize.
[2022-05-18 19:37:09] [INFO ] Deduced a trap composed of 129 places in 158 ms of which 1 ms to minimize.
[2022-05-18 19:37:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 19:37:09] [INFO ] After 25125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 370 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 370/370 places, 874/874 transitions.
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 370 transition count 862
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 24 place count 358 transition count 862
Applied a total of 24 rules in 25 ms. Remains 358 /370 variables (removed 12) and now considering 862/874 (removed 12) transitions.
[2022-05-18 19:37:09] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 358 cols
[2022-05-18 19:37:09] [INFO ] Computed 40 place invariants in 15 ms
[2022-05-18 19:37:09] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 358/370 places, 862/874 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 174772 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 174772 steps, saw 122095 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-18 19:37:13] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 358 cols
[2022-05-18 19:37:13] [INFO ] Computed 40 place invariants in 10 ms
[2022-05-18 19:37:13] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-18 19:37:13] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 18 ms returned sat
[2022-05-18 19:37:13] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 19:37:13] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-18 19:37:13] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 42 ms returned sat
[2022-05-18 19:37:17] [INFO ] After 4438ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 19:37:17] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:37:19] [INFO ] After 1325ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-18 19:37:19] [INFO ] Deduced a trap composed of 144 places in 165 ms of which 0 ms to minimize.
[2022-05-18 19:37:20] [INFO ] Deduced a trap composed of 159 places in 184 ms of which 1 ms to minimize.
[2022-05-18 19:37:20] [INFO ] Deduced a trap composed of 172 places in 171 ms of which 0 ms to minimize.
[2022-05-18 19:37:20] [INFO ] Deduced a trap composed of 149 places in 174 ms of which 0 ms to minimize.
[2022-05-18 19:37:20] [INFO ] Deduced a trap composed of 127 places in 177 ms of which 0 ms to minimize.
[2022-05-18 19:37:20] [INFO ] Deduced a trap composed of 159 places in 170 ms of which 1 ms to minimize.
[2022-05-18 19:37:21] [INFO ] Deduced a trap composed of 152 places in 182 ms of which 0 ms to minimize.
[2022-05-18 19:37:21] [INFO ] Deduced a trap composed of 161 places in 151 ms of which 0 ms to minimize.
[2022-05-18 19:37:21] [INFO ] Deduced a trap composed of 175 places in 166 ms of which 1 ms to minimize.
[2022-05-18 19:37:21] [INFO ] Deduced a trap composed of 151 places in 176 ms of which 0 ms to minimize.
[2022-05-18 19:37:21] [INFO ] Deduced a trap composed of 177 places in 168 ms of which 1 ms to minimize.
[2022-05-18 19:37:22] [INFO ] Deduced a trap composed of 142 places in 159 ms of which 1 ms to minimize.
[2022-05-18 19:37:22] [INFO ] Deduced a trap composed of 150 places in 152 ms of which 1 ms to minimize.
[2022-05-18 19:37:22] [INFO ] Deduced a trap composed of 149 places in 155 ms of which 1 ms to minimize.
[2022-05-18 19:37:22] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3062 ms
[2022-05-18 19:37:22] [INFO ] After 5054ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1446 ms.
[2022-05-18 19:37:24] [INFO ] After 11079ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 36 ms.
Support contains 4 out of 358 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 358/358 places, 862/862 transitions.
Applied a total of 0 rules in 12 ms. Remains 358 /358 variables (removed 0) and now considering 862/862 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 358/358 places, 862/862 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 358/358 places, 862/862 transitions.
Applied a total of 0 rules in 11 ms. Remains 358 /358 variables (removed 0) and now considering 862/862 (removed 0) transitions.
[2022-05-18 19:37:24] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 358 cols
[2022-05-18 19:37:24] [INFO ] Computed 40 place invariants in 17 ms
[2022-05-18 19:37:24] [INFO ] Implicit Places using invariants in 372 ms returned []
[2022-05-18 19:37:24] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 358 cols
[2022-05-18 19:37:24] [INFO ] Computed 40 place invariants in 10 ms
[2022-05-18 19:37:25] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:37:30] [INFO ] Implicit Places using invariants and state equation in 5858 ms returned []
Implicit Place search using SMT with State Equation took 6243 ms to find 0 implicit places.
[2022-05-18 19:37:30] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-18 19:37:30] [INFO ] Flow matrix only has 838 transitions (discarded 24 similar events)
// Phase 1: matrix 838 rows 358 cols
[2022-05-18 19:37:30] [INFO ] Computed 40 place invariants in 14 ms
[2022-05-18 19:37:31] [INFO ] Dead Transitions using invariants and state equation in 554 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 358/358 places, 862/862 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 358 transition count 838
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 34 place count 353 transition count 888
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 1 with 44 rules applied. Total rules applied 78 place count 353 transition count 844
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 353 transition count 838
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 90 place count 347 transition count 838
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 101 place count 347 transition count 827
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 112 place count 336 transition count 827
Applied a total of 112 rules in 89 ms. Remains 336 /358 variables (removed 22) and now considering 827/862 (removed 35) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 827 rows 336 cols
[2022-05-18 19:37:31] [INFO ] Computed 40 place invariants in 9 ms
[2022-05-18 19:37:31] [INFO ] [Real]Absence check using 14 positive place invariants in 126 ms returned sat
[2022-05-18 19:37:31] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 19 ms returned sat
[2022-05-18 19:37:31] [INFO ] After 342ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-18 19:37:31] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-18 19:37:31] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 19 ms returned sat
[2022-05-18 19:37:33] [INFO ] After 2128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-18 19:37:34] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 0 ms to minimize.
[2022-05-18 19:37:34] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 0 ms to minimize.
[2022-05-18 19:37:34] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 0 ms to minimize.
[2022-05-18 19:37:34] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 0 ms to minimize.
[2022-05-18 19:37:34] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2022-05-18 19:37:34] [INFO ] Deduced a trap composed of 119 places in 162 ms of which 0 ms to minimize.
[2022-05-18 19:37:35] [INFO ] Deduced a trap composed of 131 places in 173 ms of which 16 ms to minimize.
[2022-05-18 19:37:35] [INFO ] Deduced a trap composed of 113 places in 176 ms of which 0 ms to minimize.
[2022-05-18 19:37:35] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 0 ms to minimize.
[2022-05-18 19:37:35] [INFO ] Deduced a trap composed of 53 places in 157 ms of which 1 ms to minimize.
[2022-05-18 19:37:36] [INFO ] Deduced a trap composed of 134 places in 189 ms of which 7 ms to minimize.
[2022-05-18 19:37:36] [INFO ] Deduced a trap composed of 148 places in 174 ms of which 0 ms to minimize.
[2022-05-18 19:37:36] [INFO ] Deduced a trap composed of 131 places in 165 ms of which 0 ms to minimize.
[2022-05-18 19:37:36] [INFO ] Deduced a trap composed of 136 places in 181 ms of which 0 ms to minimize.
[2022-05-18 19:37:37] [INFO ] Deduced a trap composed of 165 places in 165 ms of which 1 ms to minimize.
[2022-05-18 19:37:37] [INFO ] Deduced a trap composed of 141 places in 161 ms of which 0 ms to minimize.
[2022-05-18 19:37:37] [INFO ] Deduced a trap composed of 60 places in 166 ms of which 1 ms to minimize.
[2022-05-18 19:37:37] [INFO ] Deduced a trap composed of 146 places in 178 ms of which 0 ms to minimize.
[2022-05-18 19:37:37] [INFO ] Deduced a trap composed of 138 places in 159 ms of which 0 ms to minimize.
[2022-05-18 19:37:38] [INFO ] Deduced a trap composed of 148 places in 172 ms of which 0 ms to minimize.
[2022-05-18 19:37:38] [INFO ] Deduced a trap composed of 132 places in 170 ms of which 0 ms to minimize.
[2022-05-18 19:37:38] [INFO ] Deduced a trap composed of 166 places in 175 ms of which 1 ms to minimize.
[2022-05-18 19:37:38] [INFO ] Deduced a trap composed of 141 places in 170 ms of which 1 ms to minimize.
[2022-05-18 19:37:38] [INFO ] Deduced a trap composed of 159 places in 167 ms of which 1 ms to minimize.
[2022-05-18 19:37:39] [INFO ] Deduced a trap composed of 138 places in 168 ms of which 1 ms to minimize.
[2022-05-18 19:37:39] [INFO ] Deduced a trap composed of 133 places in 181 ms of which 0 ms to minimize.
[2022-05-18 19:37:39] [INFO ] Deduced a trap composed of 136 places in 195 ms of which 1 ms to minimize.
[2022-05-18 19:37:39] [INFO ] Deduced a trap composed of 132 places in 157 ms of which 0 ms to minimize.
[2022-05-18 19:37:40] [INFO ] Deduced a trap composed of 66 places in 185 ms of which 0 ms to minimize.
[2022-05-18 19:37:40] [INFO ] Deduced a trap composed of 130 places in 168 ms of which 0 ms to minimize.
[2022-05-18 19:37:40] [INFO ] Deduced a trap composed of 126 places in 170 ms of which 0 ms to minimize.
[2022-05-18 19:37:40] [INFO ] Deduced a trap composed of 127 places in 196 ms of which 0 ms to minimize.
[2022-05-18 19:37:41] [INFO ] Deduced a trap composed of 65 places in 163 ms of which 0 ms to minimize.
[2022-05-18 19:37:41] [INFO ] Deduced a trap composed of 82 places in 184 ms of which 0 ms to minimize.
[2022-05-18 19:37:41] [INFO ] Deduced a trap composed of 141 places in 165 ms of which 0 ms to minimize.
[2022-05-18 19:37:41] [INFO ] Deduced a trap composed of 63 places in 189 ms of which 0 ms to minimize.
[2022-05-18 19:37:42] [INFO ] Deduced a trap composed of 67 places in 182 ms of which 0 ms to minimize.
[2022-05-18 19:37:42] [INFO ] Deduced a trap composed of 145 places in 177 ms of which 0 ms to minimize.
[2022-05-18 19:37:42] [INFO ] Deduced a trap composed of 128 places in 182 ms of which 0 ms to minimize.
[2022-05-18 19:37:42] [INFO ] Deduced a trap composed of 53 places in 174 ms of which 0 ms to minimize.
[2022-05-18 19:37:42] [INFO ] Deduced a trap composed of 73 places in 159 ms of which 1 ms to minimize.
[2022-05-18 19:37:43] [INFO ] Deduced a trap composed of 65 places in 186 ms of which 1 ms to minimize.
[2022-05-18 19:37:43] [INFO ] Deduced a trap composed of 128 places in 161 ms of which 1 ms to minimize.
[2022-05-18 19:37:43] [INFO ] Deduced a trap composed of 127 places in 185 ms of which 1 ms to minimize.
[2022-05-18 19:37:43] [INFO ] Deduced a trap composed of 131 places in 165 ms of which 0 ms to minimize.
[2022-05-18 19:37:44] [INFO ] Deduced a trap composed of 137 places in 178 ms of which 1 ms to minimize.
[2022-05-18 19:37:44] [INFO ] Deduced a trap composed of 53 places in 167 ms of which 0 ms to minimize.
[2022-05-18 19:37:44] [INFO ] Deduced a trap composed of 53 places in 221 ms of which 0 ms to minimize.
[2022-05-18 19:37:44] [INFO ] Deduced a trap composed of 140 places in 165 ms of which 0 ms to minimize.
[2022-05-18 19:37:45] [INFO ] Deduced a trap composed of 139 places in 179 ms of which 0 ms to minimize.
[2022-05-18 19:37:45] [INFO ] Deduced a trap composed of 115 places in 169 ms of which 0 ms to minimize.
[2022-05-18 19:37:45] [INFO ] Deduced a trap composed of 129 places in 170 ms of which 0 ms to minimize.
[2022-05-18 19:37:45] [INFO ] Deduced a trap composed of 53 places in 174 ms of which 0 ms to minimize.
[2022-05-18 19:37:45] [INFO ] Deduced a trap composed of 139 places in 176 ms of which 0 ms to minimize.
[2022-05-18 19:37:46] [INFO ] Deduced a trap composed of 131 places in 174 ms of which 1 ms to minimize.
[2022-05-18 19:37:46] [INFO ] Deduced a trap composed of 128 places in 178 ms of which 0 ms to minimize.
[2022-05-18 19:37:46] [INFO ] Deduced a trap composed of 137 places in 159 ms of which 0 ms to minimize.
[2022-05-18 19:37:46] [INFO ] Deduced a trap composed of 132 places in 162 ms of which 0 ms to minimize.
[2022-05-18 19:37:47] [INFO ] Deduced a trap composed of 129 places in 190 ms of which 0 ms to minimize.
[2022-05-18 19:37:47] [INFO ] Deduced a trap composed of 127 places in 163 ms of which 0 ms to minimize.
[2022-05-18 19:37:47] [INFO ] Deduced a trap composed of 134 places in 197 ms of which 0 ms to minimize.
[2022-05-18 19:37:47] [INFO ] Deduced a trap composed of 133 places in 170 ms of which 0 ms to minimize.
[2022-05-18 19:37:48] [INFO ] Deduced a trap composed of 124 places in 153 ms of which 0 ms to minimize.
[2022-05-18 19:37:48] [INFO ] Deduced a trap composed of 118 places in 194 ms of which 1 ms to minimize.
[2022-05-18 19:37:48] [INFO ] Deduced a trap composed of 135 places in 171 ms of which 0 ms to minimize.
[2022-05-18 19:37:48] [INFO ] Deduced a trap composed of 145 places in 170 ms of which 0 ms to minimize.
[2022-05-18 19:37:48] [INFO ] Deduced a trap composed of 163 places in 170 ms of which 0 ms to minimize.
[2022-05-18 19:37:49] [INFO ] Deduced a trap composed of 150 places in 196 ms of which 0 ms to minimize.
[2022-05-18 19:37:49] [INFO ] Deduced a trap composed of 117 places in 170 ms of which 1 ms to minimize.
[2022-05-18 19:37:49] [INFO ] Deduced a trap composed of 126 places in 175 ms of which 1 ms to minimize.
[2022-05-18 19:37:51] [INFO ] Deduced a trap composed of 139 places in 159 ms of which 0 ms to minimize.
[2022-05-18 19:37:51] [INFO ] Deduced a trap composed of 166 places in 170 ms of which 0 ms to minimize.
[2022-05-18 19:37:51] [INFO ] Deduced a trap composed of 129 places in 151 ms of which 0 ms to minimize.
[2022-05-18 19:37:52] [INFO ] Deduced a trap composed of 130 places in 191 ms of which 0 ms to minimize.
[2022-05-18 19:37:52] [INFO ] Deduced a trap composed of 63 places in 174 ms of which 0 ms to minimize.
[2022-05-18 19:37:52] [INFO ] Deduced a trap composed of 172 places in 178 ms of which 0 ms to minimize.
[2022-05-18 19:37:52] [INFO ] Deduced a trap composed of 151 places in 184 ms of which 1 ms to minimize.
[2022-05-18 19:37:52] [INFO ] Deduced a trap composed of 146 places in 180 ms of which 0 ms to minimize.
[2022-05-18 19:37:53] [INFO ] Deduced a trap composed of 71 places in 175 ms of which 0 ms to minimize.
[2022-05-18 19:37:53] [INFO ] Deduced a trap composed of 141 places in 182 ms of which 0 ms to minimize.
[2022-05-18 19:37:53] [INFO ] Deduced a trap composed of 66 places in 188 ms of which 0 ms to minimize.
[2022-05-18 19:37:53] [INFO ] Deduced a trap composed of 67 places in 177 ms of which 0 ms to minimize.
[2022-05-18 19:37:54] [INFO ] Deduced a trap composed of 130 places in 187 ms of which 1 ms to minimize.
[2022-05-18 19:37:54] [INFO ] Deduced a trap composed of 71 places in 170 ms of which 0 ms to minimize.
[2022-05-18 19:37:54] [INFO ] Deduced a trap composed of 66 places in 173 ms of which 0 ms to minimize.
[2022-05-18 19:37:54] [INFO ] Deduced a trap composed of 133 places in 196 ms of which 1 ms to minimize.
[2022-05-18 19:37:54] [INFO ] Deduced a trap composed of 147 places in 183 ms of which 1 ms to minimize.
[2022-05-18 19:37:55] [INFO ] Deduced a trap composed of 136 places in 168 ms of which 0 ms to minimize.
[2022-05-18 19:37:56] [INFO ] Deduced a trap composed of 153 places in 161 ms of which 0 ms to minimize.
[2022-05-18 19:37:56] [INFO ] Deduced a trap composed of 140 places in 159 ms of which 0 ms to minimize.
[2022-05-18 19:37:57] [INFO ] Deduced a trap composed of 155 places in 163 ms of which 1 ms to minimize.
[2022-05-18 19:37:57] [INFO ] Deduced a trap composed of 141 places in 191 ms of which 0 ms to minimize.
[2022-05-18 19:37:57] [INFO ] Deduced a trap composed of 134 places in 175 ms of which 1 ms to minimize.
[2022-05-18 19:37:57] [INFO ] Deduced a trap composed of 146 places in 194 ms of which 0 ms to minimize.
[2022-05-18 19:37:57] [INFO ] Deduced a trap composed of 149 places in 175 ms of which 1 ms to minimize.
[2022-05-18 19:37:58] [INFO ] Deduced a trap composed of 153 places in 169 ms of which 0 ms to minimize.
[2022-05-18 19:38:00] [INFO ] Deduced a trap composed of 142 places in 154 ms of which 0 ms to minimize.
[2022-05-18 19:38:03] [INFO ] Deduced a trap composed of 134 places in 158 ms of which 0 ms to minimize.
[2022-05-18 19:38:03] [INFO ] Deduced a trap composed of 121 places in 170 ms of which 1 ms to minimize.
[2022-05-18 19:38:03] [INFO ] Deduced a trap composed of 138 places in 176 ms of which 1 ms to minimize.
[2022-05-18 19:38:06] [INFO ] Deduced a trap composed of 144 places in 171 ms of which 0 ms to minimize.
[2022-05-18 19:38:11] [INFO ] Deduced a trap composed of 137 places in 158 ms of which 1 ms to minimize.
[2022-05-18 19:38:13] [INFO ] Deduced a trap composed of 138 places in 177 ms of which 1 ms to minimize.
[2022-05-18 19:38:13] [INFO ] Deduced a trap composed of 150 places in 165 ms of which 0 ms to minimize.
[2022-05-18 19:38:14] [INFO ] Deduced a trap composed of 175 places in 207 ms of which 0 ms to minimize.
[2022-05-18 19:38:14] [INFO ] Deduced a trap composed of 137 places in 171 ms of which 0 ms to minimize.
[2022-05-18 19:38:14] [INFO ] Deduced a trap composed of 131 places in 152 ms of which 0 ms to minimize.
[2022-05-18 19:38:14] [INFO ] Deduced a trap composed of 131 places in 172 ms of which 0 ms to minimize.
[2022-05-18 19:38:15] [INFO ] Deduced a trap composed of 125 places in 160 ms of which 1 ms to minimize.
[2022-05-18 19:38:18] [INFO ] Deduced a trap composed of 163 places in 160 ms of which 1 ms to minimize.
[2022-05-18 19:38:18] [INFO ] Deduced a trap composed of 142 places in 170 ms of which 0 ms to minimize.
[2022-05-18 19:38:19] [INFO ] Deduced a trap composed of 141 places in 177 ms of which 0 ms to minimize.
[2022-05-18 19:38:28] [INFO ] Trap strengthening (SAT) tested/added 112/112 trap constraints in 53938 ms
[2022-05-18 19:38:28] [INFO ] Deduced a trap composed of 148 places in 167 ms of which 0 ms to minimize.
[2022-05-18 19:38:28] [INFO ] Deduced a trap composed of 138 places in 186 ms of which 0 ms to minimize.
[2022-05-18 19:38:28] [INFO ] Deduced a trap composed of 136 places in 175 ms of which 0 ms to minimize.
[2022-05-18 19:38:29] [INFO ] Deduced a trap composed of 152 places in 176 ms of which 1 ms to minimize.
[2022-05-18 19:38:29] [INFO ] Deduced a trap composed of 166 places in 172 ms of which 1 ms to minimize.
[2022-05-18 19:38:29] [INFO ] Deduced a trap composed of 140 places in 170 ms of which 0 ms to minimize.
[2022-05-18 19:38:29] [INFO ] Deduced a trap composed of 138 places in 174 ms of which 0 ms to minimize.
[2022-05-18 19:38:29] [INFO ] Deduced a trap composed of 164 places in 170 ms of which 0 ms to minimize.
[2022-05-18 19:38:30] [INFO ] Deduced a trap composed of 149 places in 165 ms of which 0 ms to minimize.
[2022-05-18 19:38:30] [INFO ] Deduced a trap composed of 162 places in 169 ms of which 0 ms to minimize.
[2022-05-18 19:38:30] [INFO ] Deduced a trap composed of 158 places in 176 ms of which 1 ms to minimize.
[2022-05-18 19:38:31] [INFO ] Deduced a trap composed of 138 places in 156 ms of which 0 ms to minimize.
[2022-05-18 19:38:32] [INFO ] Deduced a trap composed of 148 places in 152 ms of which 1 ms to minimize.
[2022-05-18 19:38:33] [INFO ] Deduced a trap composed of 152 places in 146 ms of which 1 ms to minimize.
[2022-05-18 19:38:34] [INFO ] Deduced a trap composed of 138 places in 171 ms of which 1 ms to minimize.
[2022-05-18 19:38:34] [INFO ] Deduced a trap composed of 170 places in 164 ms of which 0 ms to minimize.
[2022-05-18 19:38:34] [INFO ] Deduced a trap composed of 157 places in 169 ms of which 1 ms to minimize.
[2022-05-18 19:38:34] [INFO ] Deduced a trap composed of 161 places in 161 ms of which 0 ms to minimize.
[2022-05-18 19:38:35] [INFO ] Deduced a trap composed of 141 places in 170 ms of which 1 ms to minimize.
[2022-05-18 19:38:35] [INFO ] Deduced a trap composed of 129 places in 168 ms of which 0 ms to minimize.
[2022-05-18 19:38:35] [INFO ] Deduced a trap composed of 151 places in 170 ms of which 0 ms to minimize.
[2022-05-18 19:38:35] [INFO ] Deduced a trap composed of 143 places in 163 ms of which 1 ms to minimize.
[2022-05-18 19:38:35] [INFO ] Deduced a trap composed of 149 places in 156 ms of which 0 ms to minimize.
[2022-05-18 19:38:36] [INFO ] Deduced a trap composed of 134 places in 166 ms of which 0 ms to minimize.
[2022-05-18 19:38:36] [INFO ] Deduced a trap composed of 130 places in 165 ms of which 1 ms to minimize.
[2022-05-18 19:38:36] [INFO ] Deduced a trap composed of 143 places in 163 ms of which 0 ms to minimize.
[2022-05-18 19:38:36] [INFO ] Deduced a trap composed of 163 places in 153 ms of which 1 ms to minimize.
[2022-05-18 19:38:37] [INFO ] Deduced a trap composed of 140 places in 143 ms of which 1 ms to minimize.
[2022-05-18 19:38:37] [INFO ] Deduced a trap composed of 161 places in 144 ms of which 0 ms to minimize.
[2022-05-18 19:38:37] [INFO ] Deduced a trap composed of 140 places in 154 ms of which 1 ms to minimize.
[2022-05-18 19:38:37] [INFO ] Deduced a trap composed of 155 places in 150 ms of which 0 ms to minimize.
[2022-05-18 19:38:38] [INFO ] Deduced a trap composed of 152 places in 144 ms of which 0 ms to minimize.
[2022-05-18 19:38:39] [INFO ] Deduced a trap composed of 127 places in 168 ms of which 0 ms to minimize.
[2022-05-18 19:38:48] [INFO ] Trap strengthening (SAT) tested/added 33/33 trap constraints in 20703 ms
[2022-05-18 19:38:49] [INFO ] After 77234ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-18 19:38:49] [INFO ] After 77345ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2022-05-18 19:38:49] [INFO ] Flatten gal took : 28 ms
[2022-05-18 19:38:49] [INFO ] Flatten gal took : 27 ms
[2022-05-18 19:38:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1112152685783502387.gal : 3 ms
[2022-05-18 19:38:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7511166256517434996.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms7528152579064610679;'/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/ReachabilityCardinality1112152685783502387.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7511166256517434996.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...319
Loading property file /tmp/ReachabilityCardinality7511166256517434996.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 27
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :27 after 182
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :182 after 449
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :449 after 797
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :797 after 1137
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1137 after 1702
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1702 after 2652
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2652 after 7972
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :7972 after 91056
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :91056 after 2.89346e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.9795e+06 after 2.98287e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.98287e+06 after 2.99689e+06
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2.99689e+06 after 3.31616e+06
Detected timeout of ITS tools.
[2022-05-18 19:39:04] [INFO ] Flatten gal took : 29 ms
[2022-05-18 19:39:04] [INFO ] Applying decomposition
[2022-05-18 19:39:04] [INFO ] Flatten gal took : 36 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/graph4094190159002938724.txt' '-o' '/tmp/graph4094190159002938724.bin' '-w' '/tmp/graph4094190159002938724.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4094190159002938724.bin' '-l' '-1' '-v' '-w' '/tmp/graph4094190159002938724.weights' '-q' '0' '-e' '0.001'
[2022-05-18 19:39:04] [INFO ] Decomposing Gal with order
[2022-05-18 19:39:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 19:39:04] [INFO ] Removed a total of 910 redundant transitions.
[2022-05-18 19:39:04] [INFO ] Flatten gal took : 74 ms
[2022-05-18 19:39:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 315 labels/synchronizations in 10 ms.
[2022-05-18 19:39:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14414238518610470947.gal : 4 ms
[2022-05-18 19:39:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2320666380191558312.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms7528152579064610679;'/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/ReachabilityCardinality14414238518610470947.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2320666380191558312.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/ReachabilityCardinality2320666380191558312.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1 after 392
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :392 after 768
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :768 after 768
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :768 after 3690
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3690 after 3757
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :3757 after 3829
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :3829 after 10922
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :10922 after 13863
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17513509477682855984
[2022-05-18 19:39:19] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17513509477682855984
Running compilation step : cd /tmp/ltsmin17513509477682855984;'/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 1423 ms.
Running link step : cd /tmp/ltsmin17513509477682855984;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin17513509477682855984;'/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' 'apf0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 182 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Product exploration explored 100000 steps with 15 reset in 367 ms.
Product exploration explored 100000 steps with 13 reset in 383 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Support contains 4 out of 370 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 370/370 places, 874/874 transitions.
Applied a total of 0 rules in 18 ms. Remains 370 /370 variables (removed 0) and now considering 874/874 (removed 0) transitions.
[2022-05-18 19:39:36] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
// Phase 1: matrix 850 rows 370 cols
[2022-05-18 19:39:36] [INFO ] Computed 40 place invariants in 16 ms
[2022-05-18 19:39:36] [INFO ] Dead Transitions using invariants and state equation in 610 ms found 0 transitions.
[2022-05-18 19:39:36] [INFO ] Redundant transitions in 13 ms returned []
[2022-05-18 19:39:36] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
// Phase 1: matrix 850 rows 370 cols
[2022-05-18 19:39:36] [INFO ] Computed 40 place invariants in 14 ms
[2022-05-18 19:39:37] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 370/370 places, 874/874 transitions.
Product exploration explored 100000 steps with 13 reset in 381 ms.
Product exploration explored 100000 steps with 13 reset in 397 ms.
Built C files in :
/tmp/ltsmin15084771927874833339
[2022-05-18 19:39:38] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15084771927874833339
Running compilation step : cd /tmp/ltsmin15084771927874833339;'/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 1538 ms.
Running link step : cd /tmp/ltsmin15084771927874833339;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin15084771927874833339;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15168414183127801137.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 874/874 transitions.
Applied a total of 0 rules in 6 ms. Remains 370 /370 variables (removed 0) and now considering 874/874 (removed 0) transitions.
[2022-05-18 19:39:53] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
// Phase 1: matrix 850 rows 370 cols
[2022-05-18 19:39:53] [INFO ] Computed 40 place invariants in 19 ms
[2022-05-18 19:39:53] [INFO ] Dead Transitions using invariants and state equation in 618 ms found 0 transitions.
[2022-05-18 19:39:53] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
// Phase 1: matrix 850 rows 370 cols
[2022-05-18 19:39:53] [INFO ] Computed 40 place invariants in 16 ms
[2022-05-18 19:39:54] [INFO ] Implicit Places using invariants in 398 ms returned []
[2022-05-18 19:39:54] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
// Phase 1: matrix 850 rows 370 cols
[2022-05-18 19:39:54] [INFO ] Computed 40 place invariants in 17 ms
[2022-05-18 19:39:54] [INFO ] State equation strengthened by 120 read => feed constraints.
[2022-05-18 19:39:57] [INFO ] Implicit Places using invariants and state equation in 3409 ms returned []
Implicit Place search using SMT with State Equation took 3807 ms to find 0 implicit places.
[2022-05-18 19:39:57] [INFO ] Flow matrix only has 850 transitions (discarded 24 similar events)
// Phase 1: matrix 850 rows 370 cols
[2022-05-18 19:39:57] [INFO ] Computed 40 place invariants in 10 ms
[2022-05-18 19:39:58] [INFO ] Dead Transitions using invariants and state equation in 596 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 370/370 places, 874/874 transitions.
Built C files in :
/tmp/ltsmin17187000932769715139
[2022-05-18 19:39:58] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17187000932769715139
Running compilation step : cd /tmp/ltsmin17187000932769715139;'/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 1637 ms.
Running link step : cd /tmp/ltsmin17187000932769715139;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17187000932769715139;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13623292194186685588.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-18 19:40:13] [INFO ] Flatten gal took : 32 ms
[2022-05-18 19:40:13] [INFO ] Flatten gal took : 31 ms
[2022-05-18 19:40:13] [INFO ] Time to serialize gal into /tmp/LTL13043971132344601776.gal : 4 ms
[2022-05-18 19:40:13] [INFO ] Time to serialize properties into /tmp/LTL16318789309699342625.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/LTL13043971132344601776.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16318789309699342625.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/LTL1304397...268
Read 1 LTL properties
Checking formula 0 : !((("((MarkerWrite>=1)&&(QueueJobB_4_2>=1))")U(G(X((!(G("((TryAllocateOneTaskB_2>=1)&&(IdleTasks_2>=1))")))||("((MarkerWrite>=1)&&(Que...177
Formula 0 simplified : !("((MarkerWrite>=1)&&(QueueJobB_4_2>=1))" U GX("((MarkerWrite>=1)&&(QueueJobB_4_2>=1))" | !G"((TryAllocateOneTaskB_2>=1)&&(IdleTask...166
Detected timeout of ITS tools.
[2022-05-18 19:40:28] [INFO ] Flatten gal took : 34 ms
[2022-05-18 19:40:28] [INFO ] Applying decomposition
[2022-05-18 19:40:28] [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/graph1796217482629448571.txt' '-o' '/tmp/graph1796217482629448571.bin' '-w' '/tmp/graph1796217482629448571.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1796217482629448571.bin' '-l' '-1' '-v' '-w' '/tmp/graph1796217482629448571.weights' '-q' '0' '-e' '0.001'
[2022-05-18 19:40:28] [INFO ] Decomposing Gal with order
[2022-05-18 19:40:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 19:40:28] [INFO ] Removed a total of 753 redundant transitions.
[2022-05-18 19:40:28] [INFO ] Flatten gal took : 64 ms
[2022-05-18 19:40:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 172 labels/synchronizations in 5 ms.
[2022-05-18 19:40:28] [INFO ] Time to serialize gal into /tmp/LTL5532940379988073643.gal : 6 ms
[2022-05-18 19:40:28] [INFO ] Time to serialize properties into /tmp/LTL16304303308621315078.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/LTL5532940379988073643.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16304303308621315078.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/LTL5532940...246
Read 1 LTL properties
Checking formula 0 : !((("((i5.u17.MarkerWrite>=1)&&(i5.u17.QueueJobB_4_2>=1))")U(G(X((!(G("((i5.u28.TryAllocateOneTaskB_2>=1)&&(i5.u28.IdleTasks_2>=1))"))...219
Formula 0 simplified : !("((i5.u17.MarkerWrite>=1)&&(i5.u17.QueueJobB_4_2>=1))" U GX("((i5.u17.MarkerWrite>=1)&&(i5.u17.QueueJobB_4_2>=1))" | !G"((i5.u28.T...208
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin755130025532246707
[2022-05-18 19:40:43] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin755130025532246707
Running compilation step : cd /tmp/ltsmin755130025532246707;'/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 1551 ms.
Running link step : cd /tmp/ltsmin755130025532246707;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin755130025532246707;'/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) U [](X(()||(LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PolyORBLF-PT-S04J04T06-LTLFireability-10 finished in 425393 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(p0))))'
[2022-05-18 19:40:58] [INFO ] Flatten gal took : 36 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15003368644206952281
[2022-05-18 19:40:58] [INFO ] Computing symmetric may disable matrix : 1048 transitions.
[2022-05-18 19:40:58] [INFO ] Applying decomposition
[2022-05-18 19:40:58] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 19:40:58] [INFO ] Computing symmetric may enable matrix : 1048 transitions.
[2022-05-18 19:40:58] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 19:40:59] [INFO ] Flatten gal took : 45 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/graph12980015361554081772.txt' '-o' '/tmp/graph12980015361554081772.bin' '-w' '/tmp/graph12980015361554081772.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12980015361554081772.bin' '-l' '-1' '-v' '-w' '/tmp/graph12980015361554081772.weights' '-q' '0' '-e' '0.001'
[2022-05-18 19:40:59] [INFO ] Computing Do-Not-Accords matrix : 1048 transitions.
[2022-05-18 19:40:59] [INFO ] Decomposing Gal with order
[2022-05-18 19:40:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 19:40:59] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 19:40:59] [INFO ] Built C files in 203ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15003368644206952281
Running compilation step : cd /tmp/ltsmin15003368644206952281;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' '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-18 19:40:59] [INFO ] Removed a total of 693 redundant transitions.
[2022-05-18 19:40:59] [INFO ] Flatten gal took : 67 ms
[2022-05-18 19:40:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 153 labels/synchronizations in 6 ms.
[2022-05-18 19:40:59] [INFO ] Time to serialize gal into /tmp/LTLFireability4354779115564739544.gal : 6 ms
[2022-05-18 19:40:59] [INFO ] Time to serialize properties into /tmp/LTLFireability17828888386710461266.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/LTLFireability4354779115564739544.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17828888386710461266.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 4 LTL properties
Checking formula 0 : !((F((F(G(X(X("((((i0.i0.u0.NotifyEventSourceAddedE_4>=1)||(i3.i1.u34.NotifyEventSourceAddedE_1>=1))||((i10.i0.u17.NotifyEventSourceAd...670
Formula 0 simplified : !F(FGXX"((((i0.i0.u0.NotifyEventSourceAddedE_4>=1)||(i3.i1.u34.NotifyEventSourceAddedE_1>=1))||((i10.i0.u17.NotifyEventSourceAddedE_...653
Compilation finished in 3202 ms.
Running link step : cd /tmp/ltsmin15003368644206952281;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin15003368644206952281;'/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(X((LTLAPp0==true)))))||[](<>((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( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.040: LTL layer: formula: <>((<>([](X(X((LTLAPp0==true)))))||[](<>((LTLAPp1==true)))))
pins2lts-mc-linux64( 6/ 8), 0.040: "<>((<>([](X(X((LTLAPp0==true)))))||[](<>((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.040: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.051: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.055: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.076: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.080: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.084: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.085: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.151: There are 1057 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.151: State length is 551, there are 1054 groups
pins2lts-mc-linux64( 0/ 8), 0.151: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.151: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.151: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.151: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.216: [Blue] ~118 levels ~960 states ~1968 transitions
pins2lts-mc-linux64( 6/ 8), 0.271: [Blue] ~237 levels ~1920 states ~4040 transitions
pins2lts-mc-linux64( 6/ 8), 0.369: [Blue] ~474 levels ~3840 states ~7584 transitions
pins2lts-mc-linux64( 7/ 8), 0.581: [Blue] ~943 levels ~7680 states ~14040 transitions
pins2lts-mc-linux64( 7/ 8), 0.908: [Blue] ~1850 levels ~15360 states ~27392 transitions
pins2lts-mc-linux64( 6/ 8), 1.498: [Blue] ~3728 levels ~30720 states ~65640 transitions
pins2lts-mc-linux64( 6/ 8), 2.558: [Blue] ~7166 levels ~61440 states ~129400 transitions
pins2lts-mc-linux64( 5/ 8), 4.486: [Blue] ~14405 levels ~122880 states ~219704 transitions
pins2lts-mc-linux64( 5/ 8), 8.000: [Blue] ~28577 levels ~245760 states ~443160 transitions
pins2lts-mc-linux64( 4/ 8), 20.448: [Blue] ~54941 levels ~491520 states ~923272 transitions
pins2lts-mc-linux64( 5/ 8), 33.599: [Blue] ~112684 levels ~983040 states ~1769328 transitions
pins2lts-mc-linux64( 5/ 8), 59.207: [Blue] ~221128 levels ~1966080 states ~3557912 transitions
pins2lts-mc-linux64( 5/ 8), 109.417: [Blue] ~437175 levels ~3932160 states ~7247872 transitions
pins2lts-mc-linux64( 5/ 8), 211.866: [Blue] ~858186 levels ~7864320 states ~14745592 transitions
pins2lts-mc-linux64( 5/ 8), 416.357: [Blue] ~1674070 levels ~15728640 states ~30038464 transitions
pins2lts-mc-linux64( 0/ 8), 450.108: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 450.165:
pins2lts-mc-linux64( 0/ 8), 450.165: Explored 16764231 states 35255454 transitions, fanout: 2.103
pins2lts-mc-linux64( 0/ 8), 450.165: Total exploration time 449.980 sec (449.940 sec minimum, 449.962 sec on average)
pins2lts-mc-linux64( 0/ 8), 450.165: States per second: 37256, Transitions per second: 78349
pins2lts-mc-linux64( 0/ 8), 450.166:
pins2lts-mc-linux64( 0/ 8), 450.166: State space has 26143664 states, 465198 are accepting
pins2lts-mc-linux64( 0/ 8), 450.166: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 450.166: blue states: 16764231 (64.12%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 450.166: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 450.166: all-red states: 465198 (1.78%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 450.166:
pins2lts-mc-linux64( 0/ 8), 450.166: Total memory used for local state coloring: 208.5MB
pins2lts-mc-linux64( 0/ 8), 450.166:
pins2lts-mc-linux64( 0/ 8), 450.166: Queue width: 8B, total height: 13666935, memory: 104.27MB
pins2lts-mc-linux64( 0/ 8), 450.166: Tree memory: 455.5MB, 18.3 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 450.166: Tree fill ratio (roots/leafs): 19.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 450.166: Stored 1081 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 450.166: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 450.166: Est. total memory use: 559.7MB (~1128.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15003368644206952281;'/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(X((LTLAPp0==true)))))||[](<>((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15003368644206952281;'/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(X((LTLAPp0==true)))))||[](<>((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-18 20:10:04] [INFO ] Flatten gal took : 2990 ms
[2022-05-18 20:10:04] [INFO ] Time to serialize gal into /tmp/LTLFireability17149453216150480892.gal : 94 ms
[2022-05-18 20:10:04] [INFO ] Time to serialize properties into /tmp/LTLFireability1690654296074565553.ltl : 11 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/LTLFireability17149453216150480892.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1690654296074565553.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/LTLFireabi...289
Read 4 LTL properties
Checking formula 0 : !((F((F(G(X(X("((((NotifyEventSourceAddedE_4>=1)||(NotifyEventSourceAddedE_1>=1))||((NotifyEventSourceAddedE_3>=1)||(NotifyEventSource...511
Formula 0 simplified : !F(FGXX"((((NotifyEventSourceAddedE_4>=1)||(NotifyEventSourceAddedE_1>=1))||((NotifyEventSourceAddedE_3>=1)||(NotifyEventSourceAdded...494
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="PolyORBLF-PT-S04J04T06"
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 PolyORBLF-PT-S04J04T06, 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 r168-tall-165277017000636"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J04T06.tgz
mv PolyORBLF-PT-S04J04T06 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 ;