About the Execution of ITS-Tools for FunctionPointer-PT-c016
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16219.115 | 3600000.00 | 8383577.00 | 166501.20 | FFF?FTFFFFFFTFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r312-tall-165472282300499.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FunctionPointer-PT-c016, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282300499
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.8K Jun 7 17:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Jun 7 17:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Jun 7 17:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K Jun 7 17:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 6 15:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 11K Jun 7 17:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Jun 7 17:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 7 17:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Jun 7 17:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 4.2M Jun 6 12:11 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 FunctionPointer-PT-c016-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1654861590063
Running Version 202205111006
[2022-06-10 11:46:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-10 11:46:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 11:46:31] [INFO ] Load time of PNML (sax parser for PT used): 551 ms
[2022-06-10 11:46:31] [INFO ] Transformed 2826 places.
[2022-06-10 11:46:31] [INFO ] Transformed 8960 transitions.
[2022-06-10 11:46:31] [INFO ] Parsed PT model containing 2826 places and 8960 transitions in 715 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1198 places in 41 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c016-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 1612 transition count 5962
Discarding 301 places :
Symmetric choice reduction at 1 with 301 rule applications. Total rules 317 place count 1311 transition count 3664
Iterating global reduction 1 with 301 rules applied. Total rules applied 618 place count 1311 transition count 3664
Ensure Unique test removed 352 transitions
Reduce isomorphic transitions removed 352 transitions.
Iterating post reduction 1 with 352 rules applied. Total rules applied 970 place count 1311 transition count 3312
Discarding 154 places :
Symmetric choice reduction at 2 with 154 rule applications. Total rules 1124 place count 1157 transition count 3004
Iterating global reduction 2 with 154 rules applied. Total rules applied 1278 place count 1157 transition count 3004
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 1342 place count 1157 transition count 2940
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1355 place count 1144 transition count 2914
Iterating global reduction 3 with 13 rules applied. Total rules applied 1368 place count 1144 transition count 2914
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1381 place count 1131 transition count 2888
Iterating global reduction 3 with 13 rules applied. Total rules applied 1394 place count 1131 transition count 2888
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1407 place count 1118 transition count 2862
Iterating global reduction 3 with 13 rules applied. Total rules applied 1420 place count 1118 transition count 2862
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1433 place count 1105 transition count 2836
Iterating global reduction 3 with 13 rules applied. Total rules applied 1446 place count 1105 transition count 2836
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1459 place count 1092 transition count 2810
Iterating global reduction 3 with 13 rules applied. Total rules applied 1472 place count 1092 transition count 2810
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1485 place count 1079 transition count 2784
Iterating global reduction 3 with 13 rules applied. Total rules applied 1498 place count 1079 transition count 2784
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1511 place count 1066 transition count 2758
Iterating global reduction 3 with 13 rules applied. Total rules applied 1524 place count 1066 transition count 2758
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 1582 place count 1008 transition count 2538
Iterating global reduction 3 with 58 rules applied. Total rules applied 1640 place count 1008 transition count 2538
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 1697 place count 951 transition count 2310
Iterating global reduction 3 with 57 rules applied. Total rules applied 1754 place count 951 transition count 2310
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 1810 place count 895 transition count 2186
Iterating global reduction 3 with 56 rules applied. Total rules applied 1866 place count 895 transition count 2186
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 1920 place count 841 transition count 2078
Iterating global reduction 3 with 54 rules applied. Total rules applied 1974 place count 841 transition count 2078
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 2028 place count 787 transition count 1970
Iterating global reduction 3 with 54 rules applied. Total rules applied 2082 place count 787 transition count 1970
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 2136 place count 733 transition count 1862
Iterating global reduction 3 with 54 rules applied. Total rules applied 2190 place count 733 transition count 1862
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2243 place count 680 transition count 1756
Iterating global reduction 3 with 53 rules applied. Total rules applied 2296 place count 680 transition count 1756
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2302 place count 674 transition count 1744
Iterating global reduction 3 with 6 rules applied. Total rules applied 2308 place count 674 transition count 1744
Applied a total of 2308 rules in 1403 ms. Remains 674 /1628 variables (removed 954) and now considering 1744/5962 (removed 4218) transitions.
[2022-06-10 11:46:33] [INFO ] Flow matrix only has 1176 transitions (discarded 568 similar events)
// Phase 1: matrix 1176 rows 674 cols
[2022-06-10 11:46:33] [INFO ] Computed 2 place invariants in 35 ms
[2022-06-10 11:46:34] [INFO ] Implicit Places using invariants in 702 ms returned []
[2022-06-10 11:46:34] [INFO ] Flow matrix only has 1176 transitions (discarded 568 similar events)
// Phase 1: matrix 1176 rows 674 cols
[2022-06-10 11:46:34] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-10 11:46:34] [INFO ] State equation strengthened by 293 read => feed constraints.
[2022-06-10 11:46:36] [INFO ] Implicit Places using invariants and state equation in 2549 ms returned []
Implicit Place search using SMT with State Equation took 3292 ms to find 0 implicit places.
[2022-06-10 11:46:36] [INFO ] Flow matrix only has 1176 transitions (discarded 568 similar events)
// Phase 1: matrix 1176 rows 674 cols
[2022-06-10 11:46:36] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-10 11:46:37] [INFO ] Dead Transitions using invariants and state equation in 571 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 674/1628 places, 1744/5962 transitions.
Finished structural reductions, in 1 iterations. Remains : 674/1628 places, 1744/5962 transitions.
Support contains 19 out of 674 places after structural reductions.
[2022-06-10 11:46:37] [INFO ] Flatten gal took : 135 ms
[2022-06-10 11:46:37] [INFO ] Flatten gal took : 96 ms
[2022-06-10 11:46:38] [INFO ] Input system was already deterministic with 1744 transitions.
Incomplete random walk after 10011 steps, including 2 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2022-06-10 11:46:39] [INFO ] Flow matrix only has 1176 transitions (discarded 568 similar events)
// Phase 1: matrix 1176 rows 674 cols
[2022-06-10 11:46:39] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 11:46:39] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-10 11:46:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 6 ms returned sat
[2022-06-10 11:46:39] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-10 11:46:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-10 11:46:39] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 11:46:40] [INFO ] After 590ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2022-06-10 11:46:40] [INFO ] State equation strengthened by 293 read => feed constraints.
[2022-06-10 11:46:41] [INFO ] After 341ms SMT Verify possible using 293 Read/Feed constraints in natural domain returned unsat :2 sat :8
[2022-06-10 11:46:41] [INFO ] After 902ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 300 ms.
[2022-06-10 11:46:41] [INFO ] After 2133ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
Fused 10 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 63 ms.
Support contains 11 out of 674 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 674/674 places, 1744/1744 transitions.
Graph (complete) has 2903 edges and 674 vertex of which 487 are kept as prefixes of interest. Removing 187 places using SCC suffix rule.9 ms
Discarding 187 places :
Also discarding 0 output transitions
Drop transitions removed 373 transitions
Reduce isomorphic transitions removed 373 transitions.
Iterating post reduction 0 with 373 rules applied. Total rules applied 374 place count 487 transition count 1371
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 377 place count 484 transition count 1365
Iterating global reduction 1 with 3 rules applied. Total rules applied 380 place count 484 transition count 1365
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 383 place count 481 transition count 1359
Iterating global reduction 1 with 3 rules applied. Total rules applied 386 place count 481 transition count 1359
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 389 place count 478 transition count 1353
Iterating global reduction 1 with 3 rules applied. Total rules applied 392 place count 478 transition count 1353
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 395 place count 475 transition count 1347
Iterating global reduction 1 with 3 rules applied. Total rules applied 398 place count 475 transition count 1347
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 399 place count 474 transition count 1345
Iterating global reduction 1 with 1 rules applied. Total rules applied 400 place count 474 transition count 1345
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 401 place count 473 transition count 1343
Iterating global reduction 1 with 1 rules applied. Total rules applied 402 place count 473 transition count 1343
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 403 place count 472 transition count 1341
Iterating global reduction 1 with 1 rules applied. Total rules applied 404 place count 472 transition count 1341
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 405 place count 471 transition count 1339
Iterating global reduction 1 with 1 rules applied. Total rules applied 406 place count 471 transition count 1339
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 407 place count 470 transition count 1337
Iterating global reduction 1 with 1 rules applied. Total rules applied 408 place count 470 transition count 1337
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 409 place count 469 transition count 1335
Iterating global reduction 1 with 1 rules applied. Total rules applied 410 place count 469 transition count 1335
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 411 place count 468 transition count 1331
Iterating global reduction 1 with 1 rules applied. Total rules applied 412 place count 468 transition count 1331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 413 place count 467 transition count 1327
Iterating global reduction 1 with 1 rules applied. Total rules applied 414 place count 467 transition count 1327
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 415 place count 466 transition count 1325
Iterating global reduction 1 with 1 rules applied. Total rules applied 416 place count 466 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 417 place count 465 transition count 1323
Iterating global reduction 1 with 1 rules applied. Total rules applied 418 place count 465 transition count 1323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 419 place count 464 transition count 1321
Iterating global reduction 1 with 1 rules applied. Total rules applied 420 place count 464 transition count 1321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 421 place count 463 transition count 1319
Iterating global reduction 1 with 1 rules applied. Total rules applied 422 place count 463 transition count 1319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 423 place count 462 transition count 1317
Iterating global reduction 1 with 1 rules applied. Total rules applied 424 place count 462 transition count 1317
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 436 place count 462 transition count 1305
Applied a total of 436 rules in 544 ms. Remains 462 /674 variables (removed 212) and now considering 1305/1744 (removed 439) transitions.
Finished structural reductions, in 1 iterations. Remains : 462/674 places, 1305/1744 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-06-10 11:46:42] [INFO ] Flow matrix only has 759 transitions (discarded 546 similar events)
// Phase 1: matrix 759 rows 462 cols
[2022-06-10 11:46:42] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 11:46:42] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-10 11:46:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 7 ms returned sat
[2022-06-10 11:46:43] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-10 11:46:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-10 11:46:43] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 11:46:43] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-10 11:46:43] [INFO ] State equation strengthened by 98 read => feed constraints.
[2022-06-10 11:46:43] [INFO ] After 166ms SMT Verify possible using 98 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-10 11:46:43] [INFO ] After 374ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 114 ms.
[2022-06-10 11:46:43] [INFO ] After 895ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 8 out of 462 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 462/462 places, 1305/1305 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 460 transition count 1299
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 460 transition count 1299
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 458 transition count 1295
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 458 transition count 1295
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 456 transition count 1291
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 456 transition count 1291
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 454 transition count 1287
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 454 transition count 1287
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 452 transition count 1283
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 452 transition count 1283
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 451 transition count 1281
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 451 transition count 1281
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 450 transition count 1279
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 450 transition count 1279
Applied a total of 24 rules in 115 ms. Remains 450 /462 variables (removed 12) and now considering 1279/1305 (removed 26) transitions.
Finished structural reductions, in 1 iterations. Remains : 450/462 places, 1279/1305 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) 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
Running SMT prover for 4 properties.
[2022-06-10 11:46:44] [INFO ] Flow matrix only has 738 transitions (discarded 541 similar events)
// Phase 1: matrix 738 rows 450 cols
[2022-06-10 11:46:44] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 11:46:44] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 11:46:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 11:46:44] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-10 11:46:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-10 11:46:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 11:46:44] [INFO ] After 230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-10 11:46:44] [INFO ] State equation strengthened by 92 read => feed constraints.
[2022-06-10 11:46:45] [INFO ] After 151ms SMT Verify possible using 92 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-10 11:46:45] [INFO ] After 312ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 97 ms.
[2022-06-10 11:46:45] [INFO ] After 769ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 6 out of 450 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 450/450 places, 1279/1279 transitions.
Graph (complete) has 2202 edges and 450 vertex of which 447 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 447 transition count 1273
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 446 transition count 1271
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 446 transition count 1271
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 445 transition count 1269
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 445 transition count 1269
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 444 transition count 1267
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 444 transition count 1267
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 443 transition count 1265
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 443 transition count 1265
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 442 transition count 1263
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 442 transition count 1263
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 441 transition count 1261
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 441 transition count 1261
Applied a total of 19 rules in 106 ms. Remains 441 /450 variables (removed 9) and now considering 1261/1279 (removed 18) transitions.
Finished structural reductions, in 1 iterations. Remains : 441/450 places, 1261/1279 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 224516 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 224516 steps, saw 137685 distinct states, run finished after 3003 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 4 properties.
[2022-06-10 11:46:48] [INFO ] Flow matrix only has 722 transitions (discarded 539 similar events)
// Phase 1: matrix 722 rows 441 cols
[2022-06-10 11:46:48] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-10 11:46:48] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-10 11:46:48] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-10 11:46:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-10 11:46:49] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-10 11:46:49] [INFO ] State equation strengthened by 86 read => feed constraints.
[2022-06-10 11:46:49] [INFO ] After 125ms SMT Verify possible using 86 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-10 11:46:49] [INFO ] After 276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 99 ms.
[2022-06-10 11:46:49] [INFO ] After 707ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 441/441 places, 1261/1261 transitions.
Applied a total of 0 rules in 52 ms. Remains 441 /441 variables (removed 0) and now considering 1261/1261 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 441/441 places, 1261/1261 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 441/441 places, 1261/1261 transitions.
Applied a total of 0 rules in 55 ms. Remains 441 /441 variables (removed 0) and now considering 1261/1261 (removed 0) transitions.
[2022-06-10 11:46:49] [INFO ] Flow matrix only has 722 transitions (discarded 539 similar events)
// Phase 1: matrix 722 rows 441 cols
[2022-06-10 11:46:49] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-10 11:46:49] [INFO ] Implicit Places using invariants in 335 ms returned []
[2022-06-10 11:46:49] [INFO ] Flow matrix only has 722 transitions (discarded 539 similar events)
// Phase 1: matrix 722 rows 441 cols
[2022-06-10 11:46:49] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-10 11:46:50] [INFO ] State equation strengthened by 86 read => feed constraints.
[2022-06-10 11:46:50] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned []
Implicit Place search using SMT with State Equation took 1347 ms to find 0 implicit places.
[2022-06-10 11:46:51] [INFO ] Redundant transitions in 89 ms returned []
[2022-06-10 11:46:51] [INFO ] Flow matrix only has 722 transitions (discarded 539 similar events)
// Phase 1: matrix 722 rows 441 cols
[2022-06-10 11:46:51] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-10 11:46:51] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 441/441 places, 1261/1261 transitions.
Ensure Unique test removed 539 transitions
Reduce isomorphic transitions removed 539 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 550 rules applied. Total rules applied 550 place count 441 transition count 711
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 561 place count 430 transition count 711
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 561 place count 430 transition count 632
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 719 place count 351 transition count 632
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 975 place count 223 transition count 504
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1039 place count 159 transition count 376
Iterating global reduction 2 with 64 rules applied. Total rules applied 1103 place count 159 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1104 place count 159 transition count 375
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1167 place count 96 transition count 249
Iterating global reduction 3 with 63 rules applied. Total rules applied 1230 place count 96 transition count 249
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1293 place count 33 transition count 123
Iterating global reduction 3 with 63 rules applied. Total rules applied 1356 place count 33 transition count 123
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1419 place count 33 transition count 60
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1419 place count 33 transition count 59
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1421 place count 32 transition count 59
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 4 with 2 rules applied. Total rules applied 1423 place count 31 transition count 58
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 1428 place count 31 transition count 53
Applied a total of 1428 rules in 52 ms. Remains 31 /441 variables (removed 410) and now considering 53/1261 (removed 1208) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 53 rows 31 cols
[2022-06-10 11:46:51] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 11:46:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 11:46:51] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-10 11:46:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 11:46:51] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-06-10 11:46:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 11:46:51] [INFO ] After 8ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-06-10 11:46:51] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-10 11:46:51] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2022-06-10 11:46:51] [INFO ] Flatten gal took : 4 ms
[2022-06-10 11:46:51] [INFO ] Flatten gal took : 3 ms
[2022-06-10 11:46:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10232495263984305095.gal : 2 ms
[2022-06-10 11:46:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7113826508545841686.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms15606069719121094123;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10232495263984305095.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7113826508545841686.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality7113826508545841686.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 48
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :48 after 1071
Reachability property AtomicPropp3 is true.
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1071 after 20783
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :20783 after 171927
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :171927 after 1.3545e+06
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1.3545e+06 after 1.17468e+07
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1.17468e+07 after 9.70316e+07
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :9.70316e+07 after 1.14844e+09
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1.14844e+09 after 2.05003e+10
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :2.05003e+10 after 4.58166e+11
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :4.58166e+11 after 1.21277e+13
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :1.21277e+13 after 3.44729e+14
Detected timeout of ITS tools.
[2022-06-10 11:47:06] [INFO ] Flatten gal took : 6 ms
[2022-06-10 11:47:06] [INFO ] Applying decomposition
[2022-06-10 11:47:06] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph575081570753990308.txt' '-o' '/tmp/graph575081570753990308.bin' '-w' '/tmp/graph575081570753990308.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph575081570753990308.bin' '-l' '-1' '-v' '-w' '/tmp/graph575081570753990308.weights' '-q' '0' '-e' '0.001'
[2022-06-10 11:47:06] [INFO ] Decomposing Gal with order
[2022-06-10 11:47:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 11:47:06] [INFO ] Removed a total of 32 redundant transitions.
[2022-06-10 11:47:06] [INFO ] Flatten gal took : 34 ms
[2022-06-10 11:47:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2022-06-10 11:47:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6225158206021509881.gal : 5 ms
[2022-06-10 11:47:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4762528784982926916.prop : 10 ms
Invoking ITS tools like this :cd /tmp/redAtoms15606069719121094123;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6225158206021509881.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4762528784982926916.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality4762528784982926916.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 48
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :48 after 765
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :765 after 122349
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :122349 after 808605
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :808605 after 3.09703e+06
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :3.09703e+06 after 1.32247e+07
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :1.32247e+07 after 7.46811e+07
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :7.46811e+07 after 4.87855e+08
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :4.87855e+08 after 3.55255e+09
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2299822286582839950
[2022-06-10 11:47:21] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2299822286582839950
Running compilation step : cd /tmp/ltsmin2299822286582839950;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 208 ms.
Running link step : cd /tmp/ltsmin2299822286582839950;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2299822286582839950;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp0==true'
LTSmin run took 1747 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin2299822286582839950;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp2==true'
LTSmin run took 58 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin2299822286582839950;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp7==true'
LTSmin run took 1936 ms.
Found Violation
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
FORMULA FunctionPointer-PT-c016-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 192 stabilizing places and 512 stable transitions
Graph (complete) has 3869 edges and 674 vertex of which 673 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.27 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 674 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 674/674 places, 1744/1744 transitions.
Graph (complete) has 3869 edges and 674 vertex of which 673 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 665 transition count 1724
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 665 transition count 1724
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 25 place count 657 transition count 1702
Iterating global reduction 0 with 8 rules applied. Total rules applied 33 place count 657 transition count 1702
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 41 place count 649 transition count 1682
Iterating global reduction 0 with 8 rules applied. Total rules applied 49 place count 649 transition count 1682
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 57 place count 641 transition count 1666
Iterating global reduction 0 with 8 rules applied. Total rules applied 65 place count 641 transition count 1666
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 71 place count 635 transition count 1654
Iterating global reduction 0 with 6 rules applied. Total rules applied 77 place count 635 transition count 1654
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 82 place count 630 transition count 1644
Iterating global reduction 0 with 5 rules applied. Total rules applied 87 place count 630 transition count 1644
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 91 place count 626 transition count 1636
Iterating global reduction 0 with 4 rules applied. Total rules applied 95 place count 626 transition count 1636
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 98 place count 623 transition count 1630
Iterating global reduction 0 with 3 rules applied. Total rules applied 101 place count 623 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 102 place count 622 transition count 1628
Iterating global reduction 0 with 1 rules applied. Total rules applied 103 place count 622 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 104 place count 621 transition count 1626
Iterating global reduction 0 with 1 rules applied. Total rules applied 105 place count 621 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 106 place count 620 transition count 1622
Iterating global reduction 0 with 1 rules applied. Total rules applied 107 place count 620 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 108 place count 619 transition count 1618
Iterating global reduction 0 with 1 rules applied. Total rules applied 109 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 110 place count 618 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 111 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 112 place count 617 transition count 1614
Iterating global reduction 0 with 1 rules applied. Total rules applied 113 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 114 place count 616 transition count 1612
Iterating global reduction 0 with 1 rules applied. Total rules applied 115 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 116 place count 615 transition count 1610
Iterating global reduction 0 with 1 rules applied. Total rules applied 117 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 118 place count 614 transition count 1608
Iterating global reduction 0 with 1 rules applied. Total rules applied 119 place count 614 transition count 1608
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 121 place count 614 transition count 1606
Applied a total of 121 rules in 868 ms. Remains 614 /674 variables (removed 60) and now considering 1606/1744 (removed 138) transitions.
[2022-06-10 11:47:26] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
// Phase 1: matrix 1074 rows 614 cols
[2022-06-10 11:47:26] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-10 11:47:27] [INFO ] Implicit Places using invariants in 412 ms returned []
[2022-06-10 11:47:27] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
// Phase 1: matrix 1074 rows 614 cols
[2022-06-10 11:47:27] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 11:47:27] [INFO ] State equation strengthened by 267 read => feed constraints.
[2022-06-10 11:47:29] [INFO ] Implicit Places using invariants and state equation in 1867 ms returned []
Implicit Place search using SMT with State Equation took 2283 ms to find 0 implicit places.
[2022-06-10 11:47:29] [INFO ] Redundant transitions in 36 ms returned []
[2022-06-10 11:47:29] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
// Phase 1: matrix 1074 rows 614 cols
[2022-06-10 11:47:29] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 11:47:29] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 614/674 places, 1606/1744 transitions.
Finished structural reductions, in 1 iterations. Remains : 614/674 places, 1606/1744 transitions.
Stuttering acceptance computed with spot in 516 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LEQ s520 s541) (LEQ 3 s532)), p1:(LEQ s520 s541)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 4 ms.
FORMULA FunctionPointer-PT-c016-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLCardinality-00 finished in 4280 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 674 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 674/674 places, 1744/1744 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 673 transition count 1744
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 664 transition count 1722
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 664 transition count 1722
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 27 place count 656 transition count 1700
Iterating global reduction 1 with 8 rules applied. Total rules applied 35 place count 656 transition count 1700
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 43 place count 648 transition count 1680
Iterating global reduction 1 with 8 rules applied. Total rules applied 51 place count 648 transition count 1680
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 59 place count 640 transition count 1664
Iterating global reduction 1 with 8 rules applied. Total rules applied 67 place count 640 transition count 1664
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 73 place count 634 transition count 1652
Iterating global reduction 1 with 6 rules applied. Total rules applied 79 place count 634 transition count 1652
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 84 place count 629 transition count 1642
Iterating global reduction 1 with 5 rules applied. Total rules applied 89 place count 629 transition count 1642
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 93 place count 625 transition count 1634
Iterating global reduction 1 with 4 rules applied. Total rules applied 97 place count 625 transition count 1634
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 100 place count 622 transition count 1628
Iterating global reduction 1 with 3 rules applied. Total rules applied 103 place count 622 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 621 transition count 1626
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 621 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 620 transition count 1624
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 620 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 108 place count 619 transition count 1620
Iterating global reduction 1 with 1 rules applied. Total rules applied 109 place count 619 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 618 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 116 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 118 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 119 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 120 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 121 place count 613 transition count 1606
Applied a total of 121 rules in 258 ms. Remains 613 /674 variables (removed 61) and now considering 1606/1744 (removed 138) transitions.
[2022-06-10 11:47:30] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2022-06-10 11:47:30] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-10 11:47:30] [INFO ] Implicit Places using invariants in 400 ms returned []
[2022-06-10 11:47:30] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2022-06-10 11:47:30] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-10 11:47:31] [INFO ] State equation strengthened by 265 read => feed constraints.
[2022-06-10 11:47:32] [INFO ] Implicit Places using invariants and state equation in 1515 ms returned []
Implicit Place search using SMT with State Equation took 1917 ms to find 0 implicit places.
[2022-06-10 11:47:32] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2022-06-10 11:47:32] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-10 11:47:32] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 613/674 places, 1606/1744 transitions.
Finished structural reductions, in 1 iterations. Remains : 613/674 places, 1606/1744 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s540 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 45 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-c016-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLCardinality-02 finished in 2741 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(!X(p0) U G(X(G(p0)))))'
Support contains 1 out of 674 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 674/674 places, 1744/1744 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 673 transition count 1744
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 663 transition count 1720
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 663 transition count 1720
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 30 place count 654 transition count 1694
Iterating global reduction 1 with 9 rules applied. Total rules applied 39 place count 654 transition count 1694
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 48 place count 645 transition count 1670
Iterating global reduction 1 with 9 rules applied. Total rules applied 57 place count 645 transition count 1670
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 66 place count 636 transition count 1652
Iterating global reduction 1 with 9 rules applied. Total rules applied 75 place count 636 transition count 1652
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 82 place count 629 transition count 1638
Iterating global reduction 1 with 7 rules applied. Total rules applied 89 place count 629 transition count 1638
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 95 place count 623 transition count 1626
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 623 transition count 1626
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 106 place count 618 transition count 1616
Iterating global reduction 1 with 5 rules applied. Total rules applied 111 place count 618 transition count 1616
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 115 place count 614 transition count 1608
Iterating global reduction 1 with 4 rules applied. Total rules applied 119 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 120 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 121 place count 613 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 122 place count 612 transition count 1604
Iterating global reduction 1 with 1 rules applied. Total rules applied 123 place count 612 transition count 1604
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 124 place count 611 transition count 1600
Iterating global reduction 1 with 1 rules applied. Total rules applied 125 place count 611 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 126 place count 610 transition count 1596
Iterating global reduction 1 with 1 rules applied. Total rules applied 127 place count 610 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 609 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 132 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 134 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 136 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 137 place count 605 transition count 1586
Applied a total of 137 rules in 269 ms. Remains 605 /674 variables (removed 69) and now considering 1586/1744 (removed 158) transitions.
[2022-06-10 11:47:33] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2022-06-10 11:47:33] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 11:47:33] [INFO ] Implicit Places using invariants in 375 ms returned []
[2022-06-10 11:47:33] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2022-06-10 11:47:33] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 11:47:33] [INFO ] State equation strengthened by 262 read => feed constraints.
[2022-06-10 11:47:35] [INFO ] Implicit Places using invariants and state equation in 2321 ms returned []
Implicit Place search using SMT with State Equation took 2699 ms to find 0 implicit places.
[2022-06-10 11:47:35] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2022-06-10 11:47:35] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 11:47:36] [INFO ] Dead Transitions using invariants and state equation in 487 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 605/674 places, 1586/1744 transitions.
Finished structural reductions, in 1 iterations. Remains : 605/674 places, 1586/1744 transitions.
Stuttering acceptance computed with spot in 105 ms :[p0, p0, p0]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 s380)], 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 0 reset in 545 ms.
Product exploration explored 100000 steps with 0 reset in 552 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 98 ms :[p0, p0, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 493050 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :{}
Probabilistic random walk after 493050 steps, saw 320021 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 11:47:40] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2022-06-10 11:47:40] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-10 11:47:41] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-10 11:47:41] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 11:47:41] [INFO ] After 239ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 11:47:41] [INFO ] State equation strengthened by 262 read => feed constraints.
[2022-06-10 11:47:41] [INFO ] After 66ms SMT Verify possible using 262 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 11:47:41] [INFO ] After 422ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 11:47:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-10 11:47:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 11:47:41] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 11:47:41] [INFO ] After 115ms SMT Verify possible using 262 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 11:47:41] [INFO ] After 175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-06-10 11:47:41] [INFO ] After 527ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 605 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 605/605 places, 1586/1586 transitions.
Graph (complete) has 2649 edges and 605 vertex of which 416 are kept as prefixes of interest. Removing 189 places using SCC suffix rule.1 ms
Discarding 189 places :
Also discarding 0 output transitions
Drop transitions removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Iterating post reduction 0 with 379 rules applied. Total rules applied 380 place count 416 transition count 1207
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 382 place count 416 transition count 1205
Applied a total of 382 rules in 105 ms. Remains 416 /605 variables (removed 189) and now considering 1205/1586 (removed 381) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/605 places, 1205/1586 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Finished Best-First random walk after 9903 steps, including 2 resets, run visited all 1 properties in 7 ms. (steps per millisecond=1414 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 140 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 105 ms :[p0, p0, p0]
Support contains 1 out of 605 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 605/605 places, 1586/1586 transitions.
Applied a total of 0 rules in 14 ms. Remains 605 /605 variables (removed 0) and now considering 1586/1586 (removed 0) transitions.
[2022-06-10 11:47:42] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2022-06-10 11:47:42] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-10 11:47:42] [INFO ] Implicit Places using invariants in 385 ms returned []
[2022-06-10 11:47:42] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2022-06-10 11:47:42] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 11:47:43] [INFO ] State equation strengthened by 262 read => feed constraints.
[2022-06-10 11:47:44] [INFO ] Implicit Places using invariants and state equation in 1861 ms returned []
Implicit Place search using SMT with State Equation took 2246 ms to find 0 implicit places.
[2022-06-10 11:47:44] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2022-06-10 11:47:44] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 11:47:45] [INFO ] Dead Transitions using invariants and state equation in 484 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 605/605 places, 1586/1586 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 103 ms :[p0, p0, p0]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 492839 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :{}
Probabilistic random walk after 492839 steps, saw 319884 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 11:47:48] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2022-06-10 11:47:48] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-10 11:47:48] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 11:47:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 11:47:48] [INFO ] After 237ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 11:47:48] [INFO ] State equation strengthened by 262 read => feed constraints.
[2022-06-10 11:47:48] [INFO ] After 67ms SMT Verify possible using 262 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 11:47:48] [INFO ] After 398ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 11:47:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-10 11:47:49] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 11:47:49] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 11:47:49] [INFO ] After 118ms SMT Verify possible using 262 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 11:47:49] [INFO ] After 172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-06-10 11:47:49] [INFO ] After 537ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 605 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 605/605 places, 1586/1586 transitions.
Graph (complete) has 2649 edges and 605 vertex of which 416 are kept as prefixes of interest. Removing 189 places using SCC suffix rule.1 ms
Discarding 189 places :
Also discarding 0 output transitions
Drop transitions removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Iterating post reduction 0 with 379 rules applied. Total rules applied 380 place count 416 transition count 1207
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 382 place count 416 transition count 1205
Applied a total of 382 rules in 95 ms. Remains 416 /605 variables (removed 189) and now considering 1205/1586 (removed 381) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/605 places, 1205/1586 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 600872 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :{}
Probabilistic random walk after 600872 steps, saw 368444 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 11:47:52] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
// Phase 1: matrix 680 rows 416 cols
[2022-06-10 11:47:52] [INFO ] Computed 3 place invariants in 7 ms
[2022-06-10 11:47:52] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-10 11:47:52] [INFO ] After 156ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 11:47:52] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-10 11:47:52] [INFO ] After 43ms SMT Verify possible using 75 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 11:47:52] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 11:47:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-10 11:47:53] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 11:47:53] [INFO ] After 112ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 11:47:53] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2022-06-10 11:47:53] [INFO ] After 403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 55 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 1205/1205 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 45 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2022-06-10 11:47:53] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
// Phase 1: matrix 680 rows 416 cols
[2022-06-10 11:47:53] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-10 11:47:53] [INFO ] Implicit Places using invariants in 279 ms returned []
[2022-06-10 11:47:53] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
// Phase 1: matrix 680 rows 416 cols
[2022-06-10 11:47:53] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 11:47:53] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-10 11:47:54] [INFO ] Implicit Places using invariants and state equation in 870 ms returned []
Implicit Place search using SMT with State Equation took 1149 ms to find 0 implicit places.
[2022-06-10 11:47:54] [INFO ] Redundant transitions in 14 ms returned []
[2022-06-10 11:47:54] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
// Phase 1: matrix 680 rows 416 cols
[2022-06-10 11:47:54] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 11:47:54] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 1205/1205 transitions.
Ensure Unique test removed 525 transitions
Reduce isomorphic transitions removed 525 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 416 transition count 669
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 547 place count 405 transition count 669
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 547 place count 405 transition count 600
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 685 place count 336 transition count 600
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 939 place count 209 transition count 473
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1003 place count 145 transition count 345
Iterating global reduction 2 with 64 rules applied. Total rules applied 1067 place count 145 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1068 place count 145 transition count 344
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1068 place count 145 transition count 343
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1070 place count 144 transition count 343
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1133 place count 81 transition count 217
Iterating global reduction 3 with 63 rules applied. Total rules applied 1196 place count 81 transition count 217
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1259 place count 18 transition count 91
Iterating global reduction 3 with 63 rules applied. Total rules applied 1322 place count 18 transition count 91
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1385 place count 18 transition count 28
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1385 place count 18 transition count 27
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1387 place count 17 transition count 27
Applied a total of 1387 rules in 23 ms. Remains 17 /416 variables (removed 399) and now considering 27/1205 (removed 1178) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 27 rows 17 cols
[2022-06-10 11:47:54] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 11:47:54] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-06-10 11:47:54] [INFO ] After 6ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 11:47:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 11:47:54] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 11:47:54] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 11:47:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-06-10 11:47:54] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 11:47:54] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 11:47:54] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-06-10 11:47:54] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-10 11:47:54] [INFO ] Flatten gal took : 4 ms
[2022-06-10 11:47:54] [INFO ] Flatten gal took : 3 ms
[2022-06-10 11:47:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13832360586543988917.gal : 1 ms
[2022-06-10 11:47:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7701208676090152726.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1994497304028441225;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13832360586543988917.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7701208676090152726.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality7701208676090152726.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 578
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :578 after 3858
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3858 after 198387
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :198387 after 619443
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :619443 after 1.45829e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.45829e+06 after 3.13272e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3.13272e+06 after 6.47832e+06
Detected timeout of ITS tools.
[2022-06-10 11:48:10] [INFO ] Flatten gal took : 1 ms
[2022-06-10 11:48:10] [INFO ] Applying decomposition
[2022-06-10 11:48:10] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3471745999725167539.txt' '-o' '/tmp/graph3471745999725167539.bin' '-w' '/tmp/graph3471745999725167539.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3471745999725167539.bin' '-l' '-1' '-v' '-w' '/tmp/graph3471745999725167539.weights' '-q' '0' '-e' '0.001'
[2022-06-10 11:48:10] [INFO ] Decomposing Gal with order
[2022-06-10 11:48:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 11:48:10] [INFO ] Removed a total of 20 redundant transitions.
[2022-06-10 11:48:10] [INFO ] Flatten gal took : 8 ms
[2022-06-10 11:48:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-06-10 11:48:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2754972468418075021.gal : 0 ms
[2022-06-10 11:48:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5729752879992022746.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1994497304028441225;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2754972468418075021.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5729752879992022746.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality5729752879992022746.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 578
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :578 after 9075
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin545486383943753130
[2022-06-10 11:48:25] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin545486383943753130
Running compilation step : cd /tmp/ltsmin545486383943753130;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 88 ms.
Running link step : cd /tmp/ltsmin545486383943753130;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin545486383943753130;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
LTSmin run took 174 ms.
Found Violation
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 107 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 105 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 97 ms :[p0, p0, p0]
Product exploration explored 100000 steps with 0 reset in 402 ms.
Product exploration explored 100000 steps with 0 reset in 477 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 119 ms :[p0, p0, p0]
Support contains 1 out of 605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 605/605 places, 1586/1586 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 605 transition count 1584
Applied a total of 2 rules in 173 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1586 (removed 2) transitions.
[2022-06-10 11:48:27] [INFO ] Redundant transitions in 24 ms returned []
[2022-06-10 11:48:27] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2022-06-10 11:48:27] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 11:48:27] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 605/605 places, 1584/1586 transitions.
Finished structural reductions, in 1 iterations. Remains : 605/605 places, 1584/1586 transitions.
Product exploration explored 100000 steps with 0 reset in 406 ms.
Product exploration explored 100000 steps with 1 reset in 477 ms.
Built C files in :
/tmp/ltsmin2231505151460502726
[2022-06-10 11:48:28] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2231505151460502726
Running compilation step : cd /tmp/ltsmin2231505151460502726;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2827 ms.
Running link step : cd /tmp/ltsmin2231505151460502726;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2231505151460502726;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8671844906998302648.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 605 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 605/605 places, 1586/1586 transitions.
Applied a total of 0 rules in 20 ms. Remains 605 /605 variables (removed 0) and now considering 1586/1586 (removed 0) transitions.
[2022-06-10 11:48:43] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2022-06-10 11:48:43] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 11:48:44] [INFO ] Implicit Places using invariants in 385 ms returned []
[2022-06-10 11:48:44] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2022-06-10 11:48:44] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 11:48:44] [INFO ] State equation strengthened by 262 read => feed constraints.
[2022-06-10 11:48:45] [INFO ] Implicit Places using invariants and state equation in 1721 ms returned []
Implicit Place search using SMT with State Equation took 2107 ms to find 0 implicit places.
[2022-06-10 11:48:45] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2022-06-10 11:48:45] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-10 11:48:46] [INFO ] Dead Transitions using invariants and state equation in 494 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 605/605 places, 1586/1586 transitions.
Built C files in :
/tmp/ltsmin17452792643034180456
[2022-06-10 11:48:46] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17452792643034180456
Running compilation step : cd /tmp/ltsmin17452792643034180456;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2682 ms.
Running link step : cd /tmp/ltsmin17452792643034180456;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17452792643034180456;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12821852852051535627.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-10 11:49:01] [INFO ] Flatten gal took : 62 ms
[2022-06-10 11:49:01] [INFO ] Flatten gal took : 63 ms
[2022-06-10 11:49:01] [INFO ] Time to serialize gal into /tmp/LTL15803390327335807710.gal : 10 ms
[2022-06-10 11:49:01] [INFO ] Time to serialize properties into /tmp/LTL4318280408788156209.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15803390327335807710.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4318280408788156209.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1580339...267
Read 1 LTL properties
Checking formula 0 : !((!((!(X("(l758>=2)")))U(G(X(G("(l758>=2)")))))))
Formula 0 simplified : !X"(l758>=2)" U GXG"(l758>=2)"
Detected timeout of ITS tools.
[2022-06-10 11:49:16] [INFO ] Flatten gal took : 51 ms
[2022-06-10 11:49:16] [INFO ] Applying decomposition
[2022-06-10 11:49:16] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6139808156338517844.txt' '-o' '/tmp/graph6139808156338517844.bin' '-w' '/tmp/graph6139808156338517844.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6139808156338517844.bin' '-l' '-1' '-v' '-w' '/tmp/graph6139808156338517844.weights' '-q' '0' '-e' '0.001'
[2022-06-10 11:49:16] [INFO ] Decomposing Gal with order
[2022-06-10 11:49:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 11:49:17] [INFO ] Removed a total of 2629 redundant transitions.
[2022-06-10 11:49:17] [INFO ] Flatten gal took : 115 ms
[2022-06-10 11:49:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 1127 labels/synchronizations in 73 ms.
[2022-06-10 11:49:17] [INFO ] Time to serialize gal into /tmp/LTL14271691569750185026.gal : 12 ms
[2022-06-10 11:49:17] [INFO ] Time to serialize properties into /tmp/LTL8316533791192516460.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14271691569750185026.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8316533791192516460.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1427169...246
Read 1 LTL properties
Checking formula 0 : !((!((!(X("(i7.u69.l758>=2)")))U(G(X(G("(i7.u69.l758>=2)")))))))
Formula 0 simplified : !X"(i7.u69.l758>=2)" U GXG"(i7.u69.l758>=2)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18221767484331975497
[2022-06-10 11:49:32] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18221767484331975497
Running compilation step : cd /tmp/ltsmin18221767484331975497;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2715 ms.
Running link step : cd /tmp/ltsmin18221767484331975497;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin18221767484331975497;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '!(!X((LTLAPp0==true)) U [](X([]((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c016-LTLCardinality-03 finished in 134387 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(!G(p0)) U p1)||G(X(p2)))))'
Support contains 4 out of 674 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 674/674 places, 1744/1744 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 673 transition count 1744
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 664 transition count 1722
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 664 transition count 1722
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 27 place count 656 transition count 1698
Iterating global reduction 1 with 8 rules applied. Total rules applied 35 place count 656 transition count 1698
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 42 place count 649 transition count 1680
Iterating global reduction 1 with 7 rules applied. Total rules applied 49 place count 649 transition count 1680
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 56 place count 642 transition count 1666
Iterating global reduction 1 with 7 rules applied. Total rules applied 63 place count 642 transition count 1666
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 69 place count 636 transition count 1654
Iterating global reduction 1 with 6 rules applied. Total rules applied 75 place count 636 transition count 1654
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 80 place count 631 transition count 1644
Iterating global reduction 1 with 5 rules applied. Total rules applied 85 place count 631 transition count 1644
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 89 place count 627 transition count 1636
Iterating global reduction 1 with 4 rules applied. Total rules applied 93 place count 627 transition count 1636
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 96 place count 624 transition count 1630
Iterating global reduction 1 with 3 rules applied. Total rules applied 99 place count 624 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 623 transition count 1628
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 623 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 622 transition count 1626
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 622 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 621 transition count 1622
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 621 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 620 transition count 1618
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 620 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 108 place count 619 transition count 1616
Iterating global reduction 1 with 1 rules applied. Total rules applied 109 place count 619 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 618 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 618 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 617 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 617 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 616 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 616 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 116 place count 615 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 615 transition count 1608
Applied a total of 117 rules in 179 ms. Remains 615 /674 variables (removed 59) and now considering 1608/1744 (removed 136) transitions.
[2022-06-10 11:49:47] [INFO ] Flow matrix only has 1076 transitions (discarded 532 similar events)
// Phase 1: matrix 1076 rows 615 cols
[2022-06-10 11:49:47] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 11:49:47] [INFO ] Implicit Places using invariants in 390 ms returned []
[2022-06-10 11:49:47] [INFO ] Flow matrix only has 1076 transitions (discarded 532 similar events)
// Phase 1: matrix 1076 rows 615 cols
[2022-06-10 11:49:47] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-10 11:49:48] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-10 11:49:50] [INFO ] Implicit Places using invariants and state equation in 2196 ms returned []
Implicit Place search using SMT with State Equation took 2588 ms to find 0 implicit places.
[2022-06-10 11:49:50] [INFO ] Flow matrix only has 1076 transitions (discarded 532 similar events)
// Phase 1: matrix 1076 rows 615 cols
[2022-06-10 11:49:50] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-10 11:49:50] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 615/674 places, 1608/1744 transitions.
Finished structural reductions, in 1 iterations. Remains : 615/674 places, 1608/1744 transitions.
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), p0, (OR (NOT p1) p0), (AND p0 (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0 p2), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s130 s529), p0:(LEQ 1 s533), p2:(LEQ 2 s83)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 434 ms.
Product exploration explored 100000 steps with 3 reset in 500 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Detected a total of 192/615 stabilizing places and 512/1608 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 521 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), p0, (OR (NOT p1) p0), (AND p0 (NOT p2))]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2022-06-10 11:49:52] [INFO ] Flow matrix only has 1076 transitions (discarded 532 similar events)
// Phase 1: matrix 1076 rows 615 cols
[2022-06-10 11:49:52] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 11:49:52] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-06-10 11:49:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 11:49:53] [INFO ] After 528ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-10 11:49:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 11:49:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 11:49:53] [INFO ] After 387ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-10 11:49:53] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-10 11:49:54] [INFO ] After 222ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-06-10 11:49:54] [INFO ] After 539ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 189 ms.
[2022-06-10 11:49:54] [INFO ] After 1307ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 27 ms.
Support contains 4 out of 615 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Graph (complete) has 2686 edges and 615 vertex of which 423 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 423 transition count 1224
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 389 place count 423 transition count 1220
Applied a total of 389 rules in 88 ms. Remains 423 /615 variables (removed 192) and now considering 1220/1608 (removed 388) transitions.
Finished structural reductions, in 1 iterations. Remains : 423/615 places, 1220/1608 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-06-10 11:49:54] [INFO ] Flow matrix only has 692 transitions (discarded 528 similar events)
// Phase 1: matrix 692 rows 423 cols
[2022-06-10 11:49:54] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 11:49:55] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 11:49:55] [INFO ] After 176ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-06-10 11:49:55] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-06-10 11:49:55] [INFO ] After 67ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 11:49:55] [INFO ] After 322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 11:49:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-10 11:49:55] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-10 11:49:55] [INFO ] After 99ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-10 11:49:55] [INFO ] After 173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 48 ms.
[2022-06-10 11:49:55] [INFO ] After 475ms 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 2 ms.
Support contains 4 out of 423 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 423/423 places, 1220/1220 transitions.
Applied a total of 0 rules in 45 ms. Remains 423 /423 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 423/423 places, 1220/1220 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 339801 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 339801 steps, saw 208372 distinct states, run finished after 3004 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-10 11:49:58] [INFO ] Flow matrix only has 692 transitions (discarded 528 similar events)
// Phase 1: matrix 692 rows 423 cols
[2022-06-10 11:49:58] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 11:49:58] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-10 11:49:59] [INFO ] After 180ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-06-10 11:49:59] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-06-10 11:49:59] [INFO ] After 60ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 11:49:59] [INFO ] After 324ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 11:49:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-10 11:49:59] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-10 11:49:59] [INFO ] After 103ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-10 11:49:59] [INFO ] After 177ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 47 ms.
[2022-06-10 11:49:59] [INFO ] After 485ms 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 3 ms.
Support contains 4 out of 423 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 423/423 places, 1220/1220 transitions.
Applied a total of 0 rules in 41 ms. Remains 423 /423 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 423/423 places, 1220/1220 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 423/423 places, 1220/1220 transitions.
Applied a total of 0 rules in 42 ms. Remains 423 /423 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2022-06-10 11:49:59] [INFO ] Flow matrix only has 692 transitions (discarded 528 similar events)
// Phase 1: matrix 692 rows 423 cols
[2022-06-10 11:49:59] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 11:50:00] [INFO ] Implicit Places using invariants in 281 ms returned []
[2022-06-10 11:50:00] [INFO ] Flow matrix only has 692 transitions (discarded 528 similar events)
// Phase 1: matrix 692 rows 423 cols
[2022-06-10 11:50:00] [INFO ] Computed 3 place invariants in 9 ms
[2022-06-10 11:50:00] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-06-10 11:50:00] [INFO ] Implicit Places using invariants and state equation in 913 ms returned []
Implicit Place search using SMT with State Equation took 1196 ms to find 0 implicit places.
[2022-06-10 11:50:01] [INFO ] Redundant transitions in 15 ms returned []
[2022-06-10 11:50:01] [INFO ] Flow matrix only has 692 transitions (discarded 528 similar events)
// Phase 1: matrix 692 rows 423 cols
[2022-06-10 11:50:01] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 11:50:01] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 423/423 places, 1220/1220 transitions.
Ensure Unique test removed 528 transitions
Reduce isomorphic transitions removed 528 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 541 rules applied. Total rules applied 541 place count 423 transition count 679
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 554 place count 410 transition count 679
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 554 place count 410 transition count 610
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 692 place count 341 transition count 610
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 946 place count 214 transition count 483
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1010 place count 150 transition count 355
Iterating global reduction 2 with 64 rules applied. Total rules applied 1074 place count 150 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1075 place count 150 transition count 354
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1075 place count 150 transition count 353
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1077 place count 149 transition count 353
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1140 place count 86 transition count 227
Iterating global reduction 3 with 63 rules applied. Total rules applied 1203 place count 86 transition count 227
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 1264 place count 25 transition count 105
Iterating global reduction 3 with 61 rules applied. Total rules applied 1325 place count 25 transition count 105
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 3 with 59 rules applied. Total rules applied 1384 place count 25 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1386 place count 24 transition count 49
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1389 place count 24 transition count 46
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1390 place count 24 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1391 place count 23 transition count 46
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1393 place count 23 transition count 44
Applied a total of 1393 rules in 21 ms. Remains 23 /423 variables (removed 400) and now considering 44/1220 (removed 1176) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 44 rows 23 cols
[2022-06-10 11:50:01] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 11:50:01] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-06-10 11:50:01] [INFO ] After 13ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-06-10 11:50:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 11:50:01] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 11:50:01] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 11:50:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 11:50:01] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-10 11:50:01] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-10 11:50:01] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-10 11:50:01] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-10 11:50:01] [INFO ] Flatten gal took : 3 ms
[2022-06-10 11:50:01] [INFO ] Flatten gal took : 2 ms
[2022-06-10 11:50:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8012361654826403575.gal : 1 ms
[2022-06-10 11:50:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6202809995152507988.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10867952888307781522;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8012361654826403575.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6202809995152507988.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality6202809995152507988.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 20
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :20 after 55
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :55 after 409
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :409 after 14161
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :14161 after 223686
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :223686 after 1.95486e+07
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.95486e+07 after 7.5332e+07
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :7.5332e+07 after 1.86682e+08
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.86682e+08 after 4.09164e+08
Detected timeout of ITS tools.
[2022-06-10 11:50:16] [INFO ] Flatten gal took : 4 ms
[2022-06-10 11:50:16] [INFO ] Applying decomposition
[2022-06-10 11:50:16] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4655413030454821918.txt' '-o' '/tmp/graph4655413030454821918.bin' '-w' '/tmp/graph4655413030454821918.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4655413030454821918.bin' '-l' '-1' '-v' '-w' '/tmp/graph4655413030454821918.weights' '-q' '0' '-e' '0.001'
[2022-06-10 11:50:16] [INFO ] Decomposing Gal with order
[2022-06-10 11:50:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 11:50:16] [INFO ] Removed a total of 32 redundant transitions.
[2022-06-10 11:50:16] [INFO ] Flatten gal took : 5 ms
[2022-06-10 11:50:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2022-06-10 11:50:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11806886757477233002.gal : 1 ms
[2022-06-10 11:50:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5872906491830707777.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10867952888307781522;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11806886757477233002.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5872906491830707777.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality5872906491830707777.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 48
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :48 after 514
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :514 after 15981
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :15981 after 2.06882e+06
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.06882e+06 after 1.60689e+07
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.60689e+07 after 4.39606e+07
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :4.39606e+07 after 9.96355e+07
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :9.96355e+07 after 2.10877e+08
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.10877e+08 after 4.33251e+08
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17744933934849013458
[2022-06-10 11:50:31] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17744933934849013458
Running compilation step : cd /tmp/ltsmin17744933934849013458;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 104 ms.
Running link step : cd /tmp/ltsmin17744933934849013458;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin17744933934849013458;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf3==true'
LTSmin run took 4901 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin17744933934849013458;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf7==true'
LTSmin run took 8678 ms.
Found Violation
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p2) p0)), (F (AND p1 p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (AND p1 (NOT p2) p0))]
Knowledge based reduction with 10 factoid took 662 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), p0, (OR (NOT p1) p0), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), p0, (OR (NOT p1) p0), (AND p0 (NOT p2))]
Support contains 4 out of 615 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Applied a total of 0 rules in 12 ms. Remains 615 /615 variables (removed 0) and now considering 1608/1608 (removed 0) transitions.
[2022-06-10 11:50:46] [INFO ] Flow matrix only has 1076 transitions (discarded 532 similar events)
// Phase 1: matrix 1076 rows 615 cols
[2022-06-10 11:50:46] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-10 11:50:46] [INFO ] Implicit Places using invariants in 380 ms returned []
[2022-06-10 11:50:46] [INFO ] Flow matrix only has 1076 transitions (discarded 532 similar events)
// Phase 1: matrix 1076 rows 615 cols
[2022-06-10 11:50:46] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 11:50:47] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-10 11:50:48] [INFO ] Implicit Places using invariants and state equation in 2051 ms returned []
Implicit Place search using SMT with State Equation took 2432 ms to find 0 implicit places.
[2022-06-10 11:50:48] [INFO ] Flow matrix only has 1076 transitions (discarded 532 similar events)
// Phase 1: matrix 1076 rows 615 cols
[2022-06-10 11:50:48] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 11:50:49] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 615/615 places, 1608/1608 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Detected a total of 192/615 stabilizing places and 512/1608 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 p2 p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 p0)))), (X (X p1)), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 477 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), p0, (OR (NOT p1) p0), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2022-06-10 11:50:50] [INFO ] Flow matrix only has 1076 transitions (discarded 532 similar events)
// Phase 1: matrix 1076 rows 615 cols
[2022-06-10 11:50:50] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 11:50:50] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 11:50:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 11:50:50] [INFO ] After 502ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-10 11:50:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 11:50:50] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 11:50:51] [INFO ] After 391ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-06-10 11:50:51] [INFO ] State equation strengthened by 268 read => feed constraints.
[2022-06-10 11:50:51] [INFO ] After 228ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2022-06-10 11:50:51] [INFO ] After 572ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 187 ms.
[2022-06-10 11:50:52] [INFO ] After 1328ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 24 ms.
Support contains 4 out of 615 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Graph (complete) has 2686 edges and 615 vertex of which 423 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 423 transition count 1224
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 389 place count 423 transition count 1220
Applied a total of 389 rules in 85 ms. Remains 423 /615 variables (removed 192) and now considering 1220/1608 (removed 388) transitions.
Finished structural reductions, in 1 iterations. Remains : 423/615 places, 1220/1608 transitions.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :4
Running SMT prover for 2 properties.
[2022-06-10 11:50:52] [INFO ] Flow matrix only has 692 transitions (discarded 528 similar events)
// Phase 1: matrix 692 rows 423 cols
[2022-06-10 11:50:52] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 11:50:52] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 11:50:52] [INFO ] After 181ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-06-10 11:50:52] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-06-10 11:50:52] [INFO ] After 63ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 11:50:52] [INFO ] After 325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 11:50:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-10 11:50:53] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-10 11:50:53] [INFO ] After 98ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-10 11:50:53] [INFO ] After 175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 47 ms.
[2022-06-10 11:50:53] [INFO ] After 463ms 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 2 ms.
Support contains 4 out of 423 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 423/423 places, 1220/1220 transitions.
Applied a total of 0 rules in 43 ms. Remains 423 /423 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 423/423 places, 1220/1220 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 346534 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{}
Probabilistic random walk after 346534 steps, saw 212500 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-10 11:50:56] [INFO ] Flow matrix only has 692 transitions (discarded 528 similar events)
// Phase 1: matrix 692 rows 423 cols
[2022-06-10 11:50:56] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 11:50:56] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-10 11:50:56] [INFO ] After 175ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-06-10 11:50:56] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-06-10 11:50:56] [INFO ] After 68ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 11:50:56] [INFO ] After 323ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 11:50:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 11:50:57] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-10 11:50:57] [INFO ] After 103ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-10 11:50:57] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 54 ms.
[2022-06-10 11:50:57] [INFO ] After 500ms 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 3 ms.
Support contains 4 out of 423 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 423/423 places, 1220/1220 transitions.
Applied a total of 0 rules in 41 ms. Remains 423 /423 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 423/423 places, 1220/1220 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 423/423 places, 1220/1220 transitions.
Applied a total of 0 rules in 41 ms. Remains 423 /423 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2022-06-10 11:50:57] [INFO ] Flow matrix only has 692 transitions (discarded 528 similar events)
// Phase 1: matrix 692 rows 423 cols
[2022-06-10 11:50:57] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-10 11:50:57] [INFO ] Implicit Places using invariants in 289 ms returned []
[2022-06-10 11:50:57] [INFO ] Flow matrix only has 692 transitions (discarded 528 similar events)
// Phase 1: matrix 692 rows 423 cols
[2022-06-10 11:50:57] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 11:50:57] [INFO ] State equation strengthened by 78 read => feed constraints.
[2022-06-10 11:50:58] [INFO ] Implicit Places using invariants and state equation in 1009 ms returned []
Implicit Place search using SMT with State Equation took 1299 ms to find 0 implicit places.
[2022-06-10 11:50:58] [INFO ] Redundant transitions in 16 ms returned []
[2022-06-10 11:50:58] [INFO ] Flow matrix only has 692 transitions (discarded 528 similar events)
// Phase 1: matrix 692 rows 423 cols
[2022-06-10 11:50:58] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-10 11:50:59] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 423/423 places, 1220/1220 transitions.
Ensure Unique test removed 528 transitions
Reduce isomorphic transitions removed 528 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 541 rules applied. Total rules applied 541 place count 423 transition count 679
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 554 place count 410 transition count 679
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 554 place count 410 transition count 610
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 692 place count 341 transition count 610
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 946 place count 214 transition count 483
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1010 place count 150 transition count 355
Iterating global reduction 2 with 64 rules applied. Total rules applied 1074 place count 150 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1075 place count 150 transition count 354
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1075 place count 150 transition count 353
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1077 place count 149 transition count 353
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1140 place count 86 transition count 227
Iterating global reduction 3 with 63 rules applied. Total rules applied 1203 place count 86 transition count 227
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 1264 place count 25 transition count 105
Iterating global reduction 3 with 61 rules applied. Total rules applied 1325 place count 25 transition count 105
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 3 with 59 rules applied. Total rules applied 1384 place count 25 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1386 place count 24 transition count 49
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 1389 place count 24 transition count 46
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1390 place count 24 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1391 place count 23 transition count 46
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1393 place count 23 transition count 44
Applied a total of 1393 rules in 24 ms. Remains 23 /423 variables (removed 400) and now considering 44/1220 (removed 1176) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 44 rows 23 cols
[2022-06-10 11:50:59] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 11:50:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 11:50:59] [INFO ] After 17ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-06-10 11:50:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 11:50:59] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 11:50:59] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 11:50:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-06-10 11:50:59] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-10 11:50:59] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-10 11:50:59] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-06-10 11:50:59] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-10 11:50:59] [INFO ] Flatten gal took : 2 ms
[2022-06-10 11:50:59] [INFO ] Flatten gal took : 1 ms
[2022-06-10 11:50:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5228204006744692847.gal : 1 ms
[2022-06-10 11:50:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3363533163497102068.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16511654867381923704;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5228204006744692847.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3363533163497102068.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality3363533163497102068.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 20
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :20 after 55
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :55 after 409
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :409 after 14161
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :14161 after 223686
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :223686 after 1.95486e+07
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.95486e+07 after 7.5332e+07
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :7.5332e+07 after 1.86682e+08
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.86682e+08 after 4.09164e+08
Detected timeout of ITS tools.
[2022-06-10 11:51:14] [INFO ] Flatten gal took : 1 ms
[2022-06-10 11:51:14] [INFO ] Applying decomposition
[2022-06-10 11:51:14] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9196377675612352073.txt' '-o' '/tmp/graph9196377675612352073.bin' '-w' '/tmp/graph9196377675612352073.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9196377675612352073.bin' '-l' '-1' '-v' '-w' '/tmp/graph9196377675612352073.weights' '-q' '0' '-e' '0.001'
[2022-06-10 11:51:14] [INFO ] Decomposing Gal with order
[2022-06-10 11:51:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 11:51:14] [INFO ] Removed a total of 27 redundant transitions.
[2022-06-10 11:51:14] [INFO ] Flatten gal took : 3 ms
[2022-06-10 11:51:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 0 ms.
[2022-06-10 11:51:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13400301569085860386.gal : 0 ms
[2022-06-10 11:51:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14632480350063315994.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16511654867381923704;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13400301569085860386.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14632480350063315994.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality14632480350063315994.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 48
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :48 after 514
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :514 after 15981
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :15981 after 2.06882e+06
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.06882e+06 after 1.60689e+07
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.60689e+07 after 4.39606e+07
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :4.39606e+07 after 9.96355e+07
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :9.96355e+07 after 2.10877e+08
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.10877e+08 after 4.33251e+08
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11866427161712781693
[2022-06-10 11:51:29] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11866427161712781693
Running compilation step : cd /tmp/ltsmin11866427161712781693;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 103 ms.
Running link step : cd /tmp/ltsmin11866427161712781693;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11866427161712781693;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf3==true'
LTSmin run took 6230 ms.
Found Violation
Running LTSmin : cd /tmp/ltsmin11866427161712781693;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf7==true'
LTSmin run took 470 ms.
Found Violation
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 p2 p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 p0)))), (X (X p1)), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p2) p0)), (F (AND p1 p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (AND p1 (NOT p2) p0))]
Knowledge based reduction with 10 factoid took 681 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), p0, (OR (NOT p1) p0), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), p0, (OR (NOT p1) p0), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), p0, (OR (NOT p1) p0), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 404 ms.
Product exploration explored 100000 steps with 7 reset in 466 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), p0, (OR (NOT p1) p0), (AND p0 (NOT p2))]
Support contains 4 out of 615 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 615/615 places, 1608/1608 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 615 transition count 1604
Applied a total of 4 rules in 176 ms. Remains 615 /615 variables (removed 0) and now considering 1604/1608 (removed 4) transitions.
[2022-06-10 11:51:38] [INFO ] Redundant transitions in 22 ms returned []
[2022-06-10 11:51:38] [INFO ] Flow matrix only has 1074 transitions (discarded 530 similar events)
// Phase 1: matrix 1074 rows 615 cols
[2022-06-10 11:51:38] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-10 11:51:39] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 615/615 places, 1604/1608 transitions.
Finished structural reductions, in 1 iterations. Remains : 615/615 places, 1604/1608 transitions.
Product exploration explored 100000 steps with 0 reset in 452 ms.
Product exploration explored 100000 steps with 0 reset in 477 ms.
Built C files in :
/tmp/ltsmin8939115109258200631
[2022-06-10 11:51:40] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8939115109258200631
Running compilation step : cd /tmp/ltsmin8939115109258200631;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2770 ms.
Running link step : cd /tmp/ltsmin8939115109258200631;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin8939115109258200631;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15718700396584005265.hoa' '--buchi-type=spotba'
LTSmin run took 1219 ms.
FORMULA FunctionPointer-PT-c016-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FunctionPointer-PT-c016-LTLCardinality-06 finished in 116880 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&p0)))'
Support contains 1 out of 674 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 674/674 places, 1744/1744 transitions.
Graph (complete) has 3869 edges and 674 vertex of which 673 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 664 transition count 1722
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 664 transition count 1722
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 27 place count 656 transition count 1700
Iterating global reduction 0 with 8 rules applied. Total rules applied 35 place count 656 transition count 1700
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 43 place count 648 transition count 1680
Iterating global reduction 0 with 8 rules applied. Total rules applied 51 place count 648 transition count 1680
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 59 place count 640 transition count 1664
Iterating global reduction 0 with 8 rules applied. Total rules applied 67 place count 640 transition count 1664
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 73 place count 634 transition count 1652
Iterating global reduction 0 with 6 rules applied. Total rules applied 79 place count 634 transition count 1652
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 84 place count 629 transition count 1642
Iterating global reduction 0 with 5 rules applied. Total rules applied 89 place count 629 transition count 1642
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 93 place count 625 transition count 1634
Iterating global reduction 0 with 4 rules applied. Total rules applied 97 place count 625 transition count 1634
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 100 place count 622 transition count 1628
Iterating global reduction 0 with 3 rules applied. Total rules applied 103 place count 622 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 104 place count 621 transition count 1626
Iterating global reduction 0 with 1 rules applied. Total rules applied 105 place count 621 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 106 place count 620 transition count 1624
Iterating global reduction 0 with 1 rules applied. Total rules applied 107 place count 620 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 108 place count 619 transition count 1620
Iterating global reduction 0 with 1 rules applied. Total rules applied 109 place count 619 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 110 place count 618 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 111 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 112 place count 617 transition count 1614
Iterating global reduction 0 with 1 rules applied. Total rules applied 113 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 114 place count 616 transition count 1612
Iterating global reduction 0 with 1 rules applied. Total rules applied 115 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 116 place count 615 transition count 1610
Iterating global reduction 0 with 1 rules applied. Total rules applied 117 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 118 place count 614 transition count 1608
Iterating global reduction 0 with 1 rules applied. Total rules applied 119 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 120 place count 613 transition count 1606
Iterating global reduction 0 with 1 rules applied. Total rules applied 121 place count 613 transition count 1606
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 125 place count 613 transition count 1602
Applied a total of 125 rules in 323 ms. Remains 613 /674 variables (removed 61) and now considering 1602/1744 (removed 142) transitions.
[2022-06-10 11:51:44] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 613 cols
[2022-06-10 11:51:44] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-10 11:51:44] [INFO ] Implicit Places using invariants in 410 ms returned []
[2022-06-10 11:51:44] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 613 cols
[2022-06-10 11:51:45] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-10 11:51:45] [INFO ] State equation strengthened by 265 read => feed constraints.
[2022-06-10 11:51:47] [INFO ] Implicit Places using invariants and state equation in 2081 ms returned []
Implicit Place search using SMT with State Equation took 2492 ms to find 0 implicit places.
[2022-06-10 11:51:47] [INFO ] Redundant transitions in 27 ms returned []
[2022-06-10 11:51:47] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 613 cols
[2022-06-10 11:51:47] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-10 11:51:47] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 613/674 places, 1602/1744 transitions.
Finished structural reductions, in 1 iterations. Remains : 613/674 places, 1602/1744 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 s540)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 383 ms.
Product exploration explored 100000 steps with 3 reset in 453 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 508166 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :{}
Probabilistic random walk after 508166 steps, saw 329834 distinct states, run finished after 3001 ms. (steps per millisecond=169 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 11:51:51] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 613 cols
[2022-06-10 11:51:51] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-10 11:51:51] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 11:51:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 11:51:52] [INFO ] After 248ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 11:51:52] [INFO ] State equation strengthened by 265 read => feed constraints.
[2022-06-10 11:51:52] [INFO ] After 67ms SMT Verify possible using 265 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 11:51:52] [INFO ] After 406ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 11:51:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-10 11:51:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 11:51:52] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 11:51:52] [INFO ] After 66ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 11:51:52] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2022-06-10 11:51:52] [INFO ] After 482ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 613 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 613/613 places, 1602/1602 transitions.
Graph (complete) has 2677 edges and 613 vertex of which 421 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 421 transition count 1218
Applied a total of 385 rules in 44 ms. Remains 421 /613 variables (removed 192) and now considering 1218/1602 (removed 384) transitions.
Finished structural reductions, in 1 iterations. Remains : 421/613 places, 1218/1602 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 602282 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :{}
Probabilistic random walk after 602282 steps, saw 369309 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 11:51:55] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2022-06-10 11:51:55] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-10 11:51:55] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 11:51:55] [INFO ] After 154ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 11:51:55] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-10 11:51:55] [INFO ] After 56ms SMT Verify possible using 75 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 11:51:55] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 11:51:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-10 11:51:56] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 11:51:56] [INFO ] After 80ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 11:51:56] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-06-10 11:51:56] [INFO ] After 359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 42 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 41 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2022-06-10 11:51:56] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2022-06-10 11:51:56] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-10 11:51:56] [INFO ] Implicit Places using invariants in 277 ms returned []
[2022-06-10 11:51:56] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2022-06-10 11:51:56] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 11:51:56] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-10 11:51:57] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 1195 ms to find 0 implicit places.
[2022-06-10 11:51:57] [INFO ] Redundant transitions in 13 ms returned []
[2022-06-10 11:51:57] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2022-06-10 11:51:57] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-10 11:51:57] [INFO ] Dead Transitions using invariants and state equation in 366 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 1218/1218 transitions.
Ensure Unique test removed 530 transitions
Reduce isomorphic transitions removed 530 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 421 transition count 678
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 550 place count 411 transition count 678
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 550 place count 411 transition count 605
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 696 place count 338 transition count 605
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 950 place count 211 transition count 478
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1014 place count 147 transition count 350
Iterating global reduction 2 with 64 rules applied. Total rules applied 1078 place count 147 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1079 place count 147 transition count 349
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1142 place count 84 transition count 223
Iterating global reduction 3 with 63 rules applied. Total rules applied 1205 place count 84 transition count 223
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1268 place count 21 transition count 97
Iterating global reduction 3 with 63 rules applied. Total rules applied 1331 place count 21 transition count 97
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1394 place count 21 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1394 place count 21 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1396 place count 20 transition count 33
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 4 with 2 rules applied. Total rules applied 1398 place count 19 transition count 32
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1399 place count 19 transition count 31
Applied a total of 1399 rules in 17 ms. Remains 19 /421 variables (removed 402) and now considering 31/1218 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2022-06-10 11:51:57] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 11:51:58] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 11:51:58] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 11:51:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 11:51:58] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 11:51:58] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 11:51:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-06-10 11:51:58] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 11:51:58] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 11:51:58] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-06-10 11:51:58] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-10 11:51:58] [INFO ] Flatten gal took : 1 ms
[2022-06-10 11:51:58] [INFO ] Flatten gal took : 1 ms
[2022-06-10 11:51:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13833557462210970405.gal : 1 ms
[2022-06-10 11:51:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17809622111031422460.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12909479034424743879;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13833557462210970405.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17809622111031422460.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality17809622111031422460.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 1139
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1139 after 31467
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :31467 after 84507
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :84507 after 189771
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :189771 after 399483
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :399483 after 818091
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :818091 after 1.65449e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.65449e+06 after 3.32648e+06
Detected timeout of ITS tools.
[2022-06-10 11:52:13] [INFO ] Flatten gal took : 4 ms
[2022-06-10 11:52:13] [INFO ] Applying decomposition
[2022-06-10 11:52:13] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph49891281691849964.txt' '-o' '/tmp/graph49891281691849964.bin' '-w' '/tmp/graph49891281691849964.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph49891281691849964.bin' '-l' '-1' '-v' '-w' '/tmp/graph49891281691849964.weights' '-q' '0' '-e' '0.001'
[2022-06-10 11:52:13] [INFO ] Decomposing Gal with order
[2022-06-10 11:52:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 11:52:13] [INFO ] Removed a total of 30 redundant transitions.
[2022-06-10 11:52:13] [INFO ] Flatten gal took : 3 ms
[2022-06-10 11:52:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 0 ms.
[2022-06-10 11:52:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality484703402460530829.gal : 1 ms
[2022-06-10 11:52:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11706808241285478366.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12909479034424743879;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality484703402460530829.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11706808241285478366.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality11706808241285478366.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 2544
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14248385877711173160
[2022-06-10 11:52:28] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14248385877711173160
Running compilation step : cd /tmp/ltsmin14248385877711173160;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 86 ms.
Running link step : cd /tmp/ltsmin14248385877711173160;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin14248385877711173160;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
LTSmin run took 775 ms.
Found Violation
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 1 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 1602/1602 transitions.
Applied a total of 0 rules in 82 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1602 (removed 0) transitions.
[2022-06-10 11:52:29] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 613 cols
[2022-06-10 11:52:29] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-10 11:52:29] [INFO ] Implicit Places using invariants in 381 ms returned []
[2022-06-10 11:52:29] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 613 cols
[2022-06-10 11:52:29] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 11:52:30] [INFO ] State equation strengthened by 265 read => feed constraints.
[2022-06-10 11:52:31] [INFO ] Implicit Places using invariants and state equation in 2059 ms returned []
Implicit Place search using SMT with State Equation took 2446 ms to find 0 implicit places.
[2022-06-10 11:52:31] [INFO ] Redundant transitions in 26 ms returned []
[2022-06-10 11:52:31] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 613 cols
[2022-06-10 11:52:31] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-10 11:52:32] [INFO ] Dead Transitions using invariants and state equation in 506 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 613/613 places, 1602/1602 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 506145 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :{}
Probabilistic random walk after 506145 steps, saw 328521 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 11:52:35] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 613 cols
[2022-06-10 11:52:35] [INFO ] Computed 2 place invariants in 15 ms
[2022-06-10 11:52:35] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 11:52:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 11:52:35] [INFO ] After 244ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 11:52:35] [INFO ] State equation strengthened by 265 read => feed constraints.
[2022-06-10 11:52:35] [INFO ] After 69ms SMT Verify possible using 265 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 11:52:35] [INFO ] After 409ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 11:52:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-10 11:52:36] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 11:52:36] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 11:52:36] [INFO ] After 69ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 11:52:36] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2022-06-10 11:52:36] [INFO ] After 479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 613 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 613/613 places, 1602/1602 transitions.
Graph (complete) has 2677 edges and 613 vertex of which 421 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 421 transition count 1218
Applied a total of 385 rules in 51 ms. Remains 421 /613 variables (removed 192) and now considering 1218/1602 (removed 384) transitions.
Finished structural reductions, in 1 iterations. Remains : 421/613 places, 1218/1602 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 598158 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{}
Probabilistic random walk after 598158 steps, saw 366781 distinct states, run finished after 3001 ms. (steps per millisecond=199 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 11:52:39] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2022-06-10 11:52:39] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-10 11:52:39] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-10 11:52:39] [INFO ] After 150ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 11:52:39] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-10 11:52:39] [INFO ] After 53ms SMT Verify possible using 75 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 11:52:39] [INFO ] After 271ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 11:52:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-10 11:52:40] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 11:52:40] [INFO ] After 79ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 11:52:40] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-06-10 11:52:40] [INFO ] After 364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 46 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 41 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2022-06-10 11:52:40] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2022-06-10 11:52:40] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-10 11:52:40] [INFO ] Implicit Places using invariants in 283 ms returned []
[2022-06-10 11:52:40] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2022-06-10 11:52:40] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 11:52:40] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-10 11:52:41] [INFO ] Implicit Places using invariants and state equation in 944 ms returned []
Implicit Place search using SMT with State Equation took 1229 ms to find 0 implicit places.
[2022-06-10 11:52:41] [INFO ] Redundant transitions in 17 ms returned []
[2022-06-10 11:52:41] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2022-06-10 11:52:41] [INFO ] Computed 3 place invariants in 5 ms
[2022-06-10 11:52:41] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 1218/1218 transitions.
Ensure Unique test removed 530 transitions
Reduce isomorphic transitions removed 530 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 421 transition count 678
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 550 place count 411 transition count 678
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 550 place count 411 transition count 605
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 696 place count 338 transition count 605
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 950 place count 211 transition count 478
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1014 place count 147 transition count 350
Iterating global reduction 2 with 64 rules applied. Total rules applied 1078 place count 147 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1079 place count 147 transition count 349
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1142 place count 84 transition count 223
Iterating global reduction 3 with 63 rules applied. Total rules applied 1205 place count 84 transition count 223
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1268 place count 21 transition count 97
Iterating global reduction 3 with 63 rules applied. Total rules applied 1331 place count 21 transition count 97
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1394 place count 21 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1394 place count 21 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1396 place count 20 transition count 33
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 4 with 2 rules applied. Total rules applied 1398 place count 19 transition count 32
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1399 place count 19 transition count 31
Applied a total of 1399 rules in 21 ms. Remains 19 /421 variables (removed 402) and now considering 31/1218 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2022-06-10 11:52:41] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 11:52:41] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-06-10 11:52:41] [INFO ] After 7ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 11:52:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 11:52:41] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 11:52:41] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 11:52:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 11:52:41] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 11:52:41] [INFO ] After 1ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 11:52:41] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-06-10 11:52:41] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-10 11:52:41] [INFO ] Flatten gal took : 2 ms
[2022-06-10 11:52:41] [INFO ] Flatten gal took : 1 ms
[2022-06-10 11:52:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2424825436294019982.gal : 1 ms
[2022-06-10 11:52:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18441230042127796681.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms5214649264008107569;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2424825436294019982.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18441230042127796681.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality18441230042127796681.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 1139
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1139 after 31467
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :31467 after 84507
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :84507 after 189771
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :189771 after 399483
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :399483 after 818091
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :818091 after 1.65449e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.65449e+06 after 3.32648e+06
Detected timeout of ITS tools.
[2022-06-10 11:52:56] [INFO ] Flatten gal took : 2 ms
[2022-06-10 11:52:56] [INFO ] Applying decomposition
[2022-06-10 11:52:56] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2230166472285189701.txt' '-o' '/tmp/graph2230166472285189701.bin' '-w' '/tmp/graph2230166472285189701.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2230166472285189701.bin' '-l' '-1' '-v' '-w' '/tmp/graph2230166472285189701.weights' '-q' '0' '-e' '0.001'
[2022-06-10 11:52:56] [INFO ] Decomposing Gal with order
[2022-06-10 11:52:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 11:52:56] [INFO ] Removed a total of 30 redundant transitions.
[2022-06-10 11:52:56] [INFO ] Flatten gal took : 2 ms
[2022-06-10 11:52:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 0 ms.
[2022-06-10 11:52:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17431910416821173715.gal : 1 ms
[2022-06-10 11:52:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7632893447299487207.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms5214649264008107569;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17431910416821173715.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7632893447299487207.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality7632893447299487207.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 48
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13657584575397774804
[2022-06-10 11:53:12] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13657584575397774804
Running compilation step : cd /tmp/ltsmin13657584575397774804;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 87 ms.
Running link step : cd /tmp/ltsmin13657584575397774804;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13657584575397774804;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
LTSmin run took 546 ms.
Found Violation
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3 reset in 459 ms.
Stack based approach found an accepted trace after 22498 steps with 0 reset with depth 22499 and stack size 22492 in 104 ms.
FORMULA FunctionPointer-PT-c016-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c016-LTLCardinality-09 finished in 89189 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(F(X(p0)))&&F(G(p1))))))'
Support contains 4 out of 674 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 674/674 places, 1744/1744 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 668 transition count 1730
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 668 transition count 1730
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 663 transition count 1714
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 663 transition count 1714
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 658 transition count 1698
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 658 transition count 1698
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 653 transition count 1688
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 653 transition count 1688
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 649 transition count 1680
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 649 transition count 1680
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 645 transition count 1672
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 645 transition count 1672
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 642 transition count 1666
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 642 transition count 1666
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 639 transition count 1660
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 639 transition count 1660
Applied a total of 70 rules in 93 ms. Remains 639 /674 variables (removed 35) and now considering 1660/1744 (removed 84) transitions.
[2022-06-10 11:53:13] [INFO ] Flow matrix only has 1113 transitions (discarded 547 similar events)
// Phase 1: matrix 1113 rows 639 cols
[2022-06-10 11:53:13] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-10 11:53:13] [INFO ] Implicit Places using invariants in 401 ms returned []
[2022-06-10 11:53:13] [INFO ] Flow matrix only has 1113 transitions (discarded 547 similar events)
// Phase 1: matrix 1113 rows 639 cols
[2022-06-10 11:53:13] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 11:53:14] [INFO ] State equation strengthened by 276 read => feed constraints.
[2022-06-10 11:53:16] [INFO ] Implicit Places using invariants and state equation in 2185 ms returned []
Implicit Place search using SMT with State Equation took 2587 ms to find 0 implicit places.
[2022-06-10 11:53:16] [INFO ] Flow matrix only has 1113 transitions (discarded 547 similar events)
// Phase 1: matrix 1113 rows 639 cols
[2022-06-10 11:53:16] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 11:53:16] [INFO ] Dead Transitions using invariants and state equation in 516 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 639/674 places, 1660/1744 transitions.
Finished structural reductions, in 1 iterations. Remains : 639/674 places, 1660/1744 transitions.
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ s540 s547), p1:(GT s574 s535)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 121 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c016-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLCardinality-10 finished in 3494 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 674 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 674/674 places, 1744/1744 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 673 transition count 1744
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 663 transition count 1720
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 663 transition count 1720
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 30 place count 654 transition count 1694
Iterating global reduction 1 with 9 rules applied. Total rules applied 39 place count 654 transition count 1694
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 48 place count 645 transition count 1670
Iterating global reduction 1 with 9 rules applied. Total rules applied 57 place count 645 transition count 1670
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 66 place count 636 transition count 1652
Iterating global reduction 1 with 9 rules applied. Total rules applied 75 place count 636 transition count 1652
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 82 place count 629 transition count 1638
Iterating global reduction 1 with 7 rules applied. Total rules applied 89 place count 629 transition count 1638
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 95 place count 623 transition count 1626
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 623 transition count 1626
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 106 place count 618 transition count 1616
Iterating global reduction 1 with 5 rules applied. Total rules applied 111 place count 618 transition count 1616
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 115 place count 614 transition count 1608
Iterating global reduction 1 with 4 rules applied. Total rules applied 119 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 120 place count 613 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 121 place count 613 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 122 place count 612 transition count 1604
Iterating global reduction 1 with 1 rules applied. Total rules applied 123 place count 612 transition count 1604
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 124 place count 611 transition count 1600
Iterating global reduction 1 with 1 rules applied. Total rules applied 125 place count 611 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 126 place count 610 transition count 1596
Iterating global reduction 1 with 1 rules applied. Total rules applied 127 place count 610 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 609 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 132 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 134 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 136 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 137 place count 605 transition count 1586
Applied a total of 137 rules in 180 ms. Remains 605 /674 variables (removed 69) and now considering 1586/1744 (removed 158) transitions.
[2022-06-10 11:53:17] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2022-06-10 11:53:17] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 11:53:17] [INFO ] Implicit Places using invariants in 375 ms returned []
[2022-06-10 11:53:17] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2022-06-10 11:53:17] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 11:53:17] [INFO ] State equation strengthened by 262 read => feed constraints.
[2022-06-10 11:53:19] [INFO ] Implicit Places using invariants and state equation in 1589 ms returned []
Implicit Place search using SMT with State Equation took 1966 ms to find 0 implicit places.
[2022-06-10 11:53:19] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2022-06-10 11:53:19] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 11:53:19] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 605/674 places, 1586/1744 transitions.
Finished structural reductions, in 1 iterations. Remains : 605/674 places, 1586/1744 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LEQ 1 s476) (LEQ 2 s417))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c016-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLCardinality-11 finished in 2723 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(!X(p0) U G(X(G(p0)))))'
Found a CL insensitive property : FunctionPointer-PT-c016-LTLCardinality-03
Stuttering acceptance computed with spot in 99 ms :[p0, p0, p0]
Support contains 1 out of 674 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 674/674 places, 1744/1744 transitions.
Graph (complete) has 3869 edges and 674 vertex of which 673 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 11 place count 663 transition count 1720
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 663 transition count 1720
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 30 place count 654 transition count 1694
Iterating global reduction 0 with 9 rules applied. Total rules applied 39 place count 654 transition count 1694
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 48 place count 645 transition count 1670
Iterating global reduction 0 with 9 rules applied. Total rules applied 57 place count 645 transition count 1670
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 66 place count 636 transition count 1652
Iterating global reduction 0 with 9 rules applied. Total rules applied 75 place count 636 transition count 1652
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 82 place count 629 transition count 1638
Iterating global reduction 0 with 7 rules applied. Total rules applied 89 place count 629 transition count 1638
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 95 place count 623 transition count 1626
Iterating global reduction 0 with 6 rules applied. Total rules applied 101 place count 623 transition count 1626
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 106 place count 618 transition count 1616
Iterating global reduction 0 with 5 rules applied. Total rules applied 111 place count 618 transition count 1616
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 115 place count 614 transition count 1608
Iterating global reduction 0 with 4 rules applied. Total rules applied 119 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 120 place count 613 transition count 1606
Iterating global reduction 0 with 1 rules applied. Total rules applied 121 place count 613 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 122 place count 612 transition count 1604
Iterating global reduction 0 with 1 rules applied. Total rules applied 123 place count 612 transition count 1604
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 124 place count 611 transition count 1600
Iterating global reduction 0 with 1 rules applied. Total rules applied 125 place count 611 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 126 place count 610 transition count 1596
Iterating global reduction 0 with 1 rules applied. Total rules applied 127 place count 610 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 128 place count 609 transition count 1594
Iterating global reduction 0 with 1 rules applied. Total rules applied 129 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 130 place count 608 transition count 1592
Iterating global reduction 0 with 1 rules applied. Total rules applied 131 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 132 place count 607 transition count 1590
Iterating global reduction 0 with 1 rules applied. Total rules applied 133 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 134 place count 606 transition count 1588
Iterating global reduction 0 with 1 rules applied. Total rules applied 135 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 136 place count 605 transition count 1586
Iterating global reduction 0 with 1 rules applied. Total rules applied 137 place count 605 transition count 1586
Applied a total of 137 rules in 206 ms. Remains 605 /674 variables (removed 69) and now considering 1586/1744 (removed 158) transitions.
[2022-06-10 11:53:20] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2022-06-10 11:53:20] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-10 11:53:20] [INFO ] Implicit Places using invariants in 398 ms returned []
[2022-06-10 11:53:20] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2022-06-10 11:53:20] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 11:53:20] [INFO ] State equation strengthened by 262 read => feed constraints.
[2022-06-10 11:53:22] [INFO ] Implicit Places using invariants and state equation in 1792 ms returned []
Implicit Place search using SMT with State Equation took 2191 ms to find 0 implicit places.
[2022-06-10 11:53:22] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2022-06-10 11:53:22] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 11:53:22] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 605/674 places, 1586/1744 transitions.
Finished structural reductions, in 1 iterations. Remains : 605/674 places, 1586/1744 transitions.
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 s380)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3 reset in 403 ms.
Product exploration explored 100000 steps with 1 reset in 438 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 97 ms :[p0, p0, p0]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 514546 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :{}
Probabilistic random walk after 514546 steps, saw 333974 distinct states, run finished after 3001 ms. (steps per millisecond=171 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 11:53:26] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2022-06-10 11:53:26] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-10 11:53:26] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 11:53:26] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 11:53:27] [INFO ] After 234ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 11:53:27] [INFO ] State equation strengthened by 262 read => feed constraints.
[2022-06-10 11:53:27] [INFO ] After 64ms SMT Verify possible using 262 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 11:53:27] [INFO ] After 393ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 11:53:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-06-10 11:53:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 11:53:27] [INFO ] After 249ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 11:53:27] [INFO ] After 114ms SMT Verify possible using 262 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 11:53:27] [INFO ] After 167ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-06-10 11:53:27] [INFO ] After 529ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 605 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 605/605 places, 1586/1586 transitions.
Graph (complete) has 2649 edges and 605 vertex of which 416 are kept as prefixes of interest. Removing 189 places using SCC suffix rule.1 ms
Discarding 189 places :
Also discarding 0 output transitions
Drop transitions removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Iterating post reduction 0 with 379 rules applied. Total rules applied 380 place count 416 transition count 1207
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 382 place count 416 transition count 1205
Applied a total of 382 rules in 84 ms. Remains 416 /605 variables (removed 189) and now considering 1205/1586 (removed 381) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/605 places, 1205/1586 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 610333 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :{}
Probabilistic random walk after 610333 steps, saw 374246 distinct states, run finished after 3001 ms. (steps per millisecond=203 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-10 11:53:30] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
// Phase 1: matrix 680 rows 416 cols
[2022-06-10 11:53:30] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-10 11:53:30] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-10 11:53:31] [INFO ] After 150ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 11:53:31] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-10 11:53:31] [INFO ] After 36ms SMT Verify possible using 75 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 11:53:31] [INFO ] After 257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 11:53:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-10 11:53:31] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 11:53:31] [INFO ] After 110ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 11:53:31] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-06-10 11:53:31] [INFO ] After 395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 40 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 1205/1205 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 40 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2022-06-10 11:53:31] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
// Phase 1: matrix 680 rows 416 cols
[2022-06-10 11:53:31] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-10 11:53:31] [INFO ] Implicit Places using invariants in 288 ms returned []
[2022-06-10 11:53:31] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
// Phase 1: matrix 680 rows 416 cols
[2022-06-10 11:53:31] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 11:53:32] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-10 11:53:32] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1183 ms to find 0 implicit places.
[2022-06-10 11:53:32] [INFO ] Redundant transitions in 19 ms returned []
[2022-06-10 11:53:32] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
// Phase 1: matrix 680 rows 416 cols
[2022-06-10 11:53:32] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-10 11:53:33] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 1205/1205 transitions.
Ensure Unique test removed 525 transitions
Reduce isomorphic transitions removed 525 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 416 transition count 669
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 547 place count 405 transition count 669
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 547 place count 405 transition count 600
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 685 place count 336 transition count 600
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 939 place count 209 transition count 473
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1003 place count 145 transition count 345
Iterating global reduction 2 with 64 rules applied. Total rules applied 1067 place count 145 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1068 place count 145 transition count 344
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1068 place count 145 transition count 343
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1070 place count 144 transition count 343
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1133 place count 81 transition count 217
Iterating global reduction 3 with 63 rules applied. Total rules applied 1196 place count 81 transition count 217
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1259 place count 18 transition count 91
Iterating global reduction 3 with 63 rules applied. Total rules applied 1322 place count 18 transition count 91
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1385 place count 18 transition count 28
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1385 place count 18 transition count 27
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1387 place count 17 transition count 27
Applied a total of 1387 rules in 16 ms. Remains 17 /416 variables (removed 399) and now considering 27/1205 (removed 1178) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 27 rows 17 cols
[2022-06-10 11:53:33] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 11:53:33] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 11:53:33] [INFO ] After 6ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 11:53:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-10 11:53:33] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 11:53:33] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 11:53:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-10 11:53:33] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 11:53:33] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 11:53:33] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-06-10 11:53:33] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-10 11:53:33] [INFO ] Flatten gal took : 11 ms
[2022-06-10 11:53:33] [INFO ] Flatten gal took : 9 ms
[2022-06-10 11:53:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2067982781726317718.gal : 1 ms
[2022-06-10 11:53:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1481511533193836791.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16913323484009380851;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2067982781726317718.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1481511533193836791.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality1481511533193836791.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 578
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :578 after 3858
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3858 after 198387
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :198387 after 619443
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :619443 after 1.45829e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.45829e+06 after 3.13272e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3.13272e+06 after 6.47832e+06
Detected timeout of ITS tools.
[2022-06-10 11:53:48] [INFO ] Flatten gal took : 3 ms
[2022-06-10 11:53:48] [INFO ] Applying decomposition
[2022-06-10 11:53:48] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2511900832117828788.txt' '-o' '/tmp/graph2511900832117828788.bin' '-w' '/tmp/graph2511900832117828788.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2511900832117828788.bin' '-l' '-1' '-v' '-w' '/tmp/graph2511900832117828788.weights' '-q' '0' '-e' '0.001'
[2022-06-10 11:53:48] [INFO ] Decomposing Gal with order
[2022-06-10 11:53:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 11:53:48] [INFO ] Removed a total of 20 redundant transitions.
[2022-06-10 11:53:48] [INFO ] Flatten gal took : 2 ms
[2022-06-10 11:53:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-06-10 11:53:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15672728252110116086.gal : 1 ms
[2022-06-10 11:53:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3810739477420745498.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16913323484009380851;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15672728252110116086.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3810739477420745498.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality3810739477420745498.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 1018
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1018 after 34902
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15138788020623250928
[2022-06-10 11:54:03] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15138788020623250928
Running compilation step : cd /tmp/ltsmin15138788020623250928;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 82 ms.
Running link step : cd /tmp/ltsmin15138788020623250928;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin15138788020623250928;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf0==true'
LTSmin run took 616 ms.
Found Violation
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 84 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 104 ms :[p0, p0, p0]
Support contains 1 out of 605 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 605/605 places, 1586/1586 transitions.
Applied a total of 0 rules in 10 ms. Remains 605 /605 variables (removed 0) and now considering 1586/1586 (removed 0) transitions.
[2022-06-10 11:54:04] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2022-06-10 11:54:04] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-10 11:54:04] [INFO ] Implicit Places using invariants in 378 ms returned []
[2022-06-10 11:54:04] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2022-06-10 11:54:04] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 11:54:05] [INFO ] State equation strengthened by 262 read => feed constraints.
[2022-06-10 11:54:06] [INFO ] Implicit Places using invariants and state equation in 2130 ms returned []
Implicit Place search using SMT with State Equation took 2508 ms to find 0 implicit places.
[2022-06-10 11:54:06] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2022-06-10 11:54:07] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 11:54:07] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 605/605 places, 1586/1586 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 96 ms :[p0, p0, p0]
Finished random walk after 6850 steps, including 2 resets, run visited all 1 properties in 15 ms. (steps per millisecond=456 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 100 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 105 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 98 ms :[p0, p0, p0]
Product exploration explored 100000 steps with 1 reset in 398 ms.
Product exploration explored 100000 steps with 6 reset in 476 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 94 ms :[p0, p0, p0]
Support contains 1 out of 605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 605/605 places, 1586/1586 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 605 transition count 1584
Applied a total of 2 rules in 139 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1586 (removed 2) transitions.
[2022-06-10 11:54:09] [INFO ] Redundant transitions in 31 ms returned []
[2022-06-10 11:54:09] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2022-06-10 11:54:09] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 11:54:09] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 605/605 places, 1584/1586 transitions.
Finished structural reductions, in 1 iterations. Remains : 605/605 places, 1584/1586 transitions.
Product exploration explored 100000 steps with 5 reset in 401 ms.
Product exploration explored 100000 steps with 0 reset in 480 ms.
Built C files in :
/tmp/ltsmin3570623653412063158
[2022-06-10 11:54:10] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3570623653412063158
Running compilation step : cd /tmp/ltsmin3570623653412063158;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2745 ms.
Running link step : cd /tmp/ltsmin3570623653412063158;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin3570623653412063158;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4962959432592148919.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 605 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 605/605 places, 1586/1586 transitions.
Applied a total of 0 rules in 9 ms. Remains 605 /605 variables (removed 0) and now considering 1586/1586 (removed 0) transitions.
[2022-06-10 11:54:25] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2022-06-10 11:54:25] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-10 11:54:26] [INFO ] Implicit Places using invariants in 410 ms returned []
[2022-06-10 11:54:26] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2022-06-10 11:54:26] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 11:54:26] [INFO ] State equation strengthened by 262 read => feed constraints.
[2022-06-10 11:54:28] [INFO ] Implicit Places using invariants and state equation in 1962 ms returned []
Implicit Place search using SMT with State Equation took 2373 ms to find 0 implicit places.
[2022-06-10 11:54:28] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2022-06-10 11:54:28] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 11:54:28] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 605/605 places, 1586/1586 transitions.
Built C files in :
/tmp/ltsmin12662369024913271766
[2022-06-10 11:54:28] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12662369024913271766
Running compilation step : cd /tmp/ltsmin12662369024913271766;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12662369024913271766;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12662369024913271766;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-10 11:54:31] [INFO ] Flatten gal took : 54 ms
[2022-06-10 11:54:31] [INFO ] Flatten gal took : 45 ms
[2022-06-10 11:54:31] [INFO ] Time to serialize gal into /tmp/LTL18397312129327259854.gal : 16 ms
[2022-06-10 11:54:31] [INFO ] Time to serialize properties into /tmp/LTL10271570095156509347.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18397312129327259854.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10271570095156509347.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1839731...268
Read 1 LTL properties
Checking formula 0 : !((!((!(X("(l758>=2)")))U(G(X(G("(l758>=2)")))))))
Formula 0 simplified : !X"(l758>=2)" U GXG"(l758>=2)"
Detected timeout of ITS tools.
[2022-06-10 11:54:47] [INFO ] Flatten gal took : 40 ms
[2022-06-10 11:54:47] [INFO ] Applying decomposition
[2022-06-10 11:54:47] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13886110824890722013.txt' '-o' '/tmp/graph13886110824890722013.bin' '-w' '/tmp/graph13886110824890722013.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13886110824890722013.bin' '-l' '-1' '-v' '-w' '/tmp/graph13886110824890722013.weights' '-q' '0' '-e' '0.001'
[2022-06-10 11:54:47] [INFO ] Decomposing Gal with order
[2022-06-10 11:54:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 11:54:47] [INFO ] Removed a total of 2630 redundant transitions.
[2022-06-10 11:54:47] [INFO ] Flatten gal took : 81 ms
[2022-06-10 11:54:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 1101 labels/synchronizations in 28 ms.
[2022-06-10 11:54:47] [INFO ] Time to serialize gal into /tmp/LTL14348922470559060336.gal : 6 ms
[2022-06-10 11:54:47] [INFO ] Time to serialize properties into /tmp/LTL13795543357008608368.ltl : 292 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14348922470559060336.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13795543357008608368.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1434892...247
Read 1 LTL properties
Checking formula 0 : !((!((!(X("(i6.u106.l758>=2)")))U(G(X(G("(i6.u106.l758>=2)")))))))
Formula 0 simplified : !X"(i6.u106.l758>=2)" U GXG"(i6.u106.l758>=2)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17152156766521723095
[2022-06-10 11:55:02] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17152156766521723095
Running compilation step : cd /tmp/ltsmin17152156766521723095;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2739 ms.
Running link step : cd /tmp/ltsmin17152156766521723095;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin17152156766521723095;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '!(!X((LTLAPp0==true)) U [](X([]((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c016-LTLCardinality-03 finished in 118087 ms.
[2022-06-10 11:55:17] [INFO ] Flatten gal took : 47 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2127996590622134532
[2022-06-10 11:55:17] [INFO ] Too many transitions (1744) to apply POR reductions. Disabling POR matrices.
[2022-06-10 11:55:17] [INFO ] Applying decomposition
[2022-06-10 11:55:17] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2127996590622134532
Running compilation step : cd /tmp/ltsmin2127996590622134532;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-10 11:55:17] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17264469988421116502.txt' '-o' '/tmp/graph17264469988421116502.bin' '-w' '/tmp/graph17264469988421116502.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17264469988421116502.bin' '-l' '-1' '-v' '-w' '/tmp/graph17264469988421116502.weights' '-q' '0' '-e' '0.001'
[2022-06-10 11:55:18] [INFO ] Decomposing Gal with order
[2022-06-10 11:55:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 11:55:18] [INFO ] Removed a total of 2915 redundant transitions.
[2022-06-10 11:55:18] [INFO ] Flatten gal took : 85 ms
[2022-06-10 11:55:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 1333 labels/synchronizations in 38 ms.
[2022-06-10 11:55:18] [INFO ] Time to serialize gal into /tmp/LTLCardinality15801580584011439326.gal : 10 ms
[2022-06-10 11:55:18] [INFO ] Time to serialize properties into /tmp/LTLCardinality16833806679628201451.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15801580584011439326.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16833806679628201451.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...269
Read 1 LTL properties
Checking formula 0 : !((!((!(X("(i20.i0.u105.l758>=2)")))U(G(X(G("(i20.i0.u105.l758>=2)")))))))
Formula 0 simplified : !X"(i20.i0.u105.l758>=2)" U GXG"(i20.i0.u105.l758>=2)"
Compilation finished in 3325 ms.
Running link step : cd /tmp/ltsmin2127996590622134532;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2127996590622134532;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '!(!X((LTLAPp0==true)) U [](X([]((LTLAPp0==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-06-10 12:18:13] [INFO ] Flatten gal took : 100 ms
[2022-06-10 12:18:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality17412740043417281844.gal : 14 ms
[2022-06-10 12:18:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality13524999460967980140.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17412740043417281844.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13524999460967980140.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...290
Read 1 LTL properties
Checking formula 0 : !((!((!(X("(l758>=2)")))U(G(X(G("(l758>=2)")))))))
Formula 0 simplified : !X"(l758>=2)" U GXG"(l758>=2)"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.016: LTL layer: formula: !(!X((LTLAPp0==true)) U [](X([]((LTLAPp0==true)))))
pins2lts-mc-linux64( 4/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.018: "!(!X((LTLAPp0==true)) U [](X([]((LTLAPp0==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.021: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.047: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.188: DFS-FIFO for weak LTL, using special progress label 1746
pins2lts-mc-linux64( 0/ 8), 0.188: There are 1747 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.188: State length is 675, there are 1748 groups
pins2lts-mc-linux64( 0/ 8), 0.188: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.188: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.188: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.188: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.277: ~1 levels ~960 states ~4832 transitions
pins2lts-mc-linux64( 0/ 8), 0.398: ~1 levels ~1920 states ~10896 transitions
pins2lts-mc-linux64( 0/ 8), 0.569: ~1 levels ~3840 states ~22624 transitions
pins2lts-mc-linux64( 4/ 8), 0.901: ~1 levels ~7680 states ~43128 transitions
pins2lts-mc-linux64( 4/ 8), 1.559: ~1 levels ~15360 states ~88944 transitions
pins2lts-mc-linux64( 7/ 8), 2.794: ~1 levels ~30720 states ~196912 transitions
pins2lts-mc-linux64( 4/ 8), 5.014: ~1 levels ~61440 states ~379424 transitions
pins2lts-mc-linux64( 4/ 8), 9.584: ~1 levels ~122880 states ~786616 transitions
pins2lts-mc-linux64( 4/ 8), 17.942: ~1 levels ~245760 states ~1566176 transitions
pins2lts-mc-linux64( 4/ 8), 34.435: ~1 levels ~491520 states ~3276792 transitions
pins2lts-mc-linux64( 4/ 8), 66.216: ~1 levels ~983040 states ~6581520 transitions
pins2lts-mc-linux64( 4/ 8), 132.073: ~1 levels ~1966080 states ~13764536 transitions
pins2lts-mc-linux64( 4/ 8), 259.648: ~1 levels ~3932160 states ~27099344 transitions
pins2lts-mc-linux64( 4/ 8), 522.397: ~1 levels ~7864320 states ~57179592 transitions
pins2lts-mc-linux64( 4/ 8), 1026.019: ~1 levels ~15728640 states ~111378424 transitions
pins2lts-mc-linux64( 0/ 8), 1581.481: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1581.961:
pins2lts-mc-linux64( 0/ 8), 1581.962: mean standard work distribution: 3.1% (states) 6.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 1581.962:
pins2lts-mc-linux64( 0/ 8), 1581.962: Explored 23134369 states 185807884 transitions, fanout: 8.032
pins2lts-mc-linux64( 0/ 8), 1581.962: Total exploration time 1581.740 sec (1581.260 sec minimum, 1581.368 sec on average)
pins2lts-mc-linux64( 0/ 8), 1581.962: States per second: 14626, Transitions per second: 117471
pins2lts-mc-linux64( 0/ 8), 1581.962:
pins2lts-mc-linux64( 0/ 8), 1581.962: Progress states detected: 47983450
pins2lts-mc-linux64( 0/ 8), 1581.962: Redundant explorations: -51.7868
pins2lts-mc-linux64( 0/ 8), 1581.962:
pins2lts-mc-linux64( 0/ 8), 1581.962: Queue width: 8B, total height: 42219648, memory: 322.11MB
pins2lts-mc-linux64( 0/ 8), 1581.962: Tree memory: 622.1MB, 13.6 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 1581.962: Tree fill ratio (roots/leafs): 35.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1581.962: Stored 1778 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1581.962: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1581.962: Est. total memory use: 944.2MB (~1346.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2127996590622134532;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '!(!X((LTLAPp0==true)) U [](X([]((LTLAPp0==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2127996590622134532;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '!(!X((LTLAPp0==true)) U [](X([]((LTLAPp0==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-06-10 12:41:29] [INFO ] Flatten gal took : 382 ms
[2022-06-10 12:41:30] [INFO ] Input system was already deterministic with 1744 transitions.
[2022-06-10 12:41:30] [INFO ] Transformed 674 places.
[2022-06-10 12:41:31] [INFO ] Transformed 1744 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-10 12:41:31] [INFO ] Time to serialize gal into /tmp/LTLCardinality18394273301685570779.gal : 15 ms
[2022-06-10 12:41:31] [INFO ] Time to serialize properties into /tmp/LTLCardinality15343691958478369423.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality18394273301685570779.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15343691958478369423.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...335
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((!((!(X("(l758>=2)")))U(G(X(G("(l758>=2)")))))))
Formula 0 simplified : !X"(l758>=2)" U GXG"(l758>=2)"
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-c016"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-c016, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r312-tall-165472282300499"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c016.tgz
mv FunctionPointer-PT-c016 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;