About the Execution of ITS-Tools for DES-PT-40a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8900.136 | 3600000.00 | 8873365.00 | 5474.40 | TTF?FTFFFF?FFTTT | 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.r042-smll-165252095800499.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 DES-PT-40a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-smll-165252095800499
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 332K
-rw-r--r-- 1 mcc users 6.7K Apr 29 15:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 29 15:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 29 15:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 29 15:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 9 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 83K May 10 09:33 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 DES-PT-40a-LTLCardinality-00
FORMULA_NAME DES-PT-40a-LTLCardinality-01
FORMULA_NAME DES-PT-40a-LTLCardinality-02
FORMULA_NAME DES-PT-40a-LTLCardinality-03
FORMULA_NAME DES-PT-40a-LTLCardinality-04
FORMULA_NAME DES-PT-40a-LTLCardinality-05
FORMULA_NAME DES-PT-40a-LTLCardinality-06
FORMULA_NAME DES-PT-40a-LTLCardinality-07
FORMULA_NAME DES-PT-40a-LTLCardinality-08
FORMULA_NAME DES-PT-40a-LTLCardinality-09
FORMULA_NAME DES-PT-40a-LTLCardinality-10
FORMULA_NAME DES-PT-40a-LTLCardinality-11
FORMULA_NAME DES-PT-40a-LTLCardinality-12
FORMULA_NAME DES-PT-40a-LTLCardinality-13
FORMULA_NAME DES-PT-40a-LTLCardinality-14
FORMULA_NAME DES-PT-40a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652759762366
Running Version 202205111006
[2022-05-17 03:56:04] [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-05-17 03:56:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 03:56:04] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2022-05-17 03:56:04] [INFO ] Transformed 274 places.
[2022-05-17 03:56:04] [INFO ] Transformed 231 transitions.
[2022-05-17 03:56:04] [INFO ] Found NUPN structural information;
[2022-05-17 03:56:04] [INFO ] Parsed PT model containing 274 places and 231 transitions in 357 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-40a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 273 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 273 transition count 216
Applied a total of 2 rules in 70 ms. Remains 273 /274 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 273 cols
[2022-05-17 03:56:04] [INFO ] Computed 59 place invariants in 51 ms
[2022-05-17 03:56:05] [INFO ] Implicit Places using invariants in 649 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 697 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 272/274 places, 216/217 transitions.
Applied a total of 0 rules in 19 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 272/274 places, 216/217 transitions.
Support contains 24 out of 272 places after structural reductions.
[2022-05-17 03:56:05] [INFO ] Flatten gal took : 94 ms
[2022-05-17 03:56:05] [INFO ] Flatten gal took : 46 ms
[2022-05-17 03:56:06] [INFO ] Input system was already deterministic with 216 transitions.
Incomplete random walk after 10000 steps, including 224 resets, run finished after 708 ms. (steps per millisecond=14 ) properties (out of 13) seen :7
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 03:56:07] [INFO ] Computed 58 place invariants in 14 ms
[2022-05-17 03:56:07] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-17 03:56:07] [INFO ] [Nat]Absence check using 33 positive place invariants in 16 ms returned sat
[2022-05-17 03:56:07] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 69 ms returned sat
[2022-05-17 03:56:08] [INFO ] After 696ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-17 03:56:09] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 7 ms to minimize.
[2022-05-17 03:56:09] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 2 ms to minimize.
[2022-05-17 03:56:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 299 ms
[2022-05-17 03:56:09] [INFO ] After 1369ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 240 ms.
[2022-05-17 03:56:09] [INFO ] After 1942ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 1 properties in 1051 ms.
Support contains 10 out of 272 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 272/272 places, 216/216 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 272 transition count 214
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 272 transition count 214
Applied a total of 8 rules in 38 ms. Remains 272 /272 variables (removed 0) and now considering 214/216 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 272/272 places, 214/216 transitions.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 394756 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 394756 steps, saw 58229 distinct states, run finished after 3003 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 214 rows 272 cols
[2022-05-17 03:56:14] [INFO ] Computed 60 place invariants in 7 ms
[2022-05-17 03:56:14] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-17 03:56:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 03:56:14] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 94 ms returned sat
[2022-05-17 03:56:15] [INFO ] After 515ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-17 03:56:15] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-17 03:56:15] [INFO ] After 195ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-17 03:56:15] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 3 ms to minimize.
[2022-05-17 03:56:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2022-05-17 03:56:15] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 1 ms to minimize.
[2022-05-17 03:56:16] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 1 ms to minimize.
[2022-05-17 03:56:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 281 ms
[2022-05-17 03:56:16] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 1 ms to minimize.
[2022-05-17 03:56:16] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 1 ms to minimize.
[2022-05-17 03:56:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 309 ms
[2022-05-17 03:56:16] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2022-05-17 03:56:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2022-05-17 03:56:16] [INFO ] After 1299ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 239 ms.
[2022-05-17 03:56:16] [INFO ] After 2351ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 549 ms.
Support contains 10 out of 272 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 23 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 272/272 places, 214/214 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 13 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 272 cols
[2022-05-17 03:56:17] [INFO ] Computed 60 place invariants in 7 ms
[2022-05-17 03:56:17] [INFO ] Implicit Places using invariants in 351 ms returned []
// Phase 1: matrix 214 rows 272 cols
[2022-05-17 03:56:17] [INFO ] Computed 60 place invariants in 24 ms
[2022-05-17 03:56:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-17 03:56:18] [INFO ] Implicit Places using invariants and state equation in 763 ms returned []
Implicit Place search using SMT with State Equation took 1119 ms to find 0 implicit places.
[2022-05-17 03:56:18] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 214 rows 272 cols
[2022-05-17 03:56:18] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 03:56:18] [INFO ] Dead Transitions using invariants and state equation in 343 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 272/272 places, 214/214 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 272 transition count 214
Applied a total of 1 rules in 28 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 214 rows 272 cols
[2022-05-17 03:56:18] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 03:56:19] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-17 03:56:19] [INFO ] [Nat]Absence check using 35 positive place invariants in 11 ms returned sat
[2022-05-17 03:56:19] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 89 ms returned sat
[2022-05-17 03:56:20] [INFO ] After 678ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-17 03:56:20] [INFO ] After 1073ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 232 ms.
[2022-05-17 03:56:20] [INFO ] After 1599ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2022-05-17 03:56:20] [INFO ] Flatten gal took : 48 ms
[2022-05-17 03:56:20] [INFO ] Flatten gal took : 46 ms
[2022-05-17 03:56:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14936432855508679538.gal : 22 ms
[2022-05-17 03:56:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14475118380818875364.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms2321028093348815612;'/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/ReachabilityCardinality14936432855508679538.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14475118380818875364.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/ReachabilityCardinality14475118380818875364.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :5 after 15
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :15 after 33
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :33 after 47
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :47 after 1078
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :1078 after 1705
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :1705 after 3553
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :13397 after 203961
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :203961 after 730229
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :730229 after 6.22745e+06
Detected timeout of ITS tools.
[2022-05-17 03:56:35] [INFO ] Flatten gal took : 29 ms
[2022-05-17 03:56:35] [INFO ] Applying decomposition
[2022-05-17 03:56:35] [INFO ] Flatten gal took : 27 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/graph3320831244332607636.txt' '-o' '/tmp/graph3320831244332607636.bin' '-w' '/tmp/graph3320831244332607636.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3320831244332607636.bin' '-l' '-1' '-v' '-w' '/tmp/graph3320831244332607636.weights' '-q' '0' '-e' '0.001'
[2022-05-17 03:56:36] [INFO ] Decomposing Gal with order
[2022-05-17 03:56:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 03:56:36] [INFO ] Removed a total of 56 redundant transitions.
[2022-05-17 03:56:36] [INFO ] Flatten gal took : 95 ms
[2022-05-17 03:56:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 15 ms.
[2022-05-17 03:56:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12824670313546628972.gal : 16 ms
[2022-05-17 03:56:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17603837563542114527.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms2321028093348815612;'/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/ReachabilityCardinality12824670313546628972.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17603837563542114527.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...300
Loading property file /tmp/ReachabilityCardinality17603837563542114527.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :5 after 9
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :9 after 153
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :153 after 10749
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :10749 after 1.66757e+09
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :1.66757e+09 after 2.9263e+09
Reachability property AtomicPropp3 is true.
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :2.9263e+09 after 4.48606e+09
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :4.48606e+09 after 5.93936e+09
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :5.93936e+09 after 8.50348e+09
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :5.47366e+12 after 5.49369e+12
Reachability property AtomicPropp8 is true.
Reachability property AtomicPropp2 is true.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.31656e+13 after 1.36784e+13
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.91841e+13,11.674,219788,22227,4527,473882,23394,361,664985,395,164745,0
Total reachable state count : 19184065225263
Verifying 5 reachability properties.
Reachability property AtomicPropp0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp0,1024,11.7166,219788,72,215,473882,23394,362,664985,398,164745,111
Reachability property AtomicPropp2 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp2,8.81798e+06,11.7273,219788,88,211,473882,23394,380,664985,405,164745,913
Reachability property AtomicPropp3 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp3,5.41676e+07,11.7283,219788,123,221,473882,23394,387,664985,409,164745,917
Reachability property AtomicPropp7 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp7,26244,11.7381,219788,61,180,473882,23394,388,664985,411,164745,920
Reachability property AtomicPropp8 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp8,8.35593e+10,11.7421,219788,1570,803,473882,23394,390,664985,413,164745,920
Computed a total of 175 stabilizing places and 170 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
Support contains 4 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 7 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 03:56:48] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 03:56:48] [INFO ] Implicit Places using invariants in 382 ms returned []
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 03:56:48] [INFO ] Computed 58 place invariants in 5 ms
[2022-05-17 03:56:49] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 977 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 03:56:49] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 03:56:49] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 272/272 places, 216/216 transitions.
Stuttering acceptance computed with spot in 358 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DES-PT-40a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (EQ s128 0) (EQ s208 1)), p1:(OR (EQ s161 0) (EQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1146 ms.
Product exploration explored 100000 steps with 50000 reset in 680 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 6 factoid took 113 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DES-PT-40a-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-40a-LTLCardinality-01 finished in 3607 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 17 ms. Remains 271 /272 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 271 cols
[2022-05-17 03:56:51] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 03:56:52] [INFO ] Implicit Places using invariants in 253 ms returned []
// Phase 1: matrix 215 rows 271 cols
[2022-05-17 03:56:52] [INFO ] Computed 58 place invariants in 5 ms
[2022-05-17 03:56:52] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
[2022-05-17 03:56:52] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 215 rows 271 cols
[2022-05-17 03:56:52] [INFO ] Computed 58 place invariants in 7 ms
[2022-05-17 03:56:52] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 271/272 places, 215/216 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-40a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s216 0) (EQ s136 1) (OR (EQ s238 0) (EQ s238 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 1 ms.
FORMULA DES-PT-40a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLCardinality-02 finished in 1078 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 03:56:52] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 03:56:53] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 03:56:53] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 03:56:53] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 03:56:53] [INFO ] Computed 58 place invariants in 10 ms
[2022-05-17 03:56:53] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 272/272 places, 216/216 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40a-LTLCardinality-03 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 (EQ s100 0) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2215 reset in 684 ms.
Product exploration explored 100000 steps with 2219 reset in 454 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/272 stabilizing places and 170/216 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 261 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 94 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 214 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 998284 steps, run timeout after 3001 ms. (steps per millisecond=332 ) properties seen :{}
Probabilistic random walk after 998284 steps, saw 142675 distinct states, run finished after 3001 ms. (steps per millisecond=332 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 03:56:58] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 03:56:58] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 03:56:58] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2022-05-17 03:56:58] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 79 ms returned sat
[2022-05-17 03:56:59] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 03:56:59] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 3 ms to minimize.
[2022-05-17 03:56:59] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2022-05-17 03:56:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 236 ms
[2022-05-17 03:56:59] [INFO ] After 469ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-17 03:56:59] [INFO ] After 646ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 272/272 places, 216/216 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 272 transition count 214
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 272 transition count 214
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 271 transition count 213
Applied a total of 9 rules in 63 ms. Remains 271 /272 variables (removed 1) and now considering 213/216 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/272 places, 213/216 transitions.
Incomplete random walk after 10000 steps, including 144 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1072673 steps, run timeout after 3001 ms. (steps per millisecond=357 ) properties seen :{}
Probabilistic random walk after 1072673 steps, saw 150659 distinct states, run finished after 3001 ms. (steps per millisecond=357 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 03:57:02] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 03:57:02] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 03:57:02] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned sat
[2022-05-17 03:57:02] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 21 ms returned sat
[2022-05-17 03:57:02] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 03:57:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 03:57:02] [INFO ] After 17ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 03:57:02] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2022-05-17 03:57:02] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2022-05-17 03:57:03] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 1 ms to minimize.
[2022-05-17 03:57:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 317 ms
[2022-05-17 03:57:03] [INFO ] After 348ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-17 03:57:03] [INFO ] After 626ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 271 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 16 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 16 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 03:57:03] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 03:57:03] [INFO ] Implicit Places using invariants in 345 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 03:57:03] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 03:57:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 03:57:04] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 1262 ms to find 0 implicit places.
[2022-05-17 03:57:04] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 03:57:04] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 03:57:04] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 271 transition count 213
Applied a total of 1 rules in 33 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 03:57:04] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 03:57:04] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 03:57:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2022-05-17 03:57:05] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 35 ms returned sat
[2022-05-17 03:57:05] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 03:57:05] [INFO ] After 233ms 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-05-17 03:57:05] [INFO ] After 402ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 03:57:05] [INFO ] Flatten gal took : 35 ms
[2022-05-17 03:57:05] [INFO ] Flatten gal took : 33 ms
[2022-05-17 03:57:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11147666073824190697.gal : 4 ms
[2022-05-17 03:57:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17333328273050446938.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms16749456799586219996;'/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/ReachabilityCardinality11147666073824190697.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17333328273050446938.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/ReachabilityCardinality17333328273050446938.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 16
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :16 after 26
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :26 after 38
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :38 after 504
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :504 after 1966
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1966 after 7844
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :7844 after 95560
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :95560 after 193408
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :455944 after 7.65818e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :7.65818e+08 after 7.67136e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :8.25068e+08 after 2.99114e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :8.84057e+09 after 8.84309e+09
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :3.66285e+10 after 3.66345e+10
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :9.7551e+10 after 1.85415e+11
Detected timeout of ITS tools.
[2022-05-17 03:57:20] [INFO ] Flatten gal took : 18 ms
[2022-05-17 03:57:20] [INFO ] Applying decomposition
[2022-05-17 03:57:20] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14948670303312191817.txt' '-o' '/tmp/graph14948670303312191817.bin' '-w' '/tmp/graph14948670303312191817.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14948670303312191817.bin' '-l' '-1' '-v' '-w' '/tmp/graph14948670303312191817.weights' '-q' '0' '-e' '0.001'
[2022-05-17 03:57:20] [INFO ] Decomposing Gal with order
[2022-05-17 03:57:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 03:57:20] [INFO ] Removed a total of 55 redundant transitions.
[2022-05-17 03:57:20] [INFO ] Flatten gal took : 34 ms
[2022-05-17 03:57:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 3 ms.
[2022-05-17 03:57:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11112217545512209945.gal : 4 ms
[2022-05-17 03:57:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6032563691069867790.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms16749456799586219996;'/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/ReachabilityCardinality11112217545512209945.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6032563691069867790.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/ReachabilityCardinality6032563691069867790.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 52
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :52 after 666
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :666 after 10748
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :10748 after 2.7689e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.7689e+08 after 4.58095e+08
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,7.25923e+08,0.601571,20584,1423,529,36867,2455,277,55942,384,6970,0
Total reachable state count : 725922688
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,348,0.604417,20848,90,156,36867,2455,284,55942,389,6970,0
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 267 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 123 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 6 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 03:57:21] [INFO ] Computed 58 place invariants in 5 ms
[2022-05-17 03:57:22] [INFO ] Implicit Places using invariants in 460 ms returned []
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 03:57:22] [INFO ] Computed 58 place invariants in 7 ms
[2022-05-17 03:57:22] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 1242 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 03:57:22] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 03:57:23] [INFO ] Dead Transitions using invariants and state equation in 319 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 272/272 places, 216/216 transitions.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/272 stabilizing places and 170/216 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 287 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 :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 214 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 889974 steps, run timeout after 3001 ms. (steps per millisecond=296 ) properties seen :{}
Probabilistic random walk after 889974 steps, saw 130633 distinct states, run finished after 3001 ms. (steps per millisecond=296 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 03:57:26] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 03:57:26] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 03:57:26] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2022-05-17 03:57:26] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 84 ms returned sat
[2022-05-17 03:57:27] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 03:57:27] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 2 ms to minimize.
[2022-05-17 03:57:27] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2022-05-17 03:57:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 225 ms
[2022-05-17 03:57:27] [INFO ] After 466ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-17 03:57:27] [INFO ] After 656ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 272/272 places, 216/216 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 272 transition count 214
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 272 transition count 214
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 271 transition count 213
Applied a total of 9 rules in 52 ms. Remains 271 /272 variables (removed 1) and now considering 213/216 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/272 places, 213/216 transitions.
Incomplete random walk after 10000 steps, including 143 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1080911 steps, run timeout after 3001 ms. (steps per millisecond=360 ) properties seen :{}
Probabilistic random walk after 1080911 steps, saw 151565 distinct states, run finished after 3001 ms. (steps per millisecond=360 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 03:57:30] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-17 03:57:30] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 03:57:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 11 ms returned sat
[2022-05-17 03:57:30] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 24 ms returned sat
[2022-05-17 03:57:30] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 03:57:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 03:57:30] [INFO ] After 20ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 03:57:31] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 0 ms to minimize.
[2022-05-17 03:57:31] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2022-05-17 03:57:31] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 0 ms to minimize.
[2022-05-17 03:57:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 274 ms
[2022-05-17 03:57:31] [INFO ] After 310ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-17 03:57:31] [INFO ] After 642ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 271 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 16 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 14 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 03:57:31] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 03:57:31] [INFO ] Implicit Places using invariants in 340 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 03:57:31] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 03:57:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 03:57:32] [INFO ] Implicit Places using invariants and state equation in 645 ms returned []
Implicit Place search using SMT with State Equation took 987 ms to find 0 implicit places.
[2022-05-17 03:57:32] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 03:57:32] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-17 03:57:32] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 271 transition count 213
Applied a total of 1 rules in 27 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 03:57:32] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 03:57:32] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 03:57:32] [INFO ] [Nat]Absence check using 35 positive place invariants in 11 ms returned sat
[2022-05-17 03:57:32] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 25 ms returned sat
[2022-05-17 03:57:33] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 03:57:33] [INFO ] After 243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-17 03:57:33] [INFO ] After 374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 03:57:33] [INFO ] Flatten gal took : 30 ms
[2022-05-17 03:57:33] [INFO ] Flatten gal took : 28 ms
[2022-05-17 03:57:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1775794127900318846.gal : 7 ms
[2022-05-17 03:57:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16659939118228783702.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1668835794990523611;'/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/ReachabilityCardinality1775794127900318846.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16659939118228783702.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/ReachabilityCardinality16659939118228783702.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 16
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :16 after 26
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :26 after 38
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :38 after 504
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :504 after 1966
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1966 after 7844
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :7844 after 95560
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :95560 after 193408
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :455944 after 7.65818e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :7.65818e+08 after 7.67136e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :8.25068e+08 after 2.99114e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :8.84057e+09 after 8.84309e+09
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :3.66285e+10 after 3.66345e+10
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :9.7551e+10 after 1.85415e+11
Detected timeout of ITS tools.
[2022-05-17 03:57:48] [INFO ] Flatten gal took : 14 ms
[2022-05-17 03:57:48] [INFO ] Applying decomposition
[2022-05-17 03:57:48] [INFO ] Flatten gal took : 15 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/graph14086793387946984805.txt' '-o' '/tmp/graph14086793387946984805.bin' '-w' '/tmp/graph14086793387946984805.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14086793387946984805.bin' '-l' '-1' '-v' '-w' '/tmp/graph14086793387946984805.weights' '-q' '0' '-e' '0.001'
[2022-05-17 03:57:48] [INFO ] Decomposing Gal with order
[2022-05-17 03:57:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 03:57:48] [INFO ] Removed a total of 22 redundant transitions.
[2022-05-17 03:57:48] [INFO ] Flatten gal took : 24 ms
[2022-05-17 03:57:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2022-05-17 03:57:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4678863574799487907.gal : 4 ms
[2022-05-17 03:57:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8411867337046998371.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms1668835794990523611;'/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/ReachabilityCardinality4678863574799487907.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8411867337046998371.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/ReachabilityCardinality8411867337046998371.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 52
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :52 after 666
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :666 after 10748
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :10748 after 1.66863e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.66863e+08 after 2.66652e+08
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.39157e+08,0.326383,13016,1012,482,19673,2331,244,27176,379,6637,0
Total reachable state count : 439157280
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,44544,0.327766,13280,87,163,19673,2331,250,27176,384,6637,0
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 226 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 121 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2216 reset in 392 ms.
Product exploration explored 100000 steps with 2201 reset in 469 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 39 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2022-05-17 03:57:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 03:57:50] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 03:57:50] [INFO ] Dead Transitions using invariants and state equation in 320 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 272/272 places, 216/216 transitions.
Product exploration explored 100000 steps with 2228 reset in 342 ms.
Product exploration explored 100000 steps with 2234 reset in 431 ms.
Built C files in :
/tmp/ltsmin13744267582765286040
[2022-05-17 03:57:51] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13744267582765286040
Running compilation step : cd /tmp/ltsmin13744267582765286040;'/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 813 ms.
Running link step : cd /tmp/ltsmin13744267582765286040;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin13744267582765286040;'/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/stateBased6692592701797746447.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 12 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 03:58:06] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 03:58:07] [INFO ] Implicit Places using invariants in 253 ms returned []
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 03:58:07] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 03:58:07] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 03:58:07] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 03:58:07] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 272/272 places, 216/216 transitions.
Built C files in :
/tmp/ltsmin9568711932831252540
[2022-05-17 03:58:07] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9568711932831252540
Running compilation step : cd /tmp/ltsmin9568711932831252540;'/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 581 ms.
Running link step : cd /tmp/ltsmin9568711932831252540;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin9568711932831252540;'/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/stateBased4480204463468436429.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 03:58:23] [INFO ] Flatten gal took : 15 ms
[2022-05-17 03:58:23] [INFO ] Flatten gal took : 13 ms
[2022-05-17 03:58:23] [INFO ] Time to serialize gal into /tmp/LTL12513361606639200772.gal : 6 ms
[2022-05-17 03:58:23] [INFO ] Time to serialize properties into /tmp/LTL15594710390331768552.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/LTL12513361606639200772.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15594710390331768552.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/LTL1251336...268
Read 1 LTL properties
Checking formula 0 : !((G(X("((p100==0)||(p29==1))"))))
Formula 0 simplified : !GX"((p100==0)||(p29==1))"
Detected timeout of ITS tools.
[2022-05-17 03:58:38] [INFO ] Flatten gal took : 13 ms
[2022-05-17 03:58:38] [INFO ] Applying decomposition
[2022-05-17 03:58:38] [INFO ] Flatten gal took : 12 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/graph4871739343476791554.txt' '-o' '/tmp/graph4871739343476791554.bin' '-w' '/tmp/graph4871739343476791554.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4871739343476791554.bin' '-l' '-1' '-v' '-w' '/tmp/graph4871739343476791554.weights' '-q' '0' '-e' '0.001'
[2022-05-17 03:58:38] [INFO ] Decomposing Gal with order
[2022-05-17 03:58:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 03:58:38] [INFO ] Removed a total of 47 redundant transitions.
[2022-05-17 03:58:38] [INFO ] Flatten gal took : 24 ms
[2022-05-17 03:58:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 4 ms.
[2022-05-17 03:58:38] [INFO ] Time to serialize gal into /tmp/LTL258555707041381390.gal : 4 ms
[2022-05-17 03:58:38] [INFO ] Time to serialize properties into /tmp/LTL5071942050609021267.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/LTL258555707041381390.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5071942050609021267.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/LTL2585557...244
Read 1 LTL properties
Checking formula 0 : !((G(X("((u13.p100==0)||(i3.u15.p29==1))"))))
Formula 0 simplified : !GX"((u13.p100==0)||(i3.u15.p29==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5979336955230221904
[2022-05-17 03:58:53] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5979336955230221904
Running compilation step : cd /tmp/ltsmin5979336955230221904;'/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 579 ms.
Running link step : cd /tmp/ltsmin5979336955230221904;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin5979336955230221904;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-40a-LTLCardinality-03 finished in 135425 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 6 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 03:59:08] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 03:59:08] [INFO ] Implicit Places using invariants in 246 ms returned []
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 03:59:08] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 03:59:09] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 946 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 03:59:09] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 03:59:09] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 272/272 places, 216/216 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s42 0) (EQ s176 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-40a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLCardinality-07 finished in 1268 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F(p0)||p0))))'
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 18 ms. Remains 271 /272 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 271 cols
[2022-05-17 03:59:09] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 03:59:09] [INFO ] Implicit Places using invariants in 253 ms returned []
// Phase 1: matrix 215 rows 271 cols
[2022-05-17 03:59:09] [INFO ] Computed 58 place invariants in 6 ms
[2022-05-17 03:59:10] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
[2022-05-17 03:59:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 215 rows 271 cols
[2022-05-17 03:59:10] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 03:59:10] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 271/272 places, 215/216 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s76 0) (EQ s263 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 52 steps with 1 reset in 0 ms.
FORMULA DES-PT-40a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLCardinality-08 finished in 1106 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(F(X(X(G(p0)))) U (p1 U X(X(p2))))))'
Support contains 5 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 03:59:10] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 03:59:11] [INFO ] Implicit Places using invariants in 249 ms returned []
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 03:59:11] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 03:59:11] [INFO ] Implicit Places using invariants and state equation in 715 ms returned []
Implicit Place search using SMT with State Equation took 967 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 03:59:11] [INFO ] Computed 58 place invariants in 7 ms
[2022-05-17 03:59:11] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 272/272 places, 216/216 transitions.
Stuttering acceptance computed with spot in 612 ms :[p2, p2, p2, p2, (AND p2 p0), p2, true, (AND p2 p0), (AND p2 p0), p0, (AND p0 (NOT p2))]
Running random walk in product with property : DES-PT-40a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=true, acceptance={} source=4 dest: 7}], [{ cond=p2, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 8}], [{ cond=(AND p0 p2), acceptance={} source=8 dest: 9}, { cond=p2, acceptance={} source=8 dest: 10}], [{ cond=p0, acceptance={0} source=9 dest: 9}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=10 dest: 9}, { cond=(NOT p2), acceptance={} source=10 dest: 10}]], initial=0, aps=[p1:(OR (EQ s6 0) (EQ s151 1)), p2:(EQ s51 1), p0:(OR (EQ s112 0) (EQ s111 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 18737 reset in 342 ms.
Product exploration explored 100000 steps with 18699 reset in 386 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/272 stabilizing places and 170/216 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X p1), true, (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 483 ms. Reduced automaton from 11 states, 17 edges and 3 AP to 11 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 457 ms :[p2, p2, p2, p2, (AND p2 p0), p2, true, (AND p2 p0), (AND p2 p0), p0, (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 215 resets, run finished after 478 ms. (steps per millisecond=20 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 477736 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :{}
Probabilistic random walk after 477736 steps, saw 79922 distinct states, run finished after 3001 ms. (steps per millisecond=159 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 03:59:18] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 03:59:18] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-17 03:59:18] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2022-05-17 03:59:18] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 52 ms returned sat
[2022-05-17 03:59:18] [INFO ] After 354ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-17 03:59:18] [INFO ] After 493ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 137 ms.
[2022-05-17 03:59:18] [INFO ] After 828ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 4 properties in 140 ms.
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 272/272 places, 216/216 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 272 transition count 214
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 272 transition count 214
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 271 transition count 213
Applied a total of 9 rules in 26 ms. Remains 271 /272 variables (removed 1) and now considering 213/216 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/272 places, 213/216 transitions.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1181070 steps, run timeout after 3001 ms. (steps per millisecond=393 ) properties seen :{}
Probabilistic random walk after 1181070 steps, saw 165418 distinct states, run finished after 3001 ms. (steps per millisecond=393 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 03:59:22] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 03:59:22] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 03:59:22] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 03:59:22] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 180 ms returned sat
[2022-05-17 03:59:22] [INFO ] After 341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 03:59:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 03:59:22] [INFO ] After 34ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 03:59:23] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2022-05-17 03:59:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2022-05-17 03:59:23] [INFO ] After 169ms 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-05-17 03:59:23] [INFO ] After 824ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 271 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 03:59:23] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 03:59:23] [INFO ] Implicit Places using invariants in 270 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 03:59:23] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 03:59:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 03:59:24] [INFO ] Implicit Places using invariants and state equation in 686 ms returned []
Implicit Place search using SMT with State Equation took 958 ms to find 0 implicit places.
[2022-05-17 03:59:24] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 03:59:24] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 03:59:24] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 271 transition count 213
Applied a total of 1 rules in 19 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 03:59:24] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 03:59:24] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 03:59:24] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2022-05-17 03:59:24] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 173 ms returned sat
[2022-05-17 03:59:25] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 03:59:25] [INFO ] After 323ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-05-17 03:59:25] [INFO ] After 640ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 03:59:25] [INFO ] Flatten gal took : 20 ms
[2022-05-17 03:59:25] [INFO ] Flatten gal took : 21 ms
[2022-05-17 03:59:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4979891836811686443.gal : 5 ms
[2022-05-17 03:59:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4729526274538233767.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms11752016456241287138;'/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/ReachabilityCardinality4979891836811686443.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4729526274538233767.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/ReachabilityCardinality4729526274538233767.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 16
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :16 after 26
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :26 after 38
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :38 after 504
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :504 after 1966
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1966 after 7844
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :7844 after 95560
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :95560 after 193408
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :455944 after 7.65818e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :7.65818e+08 after 7.67136e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :8.25068e+08 after 2.99114e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :8.84057e+09 after 8.84309e+09
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :3.66285e+10 after 3.66345e+10
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :9.7551e+10 after 1.85415e+11
Detected timeout of ITS tools.
[2022-05-17 03:59:40] [INFO ] Flatten gal took : 14 ms
[2022-05-17 03:59:40] [INFO ] Applying decomposition
[2022-05-17 03:59:40] [INFO ] Flatten gal took : 13 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/graph4922308202723426371.txt' '-o' '/tmp/graph4922308202723426371.bin' '-w' '/tmp/graph4922308202723426371.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4922308202723426371.bin' '-l' '-1' '-v' '-w' '/tmp/graph4922308202723426371.weights' '-q' '0' '-e' '0.001'
[2022-05-17 03:59:40] [INFO ] Decomposing Gal with order
[2022-05-17 03:59:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 03:59:40] [INFO ] Removed a total of 55 redundant transitions.
[2022-05-17 03:59:40] [INFO ] Flatten gal took : 25 ms
[2022-05-17 03:59:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 3 ms.
[2022-05-17 03:59:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality285594927607058123.gal : 3 ms
[2022-05-17 03:59:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13467942730778945843.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms11752016456241287138;'/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/ReachabilityCardinality285594927607058123.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13467942730778945843.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/ReachabilityCardinality13467942730778945843.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 52
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :52 after 670
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :670 after 10748
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :10748 after 1.67086e+09
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.67086e+09 after 2.83522e+09
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.83522e+09 after 4.43284e+09
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.43284e+09 after 7.19481e+09
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :8.55043e+12 after 8.58685e+12
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.91841e+13,12.3544,216744,24521,4656,482501,15295,283,651706,386,96649,0
Total reachable state count : 19184065225262
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,3072,12.4165,216744,51,203,482501,15295,284,651706,389,96649,4
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X p1), true, (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F (NOT p0)), (F (AND p0 p2)), (F p2)]
Knowledge based reduction with 7 factoid took 741 ms. Reduced automaton from 11 states, 17 edges and 3 AP to 11 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 498 ms :[p2, p2, p2, p2, (AND p2 p0), p2, true, (AND p2 p0), (AND p2 p0), p0, (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 483 ms :[p2, p2, p2, p2, (AND p2 p0), p2, true, (AND p2 p0), (AND p2 p0), p0, (AND p0 (NOT p2))]
Support contains 5 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 7 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 03:59:54] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 03:59:55] [INFO ] Implicit Places using invariants in 442 ms returned []
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 03:59:55] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 03:59:55] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 1075 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 03:59:55] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 03:59:55] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 272/272 places, 216/216 transitions.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/272 stabilizing places and 170/216 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p0), true, (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 384 ms. Reduced automaton from 11 states, 17 edges and 3 AP to 11 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 457 ms :[p2, p2, p2, p2, (AND p2 p0), p2, true, (AND p2 p0), (AND p2 p0), p0, (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 221 resets, run finished after 536 ms. (steps per millisecond=18 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 417534 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :{}
Probabilistic random walk after 417534 steps, saw 71641 distinct states, run finished after 3001 ms. (steps per millisecond=139 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 04:00:00] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 04:00:00] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-17 04:00:00] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2022-05-17 04:00:00] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 83 ms returned sat
[2022-05-17 04:00:01] [INFO ] After 557ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-17 04:00:01] [INFO ] After 785ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 208 ms.
[2022-05-17 04:00:02] [INFO ] After 1257ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 4 properties in 169 ms.
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 272/272 places, 216/216 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 272 transition count 214
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 272 transition count 214
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 271 transition count 213
Applied a total of 9 rules in 32 ms. Remains 271 /272 variables (removed 1) and now considering 213/216 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/272 places, 213/216 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1044370 steps, run timeout after 3001 ms. (steps per millisecond=348 ) properties seen :{}
Probabilistic random walk after 1044370 steps, saw 147200 distinct states, run finished after 3001 ms. (steps per millisecond=348 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:00:05] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 04:00:05] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 04:00:05] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 04:00:05] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 173 ms returned sat
[2022-05-17 04:00:05] [INFO ] After 331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 04:00:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 04:00:06] [INFO ] After 45ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-17 04:00:06] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2022-05-17 04:00:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-17 04:00:06] [INFO ] After 222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-05-17 04:00:06] [INFO ] After 862ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 271 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:00:06] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 04:00:06] [INFO ] Implicit Places using invariants in 259 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:00:06] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 04:00:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 04:00:07] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
[2022-05-17 04:00:07] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:00:07] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 04:00:07] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 271 transition count 213
Applied a total of 1 rules in 11 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:00:07] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 04:00:07] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 04:00:07] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 04:00:07] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 171 ms returned sat
[2022-05-17 04:00:07] [INFO ] After 237ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 04:00:07] [INFO ] After 266ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-17 04:00:07] [INFO ] After 564ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 04:00:07] [INFO ] Flatten gal took : 13 ms
[2022-05-17 04:00:07] [INFO ] Flatten gal took : 13 ms
[2022-05-17 04:00:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2864263364322436890.gal : 2 ms
[2022-05-17 04:00:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16544260765180484139.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms9203937976611292521;'/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/ReachabilityCardinality2864263364322436890.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16544260765180484139.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/ReachabilityCardinality16544260765180484139.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 16
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :16 after 26
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :26 after 38
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :38 after 504
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :504 after 1966
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1966 after 7844
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :7844 after 95560
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :95560 after 193408
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :455944 after 7.65818e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :7.65818e+08 after 7.67136e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :8.25068e+08 after 2.99114e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :8.84057e+09 after 8.84309e+09
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :3.66285e+10 after 3.66345e+10
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :9.7551e+10 after 1.85415e+11
Detected timeout of ITS tools.
[2022-05-17 04:00:23] [INFO ] Flatten gal took : 16 ms
[2022-05-17 04:00:23] [INFO ] Applying decomposition
[2022-05-17 04:00:23] [INFO ] Flatten gal took : 10 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/graph7386525201415519792.txt' '-o' '/tmp/graph7386525201415519792.bin' '-w' '/tmp/graph7386525201415519792.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7386525201415519792.bin' '-l' '-1' '-v' '-w' '/tmp/graph7386525201415519792.weights' '-q' '0' '-e' '0.001'
[2022-05-17 04:00:23] [INFO ] Decomposing Gal with order
[2022-05-17 04:00:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 04:00:23] [INFO ] Removed a total of 56 redundant transitions.
[2022-05-17 04:00:23] [INFO ] Flatten gal took : 27 ms
[2022-05-17 04:00:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 2 ms.
[2022-05-17 04:00:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8852320012924517244.gal : 3 ms
[2022-05-17 04:00:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2431014521608870830.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms9203937976611292521;'/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/ReachabilityCardinality8852320012924517244.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2431014521608870830.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/ReachabilityCardinality2431014521608870830.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 52
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :52 after 666
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :666 after 10748
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :10748 after 2.76914e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.76914e+08 after 4.58097e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4.58097e+08 after 7.25947e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :7.25947e+08 after 1.17498e+09
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :8.55043e+12 after 8.59305e+12
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.91841e+13,11.4868,190872,24528,4493,431831,15001,280,565176,376,95684,0
Total reachable state count : 19184065225262
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,8,11.5284,191136,56,166,431831,15001,281,565176,379,95684,4
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [(AND p1 (NOT p2) p0), true, (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F (NOT p0)), (F (AND p0 p2)), (F p2)]
Knowledge based reduction with 6 factoid took 441 ms. Reduced automaton from 11 states, 17 edges and 3 AP to 11 states, 17 edges and 3 AP.
Stuttering acceptance computed with spot in 409 ms :[p2, p2, p2, p2, (AND p2 p0), p2, true, (AND p2 p0), (AND p2 p0), p0, (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 398 ms :[p2, p2, p2, p2, (AND p2 p0), p2, true, (AND p2 p0), (AND p2 p0), p0, (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 416 ms :[p2, p2, p2, p2, (AND p2 p0), p2, true, (AND p2 p0), (AND p2 p0), p0, (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 18789 reset in 495 ms.
Product exploration explored 100000 steps with 18776 reset in 349 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 411 ms :[p2, p2, p2, p2, (AND p2 p0), p2, true, (AND p2 p0), (AND p2 p0), p0, (AND p0 (NOT p2))]
Support contains 5 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 11 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2022-05-17 04:00:37] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 04:00:37] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 04:00:38] [INFO ] Dead Transitions using invariants and state equation in 350 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 272/272 places, 216/216 transitions.
Product exploration explored 100000 steps with 18719 reset in 1064 ms.
Product exploration explored 100000 steps with 18749 reset in 884 ms.
Built C files in :
/tmp/ltsmin5096153647953998566
[2022-05-17 04:00:40] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5096153647953998566
Running compilation step : cd /tmp/ltsmin5096153647953998566;'/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 612 ms.
Running link step : cd /tmp/ltsmin5096153647953998566;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin5096153647953998566;'/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/stateBased3840420885888471725.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 04:00:55] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 04:00:55] [INFO ] Implicit Places using invariants in 308 ms returned []
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 04:00:55] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 04:00:56] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 948 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 04:00:56] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 04:00:56] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 272/272 places, 216/216 transitions.
Built C files in :
/tmp/ltsmin8073246736041598869
[2022-05-17 04:00:56] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8073246736041598869
Running compilation step : cd /tmp/ltsmin8073246736041598869;'/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 673 ms.
Running link step : cd /tmp/ltsmin8073246736041598869;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin8073246736041598869;'/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/stateBased10511984465655475390.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 04:01:11] [INFO ] Flatten gal took : 13 ms
[2022-05-17 04:01:11] [INFO ] Flatten gal took : 10 ms
[2022-05-17 04:01:11] [INFO ] Time to serialize gal into /tmp/LTL2546968717000114407.gal : 3 ms
[2022-05-17 04:01:11] [INFO ] Time to serialize properties into /tmp/LTL15142057124518399228.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/LTL2546968717000114407.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15142057124518399228.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/LTL2546968...267
Read 1 LTL properties
Checking formula 0 : !((X(!((F(X(X(G("((p112==0)||(p111==1))")))))U(("((p6==0)||(p151==1))")U(X(X("(p51==1)"))))))))
Formula 0 simplified : !X!(FXXG"((p112==0)||(p111==1))" U ("((p6==0)||(p151==1))" U XX"(p51==1)"))
Detected timeout of ITS tools.
[2022-05-17 04:01:26] [INFO ] Flatten gal took : 17 ms
[2022-05-17 04:01:26] [INFO ] Applying decomposition
[2022-05-17 04:01:26] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8015957884645336557.txt' '-o' '/tmp/graph8015957884645336557.bin' '-w' '/tmp/graph8015957884645336557.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8015957884645336557.bin' '-l' '-1' '-v' '-w' '/tmp/graph8015957884645336557.weights' '-q' '0' '-e' '0.001'
[2022-05-17 04:01:26] [INFO ] Decomposing Gal with order
[2022-05-17 04:01:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 04:01:26] [INFO ] Removed a total of 46 redundant transitions.
[2022-05-17 04:01:26] [INFO ] Flatten gal took : 35 ms
[2022-05-17 04:01:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 4 ms.
[2022-05-17 04:01:26] [INFO ] Time to serialize gal into /tmp/LTL8697600451445433388.gal : 7 ms
[2022-05-17 04:01:26] [INFO ] Time to serialize properties into /tmp/LTL4134946757800712783.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/LTL8697600451445433388.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4134946757800712783.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/LTL8697600...245
Read 1 LTL properties
Checking formula 0 : !((X(!((F(X(X(G("((u12.p112==0)||(u12.p111==1))")))))U(("((i3.u14.p6==0)||(u2.p151==1))")U(X(X("(u47.p51==1)"))))))))
Formula 0 simplified : !X!(FXXG"((u12.p112==0)||(u12.p111==1))" U ("((i3.u14.p6==0)||(u2.p151==1))" U XX"(u47.p51==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17771100897352477233
[2022-05-17 04:01:41] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17771100897352477233
Running compilation step : cd /tmp/ltsmin17771100897352477233;'/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 549 ms.
Running link step : cd /tmp/ltsmin17771100897352477233;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin17771100897352477233;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(!(<>(X(X([]((LTLAPp0==true))))) U ((LTLAPp1==true) U X(X((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-40a-LTLCardinality-10 finished in 166173 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(X((X(X(G(p0)))&&G(p1)))))))'
Support contains 3 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 9 ms. Remains 271 /272 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 271 cols
[2022-05-17 04:01:56] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 04:01:57] [INFO ] Implicit Places using invariants in 280 ms returned []
// Phase 1: matrix 215 rows 271 cols
[2022-05-17 04:01:57] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 04:01:57] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
[2022-05-17 04:01:57] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 215 rows 271 cols
[2022-05-17 04:01:57] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 04:01:57] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 271/272 places, 215/216 transitions.
Stuttering acceptance computed with spot in 354 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-40a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0, 1} source=0 dest: 0}, { cond=p1, acceptance={0, 1} source=0 dest: 1}, { cond=p1, acceptance={1} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 3}, { cond=p1, acceptance={0, 1} source=1 dest: 4}, { cond=p1, acceptance={1} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 0}, { cond=p1, acceptance={1} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 4}, { cond=(AND p1 p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p1 p0), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={1} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=5 dest: 2}]], initial=0, aps=[p1:(AND (EQ s149 0) (EQ s190 1)), p0:(EQ s269 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 1 ms.
FORMULA DES-PT-40a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLCardinality-11 finished in 1402 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)||p0)))'
Support contains 4 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 04:01:58] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 04:01:58] [INFO ] Implicit Places using invariants in 421 ms returned []
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 04:01:58] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 04:01:59] [INFO ] Implicit Places using invariants and state equation in 732 ms returned []
Implicit Place search using SMT with State Equation took 1155 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 272 cols
[2022-05-17 04:01:59] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 04:01:59] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 272/272 places, 216/216 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-40a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(OR (EQ s266 0) (EQ s96 1)), p0:(OR (EQ s266 0) (EQ s96 1) (EQ s160 0) (EQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 753 ms.
Product exploration explored 100000 steps with 50000 reset in 543 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DES-PT-40a-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-40a-LTLCardinality-14 finished in 2845 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Found a SL insensitive property : DES-PT-40a-LTLCardinality-03
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 7 ms. Remains 271 /272 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 271 cols
[2022-05-17 04:02:01] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 04:02:01] [INFO ] Implicit Places using invariants in 450 ms returned []
// Phase 1: matrix 215 rows 271 cols
[2022-05-17 04:02:01] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 04:02:02] [INFO ] Implicit Places using invariants and state equation in 642 ms returned []
Implicit Place search using SMT with State Equation took 1095 ms to find 0 implicit places.
// Phase 1: matrix 215 rows 271 cols
[2022-05-17 04:02:02] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 04:02:02] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 271/272 places, 215/216 transitions.
Running random walk in product with property : DES-PT-40a-LTLCardinality-03 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 (EQ s99 0) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2294 reset in 355 ms.
Product exploration explored 100000 steps with 2281 reset in 368 ms.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Detected a total of 174/271 stabilizing places and 169/215 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 172 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 76 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 233 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1095678 steps, run timeout after 3001 ms. (steps per millisecond=365 ) properties seen :{}
Probabilistic random walk after 1095678 steps, saw 155960 distinct states, run finished after 3001 ms. (steps per millisecond=365 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 215 rows 271 cols
[2022-05-17 04:02:06] [INFO ] Computed 58 place invariants in 6 ms
[2022-05-17 04:02:06] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 04:02:06] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2022-05-17 04:02:06] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 62 ms returned sat
[2022-05-17 04:02:07] [INFO ] After 255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 04:02:07] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2022-05-17 04:02:07] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 1 ms to minimize.
[2022-05-17 04:02:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 239 ms
[2022-05-17 04:02:07] [INFO ] After 510ms 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-05-17 04:02:07] [INFO ] After 666ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 271 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 215/215 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 271 transition count 213
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 271 transition count 213
Applied a total of 4 rules in 20 ms. Remains 271 /271 variables (removed 0) and now considering 213/215 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/215 transitions.
Incomplete random walk after 10000 steps, including 155 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1117194 steps, run timeout after 3001 ms. (steps per millisecond=372 ) properties seen :{}
Probabilistic random walk after 1117194 steps, saw 156631 distinct states, run finished after 3001 ms. (steps per millisecond=372 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:02:10] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 04:02:10] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 04:02:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 11 ms returned sat
[2022-05-17 04:02:10] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 161 ms returned sat
[2022-05-17 04:02:11] [INFO ] After 325ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 04:02:11] [INFO ] After 358ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-17 04:02:11] [INFO ] After 620ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 271 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 11 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:02:11] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 04:02:11] [INFO ] Implicit Places using invariants in 422 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:02:11] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-17 04:02:12] [INFO ] Implicit Places using invariants and state equation in 594 ms returned []
Implicit Place search using SMT with State Equation took 1019 ms to find 0 implicit places.
[2022-05-17 04:02:12] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:02:12] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-17 04:02:12] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 271 transition count 213
Applied a total of 1 rules in 21 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:02:12] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 04:02:12] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 04:02:12] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2022-05-17 04:02:12] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 175 ms returned sat
[2022-05-17 04:02:13] [INFO ] After 312ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 04:02:13] [INFO ] After 356ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-05-17 04:02:13] [INFO ] After 639ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 04:02:13] [INFO ] Flatten gal took : 10 ms
[2022-05-17 04:02:13] [INFO ] Flatten gal took : 10 ms
[2022-05-17 04:02:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2319717392477640093.gal : 7 ms
[2022-05-17 04:02:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10748627088758834909.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms17389751432035130820;'/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/ReachabilityCardinality2319717392477640093.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10748627088758834909.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/ReachabilityCardinality10748627088758834909.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 30
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :30 after 42
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :42 after 1090
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1090 after 1943
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1943 after 49008
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :49008 after 97396
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :97396 after 220752
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5.60515e+08 after 8.40632e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :8.78257e+08 after 8.86146e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :6.3419e+09 after 9.01264e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :9.34187e+09 after 9.56424e+09
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :7.95673e+10 after 9.82492e+10
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.98144e+11 after 2.01064e+11
Detected timeout of ITS tools.
[2022-05-17 04:02:28] [INFO ] Flatten gal took : 11 ms
[2022-05-17 04:02:28] [INFO ] Applying decomposition
[2022-05-17 04:02:28] [INFO ] Flatten gal took : 10 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/graph17253654088622324475.txt' '-o' '/tmp/graph17253654088622324475.bin' '-w' '/tmp/graph17253654088622324475.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17253654088622324475.bin' '-l' '-1' '-v' '-w' '/tmp/graph17253654088622324475.weights' '-q' '0' '-e' '0.001'
[2022-05-17 04:02:28] [INFO ] Decomposing Gal with order
[2022-05-17 04:02:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 04:02:28] [INFO ] Removed a total of 46 redundant transitions.
[2022-05-17 04:02:28] [INFO ] Flatten gal took : 21 ms
[2022-05-17 04:02:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 3 ms.
[2022-05-17 04:02:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality778277256920254432.gal : 4 ms
[2022-05-17 04:02:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15210368716443280243.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms17389751432035130820;'/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/ReachabilityCardinality778277256920254432.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15210368716443280243.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/ReachabilityCardinality15210368716443280243.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 20
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :20 after 602
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :602 after 11512
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :11512 after 1.65347e+09
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.65347e+09 after 2.93195e+09
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.86485e+09,0.678152,21388,1382,502,41901,2267,290,52770,370,6662,0
Total reachable state count : 4864854496
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,360,0.691006,21388,75,197,41901,2267,297,52770,375,6662,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 193 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 83 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 215/215 transitions.
Applied a total of 0 rules in 4 ms. Remains 271 /271 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 271 cols
[2022-05-17 04:02:29] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 04:02:29] [INFO ] Implicit Places using invariants in 348 ms returned []
// Phase 1: matrix 215 rows 271 cols
[2022-05-17 04:02:29] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 04:02:30] [INFO ] Implicit Places using invariants and state equation in 680 ms returned []
Implicit Place search using SMT with State Equation took 1030 ms to find 0 implicit places.
// Phase 1: matrix 215 rows 271 cols
[2022-05-17 04:02:30] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-17 04:02:30] [INFO ] Dead Transitions using invariants and state equation in 340 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 215/215 transitions.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Detected a total of 174/271 stabilizing places and 169/215 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 248 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 99 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 229 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1241952 steps, run timeout after 3001 ms. (steps per millisecond=413 ) properties seen :{}
Probabilistic random walk after 1241952 steps, saw 176547 distinct states, run finished after 3001 ms. (steps per millisecond=413 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 215 rows 271 cols
[2022-05-17 04:02:34] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-17 04:02:34] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 04:02:34] [INFO ] [Nat]Absence check using 33 positive place invariants in 12 ms returned sat
[2022-05-17 04:02:34] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 63 ms returned sat
[2022-05-17 04:02:34] [INFO ] After 245ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 04:02:34] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 0 ms to minimize.
[2022-05-17 04:02:35] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 1 ms to minimize.
[2022-05-17 04:02:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 286 ms
[2022-05-17 04:02:35] [INFO ] After 543ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-17 04:02:35] [INFO ] After 702ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 271 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 215/215 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 271 transition count 213
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 271 transition count 213
Applied a total of 4 rules in 13 ms. Remains 271 /271 variables (removed 0) and now considering 213/215 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/215 transitions.
Incomplete random walk after 10000 steps, including 159 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1211073 steps, run timeout after 3001 ms. (steps per millisecond=403 ) properties seen :{}
Probabilistic random walk after 1211073 steps, saw 169909 distinct states, run finished after 3001 ms. (steps per millisecond=403 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:02:38] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 04:02:38] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 04:02:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2022-05-17 04:02:38] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 186 ms returned sat
[2022-05-17 04:02:38] [INFO ] After 294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 04:02:38] [INFO ] After 322ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-17 04:02:38] [INFO ] After 637ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 271 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:02:38] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 04:02:39] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:02:39] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 04:02:40] [INFO ] Implicit Places using invariants and state equation in 800 ms returned []
Implicit Place search using SMT with State Equation took 1075 ms to find 0 implicit places.
[2022-05-17 04:02:40] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:02:40] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 04:02:40] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 271 transition count 213
Applied a total of 1 rules in 31 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:02:40] [INFO ] Computed 60 place invariants in 22 ms
[2022-05-17 04:02:40] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 04:02:40] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 04:02:40] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 263 ms returned sat
[2022-05-17 04:02:41] [INFO ] After 462ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 04:02:41] [INFO ] After 519ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2022-05-17 04:02:41] [INFO ] After 920ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-17 04:02:41] [INFO ] Flatten gal took : 14 ms
[2022-05-17 04:02:41] [INFO ] Flatten gal took : 16 ms
[2022-05-17 04:02:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11274302011853905528.gal : 2 ms
[2022-05-17 04:02:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14962203273693144207.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms8315562494181746878;'/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/ReachabilityCardinality11274302011853905528.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14962203273693144207.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/ReachabilityCardinality14962203273693144207.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 30
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :30 after 42
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :42 after 1090
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1090 after 1943
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1943 after 49008
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :49008 after 97396
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :97396 after 220752
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5.60515e+08 after 8.40632e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :8.78257e+08 after 8.86146e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :6.3419e+09 after 9.01264e+09
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :9.34187e+09 after 9.56424e+09
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :7.95673e+10 after 9.82492e+10
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.98144e+11 after 2.01064e+11
Detected timeout of ITS tools.
[2022-05-17 04:02:56] [INFO ] Flatten gal took : 11 ms
[2022-05-17 04:02:56] [INFO ] Applying decomposition
[2022-05-17 04:02:56] [INFO ] Flatten gal took : 9 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/graph15642220643388840336.txt' '-o' '/tmp/graph15642220643388840336.bin' '-w' '/tmp/graph15642220643388840336.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15642220643388840336.bin' '-l' '-1' '-v' '-w' '/tmp/graph15642220643388840336.weights' '-q' '0' '-e' '0.001'
[2022-05-17 04:02:56] [INFO ] Decomposing Gal with order
[2022-05-17 04:02:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 04:02:56] [INFO ] Removed a total of 45 redundant transitions.
[2022-05-17 04:02:56] [INFO ] Flatten gal took : 19 ms
[2022-05-17 04:02:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 2 ms.
[2022-05-17 04:02:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4099198555130100327.gal : 2 ms
[2022-05-17 04:02:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8346265835369221346.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms8315562494181746878;'/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/ReachabilityCardinality4099198555130100327.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8346265835369221346.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/ReachabilityCardinality8346265835369221346.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 20
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :20 after 602
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :602 after 11512
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :11512 after 1.81467e+09
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.81467e+09 after 2.93201e+09
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.86482e+09,0.620116,20336,1325,479,39979,2306,289,51409,381,6563,0
Total reachable state count : 4864823416
Verifying 1 reachability properties.
Reachability property apf0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,13776,0.623688,20600,123,216,39979,2306,296,51409,386,6563,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 178 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 75 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2271 reset in 250 ms.
Product exploration explored 100000 steps with 2274 reset in 421 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 215/215 transitions.
Applied a total of 0 rules in 10 ms. Remains 271 /271 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2022-05-17 04:02:58] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 215 rows 271 cols
[2022-05-17 04:02:58] [INFO ] Computed 58 place invariants in 5 ms
[2022-05-17 04:02:58] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 215/215 transitions.
Product exploration explored 100000 steps with 2278 reset in 460 ms.
Product exploration explored 100000 steps with 2267 reset in 465 ms.
Built C files in :
/tmp/ltsmin4735832315094386884
[2022-05-17 04:02:59] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4735832315094386884
Running compilation step : cd /tmp/ltsmin4735832315094386884;'/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 604 ms.
Running link step : cd /tmp/ltsmin4735832315094386884;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin4735832315094386884;'/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/stateBased9424830796861527440.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 215/215 transitions.
Applied a total of 0 rules in 20 ms. Remains 271 /271 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 271 cols
[2022-05-17 04:03:15] [INFO ] Computed 58 place invariants in 6 ms
[2022-05-17 04:03:15] [INFO ] Implicit Places using invariants in 280 ms returned []
// Phase 1: matrix 215 rows 271 cols
[2022-05-17 04:03:15] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 04:03:15] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 802 ms to find 0 implicit places.
// Phase 1: matrix 215 rows 271 cols
[2022-05-17 04:03:15] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-17 04:03:16] [INFO ] Dead Transitions using invariants and state equation in 424 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 215/215 transitions.
Built C files in :
/tmp/ltsmin1924846070490865612
[2022-05-17 04:03:16] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1924846070490865612
Running compilation step : cd /tmp/ltsmin1924846070490865612;'/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 794 ms.
Running link step : cd /tmp/ltsmin1924846070490865612;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin1924846070490865612;'/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/stateBased4620437863905799443.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 04:03:31] [INFO ] Flatten gal took : 11 ms
[2022-05-17 04:03:31] [INFO ] Flatten gal took : 11 ms
[2022-05-17 04:03:31] [INFO ] Time to serialize gal into /tmp/LTL17031402970845221595.gal : 1 ms
[2022-05-17 04:03:31] [INFO ] Time to serialize properties into /tmp/LTL13343475845922574168.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/LTL17031402970845221595.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13343475845922574168.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/LTL1703140...268
Read 1 LTL properties
Checking formula 0 : !((G(X("((p100==0)||(p29==1))"))))
Formula 0 simplified : !GX"((p100==0)||(p29==1))"
Detected timeout of ITS tools.
[2022-05-17 04:03:46] [INFO ] Flatten gal took : 10 ms
[2022-05-17 04:03:46] [INFO ] Applying decomposition
[2022-05-17 04:03:46] [INFO ] Flatten gal took : 10 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/graph5771127999855140314.txt' '-o' '/tmp/graph5771127999855140314.bin' '-w' '/tmp/graph5771127999855140314.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5771127999855140314.bin' '-l' '-1' '-v' '-w' '/tmp/graph5771127999855140314.weights' '-q' '0' '-e' '0.001'
[2022-05-17 04:03:46] [INFO ] Decomposing Gal with order
[2022-05-17 04:03:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 04:03:46] [INFO ] Removed a total of 42 redundant transitions.
[2022-05-17 04:03:46] [INFO ] Flatten gal took : 20 ms
[2022-05-17 04:03:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 1 ms.
[2022-05-17 04:03:46] [INFO ] Time to serialize gal into /tmp/LTL5799287848495128315.gal : 2 ms
[2022-05-17 04:03:46] [INFO ] Time to serialize properties into /tmp/LTL6562632324088077113.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/LTL5799287848495128315.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6562632324088077113.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/LTL5799287...245
Read 1 LTL properties
Checking formula 0 : !((G(X("((u12.p100==0)||(i3.u13.p29==1))"))))
Formula 0 simplified : !GX"((u12.p100==0)||(i3.u13.p29==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13788861217267351751
[2022-05-17 04:04:01] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13788861217267351751
Running compilation step : cd /tmp/ltsmin13788861217267351751;'/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 628 ms.
Running link step : cd /tmp/ltsmin13788861217267351751;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin13788861217267351751;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-40a-LTLCardinality-03 finished in 135520 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(F(X(X(G(p0)))) U (p1 U X(X(p2))))))'
[2022-05-17 04:04:16] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1608656369413273260
[2022-05-17 04:04:16] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2022-05-17 04:04:16] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 04:04:16] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2022-05-17 04:04:16] [INFO ] Applying decomposition
[2022-05-17 04:04:16] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 04:04:16] [INFO ] Flatten gal took : 11 ms
[2022-05-17 04:04:16] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2022-05-17 04:04:16] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 04:04:16] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1608656369413273260
Running compilation step : cd /tmp/ltsmin1608656369413273260;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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'
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/graph8279812623667551041.txt' '-o' '/tmp/graph8279812623667551041.bin' '-w' '/tmp/graph8279812623667551041.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8279812623667551041.bin' '-l' '-1' '-v' '-w' '/tmp/graph8279812623667551041.weights' '-q' '0' '-e' '0.001'
[2022-05-17 04:04:16] [INFO ] Decomposing Gal with order
[2022-05-17 04:04:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 04:04:16] [INFO ] Removed a total of 47 redundant transitions.
[2022-05-17 04:04:16] [INFO ] Flatten gal took : 33 ms
[2022-05-17 04:04:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 3 ms.
[2022-05-17 04:04:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality17442675353657844260.gal : 4 ms
[2022-05-17 04:04:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality14993712857493755414.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/LTLCardinality17442675353657844260.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14993712857493755414.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 2 LTL properties
Checking formula 0 : !((G(X("((u13.p100==0)||(i3.u14.p29==1))"))))
Formula 0 simplified : !GX"((u13.p100==0)||(i3.u14.p29==1))"
Compilation finished in 777 ms.
Running link step : cd /tmp/ltsmin1608656369413273260;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin1608656369413273260;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t176, t177, t209, u2.t8, u2.t90, u2.t94, u2.t95, u2.t96, u2.t97, u2.t98, u2.t99, u2.t100,...654
Computing Next relation with stutter on 3.63306e+06 deadlock states
Detected timeout of ITS tools.
[2022-05-17 04:27:01] [INFO ] Applying decomposition
[2022-05-17 04:27:01] [INFO ] Flatten gal took : 28 ms
[2022-05-17 04:27:01] [INFO ] Decomposing Gal with order
[2022-05-17 04:27:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 04:27:01] [INFO ] Removed a total of 291 redundant transitions.
[2022-05-17 04:27:01] [INFO ] Flatten gal took : 106 ms
[2022-05-17 04:27:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 163 labels/synchronizations in 12 ms.
[2022-05-17 04:27:01] [INFO ] Time to serialize gal into /tmp/LTLCardinality15200126479467237370.gal : 2 ms
[2022-05-17 04:27:01] [INFO ] Time to serialize properties into /tmp/LTLCardinality4219056253885656701.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/LTLCardinality15200126479467237370.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4219056253885656701.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...268
Read 2 LTL properties
Checking formula 0 : !((G(X("((u3.p100==0)||(u1.p29==1))"))))
Formula 0 simplified : !GX"((u3.p100==0)||(u1.p29==1))"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: LTL layer: formula: [](X((LTLAPp0==true)))
pins2lts-mc-linux64( 0/ 8), 0.005: "[](X((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.005: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.021: buchi has 3 states
pins2lts-mc-linux64( 0/ 8), 0.027: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.119: DFS-FIFO for weak LTL, using special progress label 221
pins2lts-mc-linux64( 0/ 8), 0.120: There are 222 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.120: State length is 273, there are 220 groups
pins2lts-mc-linux64( 0/ 8), 0.120: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.120: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.120: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.120: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.169: ~1 levels ~960 states ~6080 transitions
pins2lts-mc-linux64( 3/ 8), 0.190: ~1 levels ~1920 states ~11832 transitions
pins2lts-mc-linux64( 3/ 8), 0.238: ~1 levels ~3840 states ~21808 transitions
pins2lts-mc-linux64( 0/ 8), 0.369: ~1 levels ~7680 states ~47488 transitions
pins2lts-mc-linux64( 3/ 8), 0.515: ~1 levels ~15360 states ~83912 transitions
pins2lts-mc-linux64( 3/ 8), 0.910: ~1 levels ~30720 states ~167928 transitions
pins2lts-mc-linux64( 3/ 8), 1.704: ~1 levels ~61440 states ~387840 transitions
pins2lts-mc-linux64( 2/ 8), 3.080: ~1 levels ~122880 states ~702880 transitions
pins2lts-mc-linux64( 2/ 8), 5.730: ~1 levels ~245760 states ~1470440 transitions
pins2lts-mc-linux64( 7/ 8), 10.131: ~1 levels ~491520 states ~3086176 transitions
pins2lts-mc-linux64( 7/ 8), 17.520: ~1 levels ~983040 states ~7579040 transitions
pins2lts-mc-linux64( 2/ 8), 31.061: ~1 levels ~1966080 states ~19944176 transitions
pins2lts-mc-linux64( 2/ 8), 57.670: ~1 levels ~3932160 states ~40714168 transitions
pins2lts-mc-linux64( 2/ 8), 111.961: ~1 levels ~7864320 states ~82741240 transitions
pins2lts-mc-linux64( 2/ 8), 214.787: ~1 levels ~15728640 states ~160636048 transitions
pins2lts-mc-linux64( 2/ 8), 420.868: ~1 levels ~31457280 states ~316290936 transitions
pins2lts-mc-linux64( 2/ 8), 834.527: ~1 levels ~62914560 states ~626519600 transitions
pins2lts-mc-linux64( 4/ 8), 1600.838: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1600.868:
pins2lts-mc-linux64( 0/ 8), 1600.868: mean standard work distribution: 7.6% (states) 8.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 1600.868:
pins2lts-mc-linux64( 0/ 8), 1600.868: Explored 100640262 states 1098613670 transitions, fanout: 10.916
pins2lts-mc-linux64( 0/ 8), 1600.868: Total exploration time 1600.720 sec (1600.690 sec minimum, 1600.714 sec on average)
pins2lts-mc-linux64( 0/ 8), 1600.868: States per second: 62872, Transitions per second: 686325
pins2lts-mc-linux64( 0/ 8), 1600.868:
pins2lts-mc-linux64( 0/ 8), 1600.868: Progress states detected: 134214088
pins2lts-mc-linux64( 0/ 8), 1600.868: Redundant explorations: -25.0152
pins2lts-mc-linux64( 0/ 8), 1600.868:
pins2lts-mc-linux64( 0/ 8), 1600.868: Queue width: 8B, total height: 65683029, memory: 501.12MB
pins2lts-mc-linux64( 0/ 8), 1600.868: Tree memory: 1270.9MB, 9.9 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 1600.868: Tree fill ratio (roots/leafs): 99.0%/96.0%
pins2lts-mc-linux64( 0/ 8), 1600.868: Stored 217 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1600.868: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1600.868: Est. total memory use: 1772.0MB (~1525.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1608656369413273260;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1608656369413273260;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-17 04:49:46] [INFO ] Flatten gal took : 39 ms
[2022-05-17 04:49:46] [INFO ] Input system was already deterministic with 216 transitions.
[2022-05-17 04:49:46] [INFO ] Transformed 272 places.
[2022-05-17 04:49:46] [INFO ] Transformed 216 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-17 04:49:46] [INFO ] Time to serialize gal into /tmp/LTLCardinality6513049727339024403.gal : 19 ms
[2022-05-17 04:49:46] [INFO ] Time to serialize properties into /tmp/LTLCardinality8107268739392476661.ltl : 4 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/LTLCardinality6513049727339024403.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8107268739392476661.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...333
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(X("((p100==0)||(p29==1))"))))
Formula 0 simplified : !GX"((p100==0)||(p29==1))"
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="DES-PT-40a"
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 DES-PT-40a, 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 r042-smll-165252095800499"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40a.tgz
mv DES-PT-40a 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 ;