About the Execution of 2023-gold for ShieldPPPt-PT-030A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11006.392 | 1829519.00 | 2999162.00 | 23398.60 | FFFFFFFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r373-tall-171683789200403.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldPPPt-PT-030A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789200403
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 15:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K Apr 11 15:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 15:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 11 15:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 201K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-030A-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-030A-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-030A-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-030A-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-030A-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-030A-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-030A-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-030A-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-030A-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-030A-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-030A-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-030A-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-030A-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-030A-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-030A-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-030A-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716985909245
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-030A
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 12:31:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 12:31:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 12:31:51] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2024-05-29 12:31:51] [INFO ] Transformed 753 places.
[2024-05-29 12:31:51] [INFO ] Transformed 543 transitions.
[2024-05-29 12:31:51] [INFO ] Found NUPN structural information;
[2024-05-29 12:31:51] [INFO ] Parsed PT model containing 753 places and 543 transitions and 2166 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-030A-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030A-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 72 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2024-05-29 12:31:51] [INFO ] Computed 331 invariants in 15 ms
[2024-05-29 12:31:52] [INFO ] Implicit Places using invariants in 806 ms returned []
[2024-05-29 12:31:52] [INFO ] Invariant cache hit.
[2024-05-29 12:31:53] [INFO ] Implicit Places using invariants and state equation in 789 ms returned []
Implicit Place search using SMT with State Equation took 1629 ms to find 0 implicit places.
[2024-05-29 12:31:53] [INFO ] Invariant cache hit.
[2024-05-29 12:31:53] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2108 ms. Remains : 753/753 places, 542/542 transitions.
Support contains 57 out of 753 places after structural reductions.
[2024-05-29 12:31:54] [INFO ] Flatten gal took : 107 ms
[2024-05-29 12:31:54] [INFO ] Flatten gal took : 51 ms
[2024-05-29 12:31:54] [INFO ] Input system was already deterministic with 542 transitions.
Support contains 52 out of 753 places (down from 57) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 557 ms. (steps per millisecond=17 ) properties (out of 28) seen :10
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2024-05-29 12:31:55] [INFO ] Invariant cache hit.
[2024-05-29 12:31:55] [INFO ] [Real]Absence check using 331 positive place invariants in 69 ms returned sat
[2024-05-29 12:31:55] [INFO ] After 592ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2024-05-29 12:31:56] [INFO ] [Nat]Absence check using 331 positive place invariants in 51 ms returned sat
[2024-05-29 12:31:57] [INFO ] After 1470ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2024-05-29 12:31:59] [INFO ] After 2725ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 911 ms.
[2024-05-29 12:32:00] [INFO ] After 4303ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 18 Parikh solutions to 15 different solutions.
Parikh walk visited 16 properties in 702 ms.
Support contains 2 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Partial Free-agglomeration rule applied 118 times.
Drop transitions removed 118 transitions
Iterating global reduction 0 with 118 rules applied. Total rules applied 122 place count 751 transition count 540
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 123 place count 750 transition count 539
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 124 place count 749 transition count 539
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 124 place count 749 transition count 537
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 128 place count 747 transition count 537
Applied a total of 128 rules in 210 ms. Remains 747 /753 variables (removed 6) and now considering 537/542 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 747/753 places, 537/542 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) 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 206054 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 206054 steps, saw 196506 distinct states, run finished after 3002 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 537 rows 747 cols
[2024-05-29 12:32:04] [INFO ] Computed 330 invariants in 10 ms
[2024-05-29 12:32:04] [INFO ] [Real]Absence check using 330 positive place invariants in 48 ms returned sat
[2024-05-29 12:32:04] [INFO ] After 269ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-29 12:32:04] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-29 12:32:04] [INFO ] After 80ms SMT Verify possible using 32 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 12:32:04] [INFO ] After 596ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 12:32:05] [INFO ] [Nat]Absence check using 330 positive place invariants in 62 ms returned sat
[2024-05-29 12:32:05] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 12:32:05] [INFO ] After 87ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 12:32:05] [INFO ] After 195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 74 ms.
[2024-05-29 12:32:05] [INFO ] After 785ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 747 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 537/537 transitions.
Applied a total of 0 rules in 42 ms. Remains 747 /747 variables (removed 0) and now considering 537/537 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 747/747 places, 537/537 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 747/747 places, 537/537 transitions.
Applied a total of 0 rules in 93 ms. Remains 747 /747 variables (removed 0) and now considering 537/537 (removed 0) transitions.
[2024-05-29 12:32:05] [INFO ] Invariant cache hit.
[2024-05-29 12:32:06] [INFO ] Implicit Places using invariants in 482 ms returned [730, 734]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 484 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 745/747 places, 537/537 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 743 transition count 535
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 743 transition count 535
Applied a total of 4 rules in 141 ms. Remains 743 /745 variables (removed 2) and now considering 535/537 (removed 2) transitions.
// Phase 1: matrix 535 rows 743 cols
[2024-05-29 12:32:06] [INFO ] Computed 328 invariants in 9 ms
[2024-05-29 12:32:06] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-05-29 12:32:06] [INFO ] Invariant cache hit.
[2024-05-29 12:32:07] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-29 12:32:07] [INFO ] Implicit Places using invariants and state equation in 1000 ms returned []
Implicit Place search using SMT with State Equation took 1430 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 743/747 places, 535/537 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2150 ms. Remains : 743/747 places, 535/537 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) 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 215574 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 215574 steps, saw 206897 distinct states, run finished after 3002 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-29 12:32:11] [INFO ] Invariant cache hit.
[2024-05-29 12:32:11] [INFO ] [Real]Absence check using 328 positive place invariants in 55 ms returned sat
[2024-05-29 12:32:11] [INFO ] After 262ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-29 12:32:11] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-29 12:32:11] [INFO ] After 67ms SMT Verify possible using 30 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 12:32:11] [INFO ] After 536ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 12:32:11] [INFO ] [Nat]Absence check using 328 positive place invariants in 53 ms returned sat
[2024-05-29 12:32:12] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 12:32:12] [INFO ] After 90ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 12:32:12] [INFO ] After 187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 79 ms.
[2024-05-29 12:32:12] [INFO ] After 723ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 743 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 743/743 places, 535/535 transitions.
Applied a total of 0 rules in 17 ms. Remains 743 /743 variables (removed 0) and now considering 535/535 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 743/743 places, 535/535 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 743/743 places, 535/535 transitions.
Applied a total of 0 rules in 47 ms. Remains 743 /743 variables (removed 0) and now considering 535/535 (removed 0) transitions.
[2024-05-29 12:32:12] [INFO ] Invariant cache hit.
[2024-05-29 12:32:12] [INFO ] Implicit Places using invariants in 415 ms returned []
[2024-05-29 12:32:12] [INFO ] Invariant cache hit.
[2024-05-29 12:32:13] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-29 12:32:13] [INFO ] Implicit Places using invariants and state equation in 1013 ms returned []
Implicit Place search using SMT with State Equation took 1432 ms to find 0 implicit places.
[2024-05-29 12:32:13] [INFO ] Redundant transitions in 34 ms returned []
[2024-05-29 12:32:13] [INFO ] Invariant cache hit.
[2024-05-29 12:32:14] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1858 ms. Remains : 743/743 places, 535/535 transitions.
Applied a total of 0 rules in 27 ms. Remains 743 /743 variables (removed 0) and now considering 535/535 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-29 12:32:14] [INFO ] Invariant cache hit.
[2024-05-29 12:32:14] [INFO ] [Real]Absence check using 328 positive place invariants in 56 ms returned sat
[2024-05-29 12:32:14] [INFO ] After 284ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-29 12:32:14] [INFO ] After 378ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 50 ms.
[2024-05-29 12:32:14] [INFO ] After 633ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
FORMULA ShieldPPPt-PT-030A-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&(F(p0) U p1)))))'
Support contains 2 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 9 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2024-05-29 12:32:15] [INFO ] Computed 331 invariants in 6 ms
[2024-05-29 12:32:15] [INFO ] Implicit Places using invariants in 462 ms returned []
[2024-05-29 12:32:15] [INFO ] Invariant cache hit.
[2024-05-29 12:32:16] [INFO ] Implicit Places using invariants and state equation in 827 ms returned []
Implicit Place search using SMT with State Equation took 1290 ms to find 0 implicit places.
[2024-05-29 12:32:16] [INFO ] Invariant cache hit.
[2024-05-29 12:32:17] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1679 ms. Remains : 753/753 places, 542/542 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 355 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s626 1), p1:(EQ s676 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 113 reset in 679 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 1 ms.
FORMULA ShieldPPPt-PT-030A-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030A-LTLFireability-00 finished in 2899 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X((p1||G(p0)))))))'
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 13 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2024-05-29 12:32:18] [INFO ] Invariant cache hit.
[2024-05-29 12:32:18] [INFO ] Implicit Places using invariants in 531 ms returned []
[2024-05-29 12:32:18] [INFO ] Invariant cache hit.
[2024-05-29 12:32:19] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 1294 ms to find 0 implicit places.
[2024-05-29 12:32:19] [INFO ] Invariant cache hit.
[2024-05-29 12:32:19] [INFO ] Dead Transitions using invariants and state equation in 429 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1741 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=4, aps=[p0:(AND (EQ s183 1) (EQ s200 1)), p1:(AND (EQ s506 1) (EQ 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-030A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030A-LTLFireability-01 finished in 1941 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&(X(F((p3&&F(!p3))))||p2))))'
Support contains 5 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 9 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2024-05-29 12:32:20] [INFO ] Invariant cache hit.
[2024-05-29 12:32:20] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-05-29 12:32:20] [INFO ] Invariant cache hit.
[2024-05-29 12:32:21] [INFO ] Implicit Places using invariants and state equation in 777 ms returned []
Implicit Place search using SMT with State Equation took 1251 ms to find 0 implicit places.
[2024-05-29 12:32:21] [INFO ] Invariant cache hit.
[2024-05-29 12:32:21] [INFO ] Dead Transitions using invariants and state equation in 415 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1679 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), true, p3]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 4}, { cond=p3, acceptance={} source=4 dest: 5}], [{ cond=p3, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s399 1), p0:(AND (EQ s563 1) (EQ s577 1)), p2:(OR (NEQ s42 1) (NEQ s44 1)), p3:(OR (NEQ s42 1) (NEQ s44 1))], nbAcceptance=0, 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-030A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030A-LTLFireability-03 finished in 1919 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&X(p0)))||F((G(F(p1))||(F(p1)&&p2)))))'
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Applied a total of 4 rules in 38 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
// Phase 1: matrix 540 rows 751 cols
[2024-05-29 12:32:22] [INFO ] Computed 331 invariants in 3 ms
[2024-05-29 12:32:22] [INFO ] Implicit Places using invariants in 516 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 527 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/753 places, 540/542 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 750 transition count 538
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 748 transition count 538
Applied a total of 4 rules in 29 ms. Remains 748 /750 variables (removed 2) and now considering 538/540 (removed 2) transitions.
// Phase 1: matrix 538 rows 748 cols
[2024-05-29 12:32:22] [INFO ] Computed 330 invariants in 8 ms
[2024-05-29 12:32:23] [INFO ] Implicit Places using invariants in 481 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 483 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 746/753 places, 538/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 744 transition count 536
Applied a total of 4 rules in 29 ms. Remains 744 /746 variables (removed 2) and now considering 536/538 (removed 2) transitions.
// Phase 1: matrix 536 rows 744 cols
[2024-05-29 12:32:23] [INFO ] Computed 328 invariants in 3 ms
[2024-05-29 12:32:23] [INFO ] Implicit Places using invariants in 565 ms returned []
[2024-05-29 12:32:23] [INFO ] Invariant cache hit.
[2024-05-29 12:32:24] [INFO ] Implicit Places using invariants and state equation in 743 ms returned []
Implicit Place search using SMT with State Equation took 1310 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 744/753 places, 536/542 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2418 ms. Remains : 744/753 places, 536/542 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s276 1), p2:(AND (EQ s680 1) (EQ s697 1)), p1:(EQ s151 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 621 ms.
Product exploration explored 100000 steps with 0 reset in 733 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 199 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-29 12:32:26] [INFO ] Invariant cache hit.
[2024-05-29 12:32:26] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 12:32:27] [INFO ] [Nat]Absence check using 328 positive place invariants in 56 ms returned sat
[2024-05-29 12:32:27] [INFO ] After 331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 12:32:27] [INFO ] After 503ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 115 ms.
[2024-05-29 12:32:27] [INFO ] After 894ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 46 ms.
Support contains 4 out of 744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 744/744 places, 536/536 transitions.
Partial Free-agglomeration rule applied 115 times.
Drop transitions removed 115 transitions
Iterating global reduction 0 with 115 rules applied. Total rules applied 115 place count 744 transition count 536
Applied a total of 115 rules in 31 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 744/744 places, 536/536 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Finished probabilistic random walk after 68350 steps, run visited all 4 properties in 1079 ms. (steps per millisecond=63 )
Probabilistic random walk after 68350 steps, saw 65482 distinct states, run finished after 1081 ms. (steps per millisecond=63 ) properties seen :4
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(F p2), (F (AND p0 (NOT p1) p2)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 15 factoid took 439 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 744 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 744/744 places, 536/536 transitions.
Applied a total of 0 rules in 23 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
[2024-05-29 12:32:30] [INFO ] Invariant cache hit.
[2024-05-29 12:32:30] [INFO ] Implicit Places using invariants in 474 ms returned []
[2024-05-29 12:32:30] [INFO ] Invariant cache hit.
[2024-05-29 12:32:31] [INFO ] Implicit Places using invariants and state equation in 806 ms returned []
Implicit Place search using SMT with State Equation took 1282 ms to find 0 implicit places.
[2024-05-29 12:32:31] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-29 12:32:31] [INFO ] Invariant cache hit.
[2024-05-29 12:32:31] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1739 ms. Remains : 744/744 places, 536/536 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 164 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-29 12:32:32] [INFO ] Invariant cache hit.
[2024-05-29 12:32:32] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 12:32:33] [INFO ] [Nat]Absence check using 328 positive place invariants in 53 ms returned sat
[2024-05-29 12:32:33] [INFO ] After 322ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 12:32:33] [INFO ] After 486ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 103 ms.
[2024-05-29 12:32:33] [INFO ] After 866ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 26 ms.
Support contains 4 out of 744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 744/744 places, 536/536 transitions.
Partial Free-agglomeration rule applied 115 times.
Drop transitions removed 115 transitions
Iterating global reduction 0 with 115 rules applied. Total rules applied 115 place count 744 transition count 536
Applied a total of 115 rules in 29 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 744/744 places, 536/536 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) 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 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Finished probabilistic random walk after 68350 steps, run visited all 4 properties in 720 ms. (steps per millisecond=94 )
Probabilistic random walk after 68350 steps, saw 65482 distinct states, run finished after 721 ms. (steps per millisecond=94 ) properties seen :4
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : [(F p2), (F (AND p0 (NOT p1) p2)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 15 factoid took 503 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 539 ms.
Product exploration explored 100000 steps with 0 reset in 729 ms.
Built C files in :
/tmp/ltsmin11551335183187661586
[2024-05-29 12:32:37] [INFO ] Computing symmetric may disable matrix : 536 transitions.
[2024-05-29 12:32:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:32:37] [INFO ] Computing symmetric may enable matrix : 536 transitions.
[2024-05-29 12:32:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:32:37] [INFO ] Computing Do-Not-Accords matrix : 536 transitions.
[2024-05-29 12:32:37] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:32:37] [INFO ] Built C files in 114ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11551335183187661586
Running compilation step : cd /tmp/ltsmin11551335183187661586;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1357 ms.
Running link step : cd /tmp/ltsmin11551335183187661586;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin11551335183187661586;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7459556957579732505.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 744 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 744/744 places, 536/536 transitions.
Applied a total of 0 rules in 16 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
[2024-05-29 12:32:52] [INFO ] Invariant cache hit.
[2024-05-29 12:32:52] [INFO ] Implicit Places using invariants in 736 ms returned []
[2024-05-29 12:32:53] [INFO ] Invariant cache hit.
[2024-05-29 12:32:53] [INFO ] Implicit Places using invariants and state equation in 780 ms returned []
Implicit Place search using SMT with State Equation took 1528 ms to find 0 implicit places.
[2024-05-29 12:32:53] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 12:32:53] [INFO ] Invariant cache hit.
[2024-05-29 12:32:54] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2067 ms. Remains : 744/744 places, 536/536 transitions.
Built C files in :
/tmp/ltsmin12940485410653170422
[2024-05-29 12:32:54] [INFO ] Computing symmetric may disable matrix : 536 transitions.
[2024-05-29 12:32:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:32:54] [INFO ] Computing symmetric may enable matrix : 536 transitions.
[2024-05-29 12:32:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:32:54] [INFO ] Computing Do-Not-Accords matrix : 536 transitions.
[2024-05-29 12:32:54] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:32:54] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12940485410653170422
Running compilation step : cd /tmp/ltsmin12940485410653170422;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1217 ms.
Running link step : cd /tmp/ltsmin12940485410653170422;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12940485410653170422;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4098386745751579191.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 12:33:09] [INFO ] Flatten gal took : 75 ms
[2024-05-29 12:33:09] [INFO ] Flatten gal took : 60 ms
[2024-05-29 12:33:09] [INFO ] Time to serialize gal into /tmp/LTL7468675402116322178.gal : 7 ms
[2024-05-29 12:33:09] [INFO ] Time to serialize properties into /tmp/LTL1620907014759405847.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7468675402116322178.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15120534783122394339.hoa' '-atoms' '/tmp/LTL1620907014759405847.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1620907014759405847.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15120534783122394339.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 12:33:24] [INFO ] Flatten gal took : 34 ms
[2024-05-29 12:33:24] [INFO ] Flatten gal took : 31 ms
[2024-05-29 12:33:25] [INFO ] Time to serialize gal into /tmp/LTL11201583679075716307.gal : 578 ms
[2024-05-29 12:33:25] [INFO ] Time to serialize properties into /tmp/LTL5930822992928458489.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11201583679075716307.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5930822992928458489.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G(("(p276==0)")&&(X("(p276==0)"))))||(F((G(F("(p151==1)")))||(("((p680==1)&&(p697==1))")&&(F("(p151==1)")))))))
Formula 0 simplified : F(!"(p276==0)" | X!"(p276==0)") & G(FG!"(p151==1)" & (!"((p680==1)&&(p697==1))" | G!"(p151==1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 12:33:40] [INFO ] Flatten gal took : 28 ms
[2024-05-29 12:33:40] [INFO ] Applying decomposition
[2024-05-29 12:33:40] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8181523794139778423.txt' '-o' '/tmp/graph8181523794139778423.bin' '-w' '/tmp/graph8181523794139778423.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8181523794139778423.bin' '-l' '-1' '-v' '-w' '/tmp/graph8181523794139778423.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:33:40] [INFO ] Decomposing Gal with order
[2024-05-29 12:33:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:33:40] [INFO ] Removed a total of 89 redundant transitions.
[2024-05-29 12:33:40] [INFO ] Flatten gal took : 85 ms
[2024-05-29 12:33:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 40 ms.
[2024-05-29 12:33:40] [INFO ] Time to serialize gal into /tmp/LTL1876695806192902086.gal : 15 ms
[2024-05-29 12:33:40] [INFO ] Time to serialize properties into /tmp/LTL7972757720346502166.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1876695806192902086.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7972757720346502166.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((G(("(i5.i0.i0.u88.p276==0)")&&(X("(i5.i0.i0.u88.p276==0)"))))||(F((G(F("(i2.i1.i0.u48.p151==1)")))||(("((i16.i1.i0.u218.p680==1)&&...218
Formula 0 simplified : F(!"(i5.i0.i0.u88.p276==0)" | X!"(i5.i0.i0.u88.p276==0)") & G(FG!"(i2.i1.i0.u48.p151==1)" & (!"((i16.i1.i0.u218.p680==1)&&(i16.i1.i0...202
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin365345768128785418
[2024-05-29 12:33:56] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin365345768128785418
Running compilation step : cd /tmp/ltsmin365345768128785418;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 889 ms.
Running link step : cd /tmp/ltsmin365345768128785418;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin365345768128785418;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](((LTLAPp0==true)&&X((LTLAPp0==true))))||<>(([](<>((LTLAPp1==true)))||(<>((LTLAPp1==true))&&(LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-030A-LTLFireability-04 finished in 109142 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||(G(p1) U p2)))))'
Support contains 8 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 12 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2024-05-29 12:34:11] [INFO ] Computed 331 invariants in 2 ms
[2024-05-29 12:34:11] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-05-29 12:34:11] [INFO ] Invariant cache hit.
[2024-05-29 12:34:12] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 1278 ms to find 0 implicit places.
[2024-05-29 12:34:12] [INFO ] Invariant cache hit.
[2024-05-29 12:34:12] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1667 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 428 ms :[(NOT p1), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(AND (EQ s195 1) (EQ s210 1)), p0:(AND (EQ s195 1) (EQ s210 1) (OR (EQ s690 0) (EQ s724 0) (EQ s657 0) (EQ s659 0))), p2:(AND (EQ s703 1) (EQ s726 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 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-030A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030A-LTLFireability-05 finished in 2139 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 11 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2024-05-29 12:34:13] [INFO ] Invariant cache hit.
[2024-05-29 12:34:13] [INFO ] Implicit Places using invariants in 501 ms returned []
[2024-05-29 12:34:13] [INFO ] Invariant cache hit.
[2024-05-29 12:34:14] [INFO ] Implicit Places using invariants and state equation in 827 ms returned []
Implicit Place search using SMT with State Equation took 1332 ms to find 0 implicit places.
[2024-05-29 12:34:14] [INFO ] Invariant cache hit.
[2024-05-29 12:34:14] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1729 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s111 1) (EQ s121 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPt-PT-030A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-030A-LTLFireability-06 finished in 1881 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p1)&&p0)) U X(p2))))'
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 16 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2024-05-29 12:34:15] [INFO ] Invariant cache hit.
[2024-05-29 12:34:15] [INFO ] Implicit Places using invariants in 593 ms returned []
[2024-05-29 12:34:15] [INFO ] Invariant cache hit.
[2024-05-29 12:34:16] [INFO ] Implicit Places using invariants and state equation in 789 ms returned []
Implicit Place search using SMT with State Equation took 1383 ms to find 0 implicit places.
[2024-05-29 12:34:16] [INFO ] Invariant cache hit.
[2024-05-29 12:34:16] [INFO ] Dead Transitions using invariants and state equation in 386 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1787 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 289 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s255 1) (EQ s272 1)), p1:(AND (EQ s242 1) (EQ s244 1)), p2:(AND (EQ s255 1) (EQ s272 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 585 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 1 ms.
FORMULA ShieldPPPt-PT-030A-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030A-LTLFireability-08 finished in 2691 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 6 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Applied a total of 4 rules in 28 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
// Phase 1: matrix 540 rows 751 cols
[2024-05-29 12:34:17] [INFO ] Computed 331 invariants in 7 ms
[2024-05-29 12:34:18] [INFO ] Implicit Places using invariants in 463 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 464 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/753 places, 540/542 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 750 transition count 538
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 748 transition count 538
Applied a total of 4 rules in 17 ms. Remains 748 /750 variables (removed 2) and now considering 538/540 (removed 2) transitions.
// Phase 1: matrix 538 rows 748 cols
[2024-05-29 12:34:18] [INFO ] Computed 330 invariants in 3 ms
[2024-05-29 12:34:18] [INFO ] Implicit Places using invariants in 453 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 455 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 746/753 places, 538/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 744 transition count 536
Applied a total of 4 rules in 22 ms. Remains 744 /746 variables (removed 2) and now considering 536/538 (removed 2) transitions.
// Phase 1: matrix 536 rows 744 cols
[2024-05-29 12:34:18] [INFO ] Computed 328 invariants in 5 ms
[2024-05-29 12:34:19] [INFO ] Implicit Places using invariants in 462 ms returned []
[2024-05-29 12:34:19] [INFO ] Invariant cache hit.
[2024-05-29 12:34:20] [INFO ] Implicit Places using invariants and state equation in 816 ms returned []
Implicit Place search using SMT with State Equation took 1280 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 744/753 places, 536/542 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2267 ms. Remains : 744/753 places, 536/542 transitions.
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (OR (EQ s357 0) (EQ s359 0)) (EQ s397 1)), p0:(AND (EQ s622 1) (EQ s290 1) (EQ s324 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 556 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 1 ms.
FORMULA ShieldPPPt-PT-030A-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030A-LTLFireability-09 finished in 2892 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Applied a total of 4 rules in 28 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
// Phase 1: matrix 540 rows 751 cols
[2024-05-29 12:34:20] [INFO ] Computed 331 invariants in 4 ms
[2024-05-29 12:34:21] [INFO ] Implicit Places using invariants in 428 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 434 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/753 places, 540/542 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 750 transition count 539
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 749 transition count 539
Applied a total of 2 rules in 20 ms. Remains 749 /750 variables (removed 1) and now considering 539/540 (removed 1) transitions.
// Phase 1: matrix 539 rows 749 cols
[2024-05-29 12:34:21] [INFO ] Computed 330 invariants in 4 ms
[2024-05-29 12:34:21] [INFO ] Implicit Places using invariants in 444 ms returned [736]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 452 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 748/753 places, 539/542 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 747 transition count 538
Applied a total of 2 rules in 22 ms. Remains 747 /748 variables (removed 1) and now considering 538/539 (removed 1) transitions.
// Phase 1: matrix 538 rows 747 cols
[2024-05-29 12:34:21] [INFO ] Computed 329 invariants in 3 ms
[2024-05-29 12:34:22] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-05-29 12:34:22] [INFO ] Invariant cache hit.
[2024-05-29 12:34:22] [INFO ] Implicit Places using invariants and state equation in 788 ms returned []
Implicit Place search using SMT with State Equation took 1241 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 747/753 places, 538/542 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2201 ms. Remains : 747/753 places, 538/542 transitions.
Stuttering acceptance computed with spot in 566 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s93 1) (EQ s100 1)), p0:(AND (EQ s732 1) (EQ s734 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 1766 reset in 589 ms.
Stack based approach found an accepted trace after 79 steps with 1 reset with depth 6 and stack size 6 in 2 ms.
FORMULA ShieldPPPt-PT-030A-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030A-LTLFireability-10 finished in 3382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U X(p1))||G(p2))))'
Support contains 6 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 9 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2024-05-29 12:34:24] [INFO ] Computed 331 invariants in 2 ms
[2024-05-29 12:34:24] [INFO ] Implicit Places using invariants in 458 ms returned []
[2024-05-29 12:34:24] [INFO ] Invariant cache hit.
[2024-05-29 12:34:25] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1314 ms to find 0 implicit places.
[2024-05-29 12:34:25] [INFO ] Invariant cache hit.
[2024-05-29 12:34:25] [INFO ] Dead Transitions using invariants and state equation in 385 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1709 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (EQ s58 0) (EQ s75 0) (EQ s707 0) (EQ s709 0)), p1:(AND (EQ s707 1) (EQ s709 1) (EQ s578 1) (EQ s601 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 9 reset in 588 ms.
Product exploration explored 100000 steps with 13 reset in 680 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :2
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
Running SMT prover for 2 properties.
[2024-05-29 12:34:27] [INFO ] Invariant cache hit.
[2024-05-29 12:34:28] [INFO ] [Real]Absence check using 331 positive place invariants in 57 ms returned sat
[2024-05-29 12:34:28] [INFO ] After 604ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 12:34:28] [INFO ] [Nat]Absence check using 331 positive place invariants in 57 ms returned sat
[2024-05-29 12:34:29] [INFO ] After 431ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 12:34:29] [INFO ] After 560ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 79 ms.
[2024-05-29 12:34:29] [INFO ] After 885ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 65 ms.
Support contains 6 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Partial Free-agglomeration rule applied 118 times.
Drop transitions removed 118 transitions
Iterating global reduction 0 with 118 rules applied. Total rules applied 122 place count 751 transition count 540
Applied a total of 122 rules in 37 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 751/753 places, 540/542 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) 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 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 221923 steps, run timeout after 3057 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 221923 steps, saw 213104 distinct states, run finished after 3057 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 540 rows 751 cols
[2024-05-29 12:34:32] [INFO ] Computed 331 invariants in 2 ms
[2024-05-29 12:34:32] [INFO ] [Real]Absence check using 331 positive place invariants in 54 ms returned sat
[2024-05-29 12:34:33] [INFO ] After 546ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 12:34:33] [INFO ] [Nat]Absence check using 331 positive place invariants in 54 ms returned sat
[2024-05-29 12:34:33] [INFO ] After 313ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 12:34:33] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-29 12:34:34] [INFO ] After 150ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 12:34:34] [INFO ] After 252ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 87 ms.
[2024-05-29 12:34:34] [INFO ] After 881ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 664 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=94 )
Parikh walk visited 2 properties in 30 ms.
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) p2))), (F (AND p1 p2))]
Knowledge based reduction with 5 factoid took 1011 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Support contains 6 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Applied a total of 4 rules in 33 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
// Phase 1: matrix 540 rows 751 cols
[2024-05-29 12:34:35] [INFO ] Computed 331 invariants in 5 ms
[2024-05-29 12:34:36] [INFO ] Implicit Places using invariants in 462 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 463 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/753 places, 540/542 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 750 transition count 538
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 748 transition count 538
Applied a total of 4 rules in 16 ms. Remains 748 /750 variables (removed 2) and now considering 538/540 (removed 2) transitions.
// Phase 1: matrix 538 rows 748 cols
[2024-05-29 12:34:36] [INFO ] Computed 330 invariants in 3 ms
[2024-05-29 12:34:36] [INFO ] Implicit Places using invariants in 467 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 470 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 746/753 places, 538/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 744 transition count 536
Applied a total of 4 rules in 22 ms. Remains 744 /746 variables (removed 2) and now considering 536/538 (removed 2) transitions.
// Phase 1: matrix 536 rows 744 cols
[2024-05-29 12:34:36] [INFO ] Computed 328 invariants in 3 ms
[2024-05-29 12:34:37] [INFO ] Implicit Places using invariants in 439 ms returned []
[2024-05-29 12:34:37] [INFO ] Invariant cache hit.
[2024-05-29 12:34:37] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1281 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 744/753 places, 536/542 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2287 ms. Remains : 744/753 places, 536/542 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 88 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 12:34:38] [INFO ] Invariant cache hit.
[2024-05-29 12:34:38] [INFO ] [Real]Absence check using 328 positive place invariants in 52 ms returned sat
[2024-05-29 12:34:39] [INFO ] After 572ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 12:34:39] [INFO ] [Nat]Absence check using 328 positive place invariants in 54 ms returned sat
[2024-05-29 12:34:39] [INFO ] After 446ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 12:34:40] [INFO ] After 668ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 162 ms.
[2024-05-29 12:34:40] [INFO ] After 1065ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 78 ms.
Support contains 6 out of 744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 744/744 places, 536/536 transitions.
Partial Free-agglomeration rule applied 116 times.
Drop transitions removed 116 transitions
Iterating global reduction 0 with 116 rules applied. Total rules applied 116 place count 744 transition count 536
Applied a total of 116 rules in 24 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 744/744 places, 536/536 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) 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
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 241426 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 241426 steps, saw 233313 distinct states, run finished after 3003 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 536 rows 744 cols
[2024-05-29 12:34:43] [INFO ] Computed 328 invariants in 6 ms
[2024-05-29 12:34:43] [INFO ] [Real]Absence check using 328 positive place invariants in 54 ms returned sat
[2024-05-29 12:34:44] [INFO ] After 577ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 12:34:44] [INFO ] [Nat]Absence check using 328 positive place invariants in 51 ms returned sat
[2024-05-29 12:34:44] [INFO ] After 434ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 12:34:44] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-29 12:34:44] [INFO ] After 180ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 12:34:45] [INFO ] After 430ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 95 ms.
[2024-05-29 12:34:45] [INFO ] After 1187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 55 ms.
Support contains 6 out of 744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 744/744 places, 536/536 transitions.
Applied a total of 0 rules in 13 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 744/744 places, 536/536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 744/744 places, 536/536 transitions.
Applied a total of 0 rules in 12 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
[2024-05-29 12:34:45] [INFO ] Invariant cache hit.
[2024-05-29 12:34:45] [INFO ] Implicit Places using invariants in 437 ms returned []
[2024-05-29 12:34:45] [INFO ] Invariant cache hit.
[2024-05-29 12:34:46] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-29 12:34:47] [INFO ] Implicit Places using invariants and state equation in 1347 ms returned []
Implicit Place search using SMT with State Equation took 1791 ms to find 0 implicit places.
[2024-05-29 12:34:47] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 12:34:47] [INFO ] Invariant cache hit.
[2024-05-29 12:34:47] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2226 ms. Remains : 744/744 places, 536/536 transitions.
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 0 with 29 rules applied. Total rules applied 29 place count 744 transition count 536
Drop transitions removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 744 transition count 507
Applied a total of 58 rules in 37 ms. Remains 744 /744 variables (removed 0) and now considering 507/536 (removed 29) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 507 rows 744 cols
[2024-05-29 12:34:47] [INFO ] Computed 328 invariants in 4 ms
[2024-05-29 12:34:47] [INFO ] [Real]Absence check using 328 positive place invariants in 52 ms returned sat
[2024-05-29 12:34:48] [INFO ] After 540ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 12:34:48] [INFO ] [Nat]Absence check using 328 positive place invariants in 55 ms returned sat
[2024-05-29 12:34:48] [INFO ] After 518ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 12:34:49] [INFO ] After 609ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 78 ms.
[2024-05-29 12:34:49] [INFO ] After 919ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (AND p1 p2))]
Knowledge based reduction with 9 factoid took 184 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1296 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Product exploration explored 100000 steps with 10 reset in 586 ms.
Product exploration explored 100000 steps with 16 reset in 735 ms.
Built C files in :
/tmp/ltsmin8264487808144165723
[2024-05-29 12:34:52] [INFO ] Computing symmetric may disable matrix : 536 transitions.
[2024-05-29 12:34:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:34:52] [INFO ] Computing symmetric may enable matrix : 536 transitions.
[2024-05-29 12:34:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:34:52] [INFO ] Computing Do-Not-Accords matrix : 536 transitions.
[2024-05-29 12:34:52] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:34:52] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8264487808144165723
Running compilation step : cd /tmp/ltsmin8264487808144165723;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1259 ms.
Running link step : cd /tmp/ltsmin8264487808144165723;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin8264487808144165723;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14277858715129536645.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 744 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 744/744 places, 536/536 transitions.
Applied a total of 0 rules in 24 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
// Phase 1: matrix 536 rows 744 cols
[2024-05-29 12:35:07] [INFO ] Computed 328 invariants in 5 ms
[2024-05-29 12:35:07] [INFO ] Implicit Places using invariants in 447 ms returned []
[2024-05-29 12:35:07] [INFO ] Invariant cache hit.
[2024-05-29 12:35:08] [INFO ] Implicit Places using invariants and state equation in 837 ms returned []
Implicit Place search using SMT with State Equation took 1301 ms to find 0 implicit places.
[2024-05-29 12:35:08] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 12:35:08] [INFO ] Invariant cache hit.
[2024-05-29 12:35:09] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1740 ms. Remains : 744/744 places, 536/536 transitions.
Built C files in :
/tmp/ltsmin2809463030170423111
[2024-05-29 12:35:09] [INFO ] Computing symmetric may disable matrix : 536 transitions.
[2024-05-29 12:35:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:35:09] [INFO ] Computing symmetric may enable matrix : 536 transitions.
[2024-05-29 12:35:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:35:09] [INFO ] Computing Do-Not-Accords matrix : 536 transitions.
[2024-05-29 12:35:09] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:35:09] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2809463030170423111
Running compilation step : cd /tmp/ltsmin2809463030170423111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1255 ms.
Running link step : cd /tmp/ltsmin2809463030170423111;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin2809463030170423111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4410927669277729053.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 12:35:24] [INFO ] Flatten gal took : 23 ms
[2024-05-29 12:35:24] [INFO ] Flatten gal took : 23 ms
[2024-05-29 12:35:24] [INFO ] Time to serialize gal into /tmp/LTL17700802924055934661.gal : 4 ms
[2024-05-29 12:35:24] [INFO ] Time to serialize properties into /tmp/LTL16283859382932682139.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17700802924055934661.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12742757127821686166.hoa' '-atoms' '/tmp/LTL16283859382932682139.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16283859382932682139.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12742757127821686166.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 12:35:39] [INFO ] Flatten gal took : 23 ms
[2024-05-29 12:35:39] [INFO ] Flatten gal took : 23 ms
[2024-05-29 12:35:39] [INFO ] Time to serialize gal into /tmp/LTL6959450392765265787.gal : 4 ms
[2024-05-29 12:35:39] [INFO ] Time to serialize properties into /tmp/LTL7745316859512115340.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6959450392765265787.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7745316859512115340.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((("((p58==1)&&(p75==1))")U(X("(((p707==1)&&(p709==1))&&((p578==1)&&(p601==1)))")))||(G("(((p58==0)||(p75==0))||((p707==0)||(p709=...166
Formula 0 simplified : G((!"((p58==1)&&(p75==1))" R X!"(((p707==1)&&(p709==1))&&((p578==1)&&(p601==1)))") & F!"(((p58==0)||(p75==0))||((p707==0)||(p709==0)...159
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 12:35:54] [INFO ] Flatten gal took : 22 ms
[2024-05-29 12:35:54] [INFO ] Applying decomposition
[2024-05-29 12:35:54] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8327160468465971416.txt' '-o' '/tmp/graph8327160468465971416.bin' '-w' '/tmp/graph8327160468465971416.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8327160468465971416.bin' '-l' '-1' '-v' '-w' '/tmp/graph8327160468465971416.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:35:54] [INFO ] Decomposing Gal with order
[2024-05-29 12:35:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:35:54] [INFO ] Removed a total of 89 redundant transitions.
[2024-05-29 12:35:54] [INFO ] Flatten gal took : 34 ms
[2024-05-29 12:35:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 16 ms.
[2024-05-29 12:35:54] [INFO ] Time to serialize gal into /tmp/LTL3942632907952920132.gal : 9 ms
[2024-05-29 12:35:54] [INFO ] Time to serialize properties into /tmp/LTL535779779460656899.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3942632907952920132.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL535779779460656899.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((F((("((i1.i1.i2.u18.p58==1)&&(i0.i1.i3.u23.p75==1))")U(X("(((i17.i2.i0.u226.p707==1)&&(i17.i2.i0.u226.p709==1))&&((i13.i1.i0.u185.p...308
Formula 0 simplified : G((!"((i1.i1.i2.u18.p58==1)&&(i0.i1.i3.u23.p75==1))" R X!"(((i17.i2.i0.u226.p707==1)&&(i17.i2.i0.u226.p709==1))&&((i13.i1.i0.u185.p5...301
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2887251503800895795
[2024-05-29 12:36:09] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2887251503800895795
Running compilation step : cd /tmp/ltsmin2887251503800895795;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 873 ms.
Running link step : cd /tmp/ltsmin2887251503800895795;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin2887251503800895795;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((((LTLAPp0==true) U X((LTLAPp1==true)))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-030A-LTLFireability-11 finished in 120671 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 753 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Applied a total of 0 rules in 12 ms. Remains 753 /753 variables (removed 0) and now considering 542/542 (removed 0) transitions.
// Phase 1: matrix 542 rows 753 cols
[2024-05-29 12:36:24] [INFO ] Computed 331 invariants in 2 ms
[2024-05-29 12:36:25] [INFO ] Implicit Places using invariants in 474 ms returned []
[2024-05-29 12:36:25] [INFO ] Invariant cache hit.
[2024-05-29 12:36:26] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 1265 ms to find 0 implicit places.
[2024-05-29 12:36:26] [INFO ] Invariant cache hit.
[2024-05-29 12:36:26] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1655 ms. Remains : 753/753 places, 542/542 transitions.
Stuttering acceptance computed with spot in 982 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s751 1) (EQ s440 1) (EQ s474 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4 reset in 594 ms.
Stack based approach found an accepted trace after 439 steps with 0 reset with depth 440 and stack size 440 in 3 ms.
FORMULA ShieldPPPt-PT-030A-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030A-LTLFireability-13 finished in 3262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Applied a total of 4 rules in 28 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
// Phase 1: matrix 540 rows 751 cols
[2024-05-29 12:36:28] [INFO ] Computed 331 invariants in 4 ms
[2024-05-29 12:36:28] [INFO ] Implicit Places using invariants in 488 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 489 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/753 places, 540/542 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 750 transition count 538
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 748 transition count 538
Applied a total of 4 rules in 18 ms. Remains 748 /750 variables (removed 2) and now considering 538/540 (removed 2) transitions.
// Phase 1: matrix 538 rows 748 cols
[2024-05-29 12:36:28] [INFO ] Computed 330 invariants in 3 ms
[2024-05-29 12:36:29] [INFO ] Implicit Places using invariants in 457 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 459 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 746/753 places, 538/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 744 transition count 536
Applied a total of 4 rules in 30 ms. Remains 744 /746 variables (removed 2) and now considering 536/538 (removed 2) transitions.
// Phase 1: matrix 536 rows 744 cols
[2024-05-29 12:36:29] [INFO ] Computed 328 invariants in 4 ms
[2024-05-29 12:36:29] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-05-29 12:36:29] [INFO ] Invariant cache hit.
[2024-05-29 12:36:30] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1288 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 744/753 places, 536/542 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2315 ms. Remains : 744/753 places, 536/542 transitions.
Stuttering acceptance computed with spot in 1828 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s311 1) (EQ s321 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 619 ms.
Stack based approach found an accepted trace after 129 steps with 0 reset with depth 130 and stack size 130 in 1 ms.
FORMULA ShieldPPPt-PT-030A-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-030A-LTLFireability-15 finished in 4781 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&X(p0)))||F((G(F(p1))||(F(p1)&&p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U X(p1))||G(p2))))'
Found a Shortening insensitive property : ShieldPPPt-PT-030A-LTLFireability-11
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 6 out of 753 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 753/753 places, 542/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 751 transition count 540
Applied a total of 4 rules in 23 ms. Remains 751 /753 variables (removed 2) and now considering 540/542 (removed 2) transitions.
// Phase 1: matrix 540 rows 751 cols
[2024-05-29 12:36:33] [INFO ] Computed 331 invariants in 3 ms
[2024-05-29 12:36:33] [INFO ] Implicit Places using invariants in 465 ms returned [744]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 466 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 750/753 places, 540/542 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 750 transition count 538
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 748 transition count 538
Applied a total of 4 rules in 14 ms. Remains 748 /750 variables (removed 2) and now considering 538/540 (removed 2) transitions.
// Phase 1: matrix 538 rows 748 cols
[2024-05-29 12:36:33] [INFO ] Computed 330 invariants in 2 ms
[2024-05-29 12:36:34] [INFO ] Implicit Places using invariants in 467 ms returned [731, 735]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 468 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 746/753 places, 538/542 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 744 transition count 536
Applied a total of 4 rules in 35 ms. Remains 744 /746 variables (removed 2) and now considering 536/538 (removed 2) transitions.
// Phase 1: matrix 536 rows 744 cols
[2024-05-29 12:36:34] [INFO ] Computed 328 invariants in 1 ms
[2024-05-29 12:36:34] [INFO ] Implicit Places using invariants in 452 ms returned []
[2024-05-29 12:36:34] [INFO ] Invariant cache hit.
[2024-05-29 12:36:35] [INFO ] Implicit Places using invariants and state equation in 844 ms returned []
Implicit Place search using SMT with State Equation took 1297 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 744/753 places, 536/542 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 2303 ms. Remains : 744/753 places, 536/542 transitions.
Running random walk in product with property : ShieldPPPt-PT-030A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (EQ s58 0) (EQ s75 0) (EQ s707 0) (EQ s709 0)), p1:(AND (EQ s707 1) (EQ s709 1) (EQ s578 1) (EQ s601 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 15 reset in 622 ms.
Product exploration explored 100000 steps with 23 reset in 737 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 12:36:37] [INFO ] Invariant cache hit.
[2024-05-29 12:36:37] [INFO ] [Real]Absence check using 328 positive place invariants in 50 ms returned sat
[2024-05-29 12:36:37] [INFO ] After 572ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 12:36:38] [INFO ] [Nat]Absence check using 328 positive place invariants in 50 ms returned sat
[2024-05-29 12:36:38] [INFO ] After 440ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 12:36:38] [INFO ] After 654ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 154 ms.
[2024-05-29 12:36:38] [INFO ] After 1007ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 144 ms.
Support contains 6 out of 744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 744/744 places, 536/536 transitions.
Partial Free-agglomeration rule applied 116 times.
Drop transitions removed 116 transitions
Iterating global reduction 0 with 116 rules applied. Total rules applied 116 place count 744 transition count 536
Applied a total of 116 rules in 43 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 744/744 places, 536/536 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 173794 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 173794 steps, saw 167228 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 536 rows 744 cols
[2024-05-29 12:36:42] [INFO ] Computed 328 invariants in 7 ms
[2024-05-29 12:36:42] [INFO ] [Real]Absence check using 328 positive place invariants in 54 ms returned sat
[2024-05-29 12:36:43] [INFO ] After 555ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 12:36:43] [INFO ] [Nat]Absence check using 328 positive place invariants in 50 ms returned sat
[2024-05-29 12:36:43] [INFO ] After 450ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 12:36:43] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-29 12:36:44] [INFO ] After 191ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 12:36:44] [INFO ] After 463ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 99 ms.
[2024-05-29 12:36:44] [INFO ] After 1348ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 73 ms.
Support contains 6 out of 744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 744/744 places, 536/536 transitions.
Applied a total of 0 rules in 16 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 744/744 places, 536/536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 744/744 places, 536/536 transitions.
Applied a total of 0 rules in 15 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
[2024-05-29 12:36:44] [INFO ] Invariant cache hit.
[2024-05-29 12:36:44] [INFO ] Implicit Places using invariants in 484 ms returned []
[2024-05-29 12:36:44] [INFO ] Invariant cache hit.
[2024-05-29 12:36:45] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-29 12:36:46] [INFO ] Implicit Places using invariants and state equation in 1261 ms returned []
Implicit Place search using SMT with State Equation took 1770 ms to find 0 implicit places.
[2024-05-29 12:36:46] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 12:36:46] [INFO ] Invariant cache hit.
[2024-05-29 12:36:46] [INFO ] Dead Transitions using invariants and state equation in 411 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2211 ms. Remains : 744/744 places, 536/536 transitions.
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 0 with 29 rules applied. Total rules applied 29 place count 744 transition count 536
Drop transitions removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 744 transition count 507
Applied a total of 58 rules in 55 ms. Remains 744 /744 variables (removed 0) and now considering 507/536 (removed 29) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 507 rows 744 cols
[2024-05-29 12:36:46] [INFO ] Computed 328 invariants in 5 ms
[2024-05-29 12:36:46] [INFO ] [Real]Absence check using 328 positive place invariants in 52 ms returned sat
[2024-05-29 12:36:47] [INFO ] After 573ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 12:36:47] [INFO ] [Nat]Absence check using 328 positive place invariants in 53 ms returned sat
[2024-05-29 12:36:48] [INFO ] After 544ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 12:36:48] [INFO ] After 653ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 77 ms.
[2024-05-29 12:36:48] [INFO ] After 962ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p2 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (AND p1 p2))]
Knowledge based reduction with 5 factoid took 147 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Support contains 6 out of 744 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 744/744 places, 536/536 transitions.
Applied a total of 0 rules in 13 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
// Phase 1: matrix 536 rows 744 cols
[2024-05-29 12:36:48] [INFO ] Computed 328 invariants in 6 ms
[2024-05-29 12:36:49] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-05-29 12:36:49] [INFO ] Invariant cache hit.
[2024-05-29 12:36:50] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 1288 ms to find 0 implicit places.
[2024-05-29 12:36:50] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 12:36:50] [INFO ] Invariant cache hit.
[2024-05-29 12:36:50] [INFO ] Dead Transitions using invariants and state equation in 419 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1732 ms. Remains : 744/744 places, 536/536 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 109 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 4) 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 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 12:36:51] [INFO ] Invariant cache hit.
[2024-05-29 12:36:51] [INFO ] [Real]Absence check using 328 positive place invariants in 57 ms returned sat
[2024-05-29 12:36:51] [INFO ] After 576ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 12:36:51] [INFO ] [Nat]Absence check using 328 positive place invariants in 54 ms returned sat
[2024-05-29 12:36:52] [INFO ] After 438ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 12:36:52] [INFO ] After 651ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 156 ms.
[2024-05-29 12:36:52] [INFO ] After 1045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 75 ms.
Support contains 6 out of 744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 744/744 places, 536/536 transitions.
Partial Free-agglomeration rule applied 116 times.
Drop transitions removed 116 transitions
Iterating global reduction 0 with 116 rules applied. Total rules applied 116 place count 744 transition count 536
Applied a total of 116 rules in 23 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 744/744 places, 536/536 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) 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
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 197797 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 197797 steps, saw 190633 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 536 rows 744 cols
[2024-05-29 12:36:56] [INFO ] Computed 328 invariants in 2 ms
[2024-05-29 12:36:56] [INFO ] [Real]Absence check using 328 positive place invariants in 54 ms returned sat
[2024-05-29 12:36:56] [INFO ] After 578ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 12:36:56] [INFO ] [Nat]Absence check using 328 positive place invariants in 57 ms returned sat
[2024-05-29 12:36:57] [INFO ] After 469ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 12:36:57] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-29 12:36:57] [INFO ] After 190ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 12:36:57] [INFO ] After 457ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 94 ms.
[2024-05-29 12:36:57] [INFO ] After 1252ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 61 ms.
Support contains 6 out of 744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 744/744 places, 536/536 transitions.
Applied a total of 0 rules in 21 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 744/744 places, 536/536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 744/744 places, 536/536 transitions.
Applied a total of 0 rules in 10 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
[2024-05-29 12:36:58] [INFO ] Invariant cache hit.
[2024-05-29 12:36:58] [INFO ] Implicit Places using invariants in 480 ms returned []
[2024-05-29 12:36:58] [INFO ] Invariant cache hit.
[2024-05-29 12:36:58] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-29 12:36:59] [INFO ] Implicit Places using invariants and state equation in 1333 ms returned []
Implicit Place search using SMT with State Equation took 1817 ms to find 0 implicit places.
[2024-05-29 12:36:59] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-29 12:36:59] [INFO ] Invariant cache hit.
[2024-05-29 12:37:00] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2248 ms. Remains : 744/744 places, 536/536 transitions.
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 0 with 29 rules applied. Total rules applied 29 place count 744 transition count 536
Drop transitions removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 744 transition count 507
Applied a total of 58 rules in 32 ms. Remains 744 /744 variables (removed 0) and now considering 507/536 (removed 29) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 507 rows 744 cols
[2024-05-29 12:37:00] [INFO ] Computed 328 invariants in 3 ms
[2024-05-29 12:37:00] [INFO ] [Real]Absence check using 328 positive place invariants in 57 ms returned sat
[2024-05-29 12:37:00] [INFO ] After 577ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 12:37:01] [INFO ] [Nat]Absence check using 328 positive place invariants in 64 ms returned sat
[2024-05-29 12:37:01] [INFO ] After 540ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 12:37:01] [INFO ] After 660ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 84 ms.
[2024-05-29 12:37:01] [INFO ] After 1001ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (AND p1 p2))]
Knowledge based reduction with 9 factoid took 176 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Product exploration explored 100000 steps with 17 reset in 616 ms.
Product exploration explored 100000 steps with 24 reset in 743 ms.
Built C files in :
/tmp/ltsmin11742726799567831988
[2024-05-29 12:37:03] [INFO ] Computing symmetric may disable matrix : 536 transitions.
[2024-05-29 12:37:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:37:03] [INFO ] Computing symmetric may enable matrix : 536 transitions.
[2024-05-29 12:37:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:37:03] [INFO ] Computing Do-Not-Accords matrix : 536 transitions.
[2024-05-29 12:37:03] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:37:03] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11742726799567831988
Running compilation step : cd /tmp/ltsmin11742726799567831988;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2291 ms.
Running link step : cd /tmp/ltsmin11742726799567831988;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin11742726799567831988;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9507758264048896306.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 744 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 744/744 places, 536/536 transitions.
Applied a total of 0 rules in 19 ms. Remains 744 /744 variables (removed 0) and now considering 536/536 (removed 0) transitions.
// Phase 1: matrix 536 rows 744 cols
[2024-05-29 12:37:19] [INFO ] Computed 328 invariants in 8 ms
[2024-05-29 12:37:19] [INFO ] Implicit Places using invariants in 464 ms returned []
[2024-05-29 12:37:19] [INFO ] Invariant cache hit.
[2024-05-29 12:37:20] [INFO ] Implicit Places using invariants and state equation in 818 ms returned []
Implicit Place search using SMT with State Equation took 1284 ms to find 0 implicit places.
[2024-05-29 12:37:20] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-29 12:37:20] [INFO ] Invariant cache hit.
[2024-05-29 12:37:20] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1727 ms. Remains : 744/744 places, 536/536 transitions.
Built C files in :
/tmp/ltsmin8293987457901890005
[2024-05-29 12:37:20] [INFO ] Computing symmetric may disable matrix : 536 transitions.
[2024-05-29 12:37:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:37:20] [INFO ] Computing symmetric may enable matrix : 536 transitions.
[2024-05-29 12:37:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:37:20] [INFO ] Computing Do-Not-Accords matrix : 536 transitions.
[2024-05-29 12:37:20] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:37:20] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8293987457901890005
Running compilation step : cd /tmp/ltsmin8293987457901890005;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2253 ms.
Running link step : cd /tmp/ltsmin8293987457901890005;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin8293987457901890005;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17342860784103749666.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 12:37:35] [INFO ] Flatten gal took : 21 ms
[2024-05-29 12:37:35] [INFO ] Flatten gal took : 24 ms
[2024-05-29 12:37:35] [INFO ] Time to serialize gal into /tmp/LTL11657660878872573951.gal : 3 ms
[2024-05-29 12:37:35] [INFO ] Time to serialize properties into /tmp/LTL13501850597459951308.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11657660878872573951.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2380992874738667391.hoa' '-atoms' '/tmp/LTL13501850597459951308.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13501850597459951308.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2380992874738667391.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 12:37:50] [INFO ] Flatten gal took : 46 ms
[2024-05-29 12:37:51] [INFO ] Flatten gal took : 20 ms
[2024-05-29 12:37:51] [INFO ] Time to serialize gal into /tmp/LTL2659103217588601863.gal : 3 ms
[2024-05-29 12:37:51] [INFO ] Time to serialize properties into /tmp/LTL5054274130825871457.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2659103217588601863.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5054274130825871457.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((("((p58==1)&&(p75==1))")U(X("(((p707==1)&&(p709==1))&&((p578==1)&&(p601==1)))")))||(G("(((p58==0)||(p75==0))||((p707==0)||(p709=...166
Formula 0 simplified : G((!"((p58==1)&&(p75==1))" R X!"(((p707==1)&&(p709==1))&&((p578==1)&&(p601==1)))") & F!"(((p58==0)||(p75==0))||((p707==0)||(p709==0)...159
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 12:38:06] [INFO ] Flatten gal took : 20 ms
[2024-05-29 12:38:06] [INFO ] Applying decomposition
[2024-05-29 12:38:06] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8938068512110043863.txt' '-o' '/tmp/graph8938068512110043863.bin' '-w' '/tmp/graph8938068512110043863.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8938068512110043863.bin' '-l' '-1' '-v' '-w' '/tmp/graph8938068512110043863.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:38:06] [INFO ] Decomposing Gal with order
[2024-05-29 12:38:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:38:06] [INFO ] Removed a total of 89 redundant transitions.
[2024-05-29 12:38:06] [INFO ] Flatten gal took : 43 ms
[2024-05-29 12:38:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 21 ms.
[2024-05-29 12:38:06] [INFO ] Time to serialize gal into /tmp/LTL11743533081196551049.gal : 314 ms
[2024-05-29 12:38:06] [INFO ] Time to serialize properties into /tmp/LTL11625255640916096546.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11743533081196551049.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11625255640916096546.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((("((i1.i1.i2.u18.p58==1)&&(i1.i1.i3.u23.p75==1))")U(X("(((i22.i0.i1.u226.p707==1)&&(i22.i0.i1.u226.p709==1))&&((i18.i0.i0.u185.p...308
Formula 0 simplified : G((!"((i1.i1.i2.u18.p58==1)&&(i1.i1.i3.u23.p75==1))" R X!"(((i22.i0.i1.u226.p707==1)&&(i22.i0.i1.u226.p709==1))&&((i18.i0.i0.u185.p5...301
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17749635458766128530
[2024-05-29 12:38:21] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17749635458766128530
Running compilation step : cd /tmp/ltsmin17749635458766128530;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 910 ms.
Running link step : cd /tmp/ltsmin17749635458766128530;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin17749635458766128530;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((((LTLAPp0==true) U X((LTLAPp1==true)))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-030A-LTLFireability-11 finished in 123751 ms.
[2024-05-29 12:38:36] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4743845396169647006
[2024-05-29 12:38:36] [INFO ] Computing symmetric may disable matrix : 542 transitions.
[2024-05-29 12:38:36] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:38:36] [INFO ] Computing symmetric may enable matrix : 542 transitions.
[2024-05-29 12:38:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:38:36] [INFO ] Applying decomposition
[2024-05-29 12:38:36] [INFO ] Computing Do-Not-Accords matrix : 542 transitions.
[2024-05-29 12:38:36] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:38:36] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4743845396169647006
Running compilation step : cd /tmp/ltsmin4743845396169647006;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 12:38:36] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6483100553664802712.txt' '-o' '/tmp/graph6483100553664802712.bin' '-w' '/tmp/graph6483100553664802712.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6483100553664802712.bin' '-l' '-1' '-v' '-w' '/tmp/graph6483100553664802712.weights' '-q' '0' '-e' '0.001'
[2024-05-29 12:38:36] [INFO ] Decomposing Gal with order
[2024-05-29 12:38:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:38:36] [INFO ] Removed a total of 90 redundant transitions.
[2024-05-29 12:38:36] [INFO ] Flatten gal took : 29 ms
[2024-05-29 12:38:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 51 ms.
[2024-05-29 12:38:37] [INFO ] Time to serialize gal into /tmp/LTLFireability2142760578998075346.gal : 7 ms
[2024-05-29 12:38:37] [INFO ] Time to serialize properties into /tmp/LTLFireability6538063875101080101.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2142760578998075346.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6538063875101080101.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !(((G(("(i7.i1.i0.u88.p276!=1)")&&(X("(i7.i1.i0.u88.p276!=1)"))))||(F((G(F("(i3.u48.p151==1)")))||(("((i19.i1.i2.u218.p680==1)&&(i19.i...206
Formula 0 simplified : F(!"(i7.i1.i0.u88.p276!=1)" | X!"(i7.i1.i0.u88.p276!=1)") & G(FG!"(i3.u48.p151==1)" & (!"((i19.i1.i2.u218.p680==1)&&(i19.i1.i0.u222....190
Compilation finished in 1392 ms.
Running link step : cd /tmp/ltsmin4743845396169647006;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin4743845396169647006;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](((LTLAPp0==true)&&X((LTLAPp0==true))))||<>(([](<>((LTLAPp1==true)))||(<>((LTLAPp1==true))&&(LTLAPp2==true)))))' '--buchi-type=spotba'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.032: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.032: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.036: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.036: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.038: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.039: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.058: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.058: LTL layer: formula: ([](((LTLAPp0==true)&&X((LTLAPp0==true))))||<>(([](<>((LTLAPp1==true)))||(<>((LTLAPp1==true))&&(LTLAPp2==true)))))
pins2lts-mc-linux64( 7/ 8), 0.058: "([](((LTLAPp0==true)&&X((LTLAPp0==true))))||<>(([](<>((LTLAPp1==true)))||(<>((LTLAPp1==true))&&(LTLAPp2==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.059: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.067: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.071: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.073: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.109: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.109: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.109: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.115: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.156: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.362: DFS-FIFO for weak LTL, using special progress label 549
pins2lts-mc-linux64( 0/ 8), 0.363: There are 550 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.363: State length is 754, there are 551 groups
pins2lts-mc-linux64( 0/ 8), 0.363: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.363: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.363: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.363: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 1.794: ~1 levels ~960 states ~4328 transitions
pins2lts-mc-linux64( 1/ 8), 1.935: ~1 levels ~1920 states ~9976 transitions
pins2lts-mc-linux64( 1/ 8), 2.067: ~1 levels ~3840 states ~22168 transitions
pins2lts-mc-linux64( 1/ 8), 2.260: ~1 levels ~7680 states ~47992 transitions
pins2lts-mc-linux64( 1/ 8), 2.608: ~1 levels ~15360 states ~104920 transitions
pins2lts-mc-linux64( 1/ 8), 3.262: ~1 levels ~30720 states ~218784 transitions
pins2lts-mc-linux64( 4/ 8), 6.600: ~1 levels ~61440 states ~518424 transitions
pins2lts-mc-linux64( 1/ 8), 14.657: ~1 levels ~122880 states ~980136 transitions
pins2lts-mc-linux64( 7/ 8), 19.032: ~1 levels ~245760 states ~2036688 transitions
pins2lts-mc-linux64( 7/ 8), 38.335: ~1 levels ~491520 states ~4386288 transitions
pins2lts-mc-linux64( 7/ 8), 51.791: ~1 levels ~983040 states ~8897432 transitions
pins2lts-mc-linux64( 7/ 8), 79.548: ~1 levels ~1966080 states ~19310544 transitions
pins2lts-mc-linux64( 7/ 8), 133.832: ~1 levels ~3932160 states ~39116312 transitions
pins2lts-mc-linux64( 5/ 8), 253.608: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 253.752:
pins2lts-mc-linux64( 0/ 8), 253.752: mean standard work distribution: 2.5% (states) 2.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 253.752:
pins2lts-mc-linux64( 0/ 8), 253.752: Explored 6674686 states 74298458 transitions, fanout: 11.131
pins2lts-mc-linux64( 0/ 8), 253.752: Total exploration time 253.380 sec (253.210 sec minimum, 253.279 sec on average)
pins2lts-mc-linux64( 0/ 8), 253.752: States per second: 26343, Transitions per second: 293229
pins2lts-mc-linux64( 0/ 8), 253.752:
pins2lts-mc-linux64( 0/ 8), 253.752: Progress states detected: 14327017
pins2lts-mc-linux64( 0/ 8), 253.752: Redundant explorations: -53.4121
pins2lts-mc-linux64( 0/ 8), 253.752:
pins2lts-mc-linux64( 0/ 8), 253.752: Queue width: 8B, total height: 12292535, memory: 93.78MB
pins2lts-mc-linux64( 0/ 8), 253.752: Tree memory: 365.3MB, 26.7 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 253.752: Tree fill ratio (roots/leafs): 10.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 253.752: Stored 549 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 253.752: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 253.752: Est. total memory use: 459.1MB (~1117.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4743845396169647006;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](((LTLAPp0==true)&&X((LTLAPp0==true))))||<>(([](<>((LTLAPp1==true)))||(<>((LTLAPp1==true))&&(LTLAPp2==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4743845396169647006;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](((LTLAPp0==true)&&X((LTLAPp0==true))))||<>(([](<>((LTLAPp1==true)))||(<>((LTLAPp1==true))&&(LTLAPp2==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-29 13:00:52] [INFO ] Applying decomposition
[2024-05-29 13:00:52] [INFO ] Flatten gal took : 31 ms
[2024-05-29 13:00:52] [INFO ] Decomposing Gal with order
[2024-05-29 13:00:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 13:00:52] [INFO ] Removed a total of 180 redundant transitions.
[2024-05-29 13:00:52] [INFO ] Flatten gal took : 32 ms
[2024-05-29 13:00:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-29 13:00:52] [INFO ] Time to serialize gal into /tmp/LTLFireability4282046482949078419.gal : 7 ms
[2024-05-29 13:00:52] [INFO ] Time to serialize properties into /tmp/LTLFireability4895199393530627848.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4282046482949078419.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4895199393530627848.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !(((G(("(u155.p276!=1)")&&(X("(u155.p276!=1)"))))||(F((G(F("(u85.p151==1)")))||(("((i218.u481.p680==1)&&(u391.p697==1))")&&(F("(u85.p1...169
Formula 0 simplified : F(!"(u155.p276!=1)" | X!"(u155.p276!=1)") & G(FG!"(u85.p151==1)" & (!"((i218.u481.p680==1)&&(u391.p697==1))" | G!"(u85.p151==1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
7 transitions explored
5 items max in DFS search stack
967 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.77967,228400,1,0,450306,830,7809,654406,44,638,938657
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-030A-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F((("((i18.u33.p58==1)&&(u42.p75==1))")U(X("(((i226.u396.p707==1)&&(i226.u397.p709==1))&&((u324.p578==1)&&(u337.p601==1)))")))||(G(...240
Formula 1 simplified : G((!"((i18.u33.p58==1)&&(u42.p75==1))" R X!"(((i226.u396.p707==1)&&(i226.u397.p709==1))&&((u324.p578==1)&&(u337.p601==1)))") & F!"((...233
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
6744 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,77.2333,2243564,1,0,4.53184e+06,830,3394,9.84657e+06,34,638,963608
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-030A-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1821391 ms.
BK_STOP 1716987738764
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-030A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ShieldPPPt-PT-030A, 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 r373-tall-171683789200403"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-030A.tgz
mv ShieldPPPt-PT-030A 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 ;