About the Execution of ITS-Tools for ShieldIIPt-PT-004B
| 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 | TF?FFFFFTFFFFFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r198-tall-174894532800484.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 ShieldIIPt-PT-004B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894532800484
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 4.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 39K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K 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 67K 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 ShieldIIPt-PT-004B-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749120018987
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-004B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-05 10:40:20] [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-05 10:40:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 10:40:20] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2025-06-05 10:40:20] [INFO ] Transformed 283 places.
[2025-06-05 10:40:20] [INFO ] Transformed 263 transitions.
[2025-06-05 10:40:20] [INFO ] Found NUPN structural information;
[2025-06-05 10:40:20] [INFO ] Parsed PT model containing 283 places and 263 transitions and 654 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPt-PT-004B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-004B-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-004B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 263/263 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 242 transition count 222
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 242 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 241 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 241 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 240 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 240 transition count 220
Applied a total of 86 rules in 71 ms. Remains 240 /283 variables (removed 43) and now considering 220/263 (removed 43) transitions.
// Phase 1: matrix 220 rows 240 cols
[2025-06-05 10:40:20] [INFO ] Computed 37 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:40:20] [INFO ] Implicit Places using invariants in 261 ms returned []
[2025-06-05 10:40:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:40:21] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2025-06-05 10:40:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:23] [INFO ] Deduced a trap composed of 16 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-05 10:40:23] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:23] [INFO ] Deduced a trap composed of 12 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-05 10:40:24] [INFO ] Deduced a trap composed of 16 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-05 10:40:24] [INFO ] Deduced a trap composed of 18 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-05 10:40:24] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:24] [INFO ] Deduced a trap composed of 17 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-05 10:40:24] [INFO ] Deduced a trap composed of 13 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-05 10:40:24] [INFO ] Deduced a trap composed of 13 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-05 10:40:24] [INFO ] Deduced a trap composed of 17 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-05 10:40:24] [INFO ] Deduced a trap composed of 17 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-05 10:40:24] [INFO ] Deduced a trap composed of 19 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-05 10:40:24] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:24] [INFO ] Deduced a trap composed of 18 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-05 10:40:24] [INFO ] Deduced a trap composed of 14 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-05 10:40:24] [INFO ] Deduced a trap composed of 14 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-05 10:40:25] [INFO ] Deduced a trap composed of 18 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-05 10:40:25] [INFO ] Deduced a trap composed of 18 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-05 10:40:25] [INFO ] Deduced a trap composed of 20 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-05 10:40:25] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:25] [INFO ] Deduced a trap composed of 16 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-05 10:40:26] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:26] [INFO ] Deduced a trap composed of 15 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-05 10:40:26] [INFO ] Deduced a trap composed of 20 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-05 10:40:26] [INFO ] Deduced a trap composed of 13 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-05 10:40:26] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:26] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:28] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 220/460 variables, 240/305 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:31] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:33] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:34] [INFO ] Deduced a trap along path composed of 7 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:36] [INFO ] Deduced a trap along path composed of 7 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-05 10:40:36] [INFO ] Deduced a trap along path composed of 7 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:36] [INFO ] Deduced a trap along path composed of 3 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-05 10:40:37] [INFO ] Deduced a trap along path composed of 5 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-05 10:40:37] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 5/313 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (OVERLAPS) 0/460 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 313 constraints, problems are : Problem set: 0 solved, 219 unsolved in 21980 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 29/66 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/460 variables, 240/306 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 219/525 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:44] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:44] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:45] [INFO ] Deduced a trap composed of 16 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-05 10:40:45] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:45] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:45] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:45] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:45] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:45] [INFO ] Deduced a trap composed of 21 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-05 10:40:46] [INFO ] Deduced a trap composed of 18 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-05 10:40:46] [INFO ] Deduced a trap composed of 19 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-05 10:40:46] [INFO ] Deduced a trap composed of 19 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-05 10:40:46] [INFO ] Deduced a trap composed of 9 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-05 10:40:46] [INFO ] Deduced a trap composed of 18 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-05 10:40:46] [INFO ] Deduced a trap composed of 18 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-05 10:40:46] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:46] [INFO ] Deduced a trap composed of 19 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-05 10:40:46] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:46] [INFO ] Deduced a trap composed of 19 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-05 10:40:46] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 20/545 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:47] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:47] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:47] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:47] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:48] [INFO ] Deduced a trap composed of 18 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-05 10:40:48] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:48] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:48] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:48] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:48] [INFO ] Deduced a trap composed of 21 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-05 10:40:48] [INFO ] Deduced a trap composed of 19 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-05 10:40:49] [INFO ] Deduced a trap composed of 23 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-05 10:40:49] [INFO ] Deduced a trap composed of 21 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-05 10:40:49] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:49] [INFO ] Deduced a trap composed of 20 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-05 10:40:49] [INFO ] Deduced a trap composed of 18 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-05 10:40:49] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 17/562 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:50] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:50] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:51] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 3/565 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:54] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:54] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 2/567 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:40:57] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 1/568 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:01] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:02] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 2/570 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:05] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/460 variables, 7/578 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/460 variables, and 578 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 75/75 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 52077ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 52088ms
Starting structural reductions in LTL mode, iteration 1 : 240/283 places, 220/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52661 ms. Remains : 240/283 places, 220/263 transitions.
Support contains 34 out of 240 places after structural reductions.
[2025-06-05 10:41:13] [INFO ] Flatten gal took : 41 ms
[2025-06-05 10:41:13] [INFO ] Flatten gal took : 21 ms
[2025-06-05 10:41:13] [INFO ] Input system was already deterministic with 220 transitions.
Support contains 32 out of 240 places (down from 34) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 728 ms. (54 steps per ms) remains 1/24 properties
BEST_FIRST walk for 14921 steps (2 resets) in 43 ms. (339 steps per ms) remains 0/1 properties
Computed a total of 63 stabilizing places and 63 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' '!(X(X(X(F((G(p0)||G(F(p1))||(F(p1)&&X(!p0))))))))'
Support contains 2 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 220/220 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 238 transition count 218
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 238 transition count 218
Applied a total of 4 rules in 10 ms. Remains 238 /240 variables (removed 2) and now considering 218/220 (removed 2) transitions.
// Phase 1: matrix 218 rows 238 cols
[2025-06-05 10:41:14] [INFO ] Computed 37 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:41:14] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-05 10:41:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:41:14] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-06-05 10:41: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/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:16] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:17] [INFO ] Deduced a trap composed of 12 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-05 10:41:17] [INFO ] Deduced a trap composed of 12 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-05 10:41:17] [INFO ] Deduced a trap composed of 16 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-05 10:41:17] [INFO ] Deduced a trap composed of 16 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-05 10:41:17] [INFO ] Deduced a trap composed of 18 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-05 10:41:17] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:17] [INFO ] Deduced a trap composed of 17 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-05 10:41:17] [INFO ] Deduced a trap composed of 13 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-05 10:41:17] [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-05 10:41:17] [INFO ] Deduced a trap composed of 17 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-05 10:41:17] [INFO ] Deduced a trap composed of 19 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-05 10:41:17] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:17] [INFO ] Deduced a trap composed of 18 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-05 10:41:17] [INFO ] Deduced a trap composed of 14 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-05 10:41:17] [INFO ] Deduced a trap composed of 14 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-05 10:41:18] [INFO ] Deduced a trap composed of 18 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-05 10:41:18] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:18] [INFO ] Deduced a trap composed of 20 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-05 10:41:18] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:18] [INFO ] Deduced a trap composed of 17 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-05 10:41:19] [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-05 10:41:19] [INFO ] Deduced a trap composed of 15 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-05 10:41:19] [INFO ] Deduced a trap composed of 20 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-05 10:41:19] [INFO ] Deduced a trap composed of 13 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-05 10:41:19] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:19] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:21] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 218/456 variables, 238/303 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:25] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:25] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:26] [INFO ] Deduced a trap composed of 20 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-05 10:41:26] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:27] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:30] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:32] [INFO ] Deduced a trap along path composed of 7 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-05 10:41:32] [INFO ] Deduced a trap along path composed of 3 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-05 10:41:33] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:33] [INFO ] Deduced a trap along path composed of 7 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:33] [INFO ] Deduced a trap along path composed of 3 places in 16 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:33] [INFO ] Deduced a trap along path composed of 5 places in 16 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 6/315 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:35] [INFO ] Deduced a trap along path composed of 7 places in 22 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:38] [INFO ] Deduced a trap along path composed of 5 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:38] [INFO ] Deduced a trap along path composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/456 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/456 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 15 (OVERLAPS) 0/456 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 318 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 34/71 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/456 variables, 238/309 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 217/526 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:46] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:46] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:46] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:46] [INFO ] Deduced a trap composed of 17 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-05 10:41:46] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:46] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:46] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:46] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:47] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:47] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:47] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:47] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:47] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:47] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:47] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:47] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:48] [INFO ] Deduced a trap composed of 19 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-05 10:41:48] [INFO ] Deduced a trap composed of 19 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-05 10:41:48] [INFO ] Deduced a trap composed of 23 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-05 10:41:48] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 20/546 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:48] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:48] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:49] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:49] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:49] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:49] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:50] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:50] [INFO ] Deduced a trap composed of 21 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-05 10:41:50] [INFO ] Deduced a trap composed of 17 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-05 10:41:50] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 10/556 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:52] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:52] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:53] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:41:53] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 4/560 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 9/569 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:02] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:02] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:03] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 3/572 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:08] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:08] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:10] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 3/575 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/456 variables, and 575 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 9/9 constraints]
After SMT, in 60057ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 60058ms
Starting structural reductions in LTL mode, iteration 1 : 238/240 places, 218/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60323 ms. Remains : 238/240 places, 218/220 transitions.
Stuttering acceptance computed with spot in 336 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-00
Product exploration explored 100000 steps with 20000 reset in 197 ms.
Product exploration explored 100000 steps with 20000 reset in 131 ms.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Detected a total of 62/238 stabilizing places and 62/218 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 245 ms. (162 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
[2025-06-05 10:42:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/41 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 197/238 variables, 31/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:15] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:15] [INFO ] Deduced a trap composed of 14 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-05 10:42:15] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:15] [INFO ] Deduced a trap composed of 18 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-05 10:42:15] [INFO ] Deduced a trap composed of 19 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-05 10:42:15] [INFO ] Deduced a trap composed of 20 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-05 10:42:15] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 218/456 variables, 238/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:16] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:16] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/456 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 570 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/41 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 197/238 variables, 31/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:16] [INFO ] Deduced a trap composed of 18 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-05 10:42:16] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 218/456 variables, 238/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:16] [INFO ] Deduced a trap along path composed of 3 places in 15 ms of which 0 ms to minimize.
Problem apf2 is UNSAT
After SMT solving in domain Int declared 456/456 variables, and 288 constraints, problems are : Problem set: 1 solved, 0 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 840ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 238 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 218/218 transitions.
Applied a total of 0 rules in 11 ms. Remains 238 /238 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2025-06-05 10:42:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:42:16] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-05 10:42:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:42:17] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-06-05 10:42:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:19] [INFO ] Deduced a trap composed of 16 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-05 10:42:19] [INFO ] Deduced a trap composed of 12 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-05 10:42:19] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:19] [INFO ] Deduced a trap composed of 16 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-05 10:42:19] [INFO ] Deduced a trap composed of 16 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-05 10:42:19] [INFO ] Deduced a trap composed of 18 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-05 10:42:20] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:20] [INFO ] Deduced a trap composed of 17 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-05 10:42:20] [INFO ] Deduced a trap composed of 13 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-05 10:42:20] [INFO ] Deduced a trap composed of 13 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-05 10:42:20] [INFO ] Deduced a trap composed of 17 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-05 10:42:20] [INFO ] Deduced a trap composed of 19 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-05 10:42:20] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:20] [INFO ] Deduced a trap composed of 18 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-05 10:42:20] [INFO ] Deduced a trap composed of 14 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-05 10:42:20] [INFO ] Deduced a trap composed of 14 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-05 10:42:20] [INFO ] Deduced a trap composed of 18 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-05 10:42:20] [INFO ] Deduced a trap composed of 18 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-05 10:42:20] [INFO ] Deduced a trap composed of 20 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-05 10:42:20] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:21] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:21] [INFO ] Deduced a trap composed of 15 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-05 10:42:21] [INFO ] Deduced a trap composed of 15 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-05 10:42:21] [INFO ] Deduced a trap composed of 20 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-05 10:42:21] [INFO ] Deduced a trap composed of 13 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-05 10:42:21] [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-05 10:42:21] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:23] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 218/456 variables, 238/303 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:27] [INFO ] Deduced a trap composed of 17 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-05 10:42:28] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:29] [INFO ] Deduced a trap composed of 20 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-05 10:42:29] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:30] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:32] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:34] [INFO ] Deduced a trap along path composed of 7 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:35] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:35] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:35] [INFO ] Deduced a trap along path composed of 7 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-05 10:42:35] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:36] [INFO ] Deduced a trap along path composed of 5 places in 17 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 6/315 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:38] [INFO ] Deduced a trap along path composed of 7 places in 20 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:40] [INFO ] Deduced a trap along path composed of 5 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:40] [INFO ] Deduced a trap along path composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/456 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/456 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 15 (OVERLAPS) 0/456 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 318 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 34/71 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/456 variables, 238/309 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 217/526 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:48] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:48] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:49] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:49] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:49] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:49] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:49] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:49] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:49] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:50] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:50] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:50] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:50] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:50] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:50] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:50] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:50] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:50] [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-05 10:42:50] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:51] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 20/546 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:51] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:51] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:51] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:52] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:52] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:52] [INFO ] Deduced a trap composed of 19 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-05 10:42:52] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:53] [INFO ] Deduced a trap composed of 21 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-05 10:42:53] [INFO ] Deduced a trap composed of 17 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-05 10:42:53] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 10/556 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:55] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:55] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:56] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:42:56] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 4/560 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 9/569 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:05] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:05] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:05] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 3/572 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:11] [INFO ] Deduced a trap composed of 19 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-05 10:43:11] [INFO ] Deduced a trap composed of 21 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-05 10:43:13] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 3/575 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/456 variables, and 575 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 9/9 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 60058ms
Finished structural reductions in LTL mode , in 1 iterations and 60335 ms. Remains : 238/238 places, 218/218 transitions.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Detected a total of 62/238 stabilizing places and 62/218 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 159 steps (0 resets) in 5 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 80 ms.
Product exploration explored 100000 steps with 25000 reset in 94 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 218/218 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 238 transition count 218
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 17 Pre rules applied. Total rules applied 48 place count 238 transition count 232
Deduced a syphon composed of 65 places in 1 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 65 place count 238 transition count 232
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 1 with 78 rules applied. Total rules applied 143 place count 238 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 144 place count 238 transition count 231
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 177 place count 205 transition count 198
Deduced a syphon composed of 110 places in 1 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 210 place count 205 transition count 198
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 111 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 211 place count 205 transition count 198
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 213 place count 203 transition count 196
Deduced a syphon composed of 109 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 215 place count 203 transition count 196
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -88
Deduced a syphon composed of 124 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 230 place count 203 transition count 284
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 245 place count 188 transition count 254
Deduced a syphon composed of 109 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 260 place count 188 transition count 254
Deduced a syphon composed of 109 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 269 place count 188 transition count 245
Deduced a syphon composed of 109 places in 0 ms
Applied a total of 269 rules in 83 ms. Remains 188 /238 variables (removed 50) and now considering 245/218 (removed -27) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 10:43:18] [INFO ] Redundant transitions in 9 ms returned []
Running 244 sub problems to find dead transitions.
// Phase 1: matrix 245 rows 188 cols
[2025-06-05 10:43:18] [INFO ] Computed 37 invariants in 2 ms
[2025-06-05 10:43:18] [INFO ] State equation strengthened by 54 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 244 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:20] [INFO ] Deduced a trap composed of 2 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-05 10:43:20] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:20] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:20] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:20] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:21] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:21] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:21] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:21] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:21] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:21] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:21] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:21] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:21] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:21] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:21] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:21] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:21] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:21] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:21] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD244 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 20/57 constraints. Problems are: Problem set: 109 solved, 135 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:21] [INFO ] Deduced a trap composed of 3 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-05 10:43:21] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 2 ms to minimize.
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:21] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 2 ms to minimize.
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:21] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:21] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:21] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 2 ms to minimize.
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:21] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 2 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:21] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 2 ms to minimize.
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:21] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:21] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:21] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:21] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 2 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:21] [INFO ] Deduced a trap composed of 7 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-05 10:43:21] [INFO ] Deduced a trap composed of 8 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-05 10:43:22] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 16/73 constraints. Problems are: Problem set: 169 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/73 constraints. Problems are: Problem set: 169 solved, 75 unsolved
At refinement iteration 5 (OVERLAPS) 244/432 variables, 188/261 constraints. Problems are: Problem set: 169 solved, 75 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 53/314 constraints. Problems are: Problem set: 169 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/314 constraints. Problems are: Problem set: 169 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 1/433 variables, 1/315 constraints. Problems are: Problem set: 169 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 0/315 constraints. Problems are: Problem set: 169 solved, 75 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:24] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/433 variables, 1/316 constraints. Problems are: Problem set: 169 solved, 75 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/433 variables, 0/316 constraints. Problems are: Problem set: 169 solved, 75 unsolved
At refinement iteration 12 (OVERLAPS) 0/433 variables, 0/316 constraints. Problems are: Problem set: 169 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 316 constraints, problems are : Problem set: 169 solved, 75 unsolved in 7213 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 188/188 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 169 solved, 75 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 169 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 110/188 variables, 37/37 constraints. Problems are: Problem set: 169 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 37/74 constraints. Problems are: Problem set: 169 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/74 constraints. Problems are: Problem set: 169 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 244/432 variables, 188/262 constraints. Problems are: Problem set: 169 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 53/315 constraints. Problems are: Problem set: 169 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 75/390 constraints. Problems are: Problem set: 169 solved, 75 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:29] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:29] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:29] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 3/393 constraints. Problems are: Problem set: 169 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 0/393 constraints. Problems are: Problem set: 169 solved, 75 unsolved
At refinement iteration 9 (OVERLAPS) 1/433 variables, 1/394 constraints. Problems are: Problem set: 169 solved, 75 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 0/394 constraints. Problems are: Problem set: 169 solved, 75 unsolved
At refinement iteration 11 (OVERLAPS) 0/433 variables, 0/394 constraints. Problems are: Problem set: 169 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 433/433 variables, and 394 constraints, problems are : Problem set: 169 solved, 75 unsolved in 22053 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 188/188 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 75/244 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 29320ms problems are : Problem set: 169 solved, 75 unsolved
Search for dead transitions found 169 dead transitions in 29322ms
Found 169 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 169 transitions
Dead transitions reduction (with SMT) removed 169 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 188/238 places, 76/218 transitions.
Graph (complete) has 279 edges and 188 vertex of which 79 are kept as prefixes of interest. Removing 109 places using SCC suffix rule.3 ms
Discarding 109 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 79 /188 variables (removed 109) and now considering 76/76 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 79/238 places, 76/218 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 29442 ms. Remains : 79/238 places, 76/218 transitions.
Built C files in :
/tmp/ltsmin1973099728814047845
[2025-06-05 10:43:47] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1973099728814047845
Running compilation step : cd /tmp/ltsmin1973099728814047845;'/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 414 ms.
Running link step : cd /tmp/ltsmin1973099728814047845;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin1973099728814047845;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5602154202650683615.hoa' '--buchi-type=spotba'
LTSmin run took 263 ms.
FORMULA ShieldIIPt-PT-004B-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-004B-LTLFireability-00 finished in 154516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(X(G(p0)))||G(p1)))&&F(p2)))'
Support contains 3 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 220/220 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 237 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 237 transition count 217
Applied a total of 6 rules in 11 ms. Remains 237 /240 variables (removed 3) and now considering 217/220 (removed 3) transitions.
// Phase 1: matrix 217 rows 237 cols
[2025-06-05 10:43:48] [INFO ] Computed 37 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:43:48] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-05 10:43:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:43:48] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-06-05 10:43:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:51] [INFO ] Deduced a trap composed of 16 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-05 10:43:51] [INFO ] Deduced a trap composed of 12 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-05 10:43:51] [INFO ] Deduced a trap composed of 12 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-05 10:43:51] [INFO ] Deduced a trap composed of 16 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-05 10:43:51] [INFO ] Deduced a trap composed of 16 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-05 10:43:51] [INFO ] Deduced a trap composed of 18 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-05 10:43:51] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:51] [INFO ] Deduced a trap composed of 17 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-05 10:43:51] [INFO ] Deduced a trap composed of 13 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-05 10:43:51] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:51] [INFO ] Deduced a trap composed of 17 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-05 10:43:52] [INFO ] Deduced a trap composed of 17 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-05 10:43:52] [INFO ] Deduced a trap composed of 19 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-05 10:43:52] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:52] [INFO ] Deduced a trap composed of 18 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-05 10:43:52] [INFO ] Deduced a trap composed of 14 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-05 10:43:52] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:52] [INFO ] Deduced a trap composed of 18 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-05 10:43:52] [INFO ] Deduced a trap composed of 20 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-05 10:43:52] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:53] [INFO ] Deduced a trap composed of 18 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-05 10:43:53] [INFO ] Deduced a trap composed of 15 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-05 10:43:53] [INFO ] Deduced a trap composed of 15 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-05 10:43:53] [INFO ] Deduced a trap composed of 19 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-05 10:43:53] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:55] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 217/454 variables, 237/300 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:43:59] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:00] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:01] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:04] [INFO ] Deduced a trap composed of 21 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-05 10:44:04] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:06] [INFO ] Deduced a trap along path composed of 7 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:07] [INFO ] Deduced a trap along path composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:13] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 6 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/454 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:14] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/454 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:15] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/454 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/454 variables, and 310 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 34/71 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:19] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/454 variables, 237/309 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 216/525 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:21] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:21] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:21] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:21] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:22] [INFO ] Deduced a trap composed of 17 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-05 10:44:22] [INFO ] Deduced a trap composed of 21 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-05 10:44:22] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:22] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:22] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:22] [INFO ] Deduced a trap composed of 18 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-05 10:44:22] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:22] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:22] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:23] [INFO ] Deduced a trap composed of 21 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-05 10:44:23] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:23] [INFO ] Deduced a trap composed of 14 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-05 10:44:23] [INFO ] Deduced a trap composed of 20 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-05 10:44:23] [INFO ] Deduced a trap composed of 20 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-05 10:44:23] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:23] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 20/545 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:24] [INFO ] Deduced a trap composed of 21 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-05 10:44:24] [INFO ] Deduced a trap composed of 17 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-05 10:44:24] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:24] [INFO ] Deduced a trap composed of 22 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-05 10:44:24] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:24] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:25] [INFO ] Deduced a trap composed of 17 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-05 10:44:25] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:25] [INFO ] Deduced a trap composed of 19 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-05 10:44:25] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:25] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:25] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 12/557 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:27] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:28] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:28] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:28] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 4/561 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 2/563 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:38] [INFO ] Deduced a trap along path composed of 5 places in 29 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:38] [INFO ] Deduced a trap along path composed of 7 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:38] [INFO ] Deduced a trap along path composed of 9 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:38] [INFO ] Deduced a trap along path composed of 9 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:38] [INFO ] Deduced a trap along path composed of 8 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:38] [INFO ] Deduced a trap along path composed of 8 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-05 10:44:38] [INFO ] Deduced a trap along path composed of 7 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:38] [INFO ] Deduced a trap along path composed of 3 places in 16 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:38] [INFO ] Deduced a trap along path composed of 3 places in 14 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:39] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:39] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:39] [INFO ] Deduced a trap along path composed of 7 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:39] [INFO ] Deduced a trap along path composed of 7 places in 18 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:40] [INFO ] Deduced a trap along path composed of 3 places in 13 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:40] [INFO ] Deduced a trap along path composed of 5 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-05 10:44:42] [INFO ] Deduced a trap along path composed of 7 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-05 10:44:43] [INFO ] Deduced a trap along path composed of 5 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:44] [INFO ] Deduced a trap along path composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 18/581 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/454 variables, and 581 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 20/20 constraints]
After SMT, in 60037ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 60038ms
Starting structural reductions in LTL mode, iteration 1 : 237/240 places, 217/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60299 ms. Remains : 237/240 places, 217/220 transitions.
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-01
Entered a terminal (fully accepting) state of product in 258 steps with 1 reset in 1 ms.
FORMULA ShieldIIPt-PT-004B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-004B-LTLFireability-01 finished in 60651 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||G(p1))))))'
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 220/220 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 237 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 237 transition count 217
Applied a total of 6 rules in 8 ms. Remains 237 /240 variables (removed 3) and now considering 217/220 (removed 3) transitions.
[2025-06-05 10:44:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:44:49] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-05 10:44:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:44:49] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-06-05 10:44:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:51] [INFO ] Deduced a trap composed of 16 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-05 10:44:52] [INFO ] Deduced a trap composed of 12 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-05 10:44:52] [INFO ] Deduced a trap composed of 12 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-05 10:44:52] [INFO ] Deduced a trap composed of 16 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-05 10:44:52] [INFO ] Deduced a trap composed of 16 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-05 10:44:52] [INFO ] Deduced a trap composed of 18 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-05 10:44:52] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:52] [INFO ] Deduced a trap composed of 17 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-05 10:44:52] [INFO ] Deduced a trap composed of 13 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-05 10:44:52] [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-05 10:44:52] [INFO ] Deduced a trap composed of 17 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-05 10:44:52] [INFO ] Deduced a trap composed of 17 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-05 10:44:52] [INFO ] Deduced a trap composed of 19 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-05 10:44:52] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:52] [INFO ] Deduced a trap composed of 18 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-05 10:44:52] [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-05 10:44:53] [INFO ] Deduced a trap composed of 14 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-05 10:44:53] [INFO ] Deduced a trap composed of 18 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-05 10:44:53] [INFO ] Deduced a trap composed of 20 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-05 10:44:53] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:53] [INFO ] Deduced a trap composed of 18 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-05 10:44:54] [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-05 10:44:54] [INFO ] Deduced a trap composed of 15 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-05 10:44:54] [INFO ] Deduced a trap composed of 19 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-05 10:44:54] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:55] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 217/454 variables, 237/300 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:44:59] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:01] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:02] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:05] [INFO ] Deduced a trap composed of 21 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-05 10:45:05] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:07] [INFO ] Deduced a trap along path composed of 7 places in 17 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:08] [INFO ] Deduced a trap along path composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:13] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/454 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:14] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/454 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:16] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/454 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.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 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)timeout
(s115 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/454 variables, and 310 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 34/71 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:20] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/454 variables, 237/309 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 216/525 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:22] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:22] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:22] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:22] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:22] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:22] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:22] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:22] [INFO ] Deduced a trap composed of 20 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-05 10:45:23] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:23] [INFO ] Deduced a trap composed of 18 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-05 10:45:23] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:23] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:23] [INFO ] Deduced a trap composed of 18 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-05 10:45:23] [INFO ] Deduced a trap composed of 21 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-05 10:45:23] [INFO ] Deduced a trap composed of 14 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-05 10:45:23] [INFO ] Deduced a trap composed of 14 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-05 10:45:23] [INFO ] Deduced a trap composed of 20 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-05 10:45:24] [INFO ] Deduced a trap composed of 20 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-05 10:45:24] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:24] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 20/545 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:24] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:25] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:25] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:25] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:25] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:25] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:25] [INFO ] Deduced a trap composed of 17 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-05 10:45:25] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:25] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:26] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:26] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:26] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 12/557 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:28] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:29] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:29] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:29] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 4/561 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 2/563 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:38] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:38] [INFO ] Deduced a trap along path composed of 7 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:38] [INFO ] Deduced a trap along path composed of 9 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:38] [INFO ] Deduced a trap along path composed of 9 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:38] [INFO ] Deduced a trap along path composed of 8 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-05 10:45:39] [INFO ] Deduced a trap along path 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-05 10:45:39] [INFO ] Deduced a trap along path composed of 7 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:39] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:39] [INFO ] Deduced a trap along path composed of 3 places in 16 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:39] [INFO ] Deduced a trap along path composed of 3 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-05 10:45:39] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:39] [INFO ] Deduced a trap along path composed of 7 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-05 10:45:40] [INFO ] Deduced a trap along path composed of 7 places in 14 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:40] [INFO ] Deduced a trap along path composed of 3 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-05 10:45:41] [INFO ] Deduced a trap along path composed of 5 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-05 10:45:43] [INFO ] Deduced a trap along path composed of 7 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:43] [INFO ] Deduced a trap along path composed of 5 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-05 10:45:44] [INFO ] Deduced a trap along path composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 18/581 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/454 variables, and 581 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 20/20 constraints]
After SMT, in 60043ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 60043ms
Starting structural reductions in LTL mode, iteration 1 : 237/240 places, 217/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60258 ms. Remains : 237/240 places, 217/220 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-02
Product exploration explored 100000 steps with 149 reset in 166 ms.
Product exploration explored 100000 steps with 138 reset in 243 ms.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Detected a total of 62/237 stabilizing places and 62/217 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 237 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 2546 steps (0 resets) in 17 ms. (141 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 344 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 217/217 transitions.
Applied a total of 0 rules in 4 ms. Remains 237 /237 variables (removed 0) and now considering 217/217 (removed 0) transitions.
[2025-06-05 10:45:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:45:51] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-05 10:45:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:45:51] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-06-05 10:45:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:53] [INFO ] Deduced a trap composed of 16 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-05 10:45:53] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:53] [INFO ] Deduced a trap composed of 12 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-05 10:45:53] [INFO ] Deduced a trap composed of 16 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-05 10:45:53] [INFO ] Deduced a trap composed of 16 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-05 10:45:53] [INFO ] Deduced a trap composed of 18 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-05 10:45:54] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:54] [INFO ] Deduced a trap composed of 17 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-05 10:45:54] [INFO ] Deduced a trap composed of 13 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-05 10:45:54] [INFO ] Deduced a trap composed of 13 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-05 10:45:54] [INFO ] Deduced a trap composed of 17 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-05 10:45:54] [INFO ] Deduced a trap composed of 17 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-05 10:45:54] [INFO ] Deduced a trap composed of 19 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-05 10:45:54] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:54] [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-05 10:45:54] [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-05 10:45:54] [INFO ] Deduced a trap composed of 14 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-05 10:45:54] [INFO ] Deduced a trap composed of 18 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-05 10:45:54] [INFO ] Deduced a trap composed of 20 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-05 10:45:54] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:55] [INFO ] Deduced a trap composed of 18 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-05 10:45:55] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:55] [INFO ] Deduced a trap composed of 15 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-05 10:45:55] [INFO ] Deduced a trap composed of 19 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-05 10:45:55] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:45:57] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 217/454 variables, 237/300 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:01] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:02] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:03] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:06] [INFO ] Deduced a trap composed of 21 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-05 10:46:06] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:08] [INFO ] Deduced a trap along path composed of 7 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:09] [INFO ] Deduced a trap along path composed of 6 places in 23 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:15] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/454 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:16] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/454 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:18] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/454 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/454 variables, and 310 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 34/71 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:21] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/454 variables, 237/309 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 216/525 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:23] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:23] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:24] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:24] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:24] [INFO ] Deduced a trap composed of 17 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-05 10:46:24] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:24] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:24] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:24] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:24] [INFO ] Deduced a trap composed of 18 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-05 10:46:25] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:25] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:25] [INFO ] Deduced a trap composed of 18 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-05 10:46:25] [INFO ] Deduced a trap composed of 21 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-05 10:46:25] [INFO ] Deduced a trap composed of 14 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-05 10:46:25] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:25] [INFO ] Deduced a trap composed of 20 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-05 10:46:25] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:25] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:25] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 20/545 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:26] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:26] [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-05 10:46:26] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:27] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:27] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:27] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:27] [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-05 10:46:27] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:27] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:27] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:27] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:28] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 12/557 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:30] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:30] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:30] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:30] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 4/561 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 2/563 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:40] [INFO ] Deduced a trap along path composed of 5 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-05 10:46:40] [INFO ] Deduced a trap along path composed of 7 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:40] [INFO ] Deduced a trap along path composed of 9 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:40] [INFO ] Deduced a trap along path 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-05 10:46:40] [INFO ] Deduced a trap along path composed of 8 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:40] [INFO ] Deduced a trap along path composed of 8 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:41] [INFO ] Deduced a trap along path composed of 7 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:41] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:41] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:41] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:41] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:41] [INFO ] Deduced a trap along path composed of 7 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-05 10:46:41] [INFO ] Deduced a trap along path composed of 7 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:42] [INFO ] Deduced a trap along path composed of 3 places in 14 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:42] [INFO ] Deduced a trap along path composed of 5 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:45] [INFO ] Deduced a trap along path composed of 7 places in 18 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:45] [INFO ] Deduced a trap along path composed of 5 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:46] [INFO ] Deduced a trap along path composed of 6 places in 22 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 18/581 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/454 variables, and 581 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 20/20 constraints]
After SMT, in 60041ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 60042ms
Finished structural reductions in LTL mode , in 1 iterations and 60259 ms. Remains : 237/237 places, 217/217 transitions.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Detected a total of 62/237 stabilizing places and 62/217 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 261 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 3137 steps (0 resets) in 14 ms. (209 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 376 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 150 reset in 173 ms.
Product exploration explored 100000 steps with 149 reset in 197 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 217/217 transitions.
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 237 transition count 217
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 47 place count 237 transition count 229
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 63 place count 237 transition count 229
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 1 with 78 rules applied. Total rules applied 141 place count 237 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 142 place count 237 transition count 228
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 173 place count 206 transition count 197
Deduced a syphon composed of 110 places in 0 ms
Iterating global reduction 2 with 31 rules applied. Total rules applied 204 place count 206 transition count 197
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 111 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 205 place count 206 transition count 197
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 207 place count 204 transition count 195
Deduced a syphon composed of 109 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 209 place count 204 transition count 195
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -79
Deduced a syphon composed of 124 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 224 place count 204 transition count 274
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 239 place count 189 transition count 244
Deduced a syphon composed of 109 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 254 place count 189 transition count 244
Deduced a syphon composed of 109 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 263 place count 189 transition count 235
Deduced a syphon composed of 109 places in 0 ms
Applied a total of 263 rules in 42 ms. Remains 189 /237 variables (removed 48) and now considering 235/217 (removed -18) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 10:46:53] [INFO ] Redundant transitions in 8 ms returned []
Running 234 sub problems to find dead transitions.
// Phase 1: matrix 235 rows 189 cols
[2025-06-05 10:46:53] [INFO ] Computed 37 invariants in 3 ms
[2025-06-05 10:46:53] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/189 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 2 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 5 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-05 10:46:55] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 2 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 2 ms to minimize.
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/57 constraints. Problems are: Problem set: 102 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 2 ms to minimize.
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 2 ms to minimize.
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 2 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
Problem TDEAD35 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
Problem TDEAD39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Problem TDEAD42 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:55] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 2 ms to minimize.
Problem TDEAD46 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:46:56] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 14/71 constraints. Problems are: Problem set: 158 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/71 constraints. Problems are: Problem set: 158 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 234/423 variables, 189/260 constraints. Problems are: Problem set: 158 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 42/302 constraints. Problems are: Problem set: 158 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 0/302 constraints. Problems are: Problem set: 158 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 1/424 variables, 1/303 constraints. Problems are: Problem set: 158 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 0/303 constraints. Problems are: Problem set: 158 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/424 variables, 0/303 constraints. Problems are: Problem set: 158 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 303 constraints, problems are : Problem set: 158 solved, 76 unsolved in 5763 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 189/189 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 158 solved, 76 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 158 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 110/189 variables, 37/37 constraints. Problems are: Problem set: 158 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 34/71 constraints. Problems are: Problem set: 158 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/71 constraints. Problems are: Problem set: 158 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 234/423 variables, 189/260 constraints. Problems are: Problem set: 158 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 42/302 constraints. Problems are: Problem set: 158 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 76/378 constraints. Problems are: Problem set: 158 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:47:02] [INFO ] Deduced a trap along path composed of 3 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 1/379 constraints. Problems are: Problem set: 158 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 0/379 constraints. Problems are: Problem set: 158 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 1/424 variables, 1/380 constraints. Problems are: Problem set: 158 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 0/380 constraints. Problems are: Problem set: 158 solved, 76 unsolved
At refinement iteration 11 (OVERLAPS) 0/424 variables, 0/380 constraints. Problems are: Problem set: 158 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 380 constraints, problems are : Problem set: 158 solved, 76 unsolved in 25020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 189/189 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 76/234 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 30811ms problems are : Problem set: 158 solved, 76 unsolved
Search for dead transitions found 158 dead transitions in 30812ms
Found 158 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 158 transitions
Dead transitions reduction (with SMT) removed 158 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 189/237 places, 77/217 transitions.
Graph (complete) has 280 edges and 189 vertex of which 80 are kept as prefixes of interest. Removing 109 places using SCC suffix rule.1 ms
Discarding 109 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 80 /189 variables (removed 109) and now considering 77/77 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/237 places, 77/217 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30872 ms. Remains : 80/237 places, 77/217 transitions.
Built C files in :
/tmp/ltsmin2603700065136190
[2025-06-05 10:47:23] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2603700065136190
Running compilation step : cd /tmp/ltsmin2603700065136190;'/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 298 ms.
Running link step : cd /tmp/ltsmin2603700065136190;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2603700065136190;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9862666524830266869.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 217/217 transitions.
Applied a total of 0 rules in 10 ms. Remains 237 /237 variables (removed 0) and now considering 217/217 (removed 0) transitions.
// Phase 1: matrix 217 rows 237 cols
[2025-06-05 10:47:38] [INFO ] Computed 37 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:47:39] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-05 10:47:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:47:39] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-06-05 10:47:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:47:41] [INFO ] Deduced a trap composed of 16 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-05 10:47:41] [INFO ] Deduced a trap composed of 12 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-05 10:47:41] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:47:41] [INFO ] Deduced a trap composed of 16 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-05 10:47:41] [INFO ] Deduced a trap composed of 16 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-05 10:47:41] [INFO ] Deduced a trap composed of 18 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-05 10:47:42] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:47:42] [INFO ] Deduced a trap composed of 17 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-05 10:47:42] [INFO ] Deduced a trap composed of 13 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-05 10:47:42] [INFO ] Deduced a trap composed of 13 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-05 10:47:42] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:47:42] [INFO ] Deduced a trap composed of 17 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-05 10:47:42] [INFO ] Deduced a trap composed of 19 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-05 10:47:42] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:47:42] [INFO ] Deduced a trap composed of 18 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-05 10:47:42] [INFO ] Deduced a trap composed of 14 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-05 10:47:42] [INFO ] Deduced a trap composed of 14 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-05 10:47:42] [INFO ] Deduced a trap composed of 18 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-05 10:47:42] [INFO ] Deduced a trap composed of 20 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-05 10:47:42] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:47:43] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:47:43] [INFO ] Deduced a trap composed of 15 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-05 10:47:43] [INFO ] Deduced a trap composed of 15 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-05 10:47:43] [INFO ] Deduced a trap composed of 19 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-05 10:47:43] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:47:45] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 217/454 variables, 237/300 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:47:49] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:47:50] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:47:51] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:47:54] [INFO ] Deduced a trap composed of 21 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-05 10:47:54] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:47:56] [INFO ] Deduced a trap along path composed of 7 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:47:57] [INFO ] Deduced a trap along path composed of 6 places in 21 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:03] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/454 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:04] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/454 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:05] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 4 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/454 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/454 variables, and 310 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 34/71 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:09] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/454 variables, 237/309 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 216/525 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:11] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:11] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:12] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:12] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:12] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:12] [INFO ] Deduced a trap composed of 21 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-05 10:48:12] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:12] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:12] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:12] [INFO ] Deduced a trap composed of 18 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-05 10:48:13] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:13] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:13] [INFO ] Deduced a trap composed of 18 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-05 10:48:13] [INFO ] Deduced a trap composed of 21 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-05 10:48:13] [INFO ] Deduced a trap composed of 14 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-05 10:48:13] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:13] [INFO ] Deduced a trap composed of 20 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-05 10:48:13] [INFO ] Deduced a trap composed of 20 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-05 10:48:13] [INFO ] Deduced a trap composed of 12 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-05 10:48:13] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 20/545 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:14] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:14] [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-05 10:48:14] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:15] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:15] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:15] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:15] [INFO ] Deduced a trap composed of 17 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-05 10:48:15] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:15] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:15] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:15] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:16] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 12/557 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:18] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:18] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:18] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:18] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 4/561 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 2/563 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:28] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:28] [INFO ] Deduced a trap along path composed of 7 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-05 10:48:28] [INFO ] Deduced a trap along path composed of 9 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:28] [INFO ] Deduced a trap along path composed of 9 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-05 10:48:28] [INFO ] Deduced a trap along path composed of 8 places in 14 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:28] [INFO ] Deduced a trap along path composed of 8 places in 29 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:28] [INFO ] Deduced a trap along path composed of 7 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-05 10:48:28] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:29] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:29] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:29] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:29] [INFO ] Deduced a trap along path composed of 7 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-05 10:48:29] [INFO ] Deduced a trap along path composed of 7 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-05 10:48:30] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:30] [INFO ] Deduced a trap along path composed of 5 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:48:33] [INFO ] Deduced a trap along path composed of 7 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-05 10:48:33] [INFO ] Deduced a trap along path composed of 5 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-05 10:48:34] [INFO ] Deduced a trap along path composed of 6 places in 22 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 18/581 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/454 variables, and 581 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 20/20 constraints]
After SMT, in 60048ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 60048ms
Finished structural reductions in LTL mode , in 1 iterations and 60286 ms. Remains : 237/237 places, 217/217 transitions.
Built C files in :
/tmp/ltsmin13580492828511330313
[2025-06-05 10:48:39] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13580492828511330313
Running compilation step : cd /tmp/ltsmin13580492828511330313;'/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 300 ms.
Running link step : cd /tmp/ltsmin13580492828511330313;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13580492828511330313;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5901712574375558025.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 10:48:54] [INFO ] Flatten gal took : 11 ms
[2025-06-05 10:48:54] [INFO ] Flatten gal took : 18 ms
[2025-06-05 10:48:54] [INFO ] Time to serialize gal into /tmp/LTL12901854710989739856.gal : 3 ms
[2025-06-05 10:48:54] [INFO ] Time to serialize properties into /tmp/LTL13671134056308258789.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/LTL12901854710989739856.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16330948873843214731.hoa' '-atoms' '/tmp/LTL13671134056308258789.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/LTL13671134056308258789.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16330948873843214731.hoa
Reverse transition relation is NOT exact ! Due to transitions t7, t11, t16, t20, t25, t29, t34, t35, t38, t39, t40, t41, t42, t44, t45, t49, t54, t59, t63,...495
Computing Next relation with stutter on 7622 deadlock states
Detected timeout of ITS tools.
[2025-06-05 10:49:09] [INFO ] Flatten gal took : 9 ms
[2025-06-05 10:49:09] [INFO ] Flatten gal took : 9 ms
[2025-06-05 10:49:09] [INFO ] Time to serialize gal into /tmp/LTL5502202669841648479.gal : 2 ms
[2025-06-05 10:49:09] [INFO ] Time to serialize properties into /tmp/LTL2442342205019650555.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5502202669841648479.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2442342205019650555.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("(p1==0)"))||("(((p165==1)&&(p178==1))&&(p212==1))"))))))
Formula 0 simplified : XXG(!"(((p165==1)&&(p178==1))&&(p212==1))" & F!"(p1==0)")
Reverse transition relation is NOT exact ! Due to transitions t7, t11, t16, t20, t25, t29, t34, t35, t38, t39, t40, t41, t42, t44, t45, t49, t54, t59, t63,...495
Computing Next relation with stutter on 7622 deadlock states
Detected timeout of ITS tools.
[2025-06-05 10:49:24] [INFO ] Flatten gal took : 13 ms
[2025-06-05 10:49:24] [INFO ] Applying decomposition
[2025-06-05 10:49:24] [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/graph17283709903750526369.txt' '-o' '/tmp/graph17283709903750526369.bin' '-w' '/tmp/graph17283709903750526369.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17283709903750526369.bin' '-l' '-1' '-v' '-w' '/tmp/graph17283709903750526369.weights' '-q' '0' '-e' '0.001'
[2025-06-05 10:49:24] [INFO ] Decomposing Gal with order
[2025-06-05 10:49:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 10:49:24] [INFO ] Removed a total of 43 redundant transitions.
[2025-06-05 10:49:24] [INFO ] Flatten gal took : 74 ms
[2025-06-05 10:49:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2025-06-05 10:49:24] [INFO ] Time to serialize gal into /tmp/LTL18399428460145422122.gal : 6 ms
[2025-06-05 10:49:24] [INFO ] Time to serialize properties into /tmp/LTL10021661473920596774.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/LTL18399428460145422122.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10021661473920596774.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 : !((X(X(F((G("(i9.i0.u0.p1==0)"))||("(((i9.i1.u54.p165==1)&&(i10.u56.p178==1))&&(i9.i2.u67.p212==1))"))))))
Formula 0 simplified : XXG(!"(((i9.i1.u54.p165==1)&&(i10.u56.p178==1))&&(i9.i2.u67.p212==1))" & F!"(i9.i0.u0.p1==0)")
Reverse transition relation is NOT exact ! Due to transitions t42, t87, t127, t177, i0.i0.u2.t181, i0.i1.t98, i0.i1.u45.t94, i1.t147, i1.u20.t152, i2.i0.u8...917
Computing Next relation with stutter on 7622 deadlock states
Detected timeout of ITS tools.
Treatment of property ShieldIIPt-PT-004B-LTLFireability-02 finished in 290620 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 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 220/220 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 239 transition count 171
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 191 transition count 171
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 96 place count 191 transition count 141
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 156 place count 161 transition count 141
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 158 place count 159 transition count 139
Iterating global reduction 2 with 2 rules applied. Total rules applied 160 place count 159 transition count 139
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 160 place count 159 transition count 137
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 164 place count 157 transition count 137
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 292 place count 93 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 293 place count 93 transition count 72
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 3 with 2 rules applied. Total rules applied 295 place count 92 transition count 71
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 317 place count 81 transition count 78
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 319 place count 79 transition count 76
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 321 place count 77 transition count 76
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 321 place count 77 transition count 75
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 323 place count 76 transition count 75
Applied a total of 323 rules in 37 ms. Remains 76 /240 variables (removed 164) and now considering 75/220 (removed 145) transitions.
// Phase 1: matrix 75 rows 76 cols
[2025-06-05 10:49:39] [INFO ] Computed 35 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:49:40] [INFO ] Implicit Places using invariants in 64 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/240 places, 75/220 transitions.
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 2 place count 74 transition count 74
Applied a total of 2 rules in 3 ms. Remains 74 /75 variables (removed 1) and now considering 74/75 (removed 1) transitions.
// Phase 1: matrix 74 rows 74 cols
[2025-06-05 10:49:40] [INFO ] Computed 34 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:49:40] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-05 10:49:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:49:40] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 74/240 places, 74/220 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 287 ms. Remains : 74/240 places, 74/220 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-004B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-004B-LTLFireability-05 finished in 362 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((G(p0)||X(G(p1))))))))'
Support contains 2 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 220/220 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 238 transition count 218
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 238 transition count 218
Applied a total of 4 rules in 6 ms. Remains 238 /240 variables (removed 2) and now considering 218/220 (removed 2) transitions.
// Phase 1: matrix 218 rows 238 cols
[2025-06-05 10:49:40] [INFO ] Computed 37 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:49:40] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-05 10:49:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:49:40] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-06-05 10:49:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:49:43] [INFO ] Deduced a trap composed of 16 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-05 10:49:43] [INFO ] Deduced a trap composed of 12 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-05 10:49:43] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:49:43] [INFO ] Deduced a trap composed of 16 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-05 10:49:43] [INFO ] Deduced a trap composed of 16 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-05 10:49:43] [INFO ] Deduced a trap composed of 18 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-05 10:49:43] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:49:43] [INFO ] Deduced a trap composed of 17 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-05 10:49:43] [INFO ] Deduced a trap composed of 13 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-05 10:49:43] [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-05 10:49:43] [INFO ] Deduced a trap composed of 17 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-05 10:49:43] [INFO ] Deduced a trap composed of 17 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-05 10:49:43] [INFO ] Deduced a trap composed of 19 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-05 10:49:43] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:49:44] [INFO ] Deduced a trap composed of 18 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-05 10:49:44] [INFO ] Deduced a trap composed of 14 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-05 10:49:44] [INFO ] Deduced a trap composed of 14 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-05 10:49:44] [INFO ] Deduced a trap composed of 18 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-05 10:49:44] [INFO ] Deduced a trap composed of 18 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-05 10:49:44] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:49:44] [INFO ] Deduced a trap composed of 19 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-05 10:49:44] [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-05 10:49:44] [INFO ] Deduced a trap composed of 15 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-05 10:49:45] [INFO ] Deduced a trap composed of 19 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-05 10:49:45] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:49:46] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 218/456 variables, 238/301 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:49:50] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:49:52] [INFO ] Deduced a trap composed of 18 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-05 10:49:52] [INFO ] Deduced a trap composed of 19 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-05 10:49:52] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:49:53] [INFO ] Deduced a trap composed of 21 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-05 10:49:53] [INFO ] Deduced a trap composed of 18 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-05 10:49:54] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 3/308 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:49:57] [INFO ] Deduced a trap along path composed of 3 places in 16 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:49:57] [INFO ] Deduced a trap along path composed of 5 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:49:57] [INFO ] Deduced a trap along path composed of 7 places in 14 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:49:59] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:01] [INFO ] Deduced a trap along path composed of 7 places in 17 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:04] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/456 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:06] [INFO ] Deduced a trap along path composed of 3 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-05 10:50:07] [INFO ] Deduced a trap along path composed of 7 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-05 10:50:07] [INFO ] Deduced a trap along path composed of 7 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-05 10:50:07] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/456 variables, 4/318 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/456 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 456/456 variables, and 318 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 35/72 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:11] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 218/456 variables, 238/311 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 217/528 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:13] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:13] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:13] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:13] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:13] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:13] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:13] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:14] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:14] [INFO ] Deduced a trap composed of 20 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-05 10:50:14] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:14] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:14] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:14] [INFO ] Deduced a trap composed of 21 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-05 10:50:14] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:14] [INFO ] Deduced a trap composed of 20 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-05 10:50:14] [INFO ] Deduced a trap composed of 19 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-05 10:50:15] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:15] [INFO ] Deduced a trap composed of 26 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-05 10:50:15] [INFO ] Deduced a trap composed of 21 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-05 10:50:15] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 20/548 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:16] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:16] [INFO ] Deduced a trap composed of 22 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-05 10:50:16] [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-05 10:50:16] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:16] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:17] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:17] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 7/555 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:18] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:18] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:19] [INFO ] Deduced a trap composed of 21 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-05 10:50:19] [INFO ] Deduced a trap composed of 18 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-05 10:50:19] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:19] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 6/561 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 8/569 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:25] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:26] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 2/571 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:37] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 1/572 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/456 variables, and 572 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 72/72 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 60045ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 60046ms
Starting structural reductions in LTL mode, iteration 1 : 238/240 places, 218/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60343 ms. Remains : 238/240 places, 218/220 transitions.
Stuttering acceptance computed with spot in 336 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-06
Entered a terminal (fully accepting) state of product in 811 steps with 0 reset in 2 ms.
FORMULA ShieldIIPt-PT-004B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-004B-LTLFireability-06 finished in 60694 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 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 220/220 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 239 transition count 171
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 191 transition count 171
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 96 place count 191 transition count 141
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 156 place count 161 transition count 141
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 160 transition count 140
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 160 transition count 140
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 158 place count 160 transition count 139
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 160 place count 159 transition count 139
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 294 place count 92 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 295 place count 92 transition count 71
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 3 with 2 rules applied. Total rules applied 297 place count 91 transition count 70
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 319 place count 80 transition count 77
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 321 place count 78 transition count 75
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 323 place count 76 transition count 75
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 323 place count 76 transition count 74
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 325 place count 75 transition count 74
Applied a total of 325 rules in 27 ms. Remains 75 /240 variables (removed 165) and now considering 74/220 (removed 146) transitions.
// Phase 1: matrix 74 rows 75 cols
[2025-06-05 10:50:41] [INFO ] Computed 35 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:50:41] [INFO ] Implicit Places using invariants in 46 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/240 places, 74/220 transitions.
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 2 place count 73 transition count 73
Applied a total of 2 rules in 3 ms. Remains 73 /74 variables (removed 1) and now considering 73/74 (removed 1) transitions.
// Phase 1: matrix 73 rows 73 cols
[2025-06-05 10:50:41] [INFO ] Computed 34 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:50:41] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-05 10:50:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:50:41] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-05 10:50:41] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 73/240 places, 73/220 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 205 ms. Remains : 73/240 places, 73/220 transitions.
Stuttering acceptance computed with spot in 66 ms :[p0, true, p0]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-004B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-004B-LTLFireability-07 finished in 287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 220/220 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 237 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 237 transition count 217
Applied a total of 6 rules in 9 ms. Remains 237 /240 variables (removed 3) and now considering 217/220 (removed 3) transitions.
// Phase 1: matrix 217 rows 237 cols
[2025-06-05 10:50:41] [INFO ] Computed 37 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:50:41] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-05 10:50:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:50:41] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-06-05 10:50:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:43] [INFO ] Deduced a trap composed of 16 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-05 10:50:44] [INFO ] Deduced a trap composed of 12 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-05 10:50:44] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:44] [INFO ] Deduced a trap composed of 16 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-05 10:50:44] [INFO ] Deduced a trap composed of 16 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-05 10:50:44] [INFO ] Deduced a trap composed of 18 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-05 10:50:44] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:44] [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-05 10:50:44] [INFO ] Deduced a trap composed of 13 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-05 10:50:44] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:44] [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-05 10:50:44] [INFO ] Deduced a trap composed of 17 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-05 10:50:44] [INFO ] Deduced a trap composed of 19 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-05 10:50:44] [INFO ] Deduced a trap composed of 17 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-05 10:50:44] [INFO ] Deduced a trap composed of 18 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-05 10:50:44] [INFO ] Deduced a trap composed of 14 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-05 10:50:44] [INFO ] Deduced a trap composed of 14 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-05 10:50:45] [INFO ] Deduced a trap composed of 18 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-05 10:50:45] [INFO ] Deduced a trap composed of 20 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-05 10:50:45] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:45] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:45] [INFO ] Deduced a trap composed of 15 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-05 10:50:45] [INFO ] Deduced a trap composed of 15 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-05 10:50:46] [INFO ] Deduced a trap composed of 19 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-05 10:50:46] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:47] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 217/454 variables, 237/300 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:51] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:53] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:54] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:57] [INFO ] Deduced a trap composed of 21 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-05 10:50:57] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:50:59] [INFO ] Deduced a trap along path composed of 7 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-05 10:51:00] [INFO ] Deduced a trap along path composed of 6 places in 22 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:05] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/454 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:07] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/454 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:08] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/454 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/454 variables, and 310 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 34/71 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:12] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/454 variables, 237/309 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 216/525 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:14] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:14] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:14] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:14] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:14] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:14] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:14] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:14] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:15] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:15] [INFO ] Deduced a trap composed of 18 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-05 10:51:15] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:15] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:15] [INFO ] Deduced a trap composed of 18 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-05 10:51:15] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:15] [INFO ] Deduced a trap composed of 14 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-05 10:51:15] [INFO ] Deduced a trap composed of 14 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-05 10:51:15] [INFO ] Deduced a trap composed of 20 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-05 10:51:15] [INFO ] Deduced a trap composed of 20 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-05 10:51:16] [INFO ] Deduced a trap composed of 12 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-05 10:51:16] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 20/545 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:16] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:17] [INFO ] Deduced a trap composed of 17 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-05 10:51:17] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:17] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:17] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:17] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:17] [INFO ] Deduced a trap composed of 17 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-05 10:51:17] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:18] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:18] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:18] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:18] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 12/557 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:20] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:21] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:21] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:21] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 4/561 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 2/563 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:30] [INFO ] Deduced a trap along path composed of 5 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:31] [INFO ] Deduced a trap along path composed of 7 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-05 10:51:31] [INFO ] Deduced a trap along path composed of 9 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:31] [INFO ] Deduced a trap along path 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-05 10:51:31] [INFO ] Deduced a trap along path composed of 8 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:31] [INFO ] Deduced a trap along path composed of 8 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:31] [INFO ] Deduced a trap along path composed of 7 places in 13 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:31] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:31] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:31] [INFO ] Deduced a trap along path composed of 3 places in 14 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:32] [INFO ] Deduced a trap along path composed of 3 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-05 10:51:32] [INFO ] Deduced a trap along path composed of 7 places in 17 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:32] [INFO ] Deduced a trap along path composed of 7 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-05 10:51:33] [INFO ] Deduced a trap along path composed of 3 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-05 10:51:33] [INFO ] Deduced a trap along path composed of 5 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:35] [INFO ] Deduced a trap along path composed of 7 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:36] [INFO ] Deduced a trap along path composed of 5 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-05 10:51:37] [INFO ] Deduced a trap along path composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 18/581 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/454 variables, and 581 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 20/20 constraints]
After SMT, in 60043ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 60046ms
Starting structural reductions in LTL mode, iteration 1 : 237/240 places, 217/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60270 ms. Remains : 237/240 places, 217/220 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-08
Product exploration explored 100000 steps with 25000 reset in 127 ms.
Product exploration explored 100000 steps with 25000 reset in 120 ms.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 66 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 108 steps (0 resets) in 5 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 86 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 217/217 transitions.
Applied a total of 0 rules in 4 ms. Remains 237 /237 variables (removed 0) and now considering 217/217 (removed 0) transitions.
[2025-06-05 10:51:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:51:42] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-05 10:51:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:51:42] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-06-05 10:51:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:45] [INFO ] Deduced a trap composed of 16 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-05 10:51:45] [INFO ] Deduced a trap composed of 12 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-05 10:51:45] [INFO ] Deduced a trap composed of 12 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-05 10:51:45] [INFO ] Deduced a trap composed of 16 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-05 10:51:45] [INFO ] Deduced a trap composed of 16 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-05 10:51:45] [INFO ] Deduced a trap composed of 18 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-05 10:51:45] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:45] [INFO ] Deduced a trap composed of 17 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-05 10:51:45] [INFO ] Deduced a trap composed of 13 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-05 10:51:45] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:45] [INFO ] Deduced a trap composed of 17 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-05 10:51:45] [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-05 10:51:45] [INFO ] Deduced a trap composed of 19 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-05 10:51:46] [INFO ] Deduced a trap composed of 17 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-05 10:51:46] [INFO ] Deduced a trap composed of 18 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-05 10:51:46] [INFO ] Deduced a trap composed of 14 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-05 10:51:46] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:46] [INFO ] Deduced a trap composed of 18 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-05 10:51:46] [INFO ] Deduced a trap composed of 20 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-05 10:51:46] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:46] [INFO ] Deduced a trap composed of 18 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-05 10:51:47] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:47] [INFO ] Deduced a trap composed of 15 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-05 10:51:47] [INFO ] Deduced a trap composed of 19 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-05 10:51:47] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:48] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 217/454 variables, 237/300 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:52] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:54] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:55] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:51:58] [INFO ] Deduced a trap composed of 21 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-05 10:51:58] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:00] [INFO ] Deduced a trap along path composed of 7 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:01] [INFO ] Deduced a trap along path composed of 6 places in 20 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:06] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/454 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:07] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/454 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:09] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/454 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/454 variables, and 310 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 34/71 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:13] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/454 variables, 237/309 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 216/525 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:15] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:15] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:15] [INFO ] Deduced a trap composed of 16 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-05 10:52:15] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:15] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:15] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:16] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:16] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:16] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:16] [INFO ] Deduced a trap composed of 18 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-05 10:52:16] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:16] [INFO ] Deduced a trap composed of 19 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-05 10:52:16] [INFO ] Deduced a trap composed of 18 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-05 10:52:16] [INFO ] Deduced a trap composed of 21 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-05 10:52:16] [INFO ] Deduced a trap composed of 14 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-05 10:52:17] [INFO ] Deduced a trap composed of 14 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-05 10:52:17] [INFO ] Deduced a trap composed of 20 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-05 10:52:17] [INFO ] Deduced a trap composed of 20 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-05 10:52:17] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:17] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 20/545 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:18] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:18] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:18] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:18] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:18] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:18] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:18] [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-05 10:52:19] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:19] [INFO ] Deduced a trap composed of 19 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-05 10:52:19] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:19] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:19] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 12/557 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:21] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:22] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:22] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:22] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 4/561 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 2/563 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:31] [INFO ] Deduced a trap along path composed of 5 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-05 10:52:31] [INFO ] Deduced a trap along path composed of 7 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:32] [INFO ] Deduced a trap along path 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-05 10:52:32] [INFO ] Deduced a trap along path composed of 9 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:32] [INFO ] Deduced a trap along path composed of 8 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:32] [INFO ] Deduced a trap along path composed of 8 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:32] [INFO ] Deduced a trap along path composed of 7 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:32] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:32] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:32] [INFO ] Deduced a trap along path composed of 3 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-05 10:52:33] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:33] [INFO ] Deduced a trap along path composed of 7 places in 18 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:33] [INFO ] Deduced a trap along path composed of 7 places in 17 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:33] [INFO ] Deduced a trap along path composed of 3 places in 17 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:34] [INFO ] Deduced a trap along path composed of 5 places in 17 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:36] [INFO ] Deduced a trap along path composed of 7 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-05 10:52:37] [INFO ] Deduced a trap along path composed of 5 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:38] [INFO ] Deduced a trap along path composed of 6 places in 20 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 18/581 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/454 variables, and 581 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 20/20 constraints]
After SMT, in 60037ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 60038ms
Finished structural reductions in LTL mode , in 1 iterations and 60253 ms. Remains : 237/237 places, 217/217 transitions.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 64 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 118 steps (0 resets) in 5 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 79 ms.
Product exploration explored 100000 steps with 25000 reset in 86 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 217/217 transitions.
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 237 transition count 217
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 18 Pre rules applied. Total rules applied 46 place count 237 transition count 230
Deduced a syphon composed of 64 places in 1 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 64 place count 237 transition count 230
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 1 with 77 rules applied. Total rules applied 141 place count 237 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 142 place count 237 transition count 229
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 173 place count 206 transition count 198
Deduced a syphon composed of 110 places in 0 ms
Iterating global reduction 2 with 31 rules applied. Total rules applied 204 place count 206 transition count 198
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 111 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 205 place count 206 transition count 198
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 207 place count 204 transition count 196
Deduced a syphon composed of 109 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 209 place count 204 transition count 196
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -76
Deduced a syphon composed of 123 places in 0 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 223 place count 204 transition count 272
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 237 place count 190 transition count 244
Deduced a syphon composed of 109 places in 0 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 251 place count 190 transition count 244
Deduced a syphon composed of 109 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 260 place count 190 transition count 235
Deduced a syphon composed of 109 places in 0 ms
Applied a total of 260 rules in 34 ms. Remains 190 /237 variables (removed 47) and now considering 235/217 (removed -18) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 10:52:43] [INFO ] Redundant transitions in 3 ms returned []
Running 234 sub problems to find dead transitions.
// Phase 1: matrix 235 rows 190 cols
[2025-06-05 10:52:43] [INFO ] Computed 37 invariants in 1 ms
[2025-06-05 10:52:43] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/190 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:46] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:46] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:46] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:46] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:46] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:46] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:46] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:46] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:46] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:46] [INFO ] Deduced a trap composed of 4 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-05 10:52:46] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:46] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:46] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 2 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:46] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:46] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:46] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Problem TDEAD22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:46] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:46] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 7 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 20/57 constraints. Problems are: Problem set: 103 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:46] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 2 ms to minimize.
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:46] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:46] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:46] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:46] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:46] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
Problem TDEAD35 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:46] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:46] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Problem TDEAD39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:46] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:46] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:47] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:47] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:47] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:47] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 3 ms to minimize.
Problem TDEAD118 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 15/72 constraints. Problems are: Problem set: 159 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/72 constraints. Problems are: Problem set: 159 solved, 75 unsolved
At refinement iteration 5 (OVERLAPS) 234/424 variables, 190/262 constraints. Problems are: Problem set: 159 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 47/309 constraints. Problems are: Problem set: 159 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 0/309 constraints. Problems are: Problem set: 159 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 1/425 variables, 1/310 constraints. Problems are: Problem set: 159 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 0/310 constraints. Problems are: Problem set: 159 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/425 variables, 0/310 constraints. Problems are: Problem set: 159 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 310 constraints, problems are : Problem set: 159 solved, 75 unsolved in 6016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 190/190 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 159 solved, 75 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 159 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 110/190 variables, 37/37 constraints. Problems are: Problem set: 159 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 35/72 constraints. Problems are: Problem set: 159 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/72 constraints. Problems are: Problem set: 159 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 234/424 variables, 190/262 constraints. Problems are: Problem set: 159 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 47/309 constraints. Problems are: Problem set: 159 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 75/384 constraints. Problems are: Problem set: 159 solved, 75 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:52:54] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 1/385 constraints. Problems are: Problem set: 159 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 0/385 constraints. Problems are: Problem set: 159 solved, 75 unsolved
At refinement iteration 9 (OVERLAPS) 1/425 variables, 1/386 constraints. Problems are: Problem set: 159 solved, 75 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 0/386 constraints. Problems are: Problem set: 159 solved, 75 unsolved
At refinement iteration 11 (OVERLAPS) 0/425 variables, 0/386 constraints. Problems are: Problem set: 159 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 386 constraints, problems are : Problem set: 159 solved, 75 unsolved in 18260 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 190/190 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 75/234 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 24302ms problems are : Problem set: 159 solved, 75 unsolved
Search for dead transitions found 159 dead transitions in 24302ms
Found 159 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 159 transitions
Dead transitions reduction (with SMT) removed 159 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 190/237 places, 76/217 transitions.
Graph (complete) has 278 edges and 190 vertex of which 81 are kept as prefixes of interest. Removing 109 places using SCC suffix rule.1 ms
Discarding 109 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 81 /190 variables (removed 109) and now considering 76/76 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 81/237 places, 76/217 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 24358 ms. Remains : 81/237 places, 76/217 transitions.
Built C files in :
/tmp/ltsmin8698949134795790388
[2025-06-05 10:53:08] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8698949134795790388
Running compilation step : cd /tmp/ltsmin8698949134795790388;'/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 304 ms.
Running link step : cd /tmp/ltsmin8698949134795790388;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8698949134795790388;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8271885382105523270.hoa' '--buchi-type=spotba'
LTSmin run took 2532 ms.
FORMULA ShieldIIPt-PT-004B-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-004B-LTLFireability-08 finished in 149915 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 1 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 220/220 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 239 transition count 171
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 191 transition count 171
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 96 place count 191 transition count 142
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 154 place count 162 transition count 142
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 156 place count 160 transition count 140
Iterating global reduction 2 with 2 rules applied. Total rules applied 158 place count 160 transition count 140
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 158 place count 160 transition count 138
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 162 place count 158 transition count 138
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 296 place count 91 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 297 place count 91 transition count 70
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 3 with 2 rules applied. Total rules applied 299 place count 90 transition count 69
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 319 place count 80 transition count 75
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 321 place count 78 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 323 place count 76 transition count 73
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 323 place count 76 transition count 72
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 325 place count 75 transition count 72
Applied a total of 325 rules in 21 ms. Remains 75 /240 variables (removed 165) and now considering 72/220 (removed 148) transitions.
// Phase 1: matrix 72 rows 75 cols
[2025-06-05 10:53:11] [INFO ] Computed 35 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:53:11] [INFO ] Implicit Places using invariants in 49 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/240 places, 72/220 transitions.
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 2 place count 73 transition count 71
Applied a total of 2 rules in 3 ms. Remains 73 /74 variables (removed 1) and now considering 71/72 (removed 1) transitions.
// Phase 1: matrix 71 rows 73 cols
[2025-06-05 10:53:11] [INFO ] Computed 34 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:53:11] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-05 10:53:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:53:11] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 73/240 places, 71/220 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 216 ms. Remains : 73/240 places, 71/220 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-10
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-004B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-004B-LTLFireability-10 finished in 258 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(((p0 U p1)||G(p2)))))'
Support contains 8 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 220/220 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 237 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 237 transition count 217
Applied a total of 6 rules in 10 ms. Remains 237 /240 variables (removed 3) and now considering 217/220 (removed 3) transitions.
// Phase 1: matrix 217 rows 237 cols
[2025-06-05 10:53:11] [INFO ] Computed 37 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:53:11] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-05 10:53:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:53:11] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-06-05 10:53:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:14] [INFO ] Deduced a trap composed of 16 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-05 10:53:14] [INFO ] Deduced a trap composed of 12 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-05 10:53:14] [INFO ] Deduced a trap composed of 12 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-05 10:53:14] [INFO ] Deduced a trap composed of 16 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-05 10:53:14] [INFO ] Deduced a trap composed of 16 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-05 10:53:14] [INFO ] Deduced a trap composed of 18 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-05 10:53:14] [INFO ] Deduced a trap composed of 16 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-05 10:53:14] [INFO ] Deduced a trap composed of 17 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-05 10:53:14] [INFO ] Deduced a trap composed of 13 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-05 10:53:14] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:14] [INFO ] Deduced a trap composed of 17 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-05 10:53:14] [INFO ] Deduced a trap composed of 17 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-05 10:53:14] [INFO ] Deduced a trap composed of 19 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-05 10:53:15] [INFO ] Deduced a trap composed of 17 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-05 10:53:15] [INFO ] Deduced a trap composed of 18 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-05 10:53:15] [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-05 10:53:15] [INFO ] Deduced a trap composed of 14 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-05 10:53:15] [INFO ] Deduced a trap composed of 18 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-05 10:53:15] [INFO ] Deduced a trap composed of 20 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-05 10:53:15] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:15] [INFO ] Deduced a trap composed of 18 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-05 10:53:16] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:16] [INFO ] Deduced a trap composed of 15 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-05 10:53:16] [INFO ] Deduced a trap composed of 19 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-05 10:53:16] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:18] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 217/454 variables, 237/300 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:21] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:23] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:24] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:27] [INFO ] Deduced a trap composed of 21 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-05 10:53:27] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:29] [INFO ] Deduced a trap along path composed of 7 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:30] [INFO ] Deduced a trap along path composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:35] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/454 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:37] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/454 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:38] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/454 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/454 variables, and 310 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 34/71 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:42] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/454 variables, 237/309 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 216/525 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:44] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:44] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:44] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:44] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:44] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:44] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:44] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:45] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:45] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:45] [INFO ] Deduced a trap composed of 18 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-05 10:53:45] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:45] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:45] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:45] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:45] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:45] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:46] [INFO ] Deduced a trap composed of 20 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-05 10:53:46] [INFO ] Deduced a trap composed of 20 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-05 10:53:46] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:46] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 20/545 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:46] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:47] [INFO ] Deduced a trap composed of 17 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-05 10:53:47] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:47] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:47] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:47] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:47] [INFO ] Deduced a trap composed of 17 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-05 10:53:47] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:48] [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-05 10:53:48] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:48] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:48] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 12/557 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:50] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:51] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:51] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:53:51] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 4/561 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 2/563 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:00] [INFO ] Deduced a trap along path composed of 5 places in 18 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:00] [INFO ] Deduced a trap along path composed of 7 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:00] [INFO ] Deduced a trap along path 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-05 10:54:00] [INFO ] Deduced a trap along path composed of 9 places in 17 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:00] [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-05 10:54:01] [INFO ] Deduced a trap along path composed of 8 places in 26 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:01] [INFO ] Deduced a trap along path composed of 7 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:01] [INFO ] Deduced a trap along path composed of 3 places in 14 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:01] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:01] [INFO ] Deduced a trap along path composed of 3 places in 13 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:02] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:02] [INFO ] Deduced a trap along path composed of 7 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:02] [INFO ] Deduced a trap along path composed of 7 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:02] [INFO ] Deduced a trap along path composed of 3 places in 15 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:03] [INFO ] Deduced a trap along path composed of 5 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-05 10:54:05] [INFO ] Deduced a trap along path composed of 7 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:05] [INFO ] Deduced a trap along path composed of 5 places in 17 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:07] [INFO ] Deduced a trap along path composed of 6 places in 22 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 18/581 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/454 variables, and 581 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 20/20 constraints]
After SMT, in 60036ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 60036ms
Starting structural reductions in LTL mode, iteration 1 : 237/240 places, 217/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60258 ms. Remains : 237/240 places, 217/220 transitions.
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-11
Entered a terminal (fully accepting) state of product in 4007 steps with 0 reset in 10 ms.
FORMULA ShieldIIPt-PT-004B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-004B-LTLFireability-11 finished in 60468 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 1 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 220/220 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 239 transition count 170
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 190 transition count 170
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 98 place count 190 transition count 140
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 158 place count 160 transition count 140
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 160 place count 158 transition count 138
Iterating global reduction 2 with 2 rules applied. Total rules applied 162 place count 158 transition count 138
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 162 place count 158 transition count 136
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 166 place count 156 transition count 136
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 296 place count 91 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 297 place count 91 transition count 70
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 3 with 2 rules applied. Total rules applied 299 place count 90 transition count 69
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 321 place count 79 transition count 76
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 323 place count 77 transition count 74
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 325 place count 75 transition count 74
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 325 place count 75 transition count 73
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 327 place count 74 transition count 73
Applied a total of 327 rules in 17 ms. Remains 74 /240 variables (removed 166) and now considering 73/220 (removed 147) transitions.
// Phase 1: matrix 73 rows 74 cols
[2025-06-05 10:54:11] [INFO ] Computed 35 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:54:11] [INFO ] Implicit Places using invariants in 48 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/240 places, 73/220 transitions.
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 2 place count 72 transition count 72
Applied a total of 2 rules in 2 ms. Remains 72 /73 variables (removed 1) and now considering 72/73 (removed 1) transitions.
// Phase 1: matrix 72 rows 72 cols
[2025-06-05 10:54:11] [INFO ] Computed 34 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:54:12] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-05 10:54:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:54:12] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 72/240 places, 72/220 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 196 ms. Remains : 72/240 places, 72/220 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-004B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-004B-LTLFireability-12 finished in 236 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(G(p0))&&G(p1)))))'
Support contains 3 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 220/220 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 237 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 237 transition count 217
Applied a total of 6 rules in 12 ms. Remains 237 /240 variables (removed 3) and now considering 217/220 (removed 3) transitions.
// Phase 1: matrix 217 rows 237 cols
[2025-06-05 10:54:12] [INFO ] Computed 37 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:54:12] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-05 10:54:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:54:12] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-06-05 10:54:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:14] [INFO ] Deduced a trap composed of 16 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-05 10:54:14] [INFO ] Deduced a trap composed of 12 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-05 10:54:14] [INFO ] Deduced a trap composed of 12 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-05 10:54:14] [INFO ] Deduced a trap composed of 16 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-05 10:54:15] [INFO ] Deduced a trap composed of 16 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-05 10:54:15] [INFO ] Deduced a trap composed of 18 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-05 10:54:15] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:15] [INFO ] Deduced a trap composed of 17 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-05 10:54:15] [INFO ] Deduced a trap composed of 13 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-05 10:54:15] [INFO ] Deduced a trap composed of 13 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-05 10:54:15] [INFO ] Deduced a trap composed of 17 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-05 10:54:15] [INFO ] Deduced a trap composed of 17 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-05 10:54:15] [INFO ] Deduced a trap composed of 19 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-05 10:54:15] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:15] [INFO ] Deduced a trap composed of 18 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-05 10:54:15] [INFO ] Deduced a trap composed of 14 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-05 10:54:15] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:15] [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-05 10:54:16] [INFO ] Deduced a trap composed of 20 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-05 10:54:16] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:16] [INFO ] Deduced a trap composed of 18 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-05 10:54:16] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:16] [INFO ] Deduced a trap composed of 15 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-05 10:54:16] [INFO ] Deduced a trap composed of 19 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-05 10:54:17] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:18] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 217/454 variables, 237/300 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:22] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:24] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:24] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:28] [INFO ] Deduced a trap composed of 21 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-05 10:54:28] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:30] [INFO ] Deduced a trap along path composed of 7 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:30] [INFO ] Deduced a trap along path composed of 6 places in 16 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:36] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/454 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:37] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/454 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:38] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/454 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/454 variables, and 310 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 34/71 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:42] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/454 variables, 237/309 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 216/525 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:44] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:45] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:45] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:45] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:45] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:45] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:45] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:45] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:45] [INFO ] Deduced a trap composed of 17 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-05 10:54:46] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:46] [INFO ] Deduced a trap composed of 9 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-05 10:54:46] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:46] [INFO ] Deduced a trap composed of 18 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-05 10:54:46] [INFO ] Deduced a trap composed of 21 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-05 10:54:46] [INFO ] Deduced a trap composed of 14 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-05 10:54:46] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:46] [INFO ] Deduced a trap composed of 20 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-05 10:54:46] [INFO ] Deduced a trap composed of 20 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-05 10:54:46] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:47] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 20/545 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:47] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:47] [INFO ] Deduced a trap composed of 17 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-05 10:54:48] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:48] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:48] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:48] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:48] [INFO ] Deduced a trap composed of 17 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-05 10:54:48] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:48] [INFO ] Deduced a trap composed of 19 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-05 10:54:49] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:49] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:49] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 12/557 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:51] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:51] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:51] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:54:52] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 4/561 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 2/563 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:01] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:01] [INFO ] Deduced a trap along path composed of 7 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:01] [INFO ] Deduced a trap along path composed of 9 places in 20 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:01] [INFO ] Deduced a trap along path composed of 9 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-05 10:55:01] [INFO ] Deduced a trap along path composed of 8 places in 15 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:02] [INFO ] Deduced a trap along path composed of 8 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:02] [INFO ] Deduced a trap along path composed of 7 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-05 10:55:02] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:02] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:02] [INFO ] Deduced a trap along path composed of 3 places in 14 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:02] [INFO ] Deduced a trap along path composed of 3 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-05 10:55:03] [INFO ] Deduced a trap along path composed of 7 places in 25 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:03] [INFO ] Deduced a trap along path composed of 7 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:03] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:04] [INFO ] Deduced a trap along path composed of 5 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:06] [INFO ] Deduced a trap along path composed of 7 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:07] [INFO ] Deduced a trap along path composed of 5 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-05 10:55:08] [INFO ] Deduced a trap along path composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 18/581 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/454 variables, and 581 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 20/20 constraints]
After SMT, in 60037ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 60038ms
Starting structural reductions in LTL mode, iteration 1 : 237/240 places, 217/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60261 ms. Remains : 237/240 places, 217/220 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-13
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-004B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-004B-LTLFireability-13 finished in 60451 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)||G(p1))))'
Support contains 2 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 220/220 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 239 transition count 170
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 190 transition count 170
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 98 place count 190 transition count 142
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 154 place count 162 transition count 142
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 156 place count 160 transition count 140
Iterating global reduction 2 with 2 rules applied. Total rules applied 158 place count 160 transition count 140
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 158 place count 160 transition count 138
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 162 place count 158 transition count 138
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 290 place count 94 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 291 place count 94 transition count 73
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 3 with 2 rules applied. Total rules applied 293 place count 93 transition count 72
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 315 place count 82 transition count 79
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 317 place count 80 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 318 place count 79 transition count 77
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 318 place count 79 transition count 76
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 320 place count 78 transition count 76
Applied a total of 320 rules in 19 ms. Remains 78 /240 variables (removed 162) and now considering 76/220 (removed 144) transitions.
// Phase 1: matrix 76 rows 78 cols
[2025-06-05 10:55:12] [INFO ] Computed 36 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:55:12] [INFO ] Implicit Places using invariants in 46 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/240 places, 76/220 transitions.
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 2 place count 76 transition count 75
Applied a total of 2 rules in 2 ms. Remains 76 /77 variables (removed 1) and now considering 75/76 (removed 1) transitions.
// Phase 1: matrix 75 rows 76 cols
[2025-06-05 10:55:12] [INFO ] Computed 35 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:55:12] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-05 10:55:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:55:12] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/240 places, 75/220 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 221 ms. Remains : 76/240 places, 75/220 transitions.
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 204 ms.
Stack based approach found an accepted trace after 306 steps with 0 reset with depth 307 and stack size 306 in 1 ms.
FORMULA ShieldIIPt-PT-004B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-004B-LTLFireability-14 finished in 464 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(p0)&&F(p1)&&X(p2))))'
Support contains 3 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 220/220 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 238 transition count 218
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 238 transition count 218
Applied a total of 4 rules in 10 ms. Remains 238 /240 variables (removed 2) and now considering 218/220 (removed 2) transitions.
// Phase 1: matrix 218 rows 238 cols
[2025-06-05 10:55:13] [INFO ] Computed 37 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:55:13] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-05 10:55:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:55:13] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-06-05 10:55: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/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:15] [INFO ] Deduced a trap composed of 16 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-05 10:55:15] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:15] [INFO ] Deduced a trap composed of 12 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-05 10:55:15] [INFO ] Deduced a trap composed of 16 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-05 10:55:15] [INFO ] Deduced a trap composed of 16 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-05 10:55:16] [INFO ] Deduced a trap composed of 18 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-05 10:55:16] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:16] [INFO ] Deduced a trap composed of 17 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-05 10:55:16] [INFO ] Deduced a trap composed of 13 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-05 10:55:16] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:16] [INFO ] Deduced a trap composed of 17 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-05 10:55:16] [INFO ] Deduced a trap composed of 19 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-05 10:55:16] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:16] [INFO ] Deduced a trap composed of 18 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-05 10:55:16] [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-05 10:55:16] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:16] [INFO ] Deduced a trap composed of 18 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-05 10:55:16] [INFO ] Deduced a trap composed of 18 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-05 10:55:16] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:17] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:17] [INFO ] Deduced a trap composed of 17 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-05 10:55: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-05 10:55:17] [INFO ] Deduced a trap composed of 15 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-05 10:55:17] [INFO ] Deduced a trap composed of 20 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-05 10:55:17] [INFO ] Deduced a trap composed of 13 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-05 10:55:17] [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-05 10:55:18] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:19] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 218/456 variables, 238/303 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:23] [INFO ] Deduced a trap composed of 17 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-05 10:55:24] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:25] [INFO ] Deduced a trap composed of 20 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-05 10:55:25] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:26] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:28] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:30] [INFO ] Deduced a trap along path composed of 7 places in 21 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:31] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:31] [INFO ] Deduced a trap along path composed of 3 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-05 10:55:31] [INFO ] Deduced a trap along path composed of 7 places in 28 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:32] [INFO ] Deduced a trap along path composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:32] [INFO ] Deduced a trap along path composed of 5 places in 22 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 6/315 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:34] [INFO ] Deduced a trap along path composed of 7 places in 21 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:36] [INFO ] Deduced a trap along path composed of 5 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-05 10:55:37] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/456 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/456 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 15 (OVERLAPS) 0/456 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 318 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 34/71 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/456 variables, 238/309 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 217/526 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:44] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:45] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:45] [INFO ] Deduced a trap composed of 21 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-05 10:55:45] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:45] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:45] [INFO ] Deduced a trap composed of 18 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-05 10:55:45] [INFO ] Deduced a trap composed of 20 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-05 10:55:45] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:45] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:46] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:46] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:46] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:46] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:46] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:46] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:46] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:46] [INFO ] Deduced a trap composed of 19 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-05 10:55:46] [INFO ] Deduced a trap composed of 19 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-05 10:55:46] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:47] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 20/546 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:47] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:47] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:47] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:47] [INFO ] Deduced a trap composed of 18 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-05 10:55:48] [INFO ] Deduced a trap composed of 22 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-05 10:55:48] [INFO ] Deduced a trap composed of 19 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-05 10:55:48] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:49] [INFO ] Deduced a trap composed of 21 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-05 10:55:49] [INFO ] Deduced a trap composed of 17 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-05 10:55:49] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 10/556 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:51] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:51] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:51] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:55:52] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 4/560 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 9/569 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:56:00] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:56:01] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:56:01] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 3/572 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:56:06] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 10:56:06] [INFO ] Deduced a trap composed of 21 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-05 10:56:08] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 3/575 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/456 variables, and 575 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 9/9 constraints]
After SMT, in 60031ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 60032ms
Starting structural reductions in LTL mode, iteration 1 : 238/240 places, 218/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60252 ms. Remains : 238/240 places, 218/220 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 91 ms.
Product exploration explored 100000 steps with 33333 reset in 88 ms.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Detected a total of 62/238 stabilizing places and 62/218 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p1), (X p0), (X (X p0)), (X (X p2)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 16 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-004B-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-004B-LTLFireability-15 finished in 60657 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||G(p1))))))'
Found a Shortening insensitive property : ShieldIIPt-PT-004B-LTLFireability-02
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 240 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 240/240 places, 220/220 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 240 transition count 172
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 192 transition count 172
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 96 place count 192 transition count 142
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 156 place count 162 transition count 142
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 158 place count 160 transition count 140
Iterating global reduction 2 with 2 rules applied. Total rules applied 160 place count 160 transition count 140
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 160 place count 160 transition count 139
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 162 place count 159 transition count 139
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 296 place count 92 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 297 place count 92 transition count 71
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 3 with 2 rules applied. Total rules applied 299 place count 91 transition count 70
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 321 place count 80 transition count 77
Applied a total of 321 rules in 15 ms. Remains 80 /240 variables (removed 160) and now considering 77/220 (removed 143) transitions.
// Phase 1: matrix 77 rows 80 cols
[2025-06-05 10:56:13] [INFO ] Computed 37 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:56:13] [INFO ] Implicit Places using invariants in 49 ms returned [72, 73]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 78/240 places, 77/220 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 78 transition count 76
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 77 transition count 76
Applied a total of 2 rules in 1 ms. Remains 77 /78 variables (removed 1) and now considering 76/77 (removed 1) transitions.
// Phase 1: matrix 76 rows 77 cols
[2025-06-05 10:56:13] [INFO ] Computed 35 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:56:14] [INFO ] Implicit Places using invariants in 44 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 76/240 places, 76/220 transitions.
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 2 place count 75 transition count 75
Applied a total of 2 rules in 1 ms. Remains 75 /76 variables (removed 1) and now considering 75/76 (removed 1) transitions.
// Phase 1: matrix 75 rows 75 cols
[2025-06-05 10:56:14] [INFO ] Computed 34 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:56:14] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-05 10:56:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 10:56:14] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-05 10:56:14] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 75/240 places, 75/220 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 239 ms. Remains : 75/240 places, 75/220 transitions.
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-02
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
Treatment of property ShieldIIPt-PT-004B-LTLFireability-02 finished in 445 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2025-06-05 10:56:14] [INFO ] Flatten gal took : 9 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10638238067995780599
[2025-06-05 10:56:14] [INFO ] Computing symmetric may disable matrix : 220 transitions.
[2025-06-05 10:56:14] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 10:56:14] [INFO ] Computing symmetric may enable matrix : 220 transitions.
[2025-06-05 10:56:14] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 10:56:14] [INFO ] Applying decomposition
[2025-06-05 10:56:14] [INFO ] Flatten gal took : 11 ms
[2025-06-05 10:56:14] [INFO ] Computing Do-Not-Accords matrix : 220 transitions.
[2025-06-05 10:56:14] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph11460393973352890736.txt' '-o' '/tmp/graph11460393973352890736.bin' '-w' '/tmp/graph11460393973352890736.weights'
[2025-06-05 10:56:14] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10638238067995780599
Running compilation step : cd /tmp/ltsmin10638238067995780599;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11460393973352890736.bin' '-l' '-1' '-v' '-w' '/tmp/graph11460393973352890736.weights' '-q' '0' '-e' '0.001'
[2025-06-05 10:56:14] [INFO ] Decomposing Gal with order
[2025-06-05 10:56:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 10:56:14] [INFO ] Removed a total of 42 redundant transitions.
[2025-06-05 10:56:14] [INFO ] Flatten gal took : 23 ms
[2025-06-05 10:56:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-05 10:56:14] [INFO ] Time to serialize gal into /tmp/LTLFireability12564539307254842530.gal : 4 ms
[2025-06-05 10:56:14] [INFO ] Time to serialize properties into /tmp/LTLFireability15130045575067812324.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/LTLFireability12564539307254842530.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15130045575067812324.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...278
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(((i11.i1.u54.p165==1)&&(i9.u57.p178==1))&&(i11.i2.u69.p212==1))")||(G("(i13.i0.u0.p1==0)")))))))
Formula 0 simplified : XXG(!"(((i11.i1.u54.p165==1)&&(i9.u57.p178==1))&&(i11.i2.u69.p212==1))" & F!"(i13.i0.u0.p1==0)")
Compilation finished in 405 ms.
Running link step : cd /tmp/ltsmin10638238067995780599;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10638238067995780599;'/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(<>(((LTLAPp0==true)||[]((LTLAPp1==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t42, t87, t131, t173, i0.i0.u2.t181, i0.i1.u11.t174, i0.i2.t151, i0.i2.u20.t147, i0.i2.u23.t1...944
Computing Next relation with stutter on 7622 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: LTL layer: formula: X(X(<>(((LTLAPp0==true)||[]((LTLAPp1==true))))))
pins2lts-mc-linux64( 2/ 8), 0.006: "X(X(<>(((LTLAPp0==true)||[]((LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.006: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.011: 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( 4/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.054: There are 223 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.054: State length is 241, there are 226 groups
pins2lts-mc-linux64( 0/ 8), 0.054: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.054: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.054: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.054: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.182: [Blue] ~120 levels ~960 states ~7136 transitions
pins2lts-mc-linux64( 4/ 8), 0.231: [Blue] ~240 levels ~1920 states ~11024 transitions
pins2lts-mc-linux64( 4/ 8), 0.409: [Blue] ~480 levels ~3840 states ~18840 transitions
pins2lts-mc-linux64( 4/ 8), 0.844: [Blue] ~949 levels ~7680 states ~34960 transitions
pins2lts-mc-linux64( 4/ 8), 1.317: [Blue] ~1883 levels ~15360 states ~68928 transitions
pins2lts-mc-linux64( 4/ 8), 2.101: [Blue] ~3776 levels ~30720 states ~140272 transitions
pins2lts-mc-linux64( 3/ 8), 3.589: [Blue] ~7676 levels ~61440 states ~286832 transitions
pins2lts-mc-linux64( 5/ 8), 5.267: [Blue] ~14976 levels ~122880 states ~610824 transitions
pins2lts-mc-linux64( 3/ 8), 6.716: [Blue] ~16491 levels ~245760 states ~977088 transitions
pins2lts-mc-linux64( 3/ 8), 8.452: [Blue] ~16491 levels ~491520 states ~1713360 transitions
pins2lts-mc-linux64( 3/ 8), 10.814: [Blue] ~16491 levels ~983040 states ~3329968 transitions
pins2lts-mc-linux64( 1/ 8), 15.495: [Blue] ~210200 levels ~1966080 states ~10521928 transitions
pins2lts-mc-linux64( 1/ 8), 24.984: [Blue] ~210215 levels ~3932160 states ~16491608 transitions
pins2lts-mc-linux64( 6/ 8), 43.879: [Blue] ~80651 levels ~7864320 states ~28311928 transitions
pins2lts-mc-linux64( 6/ 8), 82.778: [Blue] ~80651 levels ~15728640 states ~57920952 transitions
pins2lts-mc-linux64( 2/ 8), 161.116: [Blue] ~69445 levels ~31457280 states ~119095552 transitions
pins2lts-mc-linux64( 2/ 8), 323.460: [Blue] ~70315 levels ~62914560 states ~242941208 transitions
pins2lts-mc-linux64( 2/ 8), 644.219: [Blue] ~70531 levels ~125829120 states ~501540912 transitions
pins2lts-mc-linux64( 7/ 8), 717.536: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 717.561:
pins2lts-mc-linux64( 0/ 8), 717.561: Explored 134181217 states 575011252 transitions, fanout: 4.285
pins2lts-mc-linux64( 0/ 8), 717.561: Total exploration time 717.490 sec (717.450 sec minimum, 717.473 sec on average)
pins2lts-mc-linux64( 0/ 8), 717.561: States per second: 187015, Transitions per second: 801421
pins2lts-mc-linux64( 0/ 8), 717.561:
pins2lts-mc-linux64( 0/ 8), 717.561: State space has 134217245 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 717.561: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 717.561: blue states: 134181217 (99.97%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 717.561: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 717.561: all-red states: 80322449 (59.85%), bogus 77005 (0.06%)
pins2lts-mc-linux64( 0/ 8), 717.561:
pins2lts-mc-linux64( 0/ 8), 717.561: Total memory used for local state coloring: 14.6MB
pins2lts-mc-linux64( 0/ 8), 717.561:
pins2lts-mc-linux64( 0/ 8), 717.561: Queue width: 8B, total height: 957847, memory: 7.31MB
pins2lts-mc-linux64( 0/ 8), 717.561: Tree memory: 1204.0MB, 9.4 B/state, compr.: 1.0%
pins2lts-mc-linux64( 0/ 8), 717.561: Tree fill ratio (roots/leafs): 99.0%/70.0%
pins2lts-mc-linux64( 0/ 8), 717.561: Stored 220 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 717.561: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 717.561: Est. total memory use: 1211.4MB (~1031.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10638238067995780599;'/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(<>(((LTLAPp0==true)||[]((LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10638238067995780599;'/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(<>(((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:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-05 11:21:32] [INFO ] Applying decomposition
[2025-06-05 11:21:32] [INFO ] Flatten gal took : 7 ms
[2025-06-05 11:21:32] [INFO ] Decomposing Gal with order
[2025-06-05 11:21:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:21:32] [INFO ] Removed a total of 12 redundant transitions.
[2025-06-05 11:21:32] [INFO ] Flatten gal took : 13 ms
[2025-06-05 11:21:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-05 11:21:32] [INFO ] Time to serialize gal into /tmp/LTLFireability12069535920752231063.gal : 3 ms
[2025-06-05 11:21:32] [INFO ] Time to serialize properties into /tmp/LTLFireability17229885623778861227.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/LTLFireability12069535920752231063.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17229885623778861227.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...278
Read 1 LTL properties
Checking formula 0 : !((X(X(F(("(((i0.i1.i0.i0.i0.i0.i0.u50.p165==1)&&(i0.i1.i0.i0.i0.u52.p178==1))&&(i0.i1.u55.p212==1))")||(G("(i0.u90.p1==0)")))))))
Formula 0 simplified : XXG(!"(((i0.i1.i0.i0.i0.i0.i0.u50.p165==1)&&(i0.i1.i0.i0.i0.u52.p178==1))&&(i0.i1.u55.p212==1))" & F!"(i0.u90.p1==0)")
Reverse transition relation is NOT exact ! Due to transitions i0.i0.i0.u4.t181, i0.i0.i0.i1.u21.t138, i0.i0.i0.i1.u21.t142, i0.i0.i0.i1.i0.u20.t147, i0.i0....1794
Computing Next relation with stutter on 7622 deadlock states
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="ShieldIIPt-PT-004B"
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 ShieldIIPt-PT-004B, 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-174894532800484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-004B.tgz
mv ShieldIIPt-PT-004B 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 ;