About the Execution of ITS-Tools for ShieldIIPs-PT-010A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FFFT??FFF?FFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r198-tall-174894532500332.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 ShieldIIPs-PT-010A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894532500332
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K 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.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 84K 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 ShieldIIPs-PT-010A-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-010A-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-010A-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-010A-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-010A-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-010A-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-010A-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-010A-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-010A-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-010A-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-010A-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-010A-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-010A-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-010A-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-010A-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-010A-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749045005272
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-010A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-04 13:50:06] [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-06-04 13:50:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 13:50:06] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2025-06-04 13:50:06] [INFO ] Transformed 253 places.
[2025-06-04 13:50:06] [INFO ] Transformed 243 transitions.
[2025-06-04 13:50:06] [INFO ] Found NUPN structural information;
[2025-06-04 13:50:06] [INFO ] Parsed PT model containing 253 places and 243 transitions and 1086 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPs-PT-010A-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010A-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-010A-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 38 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
// Phase 1: matrix 243 rows 253 cols
[2025-06-04 13:50:06] [INFO ] Computed 91 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:50:07] [INFO ] Implicit Places using invariants in 374 ms returned []
[2025-06-04 13:50:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:50:07] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2025-06-04 13:50:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:11] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:12] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:12] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:12] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:12] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:12] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:12] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:12] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:12] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:13] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 10/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/607 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:17] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:17] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:17] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 3/610 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:18] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:18] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:18] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:19] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:19] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 5/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:20] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:21] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:21] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 3/618 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:24] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:24] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/496 variables, 2/620 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:26] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 1/621 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:29] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 1/622 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:32] [INFO ] Deduced a trap along path composed of 9 places in 38 ms of which 11 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/496 variables, 1/623 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:34] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:34] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 8 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/496 variables, 2/625 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 496/496 variables, and 625 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30032 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 27/371 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/624 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 242/866 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:50:42] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 1/867 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 1/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/496 variables, and 868 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30019 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60136ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Finished structural reductions in LTL mode , in 1 iterations and 60907 ms. Remains : 253/253 places, 243/243 transitions.
Support contains 52 out of 253 places after structural reductions.
[2025-06-04 13:51:07] [INFO ] Flatten gal took : 51 ms
[2025-06-04 13:51:07] [INFO ] Flatten gal took : 24 ms
[2025-06-04 13:51:08] [INFO ] Input system was already deterministic with 243 transitions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 33680 steps (59 resets) in 1150 ms. (29 steps per ms) remains 0/28 properties
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(!F(!(G(F(p0))||p1))) U p1)))'
Support contains 3 out of 253 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 253 transition count 242
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 252 transition count 242
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 251 transition count 241
Applied a total of 4 rules in 46 ms. Remains 251 /253 variables (removed 2) and now considering 241/243 (removed 2) transitions.
// Phase 1: matrix 241 rows 251 cols
[2025-06-04 13:51:08] [INFO ] Computed 91 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:51:09] [INFO ] Implicit Places using invariants in 147 ms returned [237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 148 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 250/253 places, 241/243 transitions.
Applied a total of 0 rules in 10 ms. Remains 250 /250 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 205 ms. Remains : 250/253 places, 241/243 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLFireability-00
Stuttering criterion allowed to conclude after 549 steps with 0 reset in 11 ms.
FORMULA ShieldIIPs-PT-010A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLFireability-00 finished in 421 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) U p1)||X(X(X(p0)))) U (F(p3)&&p2)))'
Support contains 7 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 9 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
// Phase 1: matrix 243 rows 253 cols
[2025-06-04 13:51:09] [INFO ] Computed 91 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:51:09] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-06-04 13:51:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:51:09] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2025-06-04 13:51:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:13] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:13] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:13] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:14] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:14] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:14] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:14] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:14] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:14] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:15] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 10/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/607 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:19] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:19] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:19] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 3/610 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:20] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:20] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:20] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:21] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:21] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 5/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:22] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:22] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:23] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 3/618 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:26] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:26] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/496 variables, 2/620 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:28] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 1/621 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:31] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 1/622 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:34] [INFO ] Deduced a trap along path composed of 9 places in 25 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/496 variables, 1/623 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:36] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:36] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 7 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/496 variables, 2/625 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 496/496 variables, and 625 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30015 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 27/371 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/624 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 242/866 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:51:44] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 1/867 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 1/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/496 variables, and 868 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30019 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60072ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 60075ms
Finished structural reductions in LTL mode , in 1 iterations and 60490 ms. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p2) (NOT p3)), (NOT p0), (NOT p3), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLFireability-01
Entered a terminal (fully accepting) state of product in 257 steps with 0 reset in 5 ms.
FORMULA ShieldIIPs-PT-010A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLFireability-01 finished in 60808 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(p1)))))'
Support contains 3 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 8 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2025-06-04 13:52:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:52:10] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-06-04 13:52:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:52:10] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2025-06-04 13:52:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:14] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:14] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:14] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:14] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:14] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:14] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:14] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:15] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:15] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:15] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 10/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/607 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:19] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:19] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:20] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 3/610 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:21] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:21] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:21] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:21] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:21] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 5/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:22] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:23] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:23] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 3/618 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:26] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:26] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/496 variables, 2/620 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:28] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 1/621 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:31] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 1/622 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:34] [INFO ] Deduced a trap along path composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/496 variables, 1/623 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:35] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:36] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 7 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/496 variables, 2/625 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 496/496 variables, and 625 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30011 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 27/371 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/624 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 242/866 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:52:45] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 1/867 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 1/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/496 variables, and 868 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30018 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60058ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 60059ms
Finished structural reductions in LTL mode , in 1 iterations and 60442 ms. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLFireability-02
Stuttering criterion allowed to conclude after 7302 steps with 27 reset in 41 ms.
FORMULA ShieldIIPs-PT-010A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLFireability-02 finished in 60685 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||G(p1)))))'
Support contains 5 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 253 transition count 242
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 252 transition count 242
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 251 transition count 241
Applied a total of 4 rules in 19 ms. Remains 251 /253 variables (removed 2) and now considering 241/243 (removed 2) transitions.
// Phase 1: matrix 241 rows 251 cols
[2025-06-04 13:53:10] [INFO ] Computed 91 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:53:10] [INFO ] Implicit Places using invariants in 147 ms returned [237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 148 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 250/253 places, 241/243 transitions.
Applied a total of 0 rules in 8 ms. Remains 250 /250 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 175 ms. Remains : 250/253 places, 241/243 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLFireability-04
Product exploration explored 100000 steps with 186 reset in 419 ms.
Product exploration explored 100000 steps with 185 reset in 549 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 106 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (73 resets) in 364 ms. (109 steps per ms) remains 1/4 properties
BEST_FIRST walk for 7564 steps (0 resets) in 50 ms. (148 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 209 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 241/241 transitions.
Applied a total of 0 rules in 12 ms. Remains 250 /250 variables (removed 0) and now considering 241/241 (removed 0) transitions.
// Phase 1: matrix 241 rows 250 cols
[2025-06-04 13:53:12] [INFO ] Computed 90 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:53:12] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-06-04 13:53:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:53:13] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 13:53:13] [INFO ] Redundant transitions in 41 ms returned [233]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 239 sub problems to find dead transitions.
// Phase 1: matrix 240 rows 250 cols
[2025-06-04 13:53:13] [INFO ] Computed 90 invariants in 3 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 1/250 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:16] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:16] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:17] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:17] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:17] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:17] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:17] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:17] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:17] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:18] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 10/350 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 240/490 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:21] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:22] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:22] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:22] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:22] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:22] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:22] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:22] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:22] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:22] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:23] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 11/611 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:24] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:24] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 2/613 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:25] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:25] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:26] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:26] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 4/617 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:31] [INFO ] Deduced a trap along path composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 1/618 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/490 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 12 (OVERLAPS) 0/490 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 618 constraints, problems are : Problem set: 0 solved, 239 unsolved in 27220 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 1/250 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 27/367 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 240/490 variables, 250/617 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 239/856 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:44] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:53:46] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 2/858 constraints. Problems are: Problem set: 0 solved, 239 unsolved
SMT process timed out in 57270ms, After SMT, problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 57270ms
Starting structural reductions in SI_LTL mode, iteration 1 : 250/250 places, 240/241 transitions.
Applied a total of 0 rules in 8 ms. Remains 250 /250 variables (removed 0) and now considering 240/240 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57701 ms. Remains : 250/250 places, 240/241 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 109 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 34648 steps (63 resets) in 235 ms. (146 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 249 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 185 reset in 346 ms.
Product exploration explored 100000 steps with 187 reset in 442 ms.
Built C files in :
/tmp/ltsmin16250338411857071167
[2025-06-04 13:54:11] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2025-06-04 13:54:11] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 13:54:11] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2025-06-04 13:54:11] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 13:54:12] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2025-06-04 13:54:12] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 13:54:12] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16250338411857071167
Running compilation step : cd /tmp/ltsmin16250338411857071167;'/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 584 ms.
Running link step : cd /tmp/ltsmin16250338411857071167;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin16250338411857071167;'/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/stateBased9035319147752660046.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 240/240 transitions.
Applied a total of 0 rules in 15 ms. Remains 250 /250 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-04 13:54:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:54:27] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-06-04 13:54:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:54:27] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 13:54:27] [INFO ] Redundant transitions in 37 ms returned []
Running 239 sub problems to find dead transitions.
[2025-06-04 13:54:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 1/250 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:31] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:31] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:31] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:31] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:31] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:31] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:31] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:32] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:32] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:32] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 10/350 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 240/490 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:37] [INFO ] Deduced a trap along path composed of 9 places in 16 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:37] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:37] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:37] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:37] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:38] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 5/606 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:39] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:40] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:40] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:40] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 4/610 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:42] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:43] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:43] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 3/613 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/490 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:46] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:46] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:46] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/490 variables, 3/616 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:49] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:50] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:50] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/490 variables, 3/619 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/490 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:54:54] [INFO ] Deduced a trap along path composed of 16 places in 19 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/490 variables, 1/620 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 490/490 variables, and 620 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30018 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 1/250 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 28/368 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 240/490 variables, 250/618 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 239/857 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 2/859 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/490 variables, and 859 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30014 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60057ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 60058ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60478 ms. Remains : 250/250 places, 240/240 transitions.
Built C files in :
/tmp/ltsmin2295509594708217534
[2025-06-04 13:55:27] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2025-06-04 13:55:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 13:55:27] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2025-06-04 13:55:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 13:55:27] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2025-06-04 13:55:27] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 13:55:27] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2295509594708217534
Running compilation step : cd /tmp/ltsmin2295509594708217534;'/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 486 ms.
Running link step : cd /tmp/ltsmin2295509594708217534;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2295509594708217534;'/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/stateBased5781796885901686886.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-04 13:55:42] [INFO ] Flatten gal took : 18 ms
[2025-06-04 13:55:42] [INFO ] Flatten gal took : 19 ms
[2025-06-04 13:55:42] [INFO ] Time to serialize gal into /tmp/LTL14814560103402421786.gal : 5 ms
[2025-06-04 13:55:42] [INFO ] Time to serialize properties into /tmp/LTL5835262264435550822.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/LTL14814560103402421786.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6257481573752620820.hoa' '-atoms' '/tmp/LTL5835262264435550822.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...318
Loading property file /tmp/LTL5835262264435550822.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6257481573752620820.hoa
Detected timeout of ITS tools.
[2025-06-04 13:55:57] [INFO ] Flatten gal took : 18 ms
[2025-06-04 13:55:57] [INFO ] Flatten gal took : 17 ms
[2025-06-04 13:55:57] [INFO ] Time to serialize gal into /tmp/LTL17479820484510593017.gal : 4 ms
[2025-06-04 13:55:57] [INFO ] Time to serialize properties into /tmp/LTL3502651769518959996.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/LTL17479820484510593017.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3502651769518959996.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(F(("(p65==0)")||(G("(((p196==0)||(p136==0))||((p140==0)||(p152==0)))"))))))
Formula 0 simplified : G(F!"(((p196==0)||(p136==0))||((p140==0)||(p152==0)))" & FG!"(p65==0)")
Detected timeout of ITS tools.
[2025-06-04 13:56:13] [INFO ] Flatten gal took : 15 ms
[2025-06-04 13:56:13] [INFO ] Applying decomposition
[2025-06-04 13:56:13] [INFO ] Flatten gal took : 20 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/graph7758270587985449723.txt' '-o' '/tmp/graph7758270587985449723.bin' '-w' '/tmp/graph7758270587985449723.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7758270587985449723.bin' '-l' '-1' '-v' '-w' '/tmp/graph7758270587985449723.weights' '-q' '0' '-e' '0.001'
[2025-06-04 13:56:13] [INFO ] Decomposing Gal with order
[2025-06-04 13:56:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 13:56:13] [INFO ] Removed a total of 155 redundant transitions.
[2025-06-04 13:56:13] [INFO ] Flatten gal took : 54 ms
[2025-06-04 13:56:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 152 labels/synchronizations in 26 ms.
[2025-06-04 13:56:13] [INFO ] Time to serialize gal into /tmp/LTL11635629884859359848.gal : 6 ms
[2025-06-04 13:56:13] [INFO ] Time to serialize properties into /tmp/LTL1480265132463864375.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/LTL11635629884859359848.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1480265132463864375.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(F(("(i2.i0.u24.p65==0)")||(G("(((i7.i0.u71.p196==0)||(i5.i0.u49.p136==0))||((i5.i0.u51.p140==0)||(i5.i1.u54.p152==0)))"))))))
Formula 0 simplified : G(F!"(((i7.i0.u71.p196==0)||(i5.i0.u49.p136==0))||((i5.i0.u51.p140==0)||(i5.i1.u54.p152==0)))" & FG!"(i2.i0.u24.p65==0)")
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-010A-LTLFireability-04 finished in 197560 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((!(X(X(p0)) U (!p1 U G(p2)))&&p3))))'
Support contains 5 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 253 transition count 242
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 252 transition count 242
Applied a total of 2 rules in 13 ms. Remains 252 /253 variables (removed 1) and now considering 242/243 (removed 1) transitions.
// Phase 1: matrix 242 rows 252 cols
[2025-06-04 13:56:28] [INFO ] Computed 91 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:56:28] [INFO ] Implicit Places using invariants in 159 ms returned [237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 160 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 251/253 places, 242/243 transitions.
Applied a total of 0 rules in 6 ms. Remains 251 /251 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 180 ms. Remains : 251/253 places, 242/243 transitions.
Stuttering acceptance computed with spot in 337 ms :[(OR (NOT p3) p2), (OR (NOT p3) p2), (AND p0 p2), p2, p2, (AND p0 p2), (AND p0 p2), (AND p2 p0)]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLFireability-05
Product exploration explored 100000 steps with 3199 reset in 327 ms.
Product exploration explored 100000 steps with 3192 reset in 345 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X p3), (X (AND p3 (NOT p1))), (X (NOT (AND p3 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X p3)), (X (X (AND p3 (NOT p1)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 128 ms. Reduced automaton from 8 states, 19 edges and 4 AP (stutter insensitive) to 22 states, 64 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 1072 ms :[(OR (NOT p3) p2), (OR (NOT p3) p2), (AND p0 p2), p2, p2, (AND p0 p2), false, false, false, false, false, (AND (NOT p1) p0 p2 p3), false, (AND p1 p0 p2 p3), false, false, false, false, false, false, false, false]
Reduction of identical properties reduced properties to check from 20 to 17
RANDOM walk for 40000 steps (72 resets) in 295 ms. (135 steps per ms) remains 4/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 325 ms. (122 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 4/4 properties
// Phase 1: matrix 242 rows 251 cols
[2025-06-04 13:56:31] [INFO ] Computed 90 invariants in 2 ms
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/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 12/17 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 234/251 variables, 85/107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 234/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 242/493 variables, 251/592 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/493 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/493 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 493/493 variables, and 592 constraints, problems are : Problem set: 0 solved, 4 unsolved in 208 ms.
Refiners :[Domain max(s): 251/251 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf4 is UNSAT
Problem apf5 is UNSAT
Problem apf7 is UNSAT
Problem apf12 is UNSAT
After SMT solving in domain Int declared 5/493 variables, and 5 constraints, problems are : Problem set: 4 solved, 0 unsolved in 26 ms.
Refiners :[Domain max(s): 5/251 constraints, Positive P Invariants (semi-flows): 0/90 constraints, State Equation: 0/251 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 241ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p3 (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X p3), (X (AND p3 (NOT p1))), (X (NOT (AND p3 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X p3)), (X (X (AND p3 (NOT p1)))), (X (X (NOT (AND p3 p2)))), (X (X (NOT p1))), (G (OR p2 (NOT p3) (NOT p1) (NOT p0))), (G (OR (NOT p2) p3 p1 p0)), (G (OR p2 (NOT p3) (NOT p1) p0)), (G (OR (NOT p2) (NOT p3) (NOT p1) p0)), (G (OR (NOT p2) (NOT p3) (NOT p1) (NOT p0))), (G (OR p2 p3 p1 p0))]
False Knowledge obtained : [(F (NOT (OR p2 p3 (NOT p1) p0))), (F (NOT (AND p3 (NOT p1)))), (F (NOT p3)), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p2) p3 (NOT p1) (NOT p0)))), (F p1), (F p2), (F (NOT (OR (NOT p2) (NOT p3) p1 (NOT p0)))), (F p0), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p3) p1 p0))), (F (NOT (OR p2 (NOT p3) p1 (NOT p0)))), (F (NOT (OR (NOT p2) p3 (NOT p1) p0)))]
Knowledge based reduction with 18 factoid took 706 ms. Reduced automaton from 22 states, 64 edges and 4 AP (stutter insensitive) to 16 states, 46 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 811 ms :[(OR (NOT p3) p2), (OR (NOT p3) p2), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2)), p2, p2, (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2)), false, false, false, (AND p0 p2 p3), false, false, (AND (NOT p1) p2 (NOT p3) (NOT p0)), false, false, (AND p1 p2 p3 (NOT p0))]
Stuttering acceptance computed with spot in 817 ms :[(OR (NOT p3) p2), (OR (NOT p3) p2), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2)), p2, p2, (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2)), false, false, false, (AND p0 p2 p3), false, false, (AND (NOT p1) p2 (NOT p3) (NOT p0)), false, false, (AND p1 p2 p3 (NOT p0))]
Support contains 5 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 242/242 transitions.
Applied a total of 0 rules in 9 ms. Remains 251 /251 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2025-06-04 13:56:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:56:33] [INFO ] Implicit Places using invariants in 150 ms returned []
[2025-06-04 13:56:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:56:34] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 13:56:34] [INFO ] Redundant transitions in 33 ms returned [239]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 240 sub problems to find dead transitions.
// Phase 1: matrix 241 rows 251 cols
[2025-06-04 13:56:34] [INFO ] Computed 90 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 250/250 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 1/251 variables, 90/340 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:37] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:38] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:38] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:38] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:38] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:38] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:38] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:38] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:38] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:39] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 10/351 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (OVERLAPS) 241/492 variables, 251/602 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:43] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:43] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:43] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:43] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 4/606 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:44] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:44] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:44] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:45] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:45] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:45] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 6/612 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:46] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:49] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:49] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 2/615 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:52] [INFO ] Deduced a trap along path composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 1/616 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:57] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:57] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/492 variables, 2/618 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:58] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:56:58] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 2/620 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:57:02] [INFO ] Deduced a trap along path composed of 8 places in 22 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:57:02] [INFO ] Deduced a trap along path composed of 16 places in 23 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/492 variables, 2/622 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/492 variables, and 622 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30017 ms.
Refiners :[Domain max(s): 251/251 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 250/250 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 1/251 variables, 90/340 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 27/368 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (OVERLAPS) 241/492 variables, 251/619 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 240/859 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:57:07] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 1/860 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:57:18] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 1/861 constraints. Problems are: Problem set: 0 solved, 240 unsolved
SMT process timed out in 60072ms, After SMT, problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 60073ms
Starting structural reductions in SI_LTL mode, iteration 1 : 251/251 places, 241/242 transitions.
Applied a total of 0 rules in 8 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60509 ms. Remains : 251/251 places, 241/242 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p3 (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (AND (NOT p0) (NOT p2) p3)), (X (NOT (AND (NOT p0) p2 p3))), (X (NOT (AND p2 p3))), (X (NOT (AND p0 (NOT p2) p3))), (X p3), (X (NOT p0)), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND p0 p2 p3))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p0 p3) (AND (NOT p1) (NOT p3)))))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (AND (NOT p0) (NOT p2) p3))), (X (X (NOT (OR (AND p0 p2) (AND (NOT p1) p2 (NOT p3)))))), (X (X (NOT (AND p2 p3)))), (X (X p3)), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 p3)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 193 ms. Reduced automaton from 16 states, 46 edges and 4 AP (stutter insensitive) to 16 states, 46 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 780 ms :[(OR (NOT p3) p2), (OR (NOT p3) p2), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2)), p2, p2, (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2)), false, false, false, (AND p0 p2 p3), false, false, (AND (NOT p1) p2 (NOT p3) (NOT p0)), false, false, (AND p1 p2 p3 (NOT p0))]
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40000 steps (72 resets) in 337 ms. (118 steps per ms) remains 2/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 2/2 properties
[2025-06-04 13:57:35] [INFO ] Invariant cache hit.
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/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 12/17 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 234/251 variables, 85/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 234/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 241/492 variables, 251/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/492 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 592 constraints, problems are : Problem set: 0 solved, 2 unsolved in 150 ms.
Refiners :[Domain max(s): 251/251 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf5 is UNSAT
Problem apf6 is UNSAT
After SMT solving in domain Int declared 5/492 variables, and 5 constraints, problems are : Problem set: 2 solved, 0 unsolved in 21 ms.
Refiners :[Domain max(s): 5/251 constraints, Positive P Invariants (semi-flows): 0/90 constraints, State Equation: 0/251 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 177ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p3 (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (AND (NOT p0) (NOT p2) p3)), (X (NOT (AND (NOT p0) p2 p3))), (X (NOT (AND p2 p3))), (X (NOT (AND p0 (NOT p2) p3))), (X p3), (X (NOT p0)), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND p0 p2 p3))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND p0 p3) (AND (NOT p1) (NOT p3)))))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (AND (NOT p0) (NOT p2) p3))), (X (X (NOT (OR (AND p0 p2) (AND (NOT p1) p2 (NOT p3)))))), (X (X (NOT (AND p2 p3)))), (X (X p3)), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 p3)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (G (OR p0 (NOT p1) p2 (NOT p3))), (G (OR p0 (NOT p1) (NOT p2) (NOT p3)))]
False Knowledge obtained : [(F (NOT (AND (OR (NOT p0) (NOT p2)) (OR p1 (NOT p2) p3)))), (F (NOT (AND (NOT p0) (NOT p2) p3))), (F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT (OR p0 (NOT p2) p3))), (F (NOT (OR p0 p2 p3))), (F (NOT (OR (NOT p0) p2 (NOT p3)))), (F p1), (F (NOT (OR (NOT p0) (NOT p2) (NOT p3)))), (F p2), (F (NOT (OR p0 (NOT p2) (NOT p3)))), (F (NOT (AND (OR (NOT p0) (NOT p3)) (OR p1 p3)))), (F p0), (F (NOT p3))]
Knowledge based reduction with 29 factoid took 720 ms. Reduced automaton from 16 states, 46 edges and 4 AP (stutter insensitive) to 16 states, 46 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 739 ms :[(OR (NOT p3) p2), (OR (NOT p3) p2), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2)), p2, p2, (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2)), false, false, false, (AND p0 p2 p3), false, false, (AND (NOT p1) p2 (NOT p3) (NOT p0)), false, false, (AND p1 p2 p3 (NOT p0))]
Stuttering acceptance computed with spot in 772 ms :[(OR (NOT p3) p2), (OR (NOT p3) p2), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2)), p2, p2, (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2)), false, false, false, (AND p0 p2 p3), false, false, (AND (NOT p1) p2 (NOT p3) (NOT p0)), false, false, (AND p1 p2 p3 (NOT p0))]
Stuttering acceptance computed with spot in 800 ms :[(OR (NOT p3) p2), (OR (NOT p3) p2), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2)), p2, p2, (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2)), false, false, false, (AND p0 p2 p3), false, false, (AND (NOT p1) p2 (NOT p3) (NOT p0)), false, false, (AND p1 p2 p3 (NOT p0))]
Product exploration explored 100000 steps with 3131 reset in 299 ms.
Product exploration explored 100000 steps with 3141 reset in 330 ms.
Built C files in :
/tmp/ltsmin5876377433617630446
[2025-06-04 13:57:39] [INFO ] Computing symmetric may disable matrix : 241 transitions.
[2025-06-04 13:57:39] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 13:57:39] [INFO ] Computing symmetric may enable matrix : 241 transitions.
[2025-06-04 13:57:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 13:57:39] [INFO ] Computing Do-Not-Accords matrix : 241 transitions.
[2025-06-04 13:57:39] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 13:57:39] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5876377433617630446
Running compilation step : cd /tmp/ltsmin5876377433617630446;'/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 492 ms.
Running link step : cd /tmp/ltsmin5876377433617630446;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin5876377433617630446;'/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/stateBased15904912243240231886.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 241/241 transitions.
Applied a total of 0 rules in 10 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2025-06-04 13:57:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:57:54] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-04 13:57:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:57:54] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 13:57:54] [INFO ] Redundant transitions in 32 ms returned []
Running 240 sub problems to find dead transitions.
[2025-06-04 13:57:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 250/250 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 1/251 variables, 90/340 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:57:58] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:57:58] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:57:58] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:57:58] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:57:59] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:57:59] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:57:59] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:57:59] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:57:59] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:58:00] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 10/351 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (OVERLAPS) 241/492 variables, 251/602 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:58:03] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:58:04] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 2/604 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:58:05] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:58:05] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:58:05] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:58:05] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:58:05] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:58:05] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:58:05] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:58:05] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:58:07] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 9/613 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:58:07] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:58:07] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 2/615 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:58:10] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:58:10] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 2/617 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:58:13] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 1/618 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:58:13] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 1/619 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:58:16] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:58:17] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:58:18] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:58:18] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 4/623 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:58:18] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:58:19] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 2/625 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/492 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 16 (OVERLAPS) 0/492 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 625 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30013 ms.
Refiners :[Domain max(s): 251/251 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 250/250 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 1/251 variables, 90/340 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 33/374 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (OVERLAPS) 241/492 variables, 251/625 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 240/865 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 865 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30014 ms.
Refiners :[Domain max(s): 251/251 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60052ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 60053ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60461 ms. Remains : 251/251 places, 241/241 transitions.
Built C files in :
/tmp/ltsmin11988554412337205382
[2025-06-04 13:58:54] [INFO ] Computing symmetric may disable matrix : 241 transitions.
[2025-06-04 13:58:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 13:58:54] [INFO ] Computing symmetric may enable matrix : 241 transitions.
[2025-06-04 13:58:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 13:58:54] [INFO ] Computing Do-Not-Accords matrix : 241 transitions.
[2025-06-04 13:58:54] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 13:58:54] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11988554412337205382
Running compilation step : cd /tmp/ltsmin11988554412337205382;'/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 479 ms.
Running link step : cd /tmp/ltsmin11988554412337205382;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11988554412337205382;'/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/stateBased16246750397236387847.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-04 13:59:10] [INFO ] Flatten gal took : 19 ms
[2025-06-04 13:59:10] [INFO ] Flatten gal took : 12 ms
[2025-06-04 13:59:10] [INFO ] Time to serialize gal into /tmp/LTL1912238599440618242.gal : 2 ms
[2025-06-04 13:59:10] [INFO ] Time to serialize properties into /tmp/LTL10390398941707271082.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/LTL1912238599440618242.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7005612528594573083.hoa' '-atoms' '/tmp/LTL10390398941707271082.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...318
Loading property file /tmp/LTL10390398941707271082.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7005612528594573083.hoa
Detected timeout of ITS tools.
[2025-06-04 13:59:25] [INFO ] Flatten gal took : 10 ms
[2025-06-04 13:59:25] [INFO ] Flatten gal took : 10 ms
[2025-06-04 13:59:25] [INFO ] Time to serialize gal into /tmp/LTL12228992282881963802.gal : 2 ms
[2025-06-04 13:59:25] [INFO ] Time to serialize properties into /tmp/LTL8823060701314103621.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/LTL12228992282881963802.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8823060701314103621.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(F((!((X(X("(p15==1)")))U((!("((p32==1)&&(p34==1))"))U(G("((p231==1)&&(p242==1))")))))&&("((p32==0)||(p34==0))")))))
Formula 0 simplified : FG(!"((p32==0)||(p34==0))" | (XX"(p15==1)" U (!"((p32==1)&&(p34==1))" U G"((p231==1)&&(p242==1))")))
Detected timeout of ITS tools.
[2025-06-04 13:59:40] [INFO ] Flatten gal took : 13 ms
[2025-06-04 13:59:40] [INFO ] Applying decomposition
[2025-06-04 13:59:40] [INFO ] Flatten gal took : 9 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/graph2910666579094070313.txt' '-o' '/tmp/graph2910666579094070313.bin' '-w' '/tmp/graph2910666579094070313.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2910666579094070313.bin' '-l' '-1' '-v' '-w' '/tmp/graph2910666579094070313.weights' '-q' '0' '-e' '0.001'
[2025-06-04 13:59:40] [INFO ] Decomposing Gal with order
[2025-06-04 13:59:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 13:59:40] [INFO ] Removed a total of 155 redundant transitions.
[2025-06-04 13:59:40] [INFO ] Flatten gal took : 17 ms
[2025-06-04 13:59:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 152 labels/synchronizations in 11 ms.
[2025-06-04 13:59:40] [INFO ] Time to serialize gal into /tmp/LTL6952680152215195667.gal : 4 ms
[2025-06-04 13:59:40] [INFO ] Time to serialize properties into /tmp/LTL8065234440773200245.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/LTL6952680152215195667.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8065234440773200245.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...254
Read 1 LTL properties
Checking formula 0 : !((G(F((!((X(X("(i0.i1.u6.p15==1)")))U((!("((i1.i1.u11.p32==1)&&(i1.i0.u12.p34==1))"))U(G("((i9.i0.u83.p231==1)&&(i9.i0.u86.p242==1))"...210
Formula 0 simplified : FG(!"((i1.i1.u11.p32==0)||(i1.i0.u12.p34==0))" | (XX"(i0.i1.u6.p15==1)" U (!"((i1.i1.u11.p32==1)&&(i1.i0.u12.p34==1))" U G"((i9.i0.u...192
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-010A-LTLFireability-05 finished in 207108 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(G(p0)))'
Support contains 3 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 252 transition count 241
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 250 transition count 241
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 249 transition count 240
Applied a total of 5 rules in 12 ms. Remains 249 /253 variables (removed 4) and now considering 240/243 (removed 3) transitions.
// Phase 1: matrix 240 rows 249 cols
[2025-06-04 13:59:55] [INFO ] Computed 90 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:59:55] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-06-04 13:59:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 13:59:55] [INFO ] Implicit Places using invariants and state equation in 218 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-06-04 13:59:55] [INFO ] Redundant transitions in 40 ms returned [232]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 238 sub problems to find dead transitions.
// Phase 1: matrix 239 rows 249 cols
[2025-06-04 13:59:55] [INFO ] Computed 90 invariants in 3 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:59:56] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:59:57] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:59:57] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:59:57] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:59:57] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:59:57] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:59:57] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:59:57] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:59:57] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 13:59:58] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 10/349 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 239/488 variables, 249/598 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:01] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:01] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:01] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:01] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:02] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:02] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 6/604 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:03] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:06] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:07] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 2/607 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:07] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:07] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:07] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:07] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 4/611 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:09] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:09] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:09] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:09] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:09] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:09] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:10] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 7/618 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:12] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:12] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 2/620 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:14] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:14] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:14] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:15] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 4/624 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:15] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:16] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 2/626 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:19] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:19] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:19] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/488 variables, 3/629 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/488 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/488 variables, and 629 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30018 ms.
Refiners :[Domain max(s): 249/249 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 41/380 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 239/488 variables, 249/629 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 238/867 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:30] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 1/868 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:38] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 1/869 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 869 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30012 ms.
Refiners :[Domain max(s): 249/249 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60052ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 60053ms
Starting structural reductions in SI_LTL mode, iteration 1 : 249/253 places, 239/243 transitions.
Applied a total of 0 rules in 24 ms. Remains 249 /249 variables (removed 0) and now considering 239/239 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60485 ms. Remains : 249/253 places, 239/243 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLFireability-06
Stuttering criterion allowed to conclude after 556 steps with 0 reset in 3 ms.
FORMULA ShieldIIPs-PT-010A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLFireability-06 finished in 60536 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' '!((p0 U G(!p0)))'
Support contains 1 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 252 transition count 241
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 250 transition count 241
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 249 transition count 240
Applied a total of 5 rules in 10 ms. Remains 249 /253 variables (removed 4) and now considering 240/243 (removed 3) transitions.
// Phase 1: matrix 240 rows 249 cols
[2025-06-04 14:00:55] [INFO ] Computed 90 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:00:56] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-06-04 14:00:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:00:56] [INFO ] Implicit Places using invariants and state equation in 230 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-06-04 14:00:56] [INFO ] Redundant transitions in 28 ms returned [232]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 238 sub problems to find dead transitions.
// Phase 1: matrix 239 rows 249 cols
[2025-06-04 14:00:56] [INFO ] Computed 90 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:57] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:57] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:57] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:57] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:57] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:57] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:57] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:58] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:58] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:00:58] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 10/349 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 239/488 variables, 249/598 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:01] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:01] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:01] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:02] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:02] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:02] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 6/604 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:04] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:07] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:07] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 2/607 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:07] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:07] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:07] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:08] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 4/611 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:09] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:09] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:09] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:09] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:09] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:09] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:10] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 7/618 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:12] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:12] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 2/620 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:14] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:14] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:14] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:15] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 4/624 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:15] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:16] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 2/626 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:19] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:19] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:19] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/488 variables, 3/629 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/488 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 4.0)
(t1 0.0)
(t2 0.0)
(t3 3.0)
(t4 1.0)
(t5 4.0)
(t6 1.0)
(t7 3.0)
(t8 0.0)
(t9 0.0)
(t10 2.0)
(t11 0.0)
(t12 4.0)
(t13 1.0)
(t14 3.0)
(t15 0.0)
(t16 0.0)
(t17 2.0)
(t18 0.0)
(t19 3.0)
(t20 0.0)
(t21 1.0)
(t22 0.0)
(t23 0.0)
(t24 0.0)
(t25 0.0)
(t26 2.0)
(t27 1.0)
(t28 0.0)
(t29 0.0)
(t30 1.0)
(t31 0.0)
(t32 2.0)
(t33 0.0)
(t34 2.0)
(t35 2.0)
(t36 1.0)
(t37 0.0)
(t38 0.0)
(t39 2.0)
(t40 0.0)
(t41 3.0)
(t42 3.0)
(t43 2.0)
(t44 0.0)
(t45 0.0)
(t46 2.0)
(t47 0.0)
(t48 4.0)
(t49 4.0)
(t50 2.0)
(t51 0.0)
(t52 0.0)
(t53 2.0)
(t54 0.0)
(t55 4.0)
(t56 7.0)
(t57 4.0)
(t58 0.0)
(t59 0.0)
(t60 0.0)
(t61 1.0)
(t62 5.0)
(t63 4.0)
(t64 1.0)
(t65 3.0)
(t66 0.0)
(t67 0.0)
(t68 3.0)
(t69 6.0)
(t70 1.0)timeout
(t71 4.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/488 variables, and 629 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30011 ms.
Refiners :[Domain max(s): 249/249 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 41/380 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (OVERLAPS) 239/488 variables, 249/629 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 238/867 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:30] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 1/868 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:01:39] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 1/869 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 869 constraints, problems are : Problem set: 0 solved, 238 unsolved in 30013 ms.
Refiners :[Domain max(s): 249/249 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60045ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 60047ms
Starting structural reductions in SI_LTL mode, iteration 1 : 249/253 places, 239/243 transitions.
Applied a total of 0 rules in 7 ms. Remains 249 /249 variables (removed 0) and now considering 239/239 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60449 ms. Remains : 249/253 places, 239/243 transitions.
Stuttering acceptance computed with spot in 100 ms :[p0, true, p0]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLFireability-07
Entered a terminal (fully accepting) state of product in 265 steps with 0 reset in 4 ms.
FORMULA ShieldIIPs-PT-010A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLFireability-07 finished in 60567 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&&X(X(X(F(p0))))))&&X((G(!p1)||(!p1&&F(!p2))))))'
Support contains 4 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 1 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
// Phase 1: matrix 243 rows 253 cols
[2025-06-04 14:01:56] [INFO ] Computed 91 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:01:56] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-06-04 14:01:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:01:56] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2025-06-04 14:01:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:00] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:00] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:00] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:01] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:01] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:01] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:01] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:01] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:01] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:02] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 10/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/607 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:06] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:06] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:06] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 3/610 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:07] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:07] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:07] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:07] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:08] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 5/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:09] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:09] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:09] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 3/618 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:13] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:13] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/496 variables, 2/620 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:15] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 1/621 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:18] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 1/622 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:21] [INFO ] Deduced a trap along path composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/496 variables, 1/623 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:22] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:22] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 8 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/496 variables, 2/625 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 496/496 variables, and 625 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30011 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 27/371 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/624 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 242/866 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:02:31] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 1/867 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 1/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/496 variables, and 868 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30017 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 60054ms
Finished structural reductions in LTL mode , in 1 iterations and 60388 ms. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 317 ms :[(OR (NOT p0) p1), (NOT p0), p1, (NOT p0), true, (AND p2 p1), (NOT p0), p2, (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLFireability-08
Stuttering criterion allowed to conclude after 2077 steps with 9 reset in 15 ms.
FORMULA ShieldIIPs-PT-010A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLFireability-08 finished in 60745 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 2 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 253 transition count 242
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 252 transition count 242
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 251 transition count 241
Applied a total of 4 rules in 9 ms. Remains 251 /253 variables (removed 2) and now considering 241/243 (removed 2) transitions.
// Phase 1: matrix 241 rows 251 cols
[2025-06-04 14:02:57] [INFO ] Computed 91 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:02:57] [INFO ] Implicit Places using invariants in 122 ms returned [237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 123 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 250/253 places, 241/243 transitions.
Applied a total of 0 rules in 7 ms. Remains 250 /250 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 139 ms. Remains : 250/253 places, 241/243 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLFireability-09
Product exploration explored 100000 steps with 3734 reset in 288 ms.
Product exploration explored 100000 steps with 3744 reset in 319 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 48 steps (0 resets) in 5 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 241/241 transitions.
Applied a total of 0 rules in 11 ms. Remains 250 /250 variables (removed 0) and now considering 241/241 (removed 0) transitions.
// Phase 1: matrix 241 rows 250 cols
[2025-06-04 14:02:58] [INFO ] Computed 90 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:02:58] [INFO ] Implicit Places using invariants in 135 ms returned []
[2025-06-04 14:02:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:02:58] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 14:02:58] [INFO ] Redundant transitions in 28 ms returned [233]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 239 sub problems to find dead transitions.
// Phase 1: matrix 240 rows 250 cols
[2025-06-04 14:02:58] [INFO ] Computed 90 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 1/250 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:02] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:02] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:03] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:03] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:03] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:03] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:03] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:03] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:03] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:04] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 10/350 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 240/490 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:08] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:08] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:08] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:08] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:08] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:08] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:08] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:08] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:08] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:08] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:09] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 11/611 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:10] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:11] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 2/613 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:11] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:11] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:12] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:12] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 4/617 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:17] [INFO ] Deduced a trap along path composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 1/618 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/490 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 12 (OVERLAPS) 0/490 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 618 constraints, problems are : Problem set: 0 solved, 239 unsolved in 27703 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 1/250 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 27/367 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 240/490 variables, 250/617 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 239/856 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:31] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:03:32] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 2/858 constraints. Problems are: Problem set: 0 solved, 239 unsolved
SMT process timed out in 57747ms, After SMT, problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 57748ms
Starting structural reductions in SI_LTL mode, iteration 1 : 250/250 places, 240/241 transitions.
Applied a total of 0 rules in 5 ms. Remains 250 /250 variables (removed 0) and now considering 240/240 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 58166 ms. Remains : 250/250 places, 240/241 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 50 steps (0 resets) in 4 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3734 reset in 291 ms.
Product exploration explored 100000 steps with 3773 reset in 327 ms.
Built C files in :
/tmp/ltsmin2018664449209982591
[2025-06-04 14:03:57] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2025-06-04 14:03:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 14:03:57] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2025-06-04 14:03:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 14:03:57] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2025-06-04 14:03:57] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 14:03:57] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2018664449209982591
Running compilation step : cd /tmp/ltsmin2018664449209982591;'/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 495 ms.
Running link step : cd /tmp/ltsmin2018664449209982591;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2018664449209982591;'/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/stateBased5514432311973392143.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 240/240 transitions.
Applied a total of 0 rules in 12 ms. Remains 250 /250 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-04 14:04:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:04:13] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-06-04 14:04:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:04:13] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 14:04:13] [INFO ] Redundant transitions in 26 ms returned []
Running 239 sub problems to find dead transitions.
[2025-06-04 14:04:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 1/250 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:17] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:17] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:17] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:17] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:17] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:17] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:17] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:17] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:18] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:18] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 10/350 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 240/490 variables, 250/600 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:23] [INFO ] Deduced a trap along path composed of 9 places in 30 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:23] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:23] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:23] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:23] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:23] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 5/606 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:25] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:26] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:26] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:26] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 4/610 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:28] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:29] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:29] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 3/613 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/490 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:32] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:32] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:32] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/490 variables, 3/616 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:35] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:35] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:36] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/490 variables, 3/619 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/490 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:04:40] [INFO ] Deduced a trap along path composed of 16 places in 27 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/490 variables, 1/620 constraints. Problems are: Problem set: 0 solved, 239 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 490/490 variables, and 620 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30017 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 1/250 variables, 90/339 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 28/368 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 240/490 variables, 250/618 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 239/857 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 2/859 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/490 variables, and 859 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30013 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60507 ms. Remains : 250/250 places, 240/240 transitions.
Built C files in :
/tmp/ltsmin4481423197345828171
[2025-06-04 14:05:13] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2025-06-04 14:05:13] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 14:05:13] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2025-06-04 14:05:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 14:05:13] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2025-06-04 14:05:13] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 14:05:13] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4481423197345828171
Running compilation step : cd /tmp/ltsmin4481423197345828171;'/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 489 ms.
Running link step : cd /tmp/ltsmin4481423197345828171;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4481423197345828171;'/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/stateBased5193464347055769641.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-04 14:05:28] [INFO ] Flatten gal took : 9 ms
[2025-06-04 14:05:28] [INFO ] Flatten gal took : 9 ms
[2025-06-04 14:05:28] [INFO ] Time to serialize gal into /tmp/LTL10607260127004406335.gal : 1 ms
[2025-06-04 14:05:28] [INFO ] Time to serialize properties into /tmp/LTL12350824983959522313.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/LTL10607260127004406335.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14146721327561528466.hoa' '-atoms' '/tmp/LTL12350824983959522313.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/LTL12350824983959522313.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14146721327561528466.hoa
Detected timeout of ITS tools.
[2025-06-04 14:05:43] [INFO ] Flatten gal took : 9 ms
[2025-06-04 14:05:43] [INFO ] Flatten gal took : 9 ms
[2025-06-04 14:05:43] [INFO ] Time to serialize gal into /tmp/LTL8795407752458711827.gal : 2 ms
[2025-06-04 14:05:43] [INFO ] Time to serialize properties into /tmp/LTL18227158200497270515.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/LTL8795407752458711827.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18227158200497270515.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(F("((p203==0)||(p224==0))"))))
Formula 0 simplified : FG!"((p203==0)||(p224==0))"
Detected timeout of ITS tools.
[2025-06-04 14:05:58] [INFO ] Flatten gal took : 8 ms
[2025-06-04 14:05:58] [INFO ] Applying decomposition
[2025-06-04 14:05:58] [INFO ] Flatten gal took : 8 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/graph16775551879404566388.txt' '-o' '/tmp/graph16775551879404566388.bin' '-w' '/tmp/graph16775551879404566388.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16775551879404566388.bin' '-l' '-1' '-v' '-w' '/tmp/graph16775551879404566388.weights' '-q' '0' '-e' '0.001'
[2025-06-04 14:05:58] [INFO ] Decomposing Gal with order
[2025-06-04 14:05:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 14:05:58] [INFO ] Removed a total of 155 redundant transitions.
[2025-06-04 14:05:58] [INFO ] Flatten gal took : 15 ms
[2025-06-04 14:05:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 152 labels/synchronizations in 7 ms.
[2025-06-04 14:05:58] [INFO ] Time to serialize gal into /tmp/LTL12878797382646088452.gal : 3 ms
[2025-06-04 14:05:58] [INFO ] Time to serialize properties into /tmp/LTL11329270559749870591.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/LTL12878797382646088452.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11329270559749870591.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(F("((i8.i0.u73.p203==0)||(i8.i1.u81.p224==0))"))))
Formula 0 simplified : FG!"((i8.i0.u73.p203==0)||(i8.i1.u81.p224==0))"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-010A-LTLFireability-09 finished in 196599 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((F(G(p0))&&(X(X(!p1)) U ((p2&&X(X(!p1)))||X(X(G(!p1))))))))'
Support contains 5 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 4 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
// Phase 1: matrix 243 rows 253 cols
[2025-06-04 14:06:13] [INFO ] Computed 91 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:06:14] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-06-04 14:06:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:06:14] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2025-06-04 14:06:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:06:18] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:06:18] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:06:18] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:06:18] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:06:18] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:06:18] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:06:18] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:06:18] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:06:19] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:06:19] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 10/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/607 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:06:23] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:06:23] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:06:24] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 3/610 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:06:25] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:06:25] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:06:25] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:06:25] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:06:25] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 5/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:06:26] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:06:27] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:06:27] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 3/618 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:06:30] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:06:30] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/496 variables, 2/620 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:06:33] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 1/621 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:06:35] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 1/622 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:06:38] [INFO ] Deduced a trap along path composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/496 variables, 1/623 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:06:40] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:06:40] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 8 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/496 variables, 2/625 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 496/496 variables, and 625 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30016 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 27/371 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/624 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 242/866 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:06:48] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 1/867 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 1/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/496 variables, and 868 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30009 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60051ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 60052ms
Finished structural reductions in LTL mode , in 1 iterations and 60472 ms. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1, p1, p1, true]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLFireability-11
Stuttering criterion allowed to conclude after 568 steps with 0 reset in 5 ms.
FORMULA ShieldIIPs-PT-010A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLFireability-11 finished in 60759 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)&&X(F(p1))))'
Support contains 6 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 2 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2025-06-04 14:07:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:07:14] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-06-04 14:07:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:07:14] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2025-06-04 14:07:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:07:18] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:07:18] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:07:19] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:07:19] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:07:19] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:07:19] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:07:19] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:07:19] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:07:19] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:07:20] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 10/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/607 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:07:24] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:07:24] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:07:24] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 3/610 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:07:25] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:07:25] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:07:25] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:07:25] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:07:25] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 5/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:07:27] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:07:27] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:07:27] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 3/618 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:07:30] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:07:30] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/496 variables, 2/620 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:07:33] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 1/621 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:07:36] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 1/622 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:07:38] [INFO ] Deduced a trap along path composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/496 variables, 1/623 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:07:40] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:07:40] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 7 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/496 variables, 2/625 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 1.0)
(s154 0.0)
(s155 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 496/496 variables, and 625 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30015 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 27/371 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/624 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 242/866 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:07:49] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 1/867 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 1/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/496 variables, and 868 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30017 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60055ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 60055ms
Finished structural reductions in LTL mode , in 1 iterations and 60412 ms. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLFireability-12
Stuttering criterion allowed to conclude after 48404 steps with 551 reset in 148 ms.
FORMULA ShieldIIPs-PT-010A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLFireability-12 finished in 60707 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((G((X(p1)&&p0))||(p2 U p3))))'
Support contains 10 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Applied a total of 0 rules in 4 ms. Remains 253 /253 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2025-06-04 14:08:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:08:15] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-06-04 14:08:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:08:15] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2025-06-04 14:08:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:19] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:19] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:19] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:19] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:19] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:20] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:20] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:20] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:20] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:21] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 10/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/607 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:25] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:25] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:25] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 3/610 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:26] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:26] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:26] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:26] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:26] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 5/615 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:28] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:28] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:28] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 3/618 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:31] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:32] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/496 variables, 2/620 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:34] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 1/621 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:37] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 1/622 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:40] [INFO ] Deduced a trap along path composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/496 variables, 1/623 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:41] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:41] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 8 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/496 variables, 2/625 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 496/496 variables, and 625 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30013 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 252/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (OVERLAPS) 1/253 variables, 91/343 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 27/371 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/624 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 242/866 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 14:08:50] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 1/867 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 1/868 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/496 variables, and 868 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30017 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60057ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 60058ms
Finished structural reductions in LTL mode , in 1 iterations and 60424 ms. Remains : 253/253 places, 243/243 transitions.
Stuttering acceptance computed with spot in 277 ms :[true, (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3)]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-010A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLFireability-14 finished in 60727 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(G(p0)))'
Support contains 3 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 243/243 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 253 transition count 242
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 252 transition count 242
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 251 transition count 241
Applied a total of 4 rules in 19 ms. Remains 251 /253 variables (removed 2) and now considering 241/243 (removed 2) transitions.
// Phase 1: matrix 241 rows 251 cols
[2025-06-04 14:09:16] [INFO ] Computed 91 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 14:09:16] [INFO ] Implicit Places using invariants in 129 ms returned [237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 130 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 250/253 places, 241/243 transitions.
Applied a total of 0 rules in 4 ms. Remains 250 /250 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 154 ms. Remains : 250/253 places, 241/243 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-010A-LTLFireability-15
Stuttering criterion allowed to conclude after 556 steps with 0 reset in 4 ms.
FORMULA ShieldIIPs-PT-010A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-010A-LTLFireability-15 finished in 198 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||G(p1)))))'
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((!(X(X(p0)) U (!p1 U G(p2)))&&p3))))'
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)))'
[2025-06-04 14:09:16] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18332260798605879238
[2025-06-04 14:09:16] [INFO ] Applying decomposition
[2025-06-04 14:09:16] [INFO ] Computing symmetric may disable matrix : 243 transitions.
[2025-06-04 14:09:16] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 14:09:16] [INFO ] Computing symmetric may enable matrix : 243 transitions.
[2025-06-04 14:09:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 14:09:16] [INFO ] Flatten gal took : 8 ms
[2025-06-04 14:09:16] [INFO ] Computing Do-Not-Accords matrix : 243 transitions.
[2025-06-04 14:09:16] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 14:09:16] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18332260798605879238
Running compilation step : cd /tmp/ltsmin18332260798605879238;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' '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'
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/graph10403392504737489807.txt' '-o' '/tmp/graph10403392504737489807.bin' '-w' '/tmp/graph10403392504737489807.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10403392504737489807.bin' '-l' '-1' '-v' '-w' '/tmp/graph10403392504737489807.weights' '-q' '0' '-e' '0.001'
[2025-06-04 14:09:16] [INFO ] Decomposing Gal with order
[2025-06-04 14:09:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 14:09:16] [INFO ] Removed a total of 160 redundant transitions.
[2025-06-04 14:09:16] [INFO ] Flatten gal took : 15 ms
[2025-06-04 14:09:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 160 labels/synchronizations in 6 ms.
[2025-06-04 14:09:16] [INFO ] Time to serialize gal into /tmp/LTLFireability5589606662575450946.gal : 3 ms
[2025-06-04 14:09:16] [INFO ] Time to serialize properties into /tmp/LTLFireability13952195338457438080.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/LTLFireability5589606662575450946.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13952195338457438080.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...277
Read 3 LTL properties
Checking formula 0 : !((G(F(("(i2.i2.u24.p65==0)")||(G("(((i7.i0.u71.p196==0)||(i5.i1.u49.p136==0))||((i5.i1.u51.p140==0)||(i5.i2.u54.p152==0)))"))))))
Formula 0 simplified : G(F!"(((i7.i0.u71.p196==0)||(i5.i1.u49.p136==0))||((i5.i1.u51.p140==0)||(i5.i2.u54.p152==0)))" & FG!"(i2.i2.u24.p65==0)")
Compilation finished in 500 ms.
Running link step : cd /tmp/ltsmin18332260798605879238;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin18332260798605879238;'/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' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin18332260798605879238;'/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' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin18332260798605879238;'/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' '--ltl' '[](<>((!(X(X((LTLAPp2==true))) U (!(LTLAPp3==true) U []((LTLAPp4==true))))&&(LTLAPp5==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin18332260798605879238;'/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' '--ltl' '[](<>((!(X(X((LTLAPp2==true))) U (!(LTLAPp3==true) U []((LTLAPp4==true))))&&(LTLAPp5==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin18332260798605879238;'/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' '--ltl' '[](<>((LTLAPp6==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin18332260798605879238;'/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' '--ltl' '[](<>((LTLAPp6==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin18332260798605879238;'/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' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-04 14:35:40] [INFO ] Applying decomposition
[2025-06-04 14:35:40] [INFO ] Flatten gal took : 32 ms
[2025-06-04 14:35:40] [INFO ] Decomposing Gal with order
[2025-06-04 14:35:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 14:35:40] [INFO ] Removed a total of 170 redundant transitions.
[2025-06-04 14:35:40] [INFO ] Flatten gal took : 39 ms
[2025-06-04 14:35:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 12 ms.
[2025-06-04 14:35:40] [INFO ] Time to serialize gal into /tmp/LTLFireability384581536605121326.gal : 3 ms
[2025-06-04 14:35:40] [INFO ] Time to serialize properties into /tmp/LTLFireability5048652238760181524.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/LTLFireability384581536605121326.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5048652238760181524.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...275
Read 3 LTL properties
Checking formula 0 : !((G(F(("(u28.p65==0)")||(G("(((u80.p196==0)||(u56.p136==0))||((u58.p140==0)||(u61.p152==0)))"))))))
Formula 0 simplified : G(F!"(((u80.p196==0)||(u56.p136==0))||((u58.p140==0)||(u61.p152==0)))" & FG!"(u28.p65==0)")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: Initializing POR dependencies: labels 250, guards 243
pins2lts-mc-linux64( 5/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.449: LTL layer: formula: [](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))
pins2lts-mc-linux64( 4/ 8), 0.450: "[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.450: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.552: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.567: There are 251 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.567: State length is 254, there are 249 groups
pins2lts-mc-linux64( 0/ 8), 0.567: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.567: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.567: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.567: Visible groups: 0 / 249, labels: 2 / 251
pins2lts-mc-linux64( 0/ 8), 0.567: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.567: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.606: [Blue] ~120 levels ~960 states ~3040 transitions
pins2lts-mc-linux64( 7/ 8), 0.674: [Blue] ~240 levels ~1920 states ~9304 transitions
pins2lts-mc-linux64( 0/ 8), 0.775: [Blue] ~480 levels ~3840 states ~22568 transitions
pins2lts-mc-linux64( 0/ 8), 0.834: [Blue] ~647 levels ~7680 states ~30840 transitions
pins2lts-mc-linux64( 0/ 8), 0.939: [Blue] ~655 levels ~15360 states ~42768 transitions
pins2lts-mc-linux64( 2/ 8), 1.174: [Blue] ~633 levels ~30720 states ~69320 transitions
pins2lts-mc-linux64( 2/ 8), 1.564: [Blue] ~633 levels ~61440 states ~123976 transitions
pins2lts-mc-linux64( 2/ 8), 2.209: [Blue] ~633 levels ~122880 states ~242920 transitions
pins2lts-mc-linux64( 2/ 8), 3.458: [Blue] ~662 levels ~245760 states ~493832 transitions
pins2lts-mc-linux64( 2/ 8), 5.803: [Blue] ~662 levels ~491520 states ~1069192 transitions
pins2lts-mc-linux64( 5/ 8), 9.573: [Blue] ~843 levels ~983040 states ~1879544 transitions
pins2lts-mc-linux64( 3/ 8), 16.993: [Blue] ~638 levels ~1966080 states ~3568832 transitions
pins2lts-mc-linux64( 3/ 8), 31.418: [Blue] ~657 levels ~3932160 states ~7447184 transitions
pins2lts-mc-linux64( 5/ 8), 61.387: [Blue] ~843 levels ~7864320 states ~16272696 transitions
pins2lts-mc-linux64( 5/ 8), 122.252: [Blue] ~845 levels ~15728640 states ~33635680 transitions
pins2lts-mc-linux64( 5/ 8), 240.326: [Blue] ~862 levels ~31457280 states ~66088664 transitions
pins2lts-mc-linux64( 5/ 8), 482.652: [Blue] ~862 levels ~62914560 states ~131609352 transitions
pins2lts-mc-linux64( 3/ 8), 770.197: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 770.218:
pins2lts-mc-linux64( 0/ 8), 770.218: Explored 91174787 states 224879964 transitions, fanout: 2.466
pins2lts-mc-linux64( 0/ 8), 770.218: Total exploration time 769.640 sec (769.620 sec minimum, 769.633 sec on average)
pins2lts-mc-linux64( 0/ 8), 770.218: States per second: 118464, Transitions per second: 292188
pins2lts-mc-linux64( 0/ 8), 770.218:
pins2lts-mc-linux64( 0/ 8), 770.218: State space has 91195352 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 770.218: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 770.218: blue states: 91174787 (99.98%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 770.218: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 770.218: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 770.218:
pins2lts-mc-linux64( 0/ 8), 770.218: Total memory used for local state coloring: 0.1MB
pins2lts-mc-linux64( 0/ 8), 770.218:
pins2lts-mc-linux64( 0/ 8), 770.218: Queue width: 8B, total height: 6527, memory: 0.05MB
pins2lts-mc-linux64( 0/ 8), 770.218: Tree memory: 951.8MB, 10.9 B/state, compr.: 1.1%
pins2lts-mc-linux64( 0/ 8), 770.218: Tree fill ratio (roots/leafs): 67.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 770.218: Stored 296 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 770.218: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 770.218: Est. total memory use: 951.8MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin18332260798605879238;'/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' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin18332260798605879238;'/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' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:121)
at java.base/java.lang.Thread.run(Thread.java:1583)
BK_TIME_CONFINEMENT_REACHED
--------------------
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="ShieldIIPs-PT-010A"
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 ShieldIIPs-PT-010A, 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 r198-tall-174894532500332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-010A.tgz
mv ShieldIIPs-PT-010A 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 ;