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 |
| 0.000 | 1446425.00 | 0.00 | 0.00 | FFFFTFFFFFFTFFTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r044-tall-174854027700068.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
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 r044-tall-174854027700068
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 704K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 317K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml 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 1748560697725
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 202505121319
[2025-05-29 23:18:18] [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]
[2025-05-29 23:18:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 23:18:19] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2025-05-29 23:18:19] [INFO ] Transformed 221 places.
[2025-05-29 23:18:19] [INFO ] Transformed 908 transitions.
[2025-05-29 23:18:19] [INFO ] Found NUPN structural information;
[2025-05-29 23:18:19] [INFO ] Parsed PT model containing 221 places and 908 transitions and 5517 arcs in 204 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-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6a-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 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 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 207 transition count 792
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 207 transition count 792
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 205 transition count 790
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 205 transition count 790
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 204 transition count 789
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 204 transition count 789
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 97 place count 204 transition count 714
Applied a total of 97 rules in 79 ms. Remains 204 /221 variables (removed 17) and now considering 714/794 (removed 80) transitions.
[2025-05-29 23:18:19] [INFO ] Flow matrix only has 379 transitions (discarded 335 similar events)
// Phase 1: matrix 379 rows 204 cols
[2025-05-29 23:18:19] [INFO ] Computed 24 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:18:19] [INFO ] Implicit Places using invariants in 265 ms returned []
[2025-05-29 23:18:19] [INFO ] Flow matrix only has 379 transitions (discarded 335 similar events)
[2025-05-29 23:18:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:18:19] [INFO ] State equation strengthened by 177 read => feed constraints.
[2025-05-29 23:18:20] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 851 ms to find 0 implicit places.
Running 713 sub problems to find dead transitions.
[2025-05-29 23:18:20] [INFO ] Flow matrix only has 379 transitions (discarded 335 similar events)
[2025-05-29 23:18:20] [INFO ] Invariant cache hit.
[2025-05-29 23:18:20] [INFO ] State equation strengthened by 177 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 2 (OVERLAPS) 378/581 variables, 203/227 constraints. Problems are: Problem set: 0 solved, 713 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 176/403 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 5 (OVERLAPS) 1/582 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 713 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 582/583 variables, and 404 constraints, problems are : Problem set: 0 solved, 713 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 204/204 constraints, ReadFeed: 176/177 constraints, PredecessorRefiner: 713/712 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 713 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 2 (OVERLAPS) 378/581 variables, 203/227 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 176/403 constraints. Problems are: Problem set: 0 solved, 713 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 712/1115 constraints. Problems are: Problem set: 0 solved, 713 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 581/583 variables, and 1115 constraints, problems are : Problem set: 0 solved, 713 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 203/204 constraints, ReadFeed: 176/177 constraints, PredecessorRefiner: 713/712 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60993ms problems are : Problem set: 0 solved, 713 unsolved
Search for dead transitions found 0 dead transitions in 61010ms
Starting structural reductions in LTL mode, iteration 1 : 204/221 places, 714/794 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61969 ms. Remains : 204/221 places, 714/794 transitions.
Support contains 41 out of 204 places after structural reductions.
[2025-05-29 23:19:21] [INFO ] Flatten gal took : 81 ms
[2025-05-29 23:19:21] [INFO ] Flatten gal took : 59 ms
[2025-05-29 23:19:21] [INFO ] Input system was already deterministic with 714 transitions.
RANDOM walk for 40000 steps (458 resets) in 1664 ms. (24 steps per ms) remains 5/31 properties
BEST_FIRST walk for 40004 steps (16 resets) in 134 ms. (296 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (33 resets) in 66 ms. (597 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40001 steps (11 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
[2025-05-29 23:19:22] [INFO ] Flow matrix only has 379 transitions (discarded 335 similar events)
[2025-05-29 23:19:22] [INFO ] Invariant cache hit.
[2025-05-29 23:19:22] [INFO ] State equation strengthened by 177 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 193/203 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 378/581 variables, 203/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 176/403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/582 variables, 1/404 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 0/404 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/583 variables, 1/405 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 0/405 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/583 variables, 0/405 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 583/583 variables, and 405 constraints, problems are : Problem set: 1 solved, 1 unsolved in 231 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 204/204 constraints, ReadFeed: 177/177 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 197/203 variables, 24/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 378/581 variables, 203/227 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 176/403 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 1/404 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 0/404 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp30 is UNSAT
After SMT solving in domain Int declared 582/583 variables, and 405 constraints, problems are : Problem set: 2 solved, 0 unsolved in 232 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 204/204 constraints, ReadFeed: 176/177 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 479ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA CloudDeployment-PT-6a-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA CloudDeployment-PT-6a-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 102 stabilizing places and 510 stable transitions
Graph (complete) has 1980 edges and 204 vertex of which 203 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.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(((p0 U p1) U X(!X(p0))) U G(p2))))'
Support contains 7 out of 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 714/714 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 202 transition count 712
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 202 transition count 712
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 201 transition count 711
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 201 transition count 711
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 200 transition count 710
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 200 transition count 710
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 199 transition count 709
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 199 transition count 709
Applied a total of 10 rules in 19 ms. Remains 199 /204 variables (removed 5) and now considering 709/714 (removed 5) transitions.
[2025-05-29 23:19:23] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2025-05-29 23:19:23] [INFO ] Computed 24 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:19:23] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-05-29 23:19:23] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2025-05-29 23:19:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:19:23] [INFO ] State equation strengthened by 172 read => feed constraints.
[2025-05-29 23:19:23] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2025-05-29 23:19:23] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2025-05-29 23:19:23] [INFO ] Invariant cache hit.
[2025-05-29 23:19:23] [INFO ] State equation strengthened by 172 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
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 Real declared 572/573 variables, and 394 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/707 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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, 707/1100 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/573 variables, and 1100 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 198/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 708/707 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60707ms problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 60711ms
Starting structural reductions in LTL mode, iteration 1 : 199/204 places, 709/714 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61241 ms. Remains : 199/204 places, 709/714 transitions.
Stuttering acceptance computed with spot in 607 ms :[p2, p2, (AND (NOT p0) p2), (AND (NOT p0) p2), (AND p2 p1 (NOT p0)), (AND (NOT p0) p2), (AND p2 (NOT p0)), (AND (NOT p0) p2), (AND p2 p1 (NOT p0)), (AND p2 p1 (NOT p0)), (AND p2 p1 (NOT p0))]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA CloudDeployment-PT-6a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLFireability-00 finished in 61925 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(p0)))||G((p1||X((p2||G(p0))))))))'
Support contains 8 out of 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 714/714 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 203 transition count 713
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 203 transition count 713
Applied a total of 2 rules in 13 ms. Remains 203 /204 variables (removed 1) and now considering 713/714 (removed 1) transitions.
[2025-05-29 23:20:25] [INFO ] Flow matrix only has 378 transitions (discarded 335 similar events)
// Phase 1: matrix 378 rows 203 cols
[2025-05-29 23:20:25] [INFO ] Computed 24 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:20:25] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-05-29 23:20:25] [INFO ] Flow matrix only has 378 transitions (discarded 335 similar events)
[2025-05-29 23:20:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:20:25] [INFO ] State equation strengthened by 176 read => feed constraints.
[2025-05-29 23:20:26] [INFO ] Implicit Places using invariants and state equation in 656 ms returned []
Implicit Place search using SMT with State Equation took 783 ms to find 0 implicit places.
Running 712 sub problems to find dead transitions.
[2025-05-29 23:20:26] [INFO ] Flow matrix only has 378 transitions (discarded 335 similar events)
[2025-05-29 23:20:26] [INFO ] Invariant cache hit.
[2025-05-29 23:20:26] [INFO ] State equation strengthened by 176 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 2 (OVERLAPS) 377/579 variables, 202/226 constraints. Problems are: Problem set: 0 solved, 712 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 175/401 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 5 (OVERLAPS) 1/580 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/581 variables, and 402 constraints, problems are : Problem set: 0 solved, 712 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 203/203 constraints, ReadFeed: 175/176 constraints, PredecessorRefiner: 712/711 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 712 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 2 (OVERLAPS) 377/579 variables, 202/226 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 175/401 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 711/1112 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 579/581 variables, and 1112 constraints, problems are : Problem set: 0 solved, 712 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 202/203 constraints, ReadFeed: 175/176 constraints, PredecessorRefiner: 712/711 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60713ms problems are : Problem set: 0 solved, 712 unsolved
Search for dead transitions found 0 dead transitions in 60716ms
Starting structural reductions in LTL mode, iteration 1 : 203/204 places, 713/714 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61517 ms. Remains : 203/204 places, 713/714 transitions.
Stuttering acceptance computed with spot in 482 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), false, false, false, (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-01
Product exploration explored 100000 steps with 29642 reset in 1549 ms.
Product exploration explored 100000 steps with 29649 reset in 1400 ms.
Computed a total of 101 stabilizing places and 509 stable transitions
Graph (complete) has 1978 edges and 203 vertex of which 202 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 101 stabilizing places and 509 stable transitions
Detected a total of 101/203 stabilizing places and 509/713 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X p2), (X (X (NOT p1))), (X (X p2)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 172 ms. Reduced automaton from 13 states, 20 edges and 3 AP (stutter sensitive) to 13 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 536 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), false, false, false, (NOT p0)]
RANDOM walk for 40000 steps (448 resets) in 435 ms. (91 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40003 steps (25 resets) in 163 ms. (243 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (51 resets) in 216 ms. (184 steps per ms) remains 1/1 properties
[2025-05-29 23:21:31] [INFO ] Flow matrix only has 378 transitions (discarded 335 similar events)
[2025-05-29 23:21:31] [INFO ] Invariant cache hit.
[2025-05-29 23:21:31] [INFO ] State equation strengthened by 176 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 48/581 variables, and 9 constraints, problems are : Problem set: 1 solved, 0 unsolved in 32 ms.
Refiners :[Generalized P Invariants (flows): 9/24 constraints, State Equation: 0/203 constraints, ReadFeed: 0/176 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X p2), (X (X (NOT p1))), (X (X p2)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) p2))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p2), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 8 factoid took 499 ms. Reduced automaton from 13 states, 20 edges and 3 AP (stutter sensitive) to 9 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 389 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 354 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
[2025-05-29 23:21:32] [INFO ] Flow matrix only has 378 transitions (discarded 335 similar events)
[2025-05-29 23:21:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-29 23:21:32] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 5 ms returned sat
[2025-05-29 23:21:32] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2025-05-29 23:21:32] [INFO ] State equation strengthened by 176 read => feed constraints.
[2025-05-29 23:21:32] [INFO ] [Real]Added 176 Read/Feed constraints in 21 ms returned sat
[2025-05-29 23:21:32] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-29 23:21:32] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 6 ms returned sat
[2025-05-29 23:21:32] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2025-05-29 23:21:33] [INFO ] [Nat]Added 176 Read/Feed constraints in 24 ms returned sat
[2025-05-29 23:21:33] [INFO ] Computed and/alt/rep : 277/802/277 causal constraints (skipped 100 transitions) in 26 ms.
[2025-05-29 23:21:33] [INFO ] Added : 0 causal constraints over 0 iterations in 66 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 8 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 713/713 transitions.
Applied a total of 0 rules in 4 ms. Remains 203 /203 variables (removed 0) and now considering 713/713 (removed 0) transitions.
[2025-05-29 23:21:33] [INFO ] Flow matrix only has 378 transitions (discarded 335 similar events)
[2025-05-29 23:21:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:21:33] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-05-29 23:21:33] [INFO ] Flow matrix only has 378 transitions (discarded 335 similar events)
[2025-05-29 23:21:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:21:33] [INFO ] State equation strengthened by 176 read => feed constraints.
[2025-05-29 23:21:33] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
Running 712 sub problems to find dead transitions.
[2025-05-29 23:21:33] [INFO ] Flow matrix only has 378 transitions (discarded 335 similar events)
[2025-05-29 23:21:33] [INFO ] Invariant cache hit.
[2025-05-29 23:21:33] [INFO ] State equation strengthened by 176 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 2 (OVERLAPS) 377/579 variables, 202/226 constraints. Problems are: Problem set: 0 solved, 712 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 175/401 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 5 (OVERLAPS) 1/580 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/581 variables, and 402 constraints, problems are : Problem set: 0 solved, 712 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 203/203 constraints, ReadFeed: 175/176 constraints, PredecessorRefiner: 712/711 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 712 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 2 (OVERLAPS) 377/579 variables, 202/226 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 175/401 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 711/1112 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 579/581 variables, and 1112 constraints, problems are : Problem set: 0 solved, 712 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 202/203 constraints, ReadFeed: 175/176 constraints, PredecessorRefiner: 712/711 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60710ms problems are : Problem set: 0 solved, 712 unsolved
Search for dead transitions found 0 dead transitions in 60712ms
Finished structural reductions in LTL mode , in 1 iterations and 61434 ms. Remains : 203/203 places, 713/713 transitions.
Computed a total of 101 stabilizing places and 509 stable transitions
Graph (complete) has 1978 edges and 203 vertex of which 202 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 101 stabilizing places and 509 stable transitions
Detected a total of 101/203 stabilizing places and 509/713 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X p2), (X (X (NOT p1))), (X (X p2)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 162 ms. Reduced automaton from 9 states, 12 edges and 3 AP (stutter sensitive) to 9 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 337 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
RANDOM walk for 40000 steps (442 resets) in 197 ms. (202 steps per ms) remains 1/3 properties
BEST_FIRST walk for 33638 steps (24 resets) in 61 ms. (542 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X p2), (X (X (NOT p1))), (X (X p2)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F p0), (F p2)]
Knowledge based reduction with 7 factoid took 281 ms. Reduced automaton from 9 states, 12 edges and 3 AP (stutter sensitive) to 9 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 348 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 368 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
[2025-05-29 23:22:36] [INFO ] Flow matrix only has 378 transitions (discarded 335 similar events)
[2025-05-29 23:22:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-29 23:22:36] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 5 ms returned sat
[2025-05-29 23:22:36] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2025-05-29 23:22:36] [INFO ] State equation strengthened by 176 read => feed constraints.
[2025-05-29 23:22:36] [INFO ] [Real]Added 176 Read/Feed constraints in 26 ms returned sat
[2025-05-29 23:22:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-29 23:22:36] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 5 ms returned sat
[2025-05-29 23:22:36] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2025-05-29 23:22:36] [INFO ] [Nat]Added 176 Read/Feed constraints in 24 ms returned sat
[2025-05-29 23:22:36] [INFO ] Computed and/alt/rep : 277/802/277 causal constraints (skipped 100 transitions) in 26 ms.
[2025-05-29 23:22:36] [INFO ] Added : 0 causal constraints over 0 iterations in 52 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 325 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 30714 reset in 1421 ms.
Product exploration explored 100000 steps with 30789 reset in 1421 ms.
Applying partial POR strategy [false, false, false, false, true, true, false, false, true]
Stuttering acceptance computed with spot in 323 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 8 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 713/713 transitions.
Graph (trivial) has 236 edges and 203 vertex of which 58 / 203 are part of one of the 17 SCC in 4 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 157 transition count 554
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 157 transition count 554
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 29 place count 157 transition count 662
Deduced a syphon composed of 18 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 126 transitions
Redundant transition composition rules discarded 126 transitions
Iterating global reduction 0 with 126 rules applied. Total rules applied 155 place count 157 transition count 536
Deduced a syphon composed of 18 places in 0 ms
Applied a total of 155 rules in 95 ms. Remains 157 /203 variables (removed 46) and now considering 536/713 (removed 177) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 23:22:40] [INFO ] Redundant transitions in 335 ms returned []
Running 535 sub problems to find dead transitions.
[2025-05-29 23:22:40] [INFO ] Flow matrix only has 231 transitions (discarded 305 similar events)
// Phase 1: matrix 231 rows 157 cols
[2025-05-29 23:22:40] [INFO ] Computed 24 invariants in 2 ms
[2025-05-29 23:22:40] [INFO ] State equation strengthened by 134 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 535 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 TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD99 is UNSAT
At refinement iteration 2 (OVERLAPS) 230/386 variables, 156/180 constraints. Problems are: Problem set: 24 solved, 511 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 133/313 constraints. Problems are: Problem set: 24 solved, 511 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 0/313 constraints. Problems are: Problem set: 24 solved, 511 unsolved
At refinement iteration 5 (OVERLAPS) 1/387 variables, 1/314 constraints. Problems are: Problem set: 24 solved, 511 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/314 constraints. Problems are: Problem set: 24 solved, 511 unsolved
SMT process timed out in 30339ms, After SMT, problems are : Problem set: 24 solved, 511 unsolved
Search for dead transitions found 24 dead transitions in 30340ms
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 : 157/203 places, 512/713 transitions.
Graph (complete) has 1635 edges and 157 vertex of which 139 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 18 ms. Remains 139 /157 variables (removed 18) and now considering 512/512 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 139/203 places, 512/713 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30798 ms. Remains : 139/203 places, 512/713 transitions.
Built C files in :
/tmp/ltsmin362554278650025309
[2025-05-29 23:23:11] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin362554278650025309
Running compilation step : cd /tmp/ltsmin362554278650025309;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1423 ms.
Running link step : cd /tmp/ltsmin362554278650025309;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin362554278650025309;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased622460225610791656.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 713/713 transitions.
Applied a total of 0 rules in 3 ms. Remains 203 /203 variables (removed 0) and now considering 713/713 (removed 0) transitions.
[2025-05-29 23:23:26] [INFO ] Flow matrix only has 378 transitions (discarded 335 similar events)
// Phase 1: matrix 378 rows 203 cols
[2025-05-29 23:23:26] [INFO ] Computed 24 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:23:26] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-05-29 23:23:26] [INFO ] Flow matrix only has 378 transitions (discarded 335 similar events)
[2025-05-29 23:23:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:23:26] [INFO ] State equation strengthened by 176 read => feed constraints.
[2025-05-29 23:23:27] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
Running 712 sub problems to find dead transitions.
[2025-05-29 23:23:27] [INFO ] Flow matrix only has 378 transitions (discarded 335 similar events)
[2025-05-29 23:23:27] [INFO ] Invariant cache hit.
[2025-05-29 23:23:27] [INFO ] State equation strengthened by 176 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 2 (OVERLAPS) 377/579 variables, 202/226 constraints. Problems are: Problem set: 0 solved, 712 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 175/401 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 5 (OVERLAPS) 1/580 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/581 variables, and 402 constraints, problems are : Problem set: 0 solved, 712 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 203/203 constraints, ReadFeed: 175/176 constraints, PredecessorRefiner: 712/711 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 712 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/202 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 2 (OVERLAPS) 377/579 variables, 202/226 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 175/401 constraints. Problems are: Problem set: 0 solved, 712 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 711/1112 constraints. Problems are: Problem set: 0 solved, 712 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 579/581 variables, and 1112 constraints, problems are : Problem set: 0 solved, 712 unsolved in 30048 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 202/203 constraints, ReadFeed: 175/176 constraints, PredecessorRefiner: 712/711 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60734ms problems are : Problem set: 0 solved, 712 unsolved
Search for dead transitions found 0 dead transitions in 60739ms
Finished structural reductions in LTL mode , in 1 iterations and 61446 ms. Remains : 203/203 places, 713/713 transitions.
Built C files in :
/tmp/ltsmin7332586495205710060
[2025-05-29 23:24:27] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7332586495205710060
Running compilation step : cd /tmp/ltsmin7332586495205710060;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1322 ms.
Running link step : cd /tmp/ltsmin7332586495205710060;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7332586495205710060;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17536023874575566585.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-29 23:24:43] [INFO ] Flatten gal took : 38 ms
[2025-05-29 23:24:43] [INFO ] Flatten gal took : 33 ms
[2025-05-29 23:24:43] [INFO ] Time to serialize gal into /tmp/LTL16250159328017383605.gal : 7 ms
[2025-05-29 23:24:43] [INFO ] Time to serialize properties into /tmp/LTL15868266163334355748.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16250159328017383605.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17378675385824870048.hoa' '-atoms' '/tmp/LTL15868266163334355748.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15868266163334355748.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17378675385824870048.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, ...459
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2025-05-29 23:24:58] [INFO ] Flatten gal took : 30 ms
[2025-05-29 23:24:58] [INFO ] Flatten gal took : 30 ms
[2025-05-29 23:24:58] [INFO ] Time to serialize gal into /tmp/LTL17022697412142684922.gal : 7 ms
[2025-05-29 23:24:58] [INFO ] Time to serialize properties into /tmp/LTL12647977324452375382.ltl : 5 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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17022697412142684922.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12647977324452375382.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((X(X(X("((p2==1)&&(p200==1))"))))||(G(("((((p2==1)&&(p4==1))&&((p6==1)&&(p206==1)))&&(p219==1))")||(X(("((p30==1)&&(p88==1))")||(...188
Formula 0 simplified : F(XXX!"((p2==1)&&(p200==1))" & F(!"((((p2==1)&&(p4==1))&&((p6==1)&&(p206==1)))&&(p219==1))" & X(!"((p30==1)&&(p88==1))" & F!"((p2==1...172
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, ...459
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2025-05-29 23:25:13] [INFO ] Flatten gal took : 28 ms
[2025-05-29 23:25:13] [INFO ] Applying decomposition
[2025-05-29 23:25:13] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph112210238151337615.txt' '-o' '/tmp/graph112210238151337615.bin' '-w' '/tmp/graph112210238151337615.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph112210238151337615.bin' '-l' '-1' '-v' '-w' '/tmp/graph112210238151337615.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:25:13] [INFO ] Decomposing Gal with order
[2025-05-29 23:25:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:25:13] [INFO ] Removed a total of 827 redundant transitions.
[2025-05-29 23:25:13] [INFO ] Flatten gal took : 147 ms
[2025-05-29 23:25:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 222 labels/synchronizations in 19 ms.
[2025-05-29 23:25:13] [INFO ] Time to serialize gal into /tmp/LTL3022076675521918607.gal : 7 ms
[2025-05-29 23:25:13] [INFO ] Time to serialize properties into /tmp/LTL12153555402608520275.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3022076675521918607.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12153555402608520275.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((X(X(X("((u60.p2==1)&&(i9.u51.p200==1))"))))||(G(("((((u60.p2==1)&&(u60.p4==1))&&((i0.i0.u0.p6==1)&&(u60.p206==1)))&&(u60.p219==1...243
Formula 0 simplified : F(XXX!"((u60.p2==1)&&(i9.u51.p200==1))" & F(!"((((u60.p2==1)&&(u60.p4==1))&&((i0.i0.u0.p6==1)&&(u60.p206==1)))&&(u60.p219==1))" & X(...227
Reverse transition relation is NOT exact ! Due to transitions t213, t617, t628, t667, u60.t2, i0.t208, i0.t207, i0.t191, i0.i0.t199, i0.i0.t204, i0.i0.u3.t...754
Computing Next relation with stutter on 2 deadlock states
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 items max in DFS search stack
33 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.383089,30420,1,0,20763,1751,4377,43255,1399,6451,53163
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudDeployment-PT-6a-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudDeployment-PT-6a-LTLFireability-01 finished in 288951 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 204/204 places, 714/714 transitions.
Graph (trivial) has 239 edges and 204 vertex of which 60 / 204 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 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 154 transition count 544
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 154 transition count 544
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 153 transition count 543
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 153 transition count 543
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 20 place count 152 transition count 542
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 152 transition count 542
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 22 place count 151 transition count 541
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 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 59 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 167 place count 133 transition count 499
Applied a total of 167 rules in 60 ms. Remains 133 /204 variables (removed 71) and now considering 499/714 (removed 215) transitions.
[2025-05-29 23:25:14] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
// Phase 1: matrix 200 rows 133 cols
[2025-05-29 23:25:14] [INFO ] Computed 24 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:25:14] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-05-29 23:25:14] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2025-05-29 23:25:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:25:14] [INFO ] State equation strengthened by 130 read => feed constraints.
[2025-05-29 23:25:14] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 23:25:14] [INFO ] Redundant transitions in 317 ms returned []
Running 498 sub problems to find dead transitions.
[2025-05-29 23:25:14] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2025-05-29 23:25:14] [INFO ] Invariant cache hit.
[2025-05-29 23:25:14] [INFO ] State equation strengthened by 130 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 333/333 variables, and 287 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30021 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 332/333 variables, and 784 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 133/133 constraints, ReadFeed: 129/130 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60342ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60343ms
Starting structural reductions in SI_LTL mode, iteration 1 : 133/204 places, 499/714 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61110 ms. Remains : 133/204 places, 499/714 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-02
Stuttering criterion allowed to conclude after 1 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 61180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 714/714 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 202 transition count 712
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 202 transition count 712
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 201 transition count 711
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 201 transition count 711
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 200 transition count 710
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 200 transition count 710
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 199 transition count 709
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 199 transition count 709
Applied a total of 10 rules in 13 ms. Remains 199 /204 variables (removed 5) and now considering 709/714 (removed 5) transitions.
[2025-05-29 23:26:15] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2025-05-29 23:26:15] [INFO ] Computed 24 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:26:15] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-05-29 23:26:15] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2025-05-29 23:26:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:26:15] [INFO ] State equation strengthened by 172 read => feed constraints.
[2025-05-29 23:26:15] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2025-05-29 23:26:15] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2025-05-29 23:26:15] [INFO ] Invariant cache hit.
[2025-05-29 23:26:15] [INFO ] State equation strengthened by 172 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/573 variables, and 394 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 708/707 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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, 707/1100 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/573 variables, and 1100 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 198/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 708/707 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60664ms problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 60667ms
Starting structural reductions in LTL mode, iteration 1 : 199/204 places, 709/714 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61266 ms. Remains : 199/204 places, 709/714 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 157 ms.
Entered a terminal (fully accepting) state of product in 7 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 61617 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(!p1))))'
Support contains 3 out of 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 714/714 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 202 transition count 712
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 202 transition count 712
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 201 transition count 711
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 201 transition count 711
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 200 transition count 710
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 200 transition count 710
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 199 transition count 709
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 199 transition count 709
Applied a total of 10 rules in 9 ms. Remains 199 /204 variables (removed 5) and now considering 709/714 (removed 5) transitions.
[2025-05-29 23:27:17] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2025-05-29 23:27:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:27:17] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-05-29 23:27:17] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2025-05-29 23:27:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:27:17] [INFO ] State equation strengthened by 172 read => feed constraints.
[2025-05-29 23:27:17] [INFO ] Implicit Places using invariants and state equation in 704 ms returned []
Implicit Place search using SMT with State Equation took 810 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2025-05-29 23:27:17] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2025-05-29 23:27:17] [INFO ] Invariant cache hit.
[2025-05-29 23:27:17] [INFO ] State equation strengthened by 172 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/573 variables, and 394 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: 171/172 constraints, PredecessorRefiner: 708/707 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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, 707/1100 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/573 variables, and 1100 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 198/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 708/707 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60693ms problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 60695ms
Starting structural reductions in LTL mode, iteration 1 : 199/204 places, 709/714 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61519 ms. Remains : 199/204 places, 709/714 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND p1 (NOT p0)), p1, (AND p1 (NOT p0))]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 2056 ms.
Product exploration explored 100000 steps with 50000 reset in 2043 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.4 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/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X 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 7 factoid took 13 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-6a-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-6a-LTLFireability-04 finished in 65783 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 204/204 places, 714/714 transitions.
Graph (trivial) has 237 edges and 204 vertex of which 58 / 204 are part of one of the 17 SCC in 0 ms
Free SCC test removed 41 places
Ensure Unique test removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 155 transition count 552
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 155 transition count 552
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 16 place count 154 transition count 551
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 154 transition count 551
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 153 transition count 550
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 153 transition count 550
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 20 place count 152 transition count 549
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 152 transition count 549
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 57 place count 134 transition count 615
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 165 place count 134 transition count 507
Applied a total of 165 rules in 59 ms. Remains 134 /204 variables (removed 70) and now considering 507/714 (removed 207) transitions.
[2025-05-29 23:28:22] [INFO ] Flow matrix only has 202 transitions (discarded 305 similar events)
// Phase 1: matrix 202 rows 134 cols
[2025-05-29 23:28:22] [INFO ] Computed 24 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:28:22] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-05-29 23:28:22] [INFO ] Flow matrix only has 202 transitions (discarded 305 similar events)
[2025-05-29 23:28:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:28:23] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-05-29 23:28:23] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 23:28:23] [INFO ] Redundant transitions in 307 ms returned []
Running 464 sub problems to find dead transitions.
[2025-05-29 23:28:23] [INFO ] Flow matrix only has 202 transitions (discarded 305 similar events)
[2025-05-29 23:28:23] [INFO ] Invariant cache hit.
[2025-05-29 23:28:23] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 6/134 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 201/335 variables, 134/158 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 7/165 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 7 (OVERLAPS) 0/335 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 464 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/336 variables, and 165 constraints, problems are : Problem set: 0 solved, 464 unsolved in 27018 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 134/134 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 6/134 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 201/335 variables, 134/158 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 7/165 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 464/629 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 335/336 variables, and 629 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 134/134 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57346ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 57347ms
Starting structural reductions in SI_LTL mode, iteration 1 : 134/204 places, 507/714 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58042 ms. Remains : 134/204 places, 507/714 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-6a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLFireability-05 finished in 58146 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&F(G(p1)))))))'
Support contains 6 out of 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 714/714 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 202 transition count 712
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 202 transition count 712
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 201 transition count 711
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 201 transition count 711
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 200 transition count 710
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 200 transition count 710
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 199 transition count 709
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 199 transition count 709
Applied a total of 10 rules in 13 ms. Remains 199 /204 variables (removed 5) and now considering 709/714 (removed 5) transitions.
[2025-05-29 23:29:20] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2025-05-29 23:29:20] [INFO ] Computed 24 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:29:21] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-05-29 23:29:21] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2025-05-29 23:29:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:29:21] [INFO ] State equation strengthened by 172 read => feed constraints.
[2025-05-29 23:29:21] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2025-05-29 23:29:21] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2025-05-29 23:29:21] [INFO ] Invariant cache hit.
[2025-05-29 23:29:21] [INFO ] State equation strengthened by 172 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/573 variables, and 394 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/707 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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, 707/1100 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/573 variables, and 1100 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 198/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 708/707 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60708ms problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 60711ms
Starting structural reductions in LTL mode, iteration 1 : 199/204 places, 709/714 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61239 ms. Remains : 199/204 places, 709/714 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-6a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLFireability-06 finished in 61483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((((G((p0||X(p1))) U p2) U p1)&&(p0 U p3)))))'
Support contains 9 out of 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 714/714 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 202 transition count 712
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 202 transition count 712
Applied a total of 4 rules in 8 ms. Remains 202 /204 variables (removed 2) and now considering 712/714 (removed 2) transitions.
[2025-05-29 23:30:22] [INFO ] Flow matrix only has 377 transitions (discarded 335 similar events)
// Phase 1: matrix 377 rows 202 cols
[2025-05-29 23:30:22] [INFO ] Computed 24 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:30:22] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-05-29 23:30:22] [INFO ] Flow matrix only has 377 transitions (discarded 335 similar events)
[2025-05-29 23:30:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:30:22] [INFO ] State equation strengthened by 175 read => feed constraints.
[2025-05-29 23:30:22] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
Running 711 sub problems to find dead transitions.
[2025-05-29 23:30:22] [INFO ] Flow matrix only has 377 transitions (discarded 335 similar events)
[2025-05-29 23:30:22] [INFO ] Invariant cache hit.
[2025-05-29 23:30:22] [INFO ] State equation strengthened by 175 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 711 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 711 unsolved
At refinement iteration 2 (OVERLAPS) 376/577 variables, 201/225 constraints. Problems are: Problem set: 0 solved, 711 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/577 variables, 174/399 constraints. Problems are: Problem set: 0 solved, 711 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/577 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 711 unsolved
At refinement iteration 5 (OVERLAPS) 1/578 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 711 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 578/579 variables, and 400 constraints, problems are : Problem set: 0 solved, 711 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 202/202 constraints, ReadFeed: 174/175 constraints, PredecessorRefiner: 711/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 711 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 711 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 711 unsolved
At refinement iteration 2 (OVERLAPS) 376/577 variables, 201/225 constraints. Problems are: Problem set: 0 solved, 711 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/577 variables, 174/399 constraints. Problems are: Problem set: 0 solved, 711 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/577 variables, 710/1109 constraints. Problems are: Problem set: 0 solved, 711 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 577/579 variables, and 1109 constraints, problems are : Problem set: 0 solved, 711 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 201/202 constraints, ReadFeed: 174/175 constraints, PredecessorRefiner: 711/710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60658ms problems are : Problem set: 0 solved, 711 unsolved
Search for dead transitions found 0 dead transitions in 60662ms
Starting structural reductions in LTL mode, iteration 1 : 202/204 places, 712/714 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61138 ms. Remains : 202/204 places, 712/714 transitions.
Stuttering acceptance computed with spot in 418 ms :[(OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), true, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1), (NOT p3)]
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 61583 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p0))&&(X(p1)||G(p2)))))'
Support contains 7 out of 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 714/714 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 202 transition count 712
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 202 transition count 712
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 201 transition count 711
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 201 transition count 711
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 200 transition count 710
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 200 transition count 710
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 199 transition count 709
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 199 transition count 709
Applied a total of 10 rules in 14 ms. Remains 199 /204 variables (removed 5) and now considering 709/714 (removed 5) transitions.
[2025-05-29 23:31:24] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2025-05-29 23:31:24] [INFO ] Computed 24 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:31:24] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-05-29 23:31:24] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2025-05-29 23:31:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:31:24] [INFO ] State equation strengthened by 172 read => feed constraints.
[2025-05-29 23:31:24] [INFO ] Implicit Places using invariants and state equation in 619 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2025-05-29 23:31:24] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2025-05-29 23:31:24] [INFO ] Invariant cache hit.
[2025-05-29 23:31:24] [INFO ] State equation strengthened by 172 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/573 variables, and 394 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: 171/172 constraints, PredecessorRefiner: 708/707 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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, 707/1100 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/573 variables, and 1100 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 198/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 708/707 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60620ms problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 60622ms
Starting structural reductions in LTL mode, iteration 1 : 199/204 places, 709/714 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61338 ms. Remains : 199/204 places, 709/714 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-09
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-6a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-6a-LTLFireability-09 finished in 61620 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/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 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 714/714 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 202 transition count 712
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 202 transition count 712
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 201 transition count 711
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 201 transition count 711
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 200 transition count 710
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 200 transition count 710
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 199 transition count 709
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 199 transition count 709
Applied a total of 10 rules in 16 ms. Remains 199 /204 variables (removed 5) and now considering 709/714 (removed 5) transitions.
[2025-05-29 23:32:25] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2025-05-29 23:32:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:32:25] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-05-29 23:32:25] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2025-05-29 23:32:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:32:25] [INFO ] State equation strengthened by 172 read => feed constraints.
[2025-05-29 23:32:26] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2025-05-29 23:32:26] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2025-05-29 23:32:26] [INFO ] Invariant cache hit.
[2025-05-29 23:32:26] [INFO ] State equation strengthened by 172 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/573 variables, and 394 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 708/707 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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, 707/1100 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/573 variables, and 1100 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 198/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 708/707 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60678ms problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 60681ms
Starting structural reductions in LTL mode, iteration 1 : 199/204 places, 709/714 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61297 ms. Remains : 199/204 places, 709/714 transitions.
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p0) p1), p1, (AND p1 p2), p1, (AND p1 p2 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Running random walk in product with property : CloudDeployment-PT-6a-LTLFireability-12
Product exploration explored 100000 steps with 1 reset in 112 ms.
Product exploration explored 100000 steps with 1 reset in 144 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 3/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X p2), (X p3), (X (NOT (AND p1 p2))), (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2))))), (X (NOT (OR p1 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (AND p1 (NOT p3) p2))), (X (AND p3 p2)), (X p0), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2)))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND (NOT p3) (NOT p2)))))), (X (X (NOT (OR p1 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (AND p3 p2))), (X (X p0)), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT 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 626 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 306 ms :[(AND p1 p2 (NOT p3)), p1, (AND p1 p2), p1, (AND p1 p2 (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Reduction of identical properties reduced properties to check from 13 to 11
RANDOM walk for 40000 steps (458 resets) in 344 ms. (115 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40004 steps (31 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (31 resets) in 411 ms. (97 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (25 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
[2025-05-29 23:33:28] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2025-05-29 23:33:28] [INFO ] Invariant cache hit.
[2025-05-29 23:33:28] [INFO ] State equation strengthened by 172 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 190/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1/572 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/573 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/573 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 573/573 variables, and 395 constraints, problems are : Problem set: 0 solved, 3 unsolved in 532 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 190/198 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 373/571 variables, 198/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 171/393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 3/396 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/571 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/572 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/573 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/573 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/573 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 573/573 variables, and 398 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1434 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 172/172 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1983ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 68 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.0 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 0 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 65 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 65 ms. Remains : 127/199 places, 448/709 transitions.
RANDOM walk for 40000 steps (603 resets) in 229 ms. (173 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (36 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 982175 steps, run timeout after 3001 ms. (steps per millisecond=327 ) properties seen :0 out of 1
Probabilistic random walk after 982175 steps, saw 174639 distinct states, run finished after 3006 ms. (steps per millisecond=326 ) properties seen :0
[2025-05-29 23:33:34] [INFO ] Flow matrix only has 196 transitions (discarded 252 similar events)
// Phase 1: matrix 196 rows 127 cols
[2025-05-29 23:33:34] [INFO ] Computed 24 invariants in 3 ms
[2025-05-29 23:33:34] [INFO ] State equation strengthened by 131 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 49/127 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 196/323 variables, 127/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 131/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/323 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 122 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: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:33:34] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 9 ms to minimize.
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:33:34] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 49/127 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 196/323 variables, 127/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/323 variables, 131/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/323 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:33:34] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:33:34] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:33:34] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:33:34] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 6 ms to minimize.
Problem apf10 is UNSAT
After SMT solving in domain Int declared 323/323 variables, and 289 constraints, problems are : Problem set: 1 solved, 0 unsolved in 625 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: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 761ms 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) p3), (X p2), (X p3), (X (NOT (AND p1 p2))), (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2))))), (X (NOT (OR p1 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (AND p1 (NOT p3) p2))), (X (AND p3 p2)), (X p0), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (OR (AND p0 p1) (AND p0 (NOT p2)))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND (NOT p3) (NOT p2)))))), (X (X (NOT (OR p1 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) p2)))), (X (X (AND p3 p2))), (X (X p0)), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT 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 p3))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p3)))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (AND (OR (NOT p1) p3) (OR p2 p3)))), (F (NOT (OR (NOT p1) (NOT p2) p3))), (F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F p1), (F (NOT (AND (NOT p2) p3))), (F p2), (F (NOT (OR (NOT p2) p3))), (F (NOT p3)), (F (NOT (OR (NOT p1) p3)))]
Knowledge based reduction with 36 factoid took 2629 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 194 ms :[(AND p1 (NOT p3)), p1, p1, (AND p1 (NOT p3))]
Stuttering acceptance computed with spot in 187 ms :[(AND p1 (NOT p3)), p1, p1, (AND p1 (NOT p3))]
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 3 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2025-05-29 23:33:37] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2025-05-29 23:33:37] [INFO ] Computed 24 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:33:37] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-05-29 23:33:37] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2025-05-29 23:33:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:33:38] [INFO ] State equation strengthened by 172 read => feed constraints.
[2025-05-29 23:33:38] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2025-05-29 23:33:38] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2025-05-29 23:33:38] [INFO ] Invariant cache hit.
[2025-05-29 23:33:38] [INFO ] State equation strengthened by 172 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/573 variables, and 394 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/707 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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, 707/1100 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/573 variables, and 1100 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 198/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 708/707 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60881ms problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 60883ms
Finished structural reductions in LTL mode , in 1 iterations and 61472 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 p2) p3), (X p3), (X (NOT (AND (NOT p3) p1))), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (OR (NOT p2) 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 253 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 202 ms :[(AND p1 (NOT p3)), p1, p1, (AND p1 (NOT p3))]
RANDOM walk for 40000 steps (447 resets) in 280 ms. (142 steps per ms) remains 1/5 properties
BEST_FIRST walk for 31970 steps (24 resets) in 41 ms. (761 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) p3), (X p3), (X (NOT (AND (NOT p3) p1))), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (OR (NOT p2) 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 p1 (NOT p2)))), (F p2), (F (NOT (OR p3 (NOT p1)))), (F (NOT 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 188 ms :[(AND p1 (NOT p3)), p1, p1, (AND p1 (NOT p3))]
Stuttering acceptance computed with spot in 177 ms :[(AND p1 (NOT p3)), p1, p1, (AND p1 (NOT p3))]
Stuttering acceptance computed with spot in 191 ms :[(AND p1 (NOT p3)), p1, p1, (AND p1 (NOT p3))]
Product exploration explored 100000 steps with 0 reset in 68 ms.
Product exploration explored 100000 steps with 0 reset in 75 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 193 ms :[(AND p1 (NOT p3)), p1, p1, (AND p1 (NOT p3))]
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 1 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 1 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 44 ms. Remains 153 /199 variables (removed 46) and now considering 529/709 (removed 180) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 23:34:41] [INFO ] Redundant transitions in 287 ms returned []
Running 528 sub problems to find dead transitions.
[2025-05-29 23:34:41] [INFO ] Flow matrix only has 230 transitions (discarded 299 similar events)
// Phase 1: matrix 230 rows 153 cols
[2025-05-29 23:34:41] [INFO ] Computed 24 invariants in 1 ms
[2025-05-29 23:34:41] [INFO ] State equation strengthened by 131 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
SMT process timed out in 30343ms, After SMT, problems are : Problem set: 23 solved, 505 unsolved
Search for dead transitions found 23 dead transitions in 30346ms
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 14 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 30708 ms. Remains : 136/199 places, 506/709 transitions.
Built C files in :
/tmp/ltsmin1574435507975039264
[2025-05-29 23:35:12] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1574435507975039264
Running compilation step : cd /tmp/ltsmin1574435507975039264;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1401 ms.
Running link step : cd /tmp/ltsmin1574435507975039264;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin1574435507975039264;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11244476831828264806.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 7 ms. Remains 199 /199 variables (removed 0) and now considering 709/709 (removed 0) transitions.
[2025-05-29 23:35:27] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
// Phase 1: matrix 374 rows 199 cols
[2025-05-29 23:35:27] [INFO ] Computed 24 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:35:27] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-05-29 23:35:27] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2025-05-29 23:35:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:35:27] [INFO ] State equation strengthened by 172 read => feed constraints.
[2025-05-29 23:35:27] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2025-05-29 23:35:27] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2025-05-29 23:35:27] [INFO ] Invariant cache hit.
[2025-05-29 23:35:27] [INFO ] State equation strengthened by 172 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/573 variables, and 394 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 708/707 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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, 707/1100 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/573 variables, and 1100 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 198/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 708/707 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60658ms problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 60661ms
Finished structural reductions in LTL mode , in 1 iterations and 61242 ms. Remains : 199/199 places, 709/709 transitions.
Built C files in :
/tmp/ltsmin15835716679183754774
[2025-05-29 23:36:28] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15835716679183754774
Running compilation step : cd /tmp/ltsmin15835716679183754774;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1295 ms.
Running link step : cd /tmp/ltsmin15835716679183754774;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin15835716679183754774;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7348169557759561556.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-29 23:36:43] [INFO ] Flatten gal took : 25 ms
[2025-05-29 23:36:43] [INFO ] Flatten gal took : 26 ms
[2025-05-29 23:36:43] [INFO ] Time to serialize gal into /tmp/LTL9663319683759654303.gal : 6 ms
[2025-05-29 23:36:43] [INFO ] Time to serialize properties into /tmp/LTL14822618712533758386.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9663319683759654303.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10984749587652162015.hoa' '-atoms' '/tmp/LTL14822618712533758386.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14822618712533758386.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10984749587652162015.hoa
Detected timeout of ITS tools.
[2025-05-29 23:36:58] [INFO ] Flatten gal took : 22 ms
[2025-05-29 23:36:58] [INFO ] Flatten gal took : 22 ms
[2025-05-29 23:36:58] [INFO ] Time to serialize gal into /tmp/LTL6677335678040844034.gal : 5 ms
[2025-05-29 23:36:58] [INFO ] Time to serialize properties into /tmp/LTL5801077601274500460.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6677335678040844034.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5801077601274500460.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
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
Detected timeout of ITS tools.
[2025-05-29 23:37:14] [INFO ] Flatten gal took : 23 ms
[2025-05-29 23:37:14] [INFO ] Applying decomposition
[2025-05-29 23:37:14] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7942197591668861592.txt' '-o' '/tmp/graph7942197591668861592.bin' '-w' '/tmp/graph7942197591668861592.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7942197591668861592.bin' '-l' '-1' '-v' '-w' '/tmp/graph7942197591668861592.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:37:14] [INFO ] Decomposing Gal with order
[2025-05-29 23:37:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:37:14] [INFO ] Removed a total of 823 redundant transitions.
[2025-05-29 23:37:14] [INFO ] Flatten gal took : 73 ms
[2025-05-29 23:37:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 262 labels/synchronizations in 14 ms.
[2025-05-29 23:37:14] [INFO ] Time to serialize gal into /tmp/LTL15568473589985074759.gal : 4 ms
[2025-05-29 23:37:14] [INFO ] Time to serialize properties into /tmp/LTL12174670800756038340.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15568473589985074759.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12174670800756038340.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((F((G(F("((((i8.u58.p58!=1)||(i8.u58.p60!=1))||((i2.i1.u20.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.u20.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.t208, i0.t207, i0.t191, i0.i0.t199, i0.i0.t204, i0.i0.u3.t580, i0.i1.t17...781
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
133 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.37455,66508,1,0,86823,2286,4630,149334,1395,11907,136624
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 290313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 3 out of 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 714/714 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 202 transition count 712
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 202 transition count 712
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 201 transition count 711
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 201 transition count 711
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 200 transition count 710
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 200 transition count 710
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 199 transition count 709
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 199 transition count 709
Applied a total of 10 rules in 18 ms. Remains 199 /204 variables (removed 5) and now considering 709/714 (removed 5) transitions.
[2025-05-29 23:37:15] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2025-05-29 23:37:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:37:16] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-05-29 23:37:16] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2025-05-29 23:37:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:37:16] [INFO ] State equation strengthened by 172 read => feed constraints.
[2025-05-29 23:37:16] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2025-05-29 23:37:16] [INFO ] Flow matrix only has 374 transitions (discarded 335 similar events)
[2025-05-29 23:37:16] [INFO ] Invariant cache hit.
[2025-05-29 23:37:16] [INFO ] State equation strengthened by 172 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/573 variables, and 394 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 708/707 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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, 707/1100 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/573 variables, and 1100 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 198/199 constraints, ReadFeed: 171/172 constraints, PredecessorRefiner: 708/707 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60660ms problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 60664ms
Starting structural reductions in LTL mode, iteration 1 : 199/204 places, 709/714 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61275 ms. Remains : 199/204 places, 709/714 transitions.
Stuttering acceptance computed with spot in 129 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 61429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p1)||p0)))'
Support contains 9 out of 204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 204/204 places, 714/714 transitions.
Graph (trivial) has 235 edges and 204 vertex of which 60 / 204 are part of one of the 18 SCC in 0 ms
Free SCC test removed 42 places
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 154 transition count 544
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 154 transition count 544
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 153 transition count 543
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 153 transition count 543
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 20 place count 152 transition count 542
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 152 transition count 542
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 22 place count 151 transition count 541
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 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 59 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 167 place count 133 transition count 499
Applied a total of 167 rules in 40 ms. Remains 133 /204 variables (removed 71) and now considering 499/714 (removed 215) transitions.
[2025-05-29 23:38:17] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
// Phase 1: matrix 200 rows 133 cols
[2025-05-29 23:38:17] [INFO ] Computed 24 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:38:17] [INFO ] Implicit Places using invariants in 400 ms returned []
[2025-05-29 23:38:17] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2025-05-29 23:38:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:38:17] [INFO ] State equation strengthened by 130 read => feed constraints.
[2025-05-29 23:38:18] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 23:38:18] [INFO ] Redundant transitions in 242 ms returned []
Running 498 sub problems to find dead transitions.
[2025-05-29 23:38:18] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2025-05-29 23:38:18] [INFO ] Invariant cache hit.
[2025-05-29 23:38:18] [INFO ] State equation strengthened by 130 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 333/333 variables, and 287 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30021 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 332/333 variables, and 784 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 133/133 constraints, ReadFeed: 129/130 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60361ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60362ms
Starting structural reductions in SI_LTL mode, iteration 1 : 133/204 places, 499/714 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61345 ms. Remains : 133/204 places, 499/714 transitions.
Stuttering acceptance computed with spot in 86 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 112 ms.
Product exploration explored 100000 steps with 0 reset in 108 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 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) 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 151 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 78 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (646 resets) in 179 ms. (222 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (72 resets) in 51 ms. (769 steps per ms) remains 1/3 properties
[2025-05-29 23:39:19] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2025-05-29 23:39:19] [INFO ] Invariant cache hit.
[2025-05-29 23:39:19] [INFO ] State equation strengthened by 130 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 132/333 variables, and 24 constraints, problems are : Problem set: 1 solved, 0 unsolved in 33 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, Known Traps Along Path: 0/0 constraints]
After SMT, in 39ms 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 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) 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 (OR (NOT p1) p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 231 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 80 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 80 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 17 ms. Remains 133 /133 variables (removed 0) and now considering 499/499 (removed 0) transitions.
[2025-05-29 23:39:19] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2025-05-29 23:39:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:39:19] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-05-29 23:39:19] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2025-05-29 23:39:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:39:19] [INFO ] State equation strengthened by 130 read => feed constraints.
[2025-05-29 23:39:20] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 23:39:20] [INFO ] Redundant transitions in 241 ms returned []
Running 498 sub problems to find dead transitions.
[2025-05-29 23:39:20] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2025-05-29 23:39:20] [INFO ] Invariant cache hit.
[2025-05-29 23:39:20] [INFO ] State equation strengthened by 130 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
(t12 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((t0 0.0)
(t1 1.0)
(t2 0.0)
(t3 1.0)
(t4 1.0)
(t5 1.0)
(t6 1.0)
(t7 0.0)
(t8 1.0)
(t9 1.0)
(t10 0.0)
(t11 1.0)
(t12 1.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 333/333 variables, and 287 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30017 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 332/333 variables, and 784 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 133/133 constraints, ReadFeed: 129/130 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60362ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60364ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61038 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.1 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 p0), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 128 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 89 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (657 resets) in 222 ms. (179 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (72 resets) in 40 ms. (975 steps per ms) remains 1/3 properties
[2025-05-29 23:40:21] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2025-05-29 23:40:21] [INFO ] Invariant cache hit.
[2025-05-29 23:40:21] [INFO ] State equation strengthened by 130 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 132/333 variables, and 24 constraints, problems are : Problem set: 1 solved, 0 unsolved in 35 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, Known Traps Along Path: 0/0 constraints]
After SMT, in 41ms 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 p0), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT 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 260 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 73 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 106 ms.
Product exploration explored 100000 steps with 0 reset in 136 ms.
Built C files in :
/tmp/ltsmin9782348267993155893
[2025-05-29 23:40:21] [INFO ] Computing symmetric may disable matrix : 499 transitions.
[2025-05-29 23:40:21] [INFO ] Computation of Complete disable matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 23:40:22] [INFO ] Computing symmetric may enable matrix : 499 transitions.
[2025-05-29 23:40:22] [INFO ] Computation of Complete enable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 23:40:22] [INFO ] Computing Do-Not-Accords matrix : 499 transitions.
[2025-05-29 23:40:22] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 23:40:22] [INFO ] Built C files in 153ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9782348267993155893
Running compilation step : cd /tmp/ltsmin9782348267993155893;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1385 ms.
Running link step : cd /tmp/ltsmin9782348267993155893;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin9782348267993155893;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7144919501476167114.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 20 ms. Remains 133 /133 variables (removed 0) and now considering 499/499 (removed 0) transitions.
[2025-05-29 23:40:37] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2025-05-29 23:40:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:40:37] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-05-29 23:40:37] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2025-05-29 23:40:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:40:37] [INFO ] State equation strengthened by 130 read => feed constraints.
[2025-05-29 23:40:37] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 23:40:37] [INFO ] Redundant transitions in 293 ms returned []
Running 498 sub problems to find dead transitions.
[2025-05-29 23:40:37] [INFO ] Flow matrix only has 200 transitions (discarded 299 similar events)
[2025-05-29 23:40:37] [INFO ] Invariant cache hit.
[2025-05-29 23:40:37] [INFO ] State equation strengthened by 130 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 333/333 variables, and 287 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, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 332/333 variables, and 784 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 133/133 constraints, ReadFeed: 129/130 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60405ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60406ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61078 ms. Remains : 133/133 places, 499/499 transitions.
Built C files in :
/tmp/ltsmin13198073340881744281
[2025-05-29 23:41:38] [INFO ] Computing symmetric may disable matrix : 499 transitions.
[2025-05-29 23:41:38] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 23:41:38] [INFO ] Computing symmetric may enable matrix : 499 transitions.
[2025-05-29 23:41:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 23:41:38] [INFO ] Computing Do-Not-Accords matrix : 499 transitions.
[2025-05-29 23:41:38] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 23:41:38] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13198073340881744281
Running compilation step : cd /tmp/ltsmin13198073340881744281;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1348 ms.
Running link step : cd /tmp/ltsmin13198073340881744281;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin13198073340881744281;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10367467297158679370.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-29 23:41:53] [INFO ] Flatten gal took : 16 ms
[2025-05-29 23:41:53] [INFO ] Flatten gal took : 16 ms
[2025-05-29 23:41:53] [INFO ] Time to serialize gal into /tmp/LTL16880902009133502233.gal : 3 ms
[2025-05-29 23:41:53] [INFO ] Time to serialize properties into /tmp/LTL12186384576598864282.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16880902009133502233.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7305992080100791713.hoa' '-atoms' '/tmp/LTL12186384576598864282.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12186384576598864282.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7305992080100791713.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.
[2025-05-29 23:42:08] [INFO ] Flatten gal took : 16 ms
[2025-05-29 23:42:08] [INFO ] Flatten gal took : 15 ms
[2025-05-29 23:42:08] [INFO ] Time to serialize gal into /tmp/LTL8066134103046219973.gal : 4 ms
[2025-05-29 23:42:08] [INFO ] Time to serialize properties into /tmp/LTL12456397672026161376.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8066134103046219973.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12456397672026161376.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.202505121319/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.
[2025-05-29 23:42:23] [INFO ] Flatten gal took : 19 ms
[2025-05-29 23:42:23] [INFO ] Applying decomposition
[2025-05-29 23:42:23] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10209487762714605655.txt' '-o' '/tmp/graph10209487762714605655.bin' '-w' '/tmp/graph10209487762714605655.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10209487762714605655.bin' '-l' '-1' '-v' '-w' '/tmp/graph10209487762714605655.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:42:23] [INFO ] Decomposing Gal with order
[2025-05-29 23:42:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:42:23] [INFO ] Removed a total of 798 redundant transitions.
[2025-05-29 23:42:23] [INFO ] Flatten gal took : 39 ms
[2025-05-29 23:42:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 137 labels/synchronizations in 7 ms.
[2025-05-29 23:42:23] [INFO ] Time to serialize gal into /tmp/LTL16019463047678174034.gal : 2 ms
[2025-05-29 23:42:23] [INFO ] Time to serialize properties into /tmp/LTL12820689881119250873.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16019463047678174034.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12820689881119250873.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(("(((i3.u29.p114!=1)||(u49.p116!=1))||((i3.u24.p120!=1)||(u49.p206!=1)))")||(("(u49.p219!=1)")||(G("(((u49.p30!=1)||(u49.p32!=1))...206
Formula 0 simplified : F(!"(((i3.u29.p114!=1)||(u49.p116!=1))||((i3.u24.p120!=1)||(u49.p206!=1)))" & !"(u49.p219!=1)" & F!"(((u49.p30!=1)||(u49.p32!=1))||(...198
Reverse transition relation is NOT exact ! Due to transitions t213, t617, t628, u49.t2, i0.t207, i0.i1.t204, i0.i1.u0.t183.t208, i0.i1.u3.t199, i1.t172, i1...494
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
48 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.511232,36456,1,0,38653,794,3661,70108,1043,2773,106367
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 246737 ms.
All properties solved by simple procedures.
Total runtime 1445137 ms.
BK_STOP 1748562144150
--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-5832"
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 r044-tall-174854027700068"
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.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 ;