About the Execution of ITS-Tools for CloudDeployment-PT-6a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3763.056 | 1482210.00 | 1893180.00 | 3676.00 | TFFFFTTFFFFFFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r070-tall-171620506200604.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is CloudDeployment-PT-6a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620506200604
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 11 16:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 317K May 18 16:42 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 CloudDeployment-PT-6a-LTLFireability-00
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-01
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-02
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-03
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-04
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-05
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-06
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-07
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-08
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-09
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-10
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-11
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-12
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-13
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-14
FORMULA_NAME CloudDeployment-PT-6a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716331062110
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-6a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 22:37:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 22:37:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:37:43] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-05-21 22:37:43] [INFO ] Transformed 221 places.
[2024-05-21 22:37:43] [INFO ] Transformed 908 transitions.
[2024-05-21 22:37:43] [INFO ] Found NUPN structural information;
[2024-05-21 22:37:43] [INFO ] Parsed PT model containing 221 places and 908 transitions and 5517 arcs in 216 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 114 transitions
Reduce redundant transitions removed 114 transitions.
FORMULA CloudDeployment-PT-6a-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 794/794 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 209 transition count 794
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 205 transition count 790
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 205 transition count 790
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 202 transition count 787
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 202 transition count 787
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 200 transition count 785
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 200 transition count 785
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 199 transition count 784
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 199 transition count 784
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 1 with 75 rules applied. Total rules applied 107 place count 199 transition count 709
Applied a total of 107 rules in 77 ms. Remains 199 /221 variables (removed 22) and now considering 709/794 (removed 85) transitions.
[2024-05-21 22:37:43] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2024-05-21 22:37:43] [INFO ] Computed 24 invariants in 21 ms
[2024-05-21 22:37:44] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-21 22:37:44] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 22:37:44] [INFO ] Invariant cache hit.
[2024-05-21 22:37:44] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-21 22:37:44] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2024-05-21 22:37:44] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 22:37:44] [INFO ] Invariant cache hit.
[2024-05-21 22:37:44] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 7 (OVERLAPS) 1/573 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/573 variables, and 395 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30053 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 708/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (OVERLAPS) 1/572 variables, 1/1102 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/573 variables, and 1102 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
After SMT, in 61503ms problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 61534ms
Starting structural reductions in LTL mode, iteration 1 : 199/221 places, 709/794 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62229 ms. Remains : 199/221 places, 709/794 transitions.
Support contains 42 out of 199 places after structural reductions.
[2024-05-21 22:38:46] [INFO ] Flatten gal took : 79 ms
[2024-05-21 22:38:46] [INFO ] Flatten gal took : 48 ms
[2024-05-21 22:38:46] [INFO ] Input system was already deterministic with 709 transitions.
RANDOM walk for 40000 steps (447 resets) in 1857 ms. (21 steps per ms) remains 3/30 properties
BEST_FIRST walk for 40003 steps (54 resets) in 89 ms. (444 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (32 resets) in 103 ms. (384 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (12 resets) in 100 ms. (396 steps per ms) remains 2/2 properties
[2024-05-21 22:38:47] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 22:38:47] [INFO ] Invariant cache hit.
[2024-05-21 22:38:47] [INFO ] State equation strengthened by 172 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 1 (OVERLAPS) 184/198 variables, 24/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/573 variables, 1/395 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 0/395 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/573 variables, 0/395 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 573/573 variables, and 395 constraints, problems are : Problem set: 1 solved, 1 unsolved in 199 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 192/198 variables, 24/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 1/394 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/571 variables, 0/394 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp29 is UNSAT
After SMT solving in domain Int declared 572/573 variables, and 395 constraints, problems are : Problem set: 2 solved, 0 unsolved in 166 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 390ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CloudDeployment-PT-6a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6a-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 97 stabilizing places and 505 stable transitions
Graph (complete) has 1967 edges and 199 vertex of which 198 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(X(F((G(p2)&&p1)))))))'
Support contains 9 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 6 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2024-05-21 22:38:48] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 22:38:48] [INFO ] Invariant cache hit.
[2024-05-21 22:38:48] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-21 22:38:48] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 22:38:48] [INFO ] Invariant cache hit.
[2024-05-21 22:38:48] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-21 22:38:48] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2024-05-21 22:38:48] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 22:38:48] [INFO ] Invariant cache hit.
[2024-05-21 22:38:48] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 7 (OVERLAPS) 1/573 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/573 variables, and 395 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 708/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (OVERLAPS) 1/572 variables, 1/1102 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/573 variables, and 1102 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
After SMT, in 61112ms problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 61122ms
Finished structural reductions in LTL mode , in 1 iterations and 61558 ms. Remains : 199/199 places, 709/709 transitions.
Stuttering acceptance computed with spot in 314 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 3 ms.
FORMULA CloudDeployment-PT-6a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLFireability-01 finished in 61953 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((G(p1) U (p0&&G(p1)))))))'
Support contains 1 out of 199 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 234 edges and 199 vertex of which 58 / 199 are part of one of the 18 SCC in 3 ms
Free SCC test removed 40 places
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 152 transition count 545
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 152 transition count 545
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 47 place count 135 transition count 610
Drop transitions (Redundant composition of simpler transitions.) removed 107 transitions
Redundant transition composition rules discarded 107 transitions
Iterating global reduction 0 with 107 rules applied. Total rules applied 154 place count 135 transition count 503
Applied a total of 154 rules in 91 ms. Remains 135 /199 variables (removed 64) and now considering 503/709 (removed 206) transitions.
[2024-05-21 22:39:50] [INFO ] Flow matrix only has 204 transitions (discarded 299 similar events)
// Phase 1: matrix 204 rows 135 cols
[2024-05-21 22:39:50] [INFO ] Computed 24 invariants in 3 ms
[2024-05-21 22:39:50] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-21 22:39:50] [INFO ] Flow matrix only has 204 transitions (discarded 299 similar events)
[2024-05-21 22:39:50] [INFO ] Invariant cache hit.
[2024-05-21 22:39:50] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 22:39:50] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2024-05-21 22:39:50] [INFO ] Redundant transitions in 337 ms returned []
Running 460 sub problems to find dead transitions.
[2024-05-21 22:39:50] [INFO ] Flow matrix only has 204 transitions (discarded 299 similar events)
[2024-05-21 22:39:50] [INFO ] Invariant cache hit.
[2024-05-21 22:39:50] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 6/135 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 203/338 variables, 135/159 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 7/166 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 7 (OVERLAPS) 0/338 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/339 variables, and 166 constraints, problems are : Problem set: 0 solved, 460 unsolved in 12364 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 135/135 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 6/135 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 203/338 variables, 135/159 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 7/166 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 460/626 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 8 (OVERLAPS) 0/338 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/339 variables, and 626 constraints, problems are : Problem set: 0 solved, 460 unsolved in 21416 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 135/135 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints]
After SMT, in 34187ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 34192ms
Starting structural reductions in SI_LTL mode, iteration 1 : 135/199 places, 503/709 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34905 ms. Remains : 135/199 places, 503/709 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-6a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLFireability-02 finished in 34974 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 5 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 234 edges and 199 vertex of which 58 / 199 are part of one of the 17 SCC in 3 ms
Free SCC test removed 41 places
Ensure Unique test removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 153 transition count 550
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 153 transition count 550
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 17 places in 15 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 45 place count 136 transition count 606
Drop transitions (Redundant composition of simpler transitions.) removed 96 transitions
Redundant transition composition rules discarded 96 transitions
Iterating global reduction 0 with 96 rules applied. Total rules applied 141 place count 136 transition count 510
Applied a total of 141 rules in 119 ms. Remains 136 /199 variables (removed 63) and now considering 510/709 (removed 199) transitions.
[2024-05-21 22:40:25] [INFO ] Flow matrix only has 205 transitions (discarded 305 similar events)
// Phase 1: matrix 205 rows 136 cols
[2024-05-21 22:40:25] [INFO ] Computed 24 invariants in 5 ms
[2024-05-21 22:40:25] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-21 22:40:25] [INFO ] Flow matrix only has 205 transitions (discarded 305 similar events)
[2024-05-21 22:40:25] [INFO ] Invariant cache hit.
[2024-05-21 22:40:25] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-05-21 22:40:25] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2024-05-21 22:40:25] [INFO ] Redundant transitions in 472 ms returned []
Running 509 sub problems to find dead transitions.
[2024-05-21 22:40:25] [INFO ] Flow matrix only has 205 transitions (discarded 305 similar events)
[2024-05-21 22:40:25] [INFO ] Invariant cache hit.
[2024-05-21 22:40:25] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (OVERLAPS) 204/339 variables, 135/159 constraints. Problems are: Problem set: 0 solved, 509 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 129/288 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (OVERLAPS) 1/340 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 7 (OVERLAPS) 1/341 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 9 (OVERLAPS) 0/341 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 290 constraints, problems are : Problem set: 0 solved, 509 unsolved in 23677 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 136/136 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (OVERLAPS) 204/339 variables, 135/159 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 129/288 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 509/797 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 1/340 variables, 1/798 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 8 (OVERLAPS) 1/341 variables, 1/799 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/341 variables, and 799 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 136/136 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
After SMT, in 54219ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 54228ms
Starting structural reductions in SI_LTL mode, iteration 1 : 136/199 places, 510/709 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55287 ms. Remains : 136/199 places, 510/709 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-6a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLFireability-03 finished in 55396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U G((p1||F(p2))))))'
Support contains 7 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 7 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2024-05-21 22:41:20] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2024-05-21 22:41:20] [INFO ] Computed 24 invariants in 2 ms
[2024-05-21 22:41:20] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 22:41:20] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 22:41:20] [INFO ] Invariant cache hit.
[2024-05-21 22:41:20] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-21 22:41:20] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2024-05-21 22:41:20] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 22:41:20] [INFO ] Invariant cache hit.
[2024-05-21 22:41:20] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 7 (OVERLAPS) 1/573 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/573 variables, and 395 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 708/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (OVERLAPS) 1/572 variables, 1/1102 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/573 variables, and 1102 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
After SMT, in 60941ms problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 60952ms
Finished structural reductions in LTL mode , in 1 iterations and 61365 ms. Remains : 199/199 places, 709/709 transitions.
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-6a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLFireability-04 finished in 61617 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((F(p0)&&(p1||F(p2))))))))'
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 5 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2024-05-21 22:42:21] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 22:42:21] [INFO ] Invariant cache hit.
[2024-05-21 22:42:22] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-21 22:42:22] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 22:42:22] [INFO ] Invariant cache hit.
[2024-05-21 22:42:22] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-21 22:42:22] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2024-05-21 22:42:22] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 22:42:22] [INFO ] Invariant cache hit.
[2024-05-21 22:42:22] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 7 (OVERLAPS) 1/573 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/573 variables, and 395 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 708/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (OVERLAPS) 1/572 variables, 1/1102 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/573 variables, and 1102 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
After SMT, in 60936ms problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 60944ms
Finished structural reductions in LTL mode , in 1 iterations and 61339 ms. Remains : 199/199 places, 709/709 transitions.
Stuttering acceptance computed with spot in 309 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-05
Product exploration explored 100000 steps with 25000 reset in 1251 ms.
Product exploration explored 100000 steps with 25000 reset in 1177 ms.
Computed a total of 97 stabilizing places and 505 stable transitions
Graph (complete) has 1967 edges and 199 vertex of which 198 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 97 stabilizing places and 505 stable transitions
Detected a total of 97/199 stabilizing places and 505/709 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 11009 steps (125 resets) in 73 ms. (148 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p1 p2 p0), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p2 p0))), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (AND (OR (NOT p2) p0) (OR p0 (NOT p1))))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 306 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 313 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 369 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 5 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2024-05-21 22:43:27] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 22:43:27] [INFO ] Invariant cache hit.
[2024-05-21 22:43:27] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-21 22:43:27] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 22:43:27] [INFO ] Invariant cache hit.
[2024-05-21 22:43:27] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-21 22:43:27] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2024-05-21 22:43:27] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 22:43:27] [INFO ] Invariant cache hit.
[2024-05-21 22:43:27] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 7 (OVERLAPS) 1/573 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/573 variables, and 395 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 708/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (OVERLAPS) 1/572 variables, 1/1102 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/573 variables, and 1102 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
After SMT, in 60936ms problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 60945ms
Finished structural reductions in LTL mode , in 1 iterations and 61328 ms. Remains : 199/199 places, 709/709 transitions.
Computed a total of 97 stabilizing places and 505 stable transitions
Graph (complete) has 1967 edges and 199 vertex of which 198 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 97 stabilizing places and 505 stable transitions
Detected a total of 97/199 stabilizing places and 505/709 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 365 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 26472 steps (287 resets) in 119 ms. (220 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p2 p1 p0), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p2 p0))), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (AND (OR (NOT p2) p0) (OR p0 (NOT p1))))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR p2 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 326 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 7 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 297 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 278 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 307 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 25000 reset in 1141 ms.
Product exploration explored 100000 steps with 25000 reset in 1171 ms.
Applying partial POR strategy [true, true, true, true, false, false, false]
Stuttering acceptance computed with spot in 323 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 229 edges and 199 vertex of which 59 / 199 are part of one of the 18 SCC in 0 ms
Free SCC test removed 41 places
Ensure Unique test removed 118 transitions
Reduce isomorphic transitions removed 118 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 152 transition count 543
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 152 transition count 543
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -108
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 0 with 18 rules applied. Total rules applied 31 place count 152 transition count 651
Deduced a syphon composed of 18 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 125 transitions
Redundant transition composition rules discarded 125 transitions
Iterating global reduction 0 with 125 rules applied. Total rules applied 156 place count 152 transition count 526
Deduced a syphon composed of 18 places in 0 ms
Applied a total of 156 rules in 49 ms. Remains 152 /199 variables (removed 47) and now considering 526/709 (removed 183) transitions.
[2024-05-21 22:44:33] [INFO ] Redundant transitions in 327 ms returned []
Running 525 sub problems to find dead transitions.
[2024-05-21 22:44:33] [INFO ] Flow matrix only has 227 transitions (discarded 299 similar events)
// Phase 1: matrix 227 rows 152 cols
[2024-05-21 22:44:33] [INFO ] Computed 24 invariants in 2 ms
[2024-05-21 22:44:33] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 525 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 525 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD99 is UNSAT
At refinement iteration 2 (OVERLAPS) 226/377 variables, 151/175 constraints. Problems are: Problem set: 24 solved, 501 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/377 variables, 129/304 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 0/304 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 5 (OVERLAPS) 1/378 variables, 1/305 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/305 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 7 (OVERLAPS) 1/379 variables, 1/306 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/306 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 9 (OVERLAPS) 0/379 variables, 0/306 constraints. Problems are: Problem set: 24 solved, 501 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 306 constraints, problems are : Problem set: 24 solved, 501 unsolved in 25516 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 152/152 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 525/525 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 501 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 18/18 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/18 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 18/151 variables, 6/24 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/24 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 4 (OVERLAPS) 226/377 variables, 151/175 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 129/304 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 501/805 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 0/805 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 8 (OVERLAPS) 1/378 variables, 1/806 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 0/806 constraints. Problems are: Problem set: 24 solved, 501 unsolved
At refinement iteration 10 (OVERLAPS) 1/379 variables, 1/807 constraints. Problems are: Problem set: 24 solved, 501 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 379/379 variables, and 807 constraints, problems are : Problem set: 24 solved, 501 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 152/152 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 501/525 constraints, Known Traps: 0/0 constraints]
After SMT, in 56008ms problems are : Problem set: 24 solved, 501 unsolved
Search for dead transitions found 24 dead transitions in 56014ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 152/199 places, 502/709 transitions.
Graph (complete) has 1609 edges and 152 vertex of which 134 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.6 ms
Discarding 18 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 25 ms. Remains 134 /152 variables (removed 18) and now considering 502/502 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 134/199 places, 502/709 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 56428 ms. Remains : 134/199 places, 502/709 transitions.
Built C files in :
/tmp/ltsmin16183516198446573076
[2024-05-21 22:45:29] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16183516198446573076
Running compilation step : cd /tmp/ltsmin16183516198446573076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1570 ms.
Running link step : cd /tmp/ltsmin16183516198446573076;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin16183516198446573076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2607574174602120036.hoa' '--buchi-type=spotba'
LTSmin run took 229 ms.
FORMULA CloudDeployment-PT-6a-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-6a-LTLFireability-05 finished in 189817 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(F(p0))))||(X(!p1) U ((p2&&X(!p1))||X(G(!p1))))))'
Support contains 6 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 7 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2024-05-21 22:45:31] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2024-05-21 22:45:31] [INFO ] Computed 24 invariants in 6 ms
[2024-05-21 22:45:31] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 22:45:31] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 22:45:31] [INFO ] Invariant cache hit.
[2024-05-21 22:45:31] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-21 22:45:32] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2024-05-21 22:45:32] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 22:45:32] [INFO ] Invariant cache hit.
[2024-05-21 22:45:32] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 7 (OVERLAPS) 1/573 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/573 variables, and 395 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 708/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (OVERLAPS) 1/572 variables, 1/1102 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/573 variables, and 1102 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
After SMT, in 60917ms problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 60926ms
Finished structural reductions in LTL mode , in 1 iterations and 61313 ms. Remains : 199/199 places, 709/709 transitions.
Stuttering acceptance computed with spot in 381 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 1857 ms.
Product exploration explored 100000 steps with 50000 reset in 1855 ms.
Computed a total of 97 stabilizing places and 505 stable transitions
Graph (complete) has 1967 edges and 199 vertex of which 198 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 97 stabilizing places and 505 stable transitions
Detected a total of 97/199 stabilizing places and 505/709 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 99 ms. Reduced automaton from 9 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-6a-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-6a-LTLFireability-06 finished in 65536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 6 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 230 edges and 199 vertex of which 59 / 199 are part of one of the 18 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 118 transitions
Reduce isomorphic transitions removed 118 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 153 transition count 551
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 153 transition count 551
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -55
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 43 place count 137 transition count 606
Drop transitions (Redundant composition of simpler transitions.) removed 95 transitions
Redundant transition composition rules discarded 95 transitions
Iterating global reduction 0 with 95 rules applied. Total rules applied 138 place count 137 transition count 511
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 140 place count 136 transition count 510
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 141 place count 136 transition count 510
Applied a total of 141 rules in 60 ms. Remains 136 /199 variables (removed 63) and now considering 510/709 (removed 199) transitions.
[2024-05-21 22:46:37] [INFO ] Flow matrix only has 204 transitions (discarded 306 similar events)
// Phase 1: matrix 204 rows 136 cols
[2024-05-21 22:46:37] [INFO ] Computed 24 invariants in 4 ms
[2024-05-21 22:46:37] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 22:46:37] [INFO ] Flow matrix only has 204 transitions (discarded 306 similar events)
[2024-05-21 22:46:37] [INFO ] Invariant cache hit.
[2024-05-21 22:46:37] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-05-21 22:46:37] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2024-05-21 22:46:37] [INFO ] Redundant transitions in 310 ms returned []
Running 509 sub problems to find dead transitions.
[2024-05-21 22:46:37] [INFO ] Flow matrix only has 204 transitions (discarded 306 similar events)
[2024-05-21 22:46:37] [INFO ] Invariant cache hit.
[2024-05-21 22:46:37] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (OVERLAPS) 203/338 variables, 135/159 constraints. Problems are: Problem set: 0 solved, 509 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 129/288 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (OVERLAPS) 1/339 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 7 (OVERLAPS) 1/340 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 9 (OVERLAPS) 0/340 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 509 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 290 constraints, problems are : Problem set: 0 solved, 509 unsolved in 23627 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 136/136 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (OVERLAPS) 203/338 variables, 135/159 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 129/288 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 509/797 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 1/339 variables, 1/798 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 8 (OVERLAPS) 1/340 variables, 1/799 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/340 variables, and 799 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 136/136 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
After SMT, in 54203ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 54211ms
Starting structural reductions in SI_LTL mode, iteration 1 : 136/199 places, 510/709 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54871 ms. Remains : 136/199 places, 510/709 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-6a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLFireability-08 finished in 54967 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 5 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 3 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2024-05-21 22:47:32] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2024-05-21 22:47:32] [INFO ] Computed 24 invariants in 2 ms
[2024-05-21 22:47:32] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-21 22:47:32] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 22:47:32] [INFO ] Invariant cache hit.
[2024-05-21 22:47:32] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-21 22:47:32] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2024-05-21 22:47:32] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 22:47:32] [INFO ] Invariant cache hit.
[2024-05-21 22:47:32] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 7 (OVERLAPS) 1/573 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/573 variables, and 395 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 708/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (OVERLAPS) 1/572 variables, 1/1102 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/573 variables, and 1102 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
After SMT, in 61126ms problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 61137ms
Finished structural reductions in LTL mode , in 1 iterations and 61542 ms. Remains : 199/199 places, 709/709 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 7 ms.
FORMULA CloudDeployment-PT-6a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLFireability-09 finished in 61653 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 9 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 235 edges and 199 vertex of which 60 / 199 are part of one of the 18 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 151 transition count 541
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 151 transition count 541
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 47 place count 134 transition count 606
Drop transitions (Redundant composition of simpler transitions.) removed 104 transitions
Redundant transition composition rules discarded 104 transitions
Iterating global reduction 0 with 104 rules applied. Total rules applied 151 place count 134 transition count 502
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 153 place count 134 transition count 502
Applied a total of 153 rules in 45 ms. Remains 134 /199 variables (removed 65) and now considering 502/709 (removed 207) transitions.
[2024-05-21 22:48:33] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
// Phase 1: matrix 203 rows 134 cols
[2024-05-21 22:48:33] [INFO ] Computed 24 invariants in 2 ms
[2024-05-21 22:48:34] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-21 22:48:34] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
[2024-05-21 22:48:34] [INFO ] Invariant cache hit.
[2024-05-21 22:48:34] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-05-21 22:48:34] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
[2024-05-21 22:48:34] [INFO ] Redundant transitions in 260 ms returned []
Running 501 sub problems to find dead transitions.
[2024-05-21 22:48:34] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
[2024-05-21 22:48:34] [INFO ] Invariant cache hit.
[2024-05-21 22:48:34] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 202/335 variables, 133/157 constraints. Problems are: Problem set: 0 solved, 501 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 129/286 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 5 (OVERLAPS) 1/336 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 7 (OVERLAPS) 1/337 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 9 (OVERLAPS) 0/337 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 501 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 288 constraints, problems are : Problem set: 0 solved, 501 unsolved in 23496 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 134/134 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 501 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 202/335 variables, 133/157 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 129/286 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 501/787 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 6 (OVERLAPS) 1/336 variables, 1/788 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 8 (OVERLAPS) 1/337 variables, 1/789 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 789 constraints, problems are : Problem set: 0 solved, 501 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 134/134 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 0/0 constraints]
After SMT, in 53964ms problems are : Problem set: 0 solved, 501 unsolved
Search for dead transitions found 0 dead transitions in 53969ms
Starting structural reductions in SI_LTL mode, iteration 1 : 134/199 places, 502/709 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54940 ms. Remains : 134/199 places, 502/709 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 147 ms.
Product exploration explored 100000 steps with 1 reset in 189 ms.
Computed a total of 80 stabilizing places and 394 stable transitions
Graph (complete) has 1610 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 80 stabilizing places and 394 stable transitions
Detected a total of 80/134 stabilizing places and 394/502 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 234 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (653 resets) in 220 ms. (180 steps per ms) remains 2/4 properties
BEST_FIRST walk for 10597 steps (12 resets) in 87 ms. (120 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 10 factoid took 290 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 9 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 502/502 transitions.
Applied a total of 0 rules in 16 ms. Remains 134 /134 variables (removed 0) and now considering 502/502 (removed 0) transitions.
[2024-05-21 22:49:30] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
[2024-05-21 22:49:30] [INFO ] Invariant cache hit.
[2024-05-21 22:49:30] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-21 22:49:30] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
[2024-05-21 22:49:30] [INFO ] Invariant cache hit.
[2024-05-21 22:49:30] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-05-21 22:49:30] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2024-05-21 22:49:30] [INFO ] Redundant transitions in 266 ms returned []
Running 501 sub problems to find dead transitions.
[2024-05-21 22:49:30] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
[2024-05-21 22:49:31] [INFO ] Invariant cache hit.
[2024-05-21 22:49:31] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 202/335 variables, 133/157 constraints. Problems are: Problem set: 0 solved, 501 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 129/286 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 5 (OVERLAPS) 1/336 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 7 (OVERLAPS) 1/337 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 9 (OVERLAPS) 0/337 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 501 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 288 constraints, problems are : Problem set: 0 solved, 501 unsolved in 23094 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 134/134 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 501 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 202/335 variables, 133/157 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 129/286 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 501/787 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 6 (OVERLAPS) 1/336 variables, 1/788 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 8 (OVERLAPS) 1/337 variables, 1/789 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 789 constraints, problems are : Problem set: 0 solved, 501 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 134/134 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 0/0 constraints]
After SMT, in 53521ms problems are : Problem set: 0 solved, 501 unsolved
Search for dead transitions found 0 dead transitions in 53526ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54333 ms. Remains : 134/134 places, 502/502 transitions.
Computed a total of 80 stabilizing places and 394 stable transitions
Graph (complete) has 1610 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 80 stabilizing places and 394 stable transitions
Detected a total of 80/134 stabilizing places and 394/502 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 153 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (654 resets) in 770 ms. (51 steps per ms) remains 2/4 properties
BEST_FIRST walk for 8156 steps (10 resets) in 15 ms. (509 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 10 factoid took 329 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 131 ms.
Product exploration explored 100000 steps with 0 reset in 239 ms.
Built C files in :
/tmp/ltsmin3145153860756148114
[2024-05-21 22:50:26] [INFO ] Computing symmetric may disable matrix : 502 transitions.
[2024-05-21 22:50:26] [INFO ] Computation of Complete disable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:50:26] [INFO ] Computing symmetric may enable matrix : 502 transitions.
[2024-05-21 22:50:26] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:50:26] [INFO ] Computing Do-Not-Accords matrix : 502 transitions.
[2024-05-21 22:50:26] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:50:26] [INFO ] Built C files in 136ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3145153860756148114
Running compilation step : cd /tmp/ltsmin3145153860756148114;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1658 ms.
Running link step : cd /tmp/ltsmin3145153860756148114;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin3145153860756148114;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11542039552569229300.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 9 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 502/502 transitions.
Applied a total of 0 rules in 19 ms. Remains 134 /134 variables (removed 0) and now considering 502/502 (removed 0) transitions.
[2024-05-21 22:50:41] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
[2024-05-21 22:50:41] [INFO ] Invariant cache hit.
[2024-05-21 22:50:41] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 22:50:41] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
[2024-05-21 22:50:41] [INFO ] Invariant cache hit.
[2024-05-21 22:50:41] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-05-21 22:50:41] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2024-05-21 22:50:41] [INFO ] Redundant transitions in 299 ms returned []
Running 501 sub problems to find dead transitions.
[2024-05-21 22:50:41] [INFO ] Flow matrix only has 203 transitions (discarded 299 similar events)
[2024-05-21 22:50:41] [INFO ] Invariant cache hit.
[2024-05-21 22:50:41] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 202/335 variables, 133/157 constraints. Problems are: Problem set: 0 solved, 501 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 129/286 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 5 (OVERLAPS) 1/336 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 7 (OVERLAPS) 1/337 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 9 (OVERLAPS) 0/337 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 501 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 288 constraints, problems are : Problem set: 0 solved, 501 unsolved in 23641 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 134/134 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 501 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 202/335 variables, 133/157 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 129/286 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 501/787 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 0/787 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 6 (OVERLAPS) 1/336 variables, 1/788 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 8 (OVERLAPS) 1/337 variables, 1/789 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 789 constraints, problems are : Problem set: 0 solved, 501 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 134/134 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 0/0 constraints]
After SMT, in 54126ms problems are : Problem set: 0 solved, 501 unsolved
Search for dead transitions found 0 dead transitions in 54132ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54743 ms. Remains : 134/134 places, 502/502 transitions.
Built C files in :
/tmp/ltsmin37396784699379718
[2024-05-21 22:51:35] [INFO ] Computing symmetric may disable matrix : 502 transitions.
[2024-05-21 22:51:35] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:51:35] [INFO ] Computing symmetric may enable matrix : 502 transitions.
[2024-05-21 22:51:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:51:35] [INFO ] Computing Do-Not-Accords matrix : 502 transitions.
[2024-05-21 22:51:35] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 22:51:35] [INFO ] Built C files in 90ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin37396784699379718
Running compilation step : cd /tmp/ltsmin37396784699379718;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1555 ms.
Running link step : cd /tmp/ltsmin37396784699379718;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin37396784699379718;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13995531921115270305.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 22:51:50] [INFO ] Flatten gal took : 30 ms
[2024-05-21 22:51:51] [INFO ] Flatten gal took : 30 ms
[2024-05-21 22:51:51] [INFO ] Time to serialize gal into /tmp/LTL11418907628180955750.gal : 5 ms
[2024-05-21 22:51:51] [INFO ] Time to serialize properties into /tmp/LTL314669615905591472.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11418907628180955750.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3319883257133553170.hoa' '-atoms' '/tmp/LTL314669615905591472.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL314669615905591472.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3319883257133553170.hoa
Reverse transition relation is NOT exact ! Due to transitions t2, t24, t29, t32, t59, t64, t67, t94, t99, t102, t129, t134, t137, t164, t169, t172, t199, t...360
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2024-05-21 22:52:06] [INFO ] Flatten gal took : 35 ms
[2024-05-21 22:52:06] [INFO ] Flatten gal took : 24 ms
[2024-05-21 22:52:06] [INFO ] Time to serialize gal into /tmp/LTL13243186543799326355.gal : 14 ms
[2024-05-21 22:52:06] [INFO ] Time to serialize properties into /tmp/LTL6775649594689150546.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13243186543799326355.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6775649594689150546.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G("((((p2==0)||(p4==0))||((p22==0)||(p206==0)))||(p219==0))"))||(F("(((p58==1)&&(p60==1))&&((p84==1)&&(p199==1)))"))))
Formula 0 simplified : F!"((((p2==0)||(p4==0))||((p22==0)||(p206==0)))||(p219==0))" & G!"(((p58==1)&&(p60==1))&&((p84==1)&&(p199==1)))"
Reverse transition relation is NOT exact ! Due to transitions t2, t24, t29, t32, t59, t64, t67, t94, t99, t102, t129, t134, t137, t164, t169, t172, t199, t...360
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2024-05-21 22:52:21] [INFO ] Flatten gal took : 23 ms
[2024-05-21 22:52:21] [INFO ] Applying decomposition
[2024-05-21 22:52:21] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3594298631787681497.txt' '-o' '/tmp/graph3594298631787681497.bin' '-w' '/tmp/graph3594298631787681497.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3594298631787681497.bin' '-l' '-1' '-v' '-w' '/tmp/graph3594298631787681497.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:52:21] [INFO ] Decomposing Gal with order
[2024-05-21 22:52:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:52:21] [INFO ] Removed a total of 801 redundant transitions.
[2024-05-21 22:52:21] [INFO ] Flatten gal took : 150 ms
[2024-05-21 22:52:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 133 labels/synchronizations in 15 ms.
[2024-05-21 22:52:21] [INFO ] Time to serialize gal into /tmp/LTL6322466445289213719.gal : 6 ms
[2024-05-21 22:52:21] [INFO ] Time to serialize properties into /tmp/LTL8126791877900895698.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6322466445289213719.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8126791877900895698.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((G("((((u37.p2==0)||(u37.p4==0))||((i0.u2.p22==0)||(u37.p206==0)))||(u37.p219==0))"))||(F("(((i2.u14.p58==1)&&(u37.p60==1))&&((i2.u...187
Formula 0 simplified : F!"((((u37.p2==0)||(u37.p4==0))||((i0.u2.p22==0)||(u37.p206==0)))||(u37.p219==0))" & G!"(((i2.u14.p58==1)&&(u37.p60==1))&&((i2.u14.p...179
Reverse transition relation is NOT exact ! Due to transitions t213, t617, t628, u37.t2, i0.t207, i0.t199, i0.u2.t204, i0.u2.t183.t208, i0.u2.t181.t209.t208...496
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
61 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.651059,38836,1,0,45000,1309,3815,77130,1183,4871,105108
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudDeployment-PT-6a-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudDeployment-PT-6a-LTLFireability-10 finished in 228540 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(((X(F(!p1))&&(!p2 U (G(!p2)||(!p2&&G(!p3)))))||G(F(!p1)))))))'
Support contains 8 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 4 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2024-05-21 22:52:22] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2024-05-21 22:52:22] [INFO ] Computed 24 invariants in 3 ms
[2024-05-21 22:52:22] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-21 22:52:22] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 22:52:22] [INFO ] Invariant cache hit.
[2024-05-21 22:52:22] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-21 22:52:22] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2024-05-21 22:52:22] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 22:52:22] [INFO ] Invariant cache hit.
[2024-05-21 22:52:22] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 7 (OVERLAPS) 1/573 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/573 variables, and 395 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 708/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (OVERLAPS) 1/572 variables, 1/1102 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/573 variables, and 1102 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
After SMT, in 60903ms problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 60912ms
Finished structural reductions in LTL mode , in 1 iterations and 61291 ms. Remains : 199/199 places, 709/709 transitions.
Stuttering acceptance computed with spot in 343 ms :[(OR (NOT p0) p1), p1, (AND p1 p2 p3), p1, (AND p1 p2), (AND p1 p3), (AND p1 p3)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-12
Product exploration explored 100000 steps with 2 reset in 112 ms.
Product exploration explored 100000 steps with 0 reset in 118 ms.
Computed a total of 97 stabilizing places and 505 stable transitions
Graph (complete) has 1967 edges and 199 vertex of which 198 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 97 stabilizing places and 505 stable transitions
Detected a total of 97/199 stabilizing places and 505/709 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X p2), (X (NOT p3)), (X (NOT (OR p1 (NOT p2)))), (X p0), (X (AND (NOT p3) p2)), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p1 p2))), (X (AND p0 p2)), (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2))))), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p1 p3 p2))), (X (NOT (AND p3 p2))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (OR p1 (NOT p2))))), (X (X p0)), (X (X (AND (NOT p3) p2))), (X (X (NOT (OR (AND p1 p3) (AND p3 (NOT p2)))))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 p2))), (X (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2)))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p1 p3 p2)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 35 factoid took 679 ms. Reduced automaton from 7 states, 27 edges and 4 AP (stutter sensitive) to 7 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 313 ms :[(AND p1 p2 p3), p1, (AND p1 p2 p3), p1, (AND p1 p2), (AND p1 p3), (AND p1 p3)]
RANDOM walk for 40000 steps (449 resets) in 229 ms. (173 steps per ms) remains 4/13 properties
BEST_FIRST walk for 40002 steps (29 resets) in 247 ms. (161 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (46 resets) in 402 ms. (99 steps per ms) remains 1/4 properties
[2024-05-21 22:53:25] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 22:53:25] [INFO ] Invariant cache hit.
[2024-05-21 22:53:25] [INFO ] State equation strengthened by 172 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 169/198 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/573 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/573 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/573 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 573/573 variables, and 395 constraints, problems are : Problem set: 0 solved, 1 unsolved in 185 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 169/198 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/571 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/572 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/573 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/573 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/573 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 573/573 variables, and 396 constraints, problems are : Problem set: 0 solved, 1 unsolved in 259 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 459ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 3 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 237 edges and 199 vertex of which 58 / 199 are part of one of the 18 SCC in 0 ms
Free SCC test removed 40 places
Drop transitions (Empty/Sink Transition effects.) removed 129 transitions
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 170 transitions.
Graph (complete) has 1063 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 8 place count 152 transition count 497
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 152 transition count 497
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 26 place count 146 transition count 491
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 62 place count 128 transition count 557
Drop transitions (Redundant composition of simpler transitions.) removed 109 transitions
Redundant transition composition rules discarded 109 transitions
Iterating global reduction 0 with 109 rules applied. Total rules applied 171 place count 128 transition count 448
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 172 place count 128 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 173 place count 127 transition count 449
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 174 place count 127 transition count 448
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 175 place count 127 transition count 448
Applied a total of 175 rules in 84 ms. Remains 127 /199 variables (removed 72) and now considering 448/709 (removed 261) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 127/199 places, 448/709 transitions.
RANDOM walk for 40000 steps (590 resets) in 206 ms. (193 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (20 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1040280 steps, run timeout after 3001 ms. (steps per millisecond=346 ) properties seen :0 out of 1
Probabilistic random walk after 1040280 steps, saw 184135 distinct states, run finished after 3006 ms. (steps per millisecond=346 ) properties seen :0
[2024-05-21 22:53:29] [INFO ] Flow matrix only has 196 transitions (discarded 252 similar events)
// Phase 1: matrix 196 rows 127 cols
[2024-05-21 22:53:29] [INFO ] Computed 24 invariants in 3 ms
[2024-05-21 22:53:29] [INFO ] State equation strengthened by 131 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/76 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/78 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 22:53:29] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 49/127 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 196/323 variables, 127/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 131/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/323 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/323 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 283 constraints, problems are : Problem set: 0 solved, 1 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 127/127 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 60/76 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/78 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 49/127 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 196/323 variables, 127/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 131/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/323 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 22:53:29] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 3 ms to minimize.
Problem apf5 is UNSAT
After SMT solving in domain Int declared 323/323 variables, and 285 constraints, problems are : Problem set: 1 solved, 0 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 127/127 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 388ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) (NOT p3)), (X p2), (X (NOT p3)), (X (NOT (OR p1 (NOT p2)))), (X p0), (X (AND (NOT p3) p2)), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p1 p2))), (X (AND p0 p2)), (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2))))), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p1 p3 p2))), (X (NOT (AND p3 p2))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (OR p1 (NOT p2))))), (X (X p0)), (X (X (AND (NOT p3) p2))), (X (X (NOT (OR (AND p1 p3) (AND p3 (NOT p2)))))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 p2))), (X (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2)))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p1 p3 p2)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p2 (NOT p3)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p3) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR p3 (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND (OR p2 (NOT p3)) (OR (NOT p3) (NOT p1))))), (F p1), (F p2), (F (NOT (OR (NOT p2) p3))), (F p3), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p3) (NOT p1))))]
Knowledge based reduction with 36 factoid took 2623 ms. Reduced automaton from 7 states, 23 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND p1 p3), p1, (AND p1 p3), p1]
Stuttering acceptance computed with spot in 177 ms :[(AND p1 p3), p1, (AND p1 p3), p1]
Support contains 8 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 5 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2024-05-21 22:53:32] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2024-05-21 22:53:32] [INFO ] Computed 24 invariants in 2 ms
[2024-05-21 22:53:32] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 22:53:32] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 22:53:32] [INFO ] Invariant cache hit.
[2024-05-21 22:53:32] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-21 22:53:33] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2024-05-21 22:53:33] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 22:53:33] [INFO ] Invariant cache hit.
[2024-05-21 22:53:33] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 7 (OVERLAPS) 1/573 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/573 variables, and 395 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 708/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (OVERLAPS) 1/572 variables, 1/1102 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/573 variables, and 1102 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
After SMT, in 61079ms problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 61087ms
Finished structural reductions in LTL mode , in 1 iterations and 61463 ms. Remains : 199/199 places, 709/709 transitions.
Computed a total of 97 stabilizing places and 505 stable transitions
Graph (complete) has 1967 edges and 199 vertex of which 198 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 97 stabilizing places and 505 stable transitions
Detected a total of 97/199 stabilizing places and 505/709 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2)), (X (NOT p3)), (X (NOT (AND p3 p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (OR (NOT p2) p1)))), (X (X (NOT (AND p3 p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 248 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND p1 p3), p1, (AND p1 p3), p1]
RANDOM walk for 40000 steps (459 resets) in 310 ms. (128 steps per ms) remains 1/5 properties
BEST_FIRST walk for 31305 steps (24 resets) in 41 ms. (745 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2)), (X (NOT p3)), (X (NOT (AND p3 p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (OR (NOT p2) p1)))), (X (X (NOT (AND p3 p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p3) (NOT p1)))), (F p2), (F (NOT (OR p1 (NOT p2)))), (F p3)]
Knowledge based reduction with 11 factoid took 629 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND p1 p3), p1, (AND p1 p3), p1]
Stuttering acceptance computed with spot in 155 ms :[(AND p1 p3), p1, (AND p1 p3), p1]
Stuttering acceptance computed with spot in 139 ms :[(AND p1 p3), p1, (AND p1 p3), p1]
Product exploration explored 100000 steps with 0 reset in 69 ms.
Product exploration explored 100000 steps with 0 reset in 73 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 188 ms :[(AND p1 p3), p1, (AND p1 p3), p1]
Support contains 8 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 233 edges and 199 vertex of which 58 / 199 are part of one of the 18 SCC in 0 ms
Free SCC test removed 40 places
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 153 transition count 546
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 153 transition count 546
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -104
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 0 with 17 rules applied. Total rules applied 30 place count 153 transition count 650
Deduced a syphon composed of 17 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 121 transitions
Redundant transition composition rules discarded 121 transitions
Iterating global reduction 0 with 121 rules applied. Total rules applied 151 place count 153 transition count 529
Deduced a syphon composed of 17 places in 0 ms
Applied a total of 151 rules in 32 ms. Remains 153 /199 variables (removed 46) and now considering 529/709 (removed 180) transitions.
[2024-05-21 22:54:36] [INFO ] Redundant transitions in 305 ms returned []
Running 528 sub problems to find dead transitions.
[2024-05-21 22:54:36] [INFO ] Flow matrix only has 230 transitions (discarded 299 similar events)
// Phase 1: matrix 230 rows 153 cols
[2024-05-21 22:54:36] [INFO ] Computed 24 invariants in 1 ms
[2024-05-21 22:54:36] [INFO ] State equation strengthened by 131 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 528 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 528 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD101 is UNSAT
At refinement iteration 2 (OVERLAPS) 229/381 variables, 152/176 constraints. Problems are: Problem set: 23 solved, 505 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 130/306 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/306 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 5 (OVERLAPS) 1/382 variables, 1/307 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 0/307 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 7 (OVERLAPS) 1/383 variables, 1/308 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 0/308 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 9 (OVERLAPS) 0/383 variables, 0/308 constraints. Problems are: Problem set: 23 solved, 505 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 308 constraints, problems are : Problem set: 23 solved, 505 unsolved in 25191 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 153/153 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 528/528 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 23 solved, 505 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 18/18 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/18 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 2 (OVERLAPS) 17/152 variables, 6/24 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/24 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 4 (OVERLAPS) 229/381 variables, 152/176 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 130/306 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 505/811 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/811 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 8 (OVERLAPS) 1/382 variables, 1/812 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/812 constraints. Problems are: Problem set: 23 solved, 505 unsolved
At refinement iteration 10 (OVERLAPS) 1/383 variables, 1/813 constraints. Problems are: Problem set: 23 solved, 505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/383 variables, and 813 constraints, problems are : Problem set: 23 solved, 505 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 153/153 constraints, ReadFeed: 131/131 constraints, PredecessorRefiner: 505/528 constraints, Known Traps: 0/0 constraints]
After SMT, in 55723ms problems are : Problem set: 23 solved, 505 unsolved
Search for dead transitions found 23 dead transitions in 55729ms
Found 23 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 23 transitions
Dead transitions reduction (with SMT) removed 23 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 153/199 places, 506/709 transitions.
Graph (complete) has 1622 edges and 153 vertex of which 136 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 136 /153 variables (removed 17) and now considering 506/506 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 136/199 places, 506/709 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 56091 ms. Remains : 136/199 places, 506/709 transitions.
Built C files in :
/tmp/ltsmin8931327753298225983
[2024-05-21 22:55:32] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8931327753298225983
Running compilation step : cd /tmp/ltsmin8931327753298225983;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1451 ms.
Running link step : cd /tmp/ltsmin8931327753298225983;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin8931327753298225983;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11863231399309239854.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 4 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2024-05-21 22:55:47] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2024-05-21 22:55:47] [INFO ] Computed 24 invariants in 4 ms
[2024-05-21 22:55:47] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-21 22:55:47] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 22:55:47] [INFO ] Invariant cache hit.
[2024-05-21 22:55:47] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-21 22:55:47] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2024-05-21 22:55:47] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 22:55:47] [INFO ] Invariant cache hit.
[2024-05-21 22:55:47] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 7 (OVERLAPS) 1/573 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/573 variables, and 395 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 708/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (OVERLAPS) 1/572 variables, 1/1102 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/573 variables, and 1102 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
After SMT, in 60990ms problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 60998ms
Finished structural reductions in LTL mode , in 1 iterations and 61374 ms. Remains : 199/199 places, 709/709 transitions.
Built C files in :
/tmp/ltsmin10581123394251165115
[2024-05-21 22:56:48] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10581123394251165115
Running compilation step : cd /tmp/ltsmin10581123394251165115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1413 ms.
Running link step : cd /tmp/ltsmin10581123394251165115;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin10581123394251165115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12931575543259598608.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 22:57:04] [INFO ] Flatten gal took : 55 ms
[2024-05-21 22:57:04] [INFO ] Flatten gal took : 26 ms
[2024-05-21 22:57:04] [INFO ] Time to serialize gal into /tmp/LTL4263723795291731839.gal : 31 ms
[2024-05-21 22:57:04] [INFO ] Time to serialize properties into /tmp/LTL13738951670653831538.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4263723795291731839.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3227240085175192611.hoa' '-atoms' '/tmp/LTL13738951670653831538.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13738951670653831538.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3227240085175192611.hoa
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t16, t24, t29, t32, t33, t36, t38, t51, t59, t64, t67, t68, t71, t73, t86, t94, t99, ...453
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2024-05-21 22:57:19] [INFO ] Flatten gal took : 23 ms
[2024-05-21 22:57:19] [INFO ] Flatten gal took : 22 ms
[2024-05-21 22:57:19] [INFO ] Time to serialize gal into /tmp/LTL4059912807022228057.gal : 5 ms
[2024-05-21 22:57:19] [INFO ] Time to serialize properties into /tmp/LTL14401564846162572442.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4059912807022228057.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14401564846162572442.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((F((G(F("((((p58!=1)||(p60!=1))||((p78!=1)||(p206!=1)))||(((p219!=1)||(p32!=1))||(p86!=1)))")))||((X(F("((((p58!=1)||(p60!=1))||(...399
Formula 0 simplified : G(!"((((p58==0)||(p60==0))||((p78==0)||(p206==0)))||(p219==0))" | G(FG!"((((p58!=1)||(p60!=1))||((p78!=1)||(p206!=1)))||(((p219!=1)|...315
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t16, t24, t29, t32, t33, t36, t38, t51, t59, t64, t67, t68, t71, t73, t86, t94, t99, ...453
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2024-05-21 22:57:34] [INFO ] Flatten gal took : 39 ms
[2024-05-21 22:57:34] [INFO ] Applying decomposition
[2024-05-21 22:57:34] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13868820845724442884.txt' '-o' '/tmp/graph13868820845724442884.bin' '-w' '/tmp/graph13868820845724442884.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13868820845724442884.bin' '-l' '-1' '-v' '-w' '/tmp/graph13868820845724442884.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:57:34] [INFO ] Decomposing Gal with order
[2024-05-21 22:57:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:57:34] [INFO ] Removed a total of 823 redundant transitions.
[2024-05-21 22:57:34] [INFO ] Flatten gal took : 70 ms
[2024-05-21 22:57:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 261 labels/synchronizations in 13 ms.
[2024-05-21 22:57:34] [INFO ] Time to serialize gal into /tmp/LTL13004333870557123984.gal : 5 ms
[2024-05-21 22:57:34] [INFO ] Time to serialize properties into /tmp/LTL2395318638221946684.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13004333870557123984.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2395318638221946684.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((F((G(F("((((i8.u58.p58!=1)||(i8.u58.p60!=1))||((i2.i1.u16.p78!=1)||(i8.u58.p206!=1)))||(((i8.u58.p219!=1)||(i8.u58.p32!=1))||(i8...593
Formula 0 simplified : G(!"((((i8.u58.p58==0)||(i8.u58.p60==0))||((i2.i1.u16.p78==0)||(i8.u58.p206==0)))||(i8.u58.p219==0))" | G(FG!"((((i8.u58.p58!=1)||(i...481
Reverse transition relation is NOT exact ! Due to transitions t213, t617, t628, i0.t191, i0.i0.t199, i0.i0.t204, i0.i0.u4.t580, i0.i1.t179, i0.i1.t207, i0....777
Computing Next relation with stutter on 2 deadlock states
6 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
106 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.11648,62912,1,0,79157,2276,4657,142026,1380,11980,127955
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudDeployment-PT-6a-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudDeployment-PT-6a-LTLFireability-12 finished in 313519 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 3 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Applied a total of 0 rules in 2 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2024-05-21 22:57:35] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 22:57:35] [INFO ] Invariant cache hit.
[2024-05-21 22:57:36] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 22:57:36] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 22:57:36] [INFO ] Invariant cache hit.
[2024-05-21 22:57:36] [INFO ] State equation strengthened by 172 read => feed constraints.
[2024-05-21 22:57:36] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2024-05-21 22:57:36] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2024-05-21 22:57:36] [INFO ] Invariant cache hit.
[2024-05-21 22:57:36] [INFO ] State equation strengthened by 172 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 7 (OVERLAPS) 1/573 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/573 variables, and 395 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 708/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/1101 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 6 (OVERLAPS) 1/572 variables, 1/1102 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/573 variables, and 1102 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 0/0 constraints]
After SMT, in 60990ms problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 60999ms
Finished structural reductions in LTL mode , in 1 iterations and 61368 ms. Remains : 199/199 places, 709/709 transitions.
Stuttering acceptance computed with spot in 147 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-6a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLFireability-13 finished in 61534 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p1)||p0)))'
Support contains 9 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 709/709 transitions.
Graph (trivial) has 235 edges and 199 vertex of which 60 / 199 are part of one of the 18 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 151 transition count 541
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 151 transition count 541
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 49 place count 133 transition count 607
Drop transitions (Redundant composition of simpler transitions.) removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 0 with 108 rules applied. Total rules applied 157 place count 133 transition count 499
Applied a total of 157 rules in 46 ms. Remains 133 /199 variables (removed 66) and now considering 499/709 (removed 210) transitions.
[2024-05-21 22:58:37] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
// Phase 1: matrix 200 rows 133 cols
[2024-05-21 22:58:37] [INFO ] Computed 24 invariants in 4 ms
[2024-05-21 22:58:37] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-21 22:58:37] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2024-05-21 22:58:37] [INFO ] Invariant cache hit.
[2024-05-21 22:58:37] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-05-21 22:58:37] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2024-05-21 22:58:38] [INFO ] Redundant transitions in 357 ms returned []
Running 498 sub problems to find dead transitions.
[2024-05-21 22:58:38] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2024-05-21 22:58:38] [INFO ] Invariant cache hit.
[2024-05-21 22:58:38] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (OVERLAPS) 199/331 variables, 132/156 constraints. Problems are: Problem set: 0 solved, 498 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 129/285 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (OVERLAPS) 1/332 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 7 (OVERLAPS) 1/333 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 9 (OVERLAPS) 0/333 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 498 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 287 constraints, problems are : Problem set: 0 solved, 498 unsolved in 23136 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 133/133 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (OVERLAPS) 199/331 variables, 132/156 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 129/285 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 498/783 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (OVERLAPS) 1/332 variables, 1/784 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 8 (OVERLAPS) 1/333 variables, 1/785 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 333/333 variables, and 785 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 133/133 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 0/0 constraints]
After SMT, in 53631ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 53636ms
Starting structural reductions in SI_LTL mode, iteration 1 : 133/199 places, 499/709 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54516 ms. Remains : 133/199 places, 499/709 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 90 ms.
Product exploration explored 100000 steps with 0 reset in 100 ms.
Computed a total of 79 stabilizing places and 391 stable transitions
Graph (complete) has 1607 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 79 stabilizing places and 391 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 8 factoid took 155 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (641 resets) in 185 ms. (215 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (69 resets) in 63 ms. (625 steps per ms) remains 1/3 properties
[2024-05-21 22:59:32] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2024-05-21 22:59:32] [INFO ] Invariant cache hit.
[2024-05-21 22:59:32] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 132/333 variables, and 24 constraints, problems are : Problem set: 1 solved, 0 unsolved in 34 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/133 constraints, ReadFeed: 0/130 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 60ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (G (OR p1 p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 9 factoid took 268 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 9 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 499/499 transitions.
Applied a total of 0 rules in 15 ms. Remains 133 /133 variables (removed 0) and now considering 499/499 (removed 0) transitions.
[2024-05-21 22:59:33] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2024-05-21 22:59:33] [INFO ] Invariant cache hit.
[2024-05-21 22:59:33] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 22:59:33] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2024-05-21 22:59:33] [INFO ] Invariant cache hit.
[2024-05-21 22:59:33] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-05-21 22:59:33] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-05-21 22:59:33] [INFO ] Redundant transitions in 299 ms returned []
Running 498 sub problems to find dead transitions.
[2024-05-21 22:59:33] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2024-05-21 22:59:33] [INFO ] Invariant cache hit.
[2024-05-21 22:59:33] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (OVERLAPS) 199/331 variables, 132/156 constraints. Problems are: Problem set: 0 solved, 498 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 129/285 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (OVERLAPS) 1/332 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 7 (OVERLAPS) 1/333 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 9 (OVERLAPS) 0/333 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 498 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 287 constraints, problems are : Problem set: 0 solved, 498 unsolved in 23175 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 133/133 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (OVERLAPS) 199/331 variables, 132/156 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 129/285 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 498/783 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (OVERLAPS) 1/332 variables, 1/784 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 8 (OVERLAPS) 1/333 variables, 1/785 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 333/333 variables, and 785 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 133/133 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 0/0 constraints]
After SMT, in 53632ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 53638ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54247 ms. Remains : 133/133 places, 499/499 transitions.
Computed a total of 79 stabilizing places and 391 stable transitions
Graph (complete) has 1607 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 79 stabilizing places and 391 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 160 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (646 resets) in 767 ms. (52 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (70 resets) in 72 ms. (548 steps per ms) remains 1/3 properties
[2024-05-21 23:00:27] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2024-05-21 23:00:27] [INFO ] Invariant cache hit.
[2024-05-21 23:00:27] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 132/333 variables, and 24 constraints, problems are : Problem set: 1 solved, 0 unsolved in 48 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/133 constraints, ReadFeed: 0/130 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 62ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (G (OR p0 p1))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 296 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 90 ms.
Product exploration explored 100000 steps with 0 reset in 100 ms.
Built C files in :
/tmp/ltsmin2505194524661631214
[2024-05-21 23:00:28] [INFO ] Computing symmetric may disable matrix : 499 transitions.
[2024-05-21 23:00:28] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:00:28] [INFO ] Computing symmetric may enable matrix : 499 transitions.
[2024-05-21 23:00:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:00:28] [INFO ] Computing Do-Not-Accords matrix : 499 transitions.
[2024-05-21 23:00:28] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:00:28] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2505194524661631214
Running compilation step : cd /tmp/ltsmin2505194524661631214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1553 ms.
Running link step : cd /tmp/ltsmin2505194524661631214;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin2505194524661631214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10897798707401356223.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 9 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 499/499 transitions.
Applied a total of 0 rules in 15 ms. Remains 133 /133 variables (removed 0) and now considering 499/499 (removed 0) transitions.
[2024-05-21 23:00:43] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2024-05-21 23:00:43] [INFO ] Invariant cache hit.
[2024-05-21 23:00:43] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 23:00:43] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2024-05-21 23:00:43] [INFO ] Invariant cache hit.
[2024-05-21 23:00:44] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-05-21 23:00:44] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2024-05-21 23:00:44] [INFO ] Redundant transitions in 332 ms returned []
Running 498 sub problems to find dead transitions.
[2024-05-21 23:00:44] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2024-05-21 23:00:44] [INFO ] Invariant cache hit.
[2024-05-21 23:00:44] [INFO ] State equation strengthened by 130 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (OVERLAPS) 199/331 variables, 132/156 constraints. Problems are: Problem set: 0 solved, 498 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 129/285 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (OVERLAPS) 1/332 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 7 (OVERLAPS) 1/333 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 9 (OVERLAPS) 0/333 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 498 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 287 constraints, problems are : Problem set: 0 solved, 498 unsolved in 23289 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 133/133 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (OVERLAPS) 199/331 variables, 132/156 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/331 variables, 129/285 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 498/783 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/331 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (OVERLAPS) 1/332 variables, 1/784 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/784 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 8 (OVERLAPS) 1/333 variables, 1/785 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 333/333 variables, and 785 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 133/133 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 0/0 constraints]
After SMT, in 53750ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 53756ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54387 ms. Remains : 133/133 places, 499/499 transitions.
Built C files in :
/tmp/ltsmin9374006017281853166
[2024-05-21 23:01:38] [INFO ] Computing symmetric may disable matrix : 499 transitions.
[2024-05-21 23:01:38] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:01:38] [INFO ] Computing symmetric may enable matrix : 499 transitions.
[2024-05-21 23:01:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:01:38] [INFO ] Computing Do-Not-Accords matrix : 499 transitions.
[2024-05-21 23:01:38] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:01:38] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9374006017281853166
Running compilation step : cd /tmp/ltsmin9374006017281853166;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1540 ms.
Running link step : cd /tmp/ltsmin9374006017281853166;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin9374006017281853166;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16829366722265627943.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 23:01:53] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:01:53] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:01:53] [INFO ] Time to serialize gal into /tmp/LTL17619541261339638407.gal : 3 ms
[2024-05-21 23:01:53] [INFO ] Time to serialize properties into /tmp/LTL2770164694884779961.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17619541261339638407.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3718401482292329114.hoa' '-atoms' '/tmp/LTL2770164694884779961.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2770164694884779961.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3718401482292329114.hoa
Reverse transition relation is NOT exact ! Due to transitions t2, t24, t29, t32, t59, t64, t67, t94, t99, t102, t129, t134, t137, t164, t169, t172, t199, t...344
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2024-05-21 23:02:08] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:02:08] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:02:08] [INFO ] Time to serialize gal into /tmp/LTL8965928369886732196.gal : 4 ms
[2024-05-21 23:02:08] [INFO ] Time to serialize properties into /tmp/LTL12135939988234042466.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8965928369886732196.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12135939988234042466.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("(((p114!=1)||(p116!=1))||((p120!=1)||(p206!=1)))")||(("(p219!=1)")||(G("(((p30!=1)||(p32!=1))||((p56!=1)||(p207!=1)))"))))))
Formula 0 simplified : F(!"(((p114!=1)||(p116!=1))||((p120!=1)||(p206!=1)))" & !"(p219!=1)" & F!"(((p30!=1)||(p32!=1))||((p56!=1)||(p207!=1)))")
Reverse transition relation is NOT exact ! Due to transitions t2, t24, t29, t32, t59, t64, t67, t94, t99, t102, t129, t134, t137, t164, t169, t172, t199, t...344
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2024-05-21 23:02:23] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:02:23] [INFO ] Applying decomposition
[2024-05-21 23:02:23] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2033038450651043249.txt' '-o' '/tmp/graph2033038450651043249.bin' '-w' '/tmp/graph2033038450651043249.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2033038450651043249.bin' '-l' '-1' '-v' '-w' '/tmp/graph2033038450651043249.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:02:23] [INFO ] Decomposing Gal with order
[2024-05-21 23:02:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:02:23] [INFO ] Removed a total of 795 redundant transitions.
[2024-05-21 23:02:23] [INFO ] Flatten gal took : 54 ms
[2024-05-21 23:02:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 139 labels/synchronizations in 22 ms.
[2024-05-21 23:02:23] [INFO ] Time to serialize gal into /tmp/LTL2458537556558254382.gal : 10 ms
[2024-05-21 23:02:23] [INFO ] Time to serialize properties into /tmp/LTL1447495327175540619.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2458537556558254382.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1447495327175540619.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(("(((i4.u26.p114!=1)||(u47.p116!=1))||((i4.u22.p120!=1)||(u47.p206!=1)))")||(("(u47.p219!=1)")||(G("(((u47.p30!=1)||(u47.p32!=1))...206
Formula 0 simplified : F(!"(((i4.u26.p114!=1)||(u47.p116!=1))||((i4.u22.p120!=1)||(u47.p206!=1)))" & !"(u47.p219!=1)" & F!"(((u47.p30!=1)||(u47.p32!=1))||(...198
Reverse transition relation is NOT exact ! Due to transitions t213, t617, t628, u47.t2, i0.t183_t208, i0.t207, i0.t204, i0.u2.t199, i1.t172, i1.i0.t169, i1...475
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
0 strongly connected components in search stack
5 transitions explored
2 items max in DFS search stack
40 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.452411,32460,1,0,32704,1241,3712,55604,1123,3912,93256
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CloudDeployment-PT-6a-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudDeployment-PT-6a-LTLFireability-14 finished in 226769 ms.
All properties solved by simple procedures.
Total runtime 1480963 ms.
BK_STOP 1716332544320
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudDeployment-PT-6a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is CloudDeployment-PT-6a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r070-tall-171620506200604"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-6a.tgz
mv CloudDeployment-PT-6a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;