About the Execution of GreatSPN+red for ShieldIIPs-PT-004B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10208.348 | 2031430.00 | 3651893.00 | 4361.30 | FTTFFF??TFFT?TFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r355-tall-171683757900059.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ShieldIIPs-PT-004B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683757900059
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 11 14:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 14:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 11 14:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 66K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-004B-LTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-004B-LTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-004B-LTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-004B-LTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-004B-LTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-004B-LTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-004B-LTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-004B-LTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-004B-LTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-004B-LTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-004B-LTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-004B-LTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-004B-LTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-004B-LTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-004B-LTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-004B-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716881429182
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-004B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 07:30:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 07:30:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 07:30:30] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-28 07:30:30] [INFO ] Transformed 243 places.
[2024-05-28 07:30:30] [INFO ] Transformed 239 transitions.
[2024-05-28 07:30:30] [INFO ] Found NUPN structural information;
[2024-05-28 07:30:30] [INFO ] Parsed PT model containing 243 places and 239 transitions and 718 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldIIPs-PT-004B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-004B-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-004B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-004B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-004B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 239/239 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 222 transition count 218
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 222 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 221 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 221 transition count 217
Applied a total of 44 rules in 70 ms. Remains 221 /243 variables (removed 22) and now considering 217/239 (removed 22) transitions.
// Phase 1: matrix 217 rows 221 cols
[2024-05-28 07:30:30] [INFO ] Computed 37 invariants in 16 ms
[2024-05-28 07:30:31] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-28 07:30:31] [INFO ] Invariant cache hit.
[2024-05-28 07:30:31] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-05-28 07:30:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:30:33] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 16 ms to minimize.
[2024-05-28 07:30:33] [INFO ] Deduced a trap composed of 48 places in 296 ms of which 17 ms to minimize.
[2024-05-28 07:30:34] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 2 ms to minimize.
[2024-05-28 07:30:34] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-28 07:30:34] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
[2024-05-28 07:30:34] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-05-28 07:30:34] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 1 ms to minimize.
[2024-05-28 07:30:34] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:30:34] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 13 ms to minimize.
[2024-05-28 07:30:34] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 1 ms to minimize.
[2024-05-28 07:30:34] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-05-28 07:30:35] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:30:35] [INFO ] Deduced a trap composed of 16 places in 180 ms of which 2 ms to minimize.
[2024-05-28 07:30:35] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-28 07:30:35] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-28 07:30:35] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 2 ms to minimize.
[2024-05-28 07:30:35] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:30:35] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:30:35] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:30:35] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:30:35] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:30:36] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-05-28 07:30:36] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:30:36] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-28 07:30:36] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:30:36] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:30:36] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:30:36] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:30:36] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:30:36] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:30:36] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-28 07:30:36] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:30:36] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 1 ms to minimize.
[2024-05-28 07:30:36] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
[2024-05-28 07:30:36] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 3 ms to minimize.
[2024-05-28 07:30:36] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 0 ms to minimize.
[2024-05-28 07:30:36] [INFO ] Deduced a trap composed of 14 places in 16 ms of which 1 ms to minimize.
[2024-05-28 07:30:36] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-28 07:30:36] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:30:37] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:30:38] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-28 07:30:38] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:30:38] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:30:38] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:30:38] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 2 ms to minimize.
[2024-05-28 07:30:38] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:30:38] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:30:38] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:30:38] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:30:38] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:30:38] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
[2024-05-28 07:30:38] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:30:38] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:30:38] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:30:39] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:30:39] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 2 ms to minimize.
[2024-05-28 07:30:39] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:30:39] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:30:39] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:30:39] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:30:39] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:30:39] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:30:39] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:30:40] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:30:40] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:30:40] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:30:40] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:30:40] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:30:40] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:30:40] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:30:40] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:30:40] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 12/109 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:30:41] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:30:41] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:30:43] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:30:43] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:30:43] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-28 07:30:43] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:30:43] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:30:44] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (OVERLAPS) 217/438 variables, 221/338 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:30:46] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:30:46] [INFO ] Deduced a trap composed of 52 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:30:47] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:30:47] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:30:47] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:30:47] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:30:47] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:30:47] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:30:47] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:30:47] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:30:47] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:30:48] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:30:48] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:30:48] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:30:48] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:30:48] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:30:48] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 2 ms to minimize.
[2024-05-28 07:30:48] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 2 ms to minimize.
[2024-05-28 07:30:48] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 3 ms to minimize.
[2024-05-28 07:30:48] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/438 variables, 20/358 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:30:48] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:30:48] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:30:49] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:30:49] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:30:49] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:30:49] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:30:49] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:30:49] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:30:49] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/438 variables, 9/367 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:30:52] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-28 07:30:52] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:30:52] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:30:52] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:30:52] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:30:52] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:30:52] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:30:52] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:30:52] [INFO ] Deduced a trap composed of 30 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:30:53] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 10/377 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:30:53] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:30:54] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:30:54] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:30:54] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:30:54] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:30:54] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:30:54] [INFO ] Deduced a trap composed of 45 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:30:55] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:30:55] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:30:55] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:30:55] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:30:55] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:30:55] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:30:55] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:30:55] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:30:55] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:30:55] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:30:55] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:30:55] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:30:55] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/438 variables, 20/397 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:30:56] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:30:56] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:30:56] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:30:56] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:30:56] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:30:56] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:30:57] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:30:57] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/438 variables, 8/405 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:30:59] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/438 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:31:00] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:31:01] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/438 variables, and 408 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 150/150 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 150/187 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:31:02] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:31:03] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:31:03] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:31:03] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-28 07:31:03] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:31:03] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:31:03] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:31:03] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:31:03] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:31:03] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 10/197 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:31:04] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:31:04] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:31:04] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:31:04] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:31:04] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:31:04] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:31:04] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:31:04] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:31:04] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:31:04] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:31:04] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:31:04] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:31:04] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:31:04] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 14/211 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:31:05] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:31:05] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:31:05] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:31:06] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:31:06] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:31:06] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:31:06] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:31:06] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:31:06] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:31:06] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:31:06] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:31:06] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:31:06] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:31:06] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 14/225 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:31:07] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:31:07] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:31:07] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:31:07] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:31:07] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 0 ms to minimize.
[2024-05-28 07:31:07] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-05-28 07:31:07] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:31:08] [INFO ] Deduced a trap composed of 27 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 8/233 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:31:09] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:31:09] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:31:09] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (OVERLAPS) 217/438 variables, 221/457 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 216/673 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:31:13] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-28 07:31:13] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 2 ms to minimize.
[2024-05-28 07:31:13] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:31:14] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-28 07:31:14] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:31:14] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:31:14] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:31:15] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:31:15] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:31:15] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/438 variables, 10/683 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 07:31:22] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:31:22] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-28 07:31:22] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-28 07:31:23] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-28 07:31:23] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:31:23] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:31:23] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-28 07:31:24] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-05-28 07:31:24] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:31:24] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:31:25] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:31:25] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/438 variables, 12/695 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/438 variables, and 695 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 221/221 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 60142ms
Starting structural reductions in LTL mode, iteration 1 : 221/243 places, 217/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60793 ms. Remains : 221/243 places, 217/239 transitions.
Support contains 25 out of 221 places after structural reductions.
[2024-05-28 07:31:31] [INFO ] Flatten gal took : 64 ms
[2024-05-28 07:31:31] [INFO ] Flatten gal took : 27 ms
[2024-05-28 07:31:31] [INFO ] Input system was already deterministic with 217 transitions.
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 10705 steps (16 resets) in 140 ms. (75 steps per ms) remains 0/17 properties
Computed a total of 51 stabilizing places and 51 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(p0))||G((X(p1) U p2)))))'
Support contains 3 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 217/217 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 215 transition count 211
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 215 transition count 211
Applied a total of 12 rules in 8 ms. Remains 215 /221 variables (removed 6) and now considering 211/217 (removed 6) transitions.
// Phase 1: matrix 211 rows 215 cols
[2024-05-28 07:31:32] [INFO ] Computed 37 invariants in 3 ms
[2024-05-28 07:31:32] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-28 07:31:32] [INFO ] Invariant cache hit.
[2024-05-28 07:31:32] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2024-05-28 07:31:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:31:34] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:31:34] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:31:34] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-05-28 07:31:34] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:31:34] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:31:34] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:31:34] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:31:34] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:31:34] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-28 07:31:34] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2024-05-28 07:31:34] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 2 ms to minimize.
[2024-05-28 07:31:34] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:31:34] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:31:34] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:31:35] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:31:35] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:31:35] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:31:35] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:31:35] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:31:35] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:31:35] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:31:35] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-28 07:31:35] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 2 ms to minimize.
[2024-05-28 07:31:35] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2024-05-28 07:31:35] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:31:35] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:31:36] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:31:36] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 2 ms to minimize.
[2024-05-28 07:31:36] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 4 ms to minimize.
[2024-05-28 07:31:36] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:31:36] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:31:36] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:31:36] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:31:36] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:31:36] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 4 ms to minimize.
[2024-05-28 07:31:36] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 0 ms to minimize.
[2024-05-28 07:31:36] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:31:36] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:31:36] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:31:36] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:31:37] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:31:37] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:31:37] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:31:38] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:31:38] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:31:38] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:31:38] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:31:38] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2024-05-28 07:31:38] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:31:38] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:31:38] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:31:38] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:31:38] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-28 07:31:38] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:31:38] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:31:38] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:31:38] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 17/94 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:31:39] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:31:39] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:31:40] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:31:40] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:31:40] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:31:41] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:31:42] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:31:42] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2024-05-28 07:31:42] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (OVERLAPS) 211/426 variables, 215/318 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:31:45] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:31:45] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:31:45] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:31:45] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-28 07:31:45] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-28 07:31:45] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:31:45] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:31:46] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:31:46] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:31:46] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:31:46] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:31:46] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:31:46] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:31:46] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:31:46] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
[2024-05-28 07:31:46] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:31:46] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:31:46] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:31:46] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 19/337 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:31:47] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:31:47] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:31:47] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:31:47] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:31:47] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:31:47] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:31:47] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:31:47] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:31:47] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:31:48] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:31:48] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:31:48] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 12/349 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:31:49] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:31:49] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2024-05-28 07:31:49] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-28 07:31:49] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:31:49] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:31:49] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:31:49] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 7/356 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:31:52] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:31:52] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:31:53] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-28 07:31:53] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:31:53] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:31:53] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-05-28 07:31:53] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:31:53] [INFO ] Deduced a trap composed of 30 places in 24 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 8/364 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:31:54] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:31:54] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:31:54] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:31:54] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-05-28 07:31:54] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:31:55] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:31:55] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:31:55] [INFO ] Deduced a trap composed of 45 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:31:55] [INFO ] Deduced a trap composed of 45 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:31:55] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 10/374 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:31:55] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:31:55] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:31:56] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:31:56] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:31:56] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:31:56] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:31:56] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:31:56] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:31:56] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:31:56] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:31:57] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:31:57] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:31:57] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 13/387 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:31:59] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:31:59] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-28 07:31:59] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:31:59] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:31:59] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:31:59] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 6/393 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:32:00] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:32:01] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:32:01] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:32:01] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:32:01] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:32:01] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:32:01] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:32:01] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:32:01] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:32:01] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:32:01] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:32:01] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 12/405 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/426 variables, and 405 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 153/153 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 153/190 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 211/426 variables, 215/405 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/426 variables, 210/615 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:32:06] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-28 07:32:06] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-28 07:32:07] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:32:07] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-28 07:32:07] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:32:07] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:32:08] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-28 07:32:08] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-28 07:32:08] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-28 07:32:08] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:32:08] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:32:08] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:32:08] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:32:08] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:32:08] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:32:09] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:32:09] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-28 07:32:09] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-28 07:32:09] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:32:09] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 20/635 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:32:13] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:32:13] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:32:14] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:32:14] [INFO ] Deduced a trap composed of 23 places in 19 ms of which 1 ms to minimize.
[2024-05-28 07:32:14] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:32:14] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-28 07:32:14] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:32:14] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 8/643 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:32:20] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-05-28 07:32:20] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-28 07:32:20] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
[2024-05-28 07:32:20] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-28 07:32:21] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-05-28 07:32:21] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:32:21] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:32:21] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:32:21] [INFO ] Deduced a trap composed of 55 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:32:21] [INFO ] Deduced a trap composed of 58 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:32:21] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:32:21] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:32:22] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 13/656 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:32:27] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:32:29] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
[2024-05-28 07:32:29] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-28 07:32:29] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:32:30] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:32:30] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:32:31] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 663 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 201/201 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 60057ms
Starting structural reductions in LTL mode, iteration 1 : 215/221 places, 211/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60359 ms. Remains : 215/221 places, 211/217 transitions.
Stuttering acceptance computed with spot in 313 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLCardinality-01
Product exploration explored 100000 steps with 808 reset in 299 ms.
Product exploration explored 100000 steps with 803 reset in 283 ms.
Computed a total of 48 stabilizing places and 48 stable transitions
Computed a total of 48 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 103 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
RANDOM walk for 40000 steps (68 resets) in 423 ms. (94 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 181 ms. (219 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
[2024-05-28 07:32:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/53 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 162/215 variables, 29/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 211/426 variables, 215/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/426 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 252 constraints, problems are : Problem set: 0 solved, 2 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
Problem apf3 is UNSAT
After SMT solving in domain Int declared 53/426 variables, and 8 constraints, problems are : Problem set: 2 solved, 0 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 8/37 constraints, State Equation: 0/215 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 166ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p0 p2)), (G (OR p0 p2 (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT p2)), (F (NOT (AND (NOT p0) (NOT p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 14 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-004B-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-004B-LTLCardinality-01 finished in 62056 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 3 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 217/217 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 214 transition count 210
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 214 transition count 210
Applied a total of 14 rules in 9 ms. Remains 214 /221 variables (removed 7) and now considering 210/217 (removed 7) transitions.
// Phase 1: matrix 210 rows 214 cols
[2024-05-28 07:32:34] [INFO ] Computed 37 invariants in 3 ms
[2024-05-28 07:32:34] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-28 07:32:34] [INFO ] Invariant cache hit.
[2024-05-28 07:32:34] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2024-05-28 07:32:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:32:36] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:32:36] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:32:36] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:32:36] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:32:36] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:32:36] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:32:36] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:32:36] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-28 07:32:36] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-05-28 07:32:36] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:32:36] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:32:36] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:32:36] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:32:36] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:32:36] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:32:36] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:32:37] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:32:37] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-28 07:32:37] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-28 07:32:37] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:32:37] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:32:37] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:32:37] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-05-28 07:32:37] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:32:37] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:32:37] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:32:37] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:32:38] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:32:38] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:32:38] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:32:38] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:32:38] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:32:38] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:32:38] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:32:38] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:32:38] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:32:38] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:32:38] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:32:38] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:32:38] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:32:39] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:32:39] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:32:40] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:32:40] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:32:40] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:32:40] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:32:40] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:32:40] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:32:40] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:32:40] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:32:40] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:32:40] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:32:40] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:32:41] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-28 07:32:41] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:32:41] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:32:41] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:32:41] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:32:41] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:32:41] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:32:41] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 8/98 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:32:42] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:32:44] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:32:44] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:32:44] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:32:44] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:32:45] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:32:45] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:32:45] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 10 (OVERLAPS) 210/424 variables, 214/320 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:32:47] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:32:47] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:32:47] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:32:47] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:32:48] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:32:48] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:32:48] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-28 07:32:48] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:32:48] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:32:48] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:32:48] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:32:48] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:32:48] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:32:49] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:32:49] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:32:49] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:32:49] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 17/337 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:32:50] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:32:50] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:32:50] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:32:50] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:32:52] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:32:52] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:32:53] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:32:53] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:32:53] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:32:53] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:32:53] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:32:53] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:32:53] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:32:53] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:32:53] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2024-05-28 07:32:53] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 0 ms to minimize.
[2024-05-28 07:32:53] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:32:53] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:32:53] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:32:53] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:32:53] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:32:54] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:32:54] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:32:54] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:32:54] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
[2024-05-28 07:32:54] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:32:55] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:32:55] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:32:55] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:32:55] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:32:55] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:32:55] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:32:55] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:32:55] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:32:55] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:32:55] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 12/373 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:32:56] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:32:57] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:32:57] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 3/376 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:33:00] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
[2024-05-28 07:33:00] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/424 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:33:00] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:33:01] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:33:01] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:33:01] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:33:01] [INFO ] Deduced a trap composed of 29 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:33:01] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/424 variables, 6/384 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:33:02] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 2 ms to minimize.
[2024-05-28 07:33:02] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:33:02] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:33:02] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:33:03] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:33:03] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:33:03] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 18 (INCLUDED_ONLY) 0/424 variables, 7/391 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 424/424 variables, and 391 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 140/140 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 140/177 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/424 variables, 214/391 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 209/600 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:33:08] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:33:08] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-28 07:33:09] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-28 07:33:09] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:33:09] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:33:09] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:33:09] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:33:10] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:33:10] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 9/609 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:33:15] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-05-28 07:33:15] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-28 07:33:15] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-28 07:33:15] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 2 ms to minimize.
[2024-05-28 07:33:15] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:33:15] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:33:16] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:33:16] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:33:16] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:33:17] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 10/619 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:33:22] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-05-28 07:33:23] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:33:23] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:33:23] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 4/623 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:33:30] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:33:31] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:33:31] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:33:32] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:33:32] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:33:32] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:33:32] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:33:32] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/424 variables, and 631 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 171/171 constraints]
After SMT, in 60081ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 60087ms
Starting structural reductions in LTL mode, iteration 1 : 214/221 places, 210/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60340 ms. Remains : 214/221 places, 210/217 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-004B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004B-LTLCardinality-03 finished in 60502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 217/217 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 220 transition count 197
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 201 transition count 197
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 38 place count 201 transition count 175
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 82 place count 179 transition count 175
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 89 place count 172 transition count 168
Iterating global reduction 2 with 7 rules applied. Total rules applied 96 place count 172 transition count 168
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 96 place count 172 transition count 165
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 102 place count 169 transition count 165
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 230 place count 105 transition count 101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 232 place count 103 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 233 place count 102 transition count 99
Applied a total of 233 rules in 63 ms. Remains 102 /221 variables (removed 119) and now considering 99/217 (removed 118) transitions.
// Phase 1: matrix 99 rows 102 cols
[2024-05-28 07:33:34] [INFO ] Computed 36 invariants in 0 ms
[2024-05-28 07:33:34] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-28 07:33:34] [INFO ] Invariant cache hit.
[2024-05-28 07:33:34] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2024-05-28 07:33:34] [INFO ] Redundant transitions in 23 ms returned [98]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 95 sub problems to find dead transitions.
// Phase 1: matrix 98 rows 102 cols
[2024-05-28 07:33:34] [INFO ] Computed 36 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:33:35] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 07:33:35] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 07:33:35] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-28 07:33:35] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 0 ms to minimize.
[2024-05-28 07:33:35] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-28 07:33:35] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:33:35] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:33:35] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:33:35] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 9/35 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 2/102 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:33:36] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:33:36] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:33:36] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:33:36] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:33:36] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:33:36] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:33:36] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 98/200 variables, 102/154 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:33:37] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:33:37] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-05-28 07:33:37] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:33:37] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:33:37] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:33:37] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2024-05-28 07:33:37] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:33:37] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 8/162 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:33:37] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-28 07:33:37] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:33:37] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-28 07:33:37] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:33:37] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:33:37] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 6/168 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:33:38] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:33:38] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:33:38] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:33:38] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 13 (OVERLAPS) 0/200 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 172 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4821 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 24/50 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:33:39] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:33:39] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 2/102 variables, 10/62 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 98/200 variables, 102/174 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 95/269 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:33:40] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:33:42] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:33:43] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 13 (OVERLAPS) 0/200 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 272 constraints, problems are : Problem set: 0 solved, 95 unsolved in 7298 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 39/39 constraints]
After SMT, in 12137ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 12140ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/221 places, 98/217 transitions.
Applied a total of 0 rules in 7 ms. Remains 102 /102 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12377 ms. Remains : 102/221 places, 98/217 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLCardinality-04
Stuttering criterion allowed to conclude after 249 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-004B-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004B-LTLCardinality-04 finished in 12432 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 217/217 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 220 transition count 195
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 199 transition count 195
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 42 place count 199 transition count 174
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 84 place count 178 transition count 174
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 91 place count 171 transition count 167
Iterating global reduction 2 with 7 rules applied. Total rules applied 98 place count 171 transition count 167
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 98 place count 171 transition count 164
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 104 place count 168 transition count 164
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 230 place count 105 transition count 101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 232 place count 103 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 233 place count 102 transition count 99
Applied a total of 233 rules in 26 ms. Remains 102 /221 variables (removed 119) and now considering 99/217 (removed 118) transitions.
// Phase 1: matrix 99 rows 102 cols
[2024-05-28 07:33:47] [INFO ] Computed 36 invariants in 1 ms
[2024-05-28 07:33:47] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-28 07:33:47] [INFO ] Invariant cache hit.
[2024-05-28 07:33:47] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-28 07:33:47] [INFO ] Redundant transitions in 18 ms returned [98]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 96 sub problems to find dead transitions.
// Phase 1: matrix 98 rows 102 cols
[2024-05-28 07:33:47] [INFO ] Computed 36 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:33:47] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:33:47] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 07:33:47] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:33:47] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:33:47] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-28 07:33:47] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-28 07:33:47] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:33:48] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:33:48] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (OVERLAPS) 1/102 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:33:48] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:33:48] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:33:48] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:33:49] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-28 07:33:49] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 98/200 variables, 102/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:33:49] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-05-28 07:33:49] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:33:49] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:33:49] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:33:49] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:33:50] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:33:50] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 7/159 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:33:50] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:33:51] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/200 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:33:52] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:33:52] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:33:52] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/200 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/200 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 16 (OVERLAPS) 0/200 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 164 constraints, problems are : Problem set: 0 solved, 96 unsolved in 5902 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 25/55 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 98/200 variables, 102/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 96/260 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:33:54] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:33:54] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:33:54] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/200 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 263 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3792 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 29/29 constraints]
After SMT, in 9710ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 9711ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/221 places, 98/217 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9905 ms. Remains : 102/221 places, 98/217 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLCardinality-06
Product exploration explored 100000 steps with 1441 reset in 237 ms.
Product exploration explored 100000 steps with 1316 reset in 311 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 177 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 180 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-28 07:33:58] [INFO ] Invariant cache hit.
[2024-05-28 07:33:58] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-28 07:33:58] [INFO ] Invariant cache hit.
[2024-05-28 07:33:58] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-28 07:33:58] [INFO ] Redundant transitions in 17 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-28 07:33:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:33:58] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:33:58] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-05-28 07:33:58] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:33:58] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:33:58] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:33:58] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:33:59] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:33:59] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:33:59] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (OVERLAPS) 1/102 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:33:59] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:33:59] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:33:59] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:34:00] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:34:00] [INFO ] Deduced a trap composed of 8 places in 14 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 98/200 variables, 102/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:34:00] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-28 07:34:00] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:34:00] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:34:00] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:34:00] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:34:01] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:34:01] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 7/159 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:34:01] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:34:02] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/200 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:34:03] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:34:03] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 07:34:03] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/200 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/200 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 16 (OVERLAPS) 0/200 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 164 constraints, problems are : Problem set: 0 solved, 96 unsolved in 5786 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 25/55 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 98/200 variables, 102/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 96/260 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:34:05] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:34:05] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:34:06] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:34:08] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:34:12] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/200 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:34:14] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:34:17] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:34:19] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/200 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/200 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:34:27] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/200 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 200/200 variables, and 269 constraints, problems are : Problem set: 0 solved, 96 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 35/35 constraints]
After SMT, in 35809ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 35810ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35973 ms. Remains : 102/102 places, 98/98 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 155 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 10 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1367 reset in 199 ms.
Product exploration explored 100000 steps with 1395 reset in 212 ms.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-28 07:34:35] [INFO ] Invariant cache hit.
[2024-05-28 07:34:35] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-28 07:34:35] [INFO ] Invariant cache hit.
[2024-05-28 07:34:35] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2024-05-28 07:34:35] [INFO ] Redundant transitions in 17 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-28 07:34:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:34:35] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:34:35] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 07:34:35] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:34:35] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:34:35] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
[2024-05-28 07:34:35] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-28 07:34:36] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:34:36] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:34:36] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (OVERLAPS) 1/102 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:34:36] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:34:36] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:34:36] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:34:37] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-28 07:34:37] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 98/200 variables, 102/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:34:37] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 07:34:37] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-28 07:34:37] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-28 07:34:37] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:34:37] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:34:38] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:34:38] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 7/159 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:34:38] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:34:39] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/200 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:34:40] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 3 ms to minimize.
[2024-05-28 07:34:40] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:34:40] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/200 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/200 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 16 (OVERLAPS) 0/200 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 164 constraints, problems are : Problem set: 0 solved, 96 unsolved in 5896 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 25/55 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 98/200 variables, 102/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 96/260 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:34:42] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:34:42] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:34:43] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:34:45] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:34:49] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/200 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:34:51] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:34:54] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:34:56] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/200 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/200 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:35:04] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/200 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 200/200 variables, and 269 constraints, problems are : Problem set: 0 solved, 96 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 35/35 constraints]
After SMT, in 35923ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 35924ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 36088 ms. Remains : 102/102 places, 98/98 transitions.
Treatment of property ShieldIIPs-PT-004B-LTLCardinality-06 finished in 84249 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 217/217 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 220 transition count 195
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 199 transition count 195
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 42 place count 199 transition count 174
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 84 place count 178 transition count 174
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 90 place count 172 transition count 168
Iterating global reduction 2 with 6 rules applied. Total rules applied 96 place count 172 transition count 168
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 96 place count 172 transition count 165
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 102 place count 169 transition count 165
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 230 place count 105 transition count 101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 232 place count 103 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 233 place count 102 transition count 99
Applied a total of 233 rules in 22 ms. Remains 102 /221 variables (removed 119) and now considering 99/217 (removed 118) transitions.
// Phase 1: matrix 99 rows 102 cols
[2024-05-28 07:35:11] [INFO ] Computed 36 invariants in 2 ms
[2024-05-28 07:35:11] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-28 07:35:11] [INFO ] Invariant cache hit.
[2024-05-28 07:35:11] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-05-28 07:35:11] [INFO ] Redundant transitions in 16 ms returned [98]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 97 sub problems to find dead transitions.
// Phase 1: matrix 98 rows 102 cols
[2024-05-28 07:35:11] [INFO ] Computed 36 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:35:11] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:35:11] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:35:11] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:35:11] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:35:12] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:35:12] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:35:12] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:35:12] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-28 07:35:12] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 98/200 variables, 102/147 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:35:12] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 148 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2360 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 98/200 variables, 102/148 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 97/245 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:35:14] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:35:15] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:35:15] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:35:16] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:35:17] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/200 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 250 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5270 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 15/15 constraints]
After SMT, in 7645ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 7648ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/221 places, 98/217 transitions.
Applied a total of 0 rules in 7 ms. Remains 102 /102 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7831 ms. Remains : 102/221 places, 98/217 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLCardinality-07
Product exploration explored 100000 steps with 1924 reset in 254 ms.
Product exploration explored 100000 steps with 1964 reset in 284 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 84 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 1089 steps (1 resets) in 7 ms. (136 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 134 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 98/98 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-28 07:35:20] [INFO ] Invariant cache hit.
[2024-05-28 07:35:20] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-28 07:35:20] [INFO ] Invariant cache hit.
[2024-05-28 07:35:20] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-05-28 07:35:20] [INFO ] Redundant transitions in 15 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-28 07:35:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:35:20] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:35:20] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:35:20] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:35:21] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:35:21] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:35:21] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:35:21] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:35:21] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:35:21] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 98/200 variables, 102/147 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:35:21] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:35:21] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:35:22] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 150 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2441 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 98/200 variables, 102/150 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 97/247 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 247 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2138 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 12/12 constraints]
After SMT, in 4596ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 4597ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4744 ms. Remains : 102/102 places, 98/98 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 3114 steps (12 resets) in 14 ms. (207 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 137 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1966 reset in 189 ms.
Product exploration explored 100000 steps with 1976 reset in 204 ms.
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 98/98 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-28 07:35:26] [INFO ] Invariant cache hit.
[2024-05-28 07:35:26] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-28 07:35:26] [INFO ] Invariant cache hit.
[2024-05-28 07:35:26] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-28 07:35:26] [INFO ] Redundant transitions in 25 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-28 07:35:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:35:26] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:35:26] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:35:26] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:35:26] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:35:26] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:35:27] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-28 07:35:27] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:35:27] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:35:27] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 98/200 variables, 102/147 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-28 07:35:27] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 07:35:27] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 07:35:27] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 150 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2395 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 98/200 variables, 102/150 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 97/247 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 247 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2260 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 12/12 constraints]
After SMT, in 4679ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 4680ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4845 ms. Remains : 102/102 places, 98/98 transitions.
Treatment of property ShieldIIPs-PT-004B-LTLCardinality-07 finished in 19820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((G(p0) U p1))&&((p1 U X(p3))||p2))))'
Support contains 5 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 217/217 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 216 transition count 212
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 216 transition count 212
Applied a total of 10 rules in 5 ms. Remains 216 /221 variables (removed 5) and now considering 212/217 (removed 5) transitions.
// Phase 1: matrix 212 rows 216 cols
[2024-05-28 07:35:31] [INFO ] Computed 37 invariants in 2 ms
[2024-05-28 07:35:31] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-28 07:35:31] [INFO ] Invariant cache hit.
[2024-05-28 07:35:31] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2024-05-28 07:35:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:35:32] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 0 ms to minimize.
[2024-05-28 07:35:33] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:35:33] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 2 ms to minimize.
[2024-05-28 07:35:33] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-05-28 07:35:33] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:35:33] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:35:33] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-28 07:35:33] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 2 ms to minimize.
[2024-05-28 07:35:33] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:35:33] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:35:33] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:35:33] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:35:33] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:35:33] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-05-28 07:35:33] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:35:33] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:35:33] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:35:34] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:35:34] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:35:34] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:35:34] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:35:34] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-28 07:35:34] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:35:34] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:35:34] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-28 07:35:34] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:35:34] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:35:34] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:35:34] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:35:35] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:35:35] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:35:35] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:35:35] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:35:35] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:35:35] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:35:35] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:35:35] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:35:35] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:35:35] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:35:35] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:35:36] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:35:36] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:35:36] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:35:36] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:35:36] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:35:36] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:35:36] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:35:37] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2024-05-28 07:35:37] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:35:37] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-28 07:35:37] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-05-28 07:35:37] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:35:37] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:35:37] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:35:38] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:35:39] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:35:39] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:35:40] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 2 ms to minimize.
[2024-05-28 07:35:40] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:35:41] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-28 07:35:41] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:35:41] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:35:41] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:35:41] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 4 ms to minimize.
[2024-05-28 07:35:41] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 0 ms to minimize.
[2024-05-28 07:35:41] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:35:42] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:35:42] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 7/105 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:35:43] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:35:43] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:35:44] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:35:45] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2024-05-28 07:35:45] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:35:45] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:35:45] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-28 07:35:46] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:35:46] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-28 07:35:46] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:35:46] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:35:46] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:35:47] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:35:47] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:35:48] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:35:49] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:35:49] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:35:49] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/216 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/216 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 16 (OVERLAPS) 212/428 variables, 216/339 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:35:52] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:35:52] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:35:52] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:35:52] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:35:52] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:35:52] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:35:52] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:35:53] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:35:53] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:35:53] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:35:53] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:35:53] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:35:53] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:35:53] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:35:53] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/428 variables, 15/354 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:35:54] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:35:54] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:35:54] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:35:54] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:35:54] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:35:55] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:35:55] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 0 ms to minimize.
[2024-05-28 07:35:55] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:35:55] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:35:55] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-05-28 07:35:55] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:35:55] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/428 variables, 12/366 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:35:57] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-28 07:35:57] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:35:57] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-05-28 07:35:57] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:35:57] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:35:57] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 07:35:57] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:35:58] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:35:58] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2024-05-28 07:35:58] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:35:58] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:35:58] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:35:58] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:35:58] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:35:58] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:35:58] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:35:58] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:35:58] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:35:58] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:35:58] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/428 variables, 20/386 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:35:59] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:35:59] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
[2024-05-28 07:35:59] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:35:59] [INFO ] Deduced a trap composed of 68 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:35:59] [INFO ] Deduced a trap composed of 54 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:35:59] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:35:59] [INFO ] Deduced a trap composed of 62 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:35:59] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:35:59] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-05-28 07:36:00] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:36:00] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:36:00] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:36:00] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:36:00] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:36:00] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:36:00] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:36:00] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:36:00] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/428 variables, 18/404 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/428 variables, and 404 constraints, problems are : Problem set: 0 solved, 211 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 151/151 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 151/188 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:36:02] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:36:02] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:36:02] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:36:02] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:36:03] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:36:03] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:36:03] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:36:03] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:36:03] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 9/197 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 212/428 variables, 216/413 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 211/624 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:36:07] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-05-28 07:36:07] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:36:07] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:36:07] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:36:08] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:36:08] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 6/630 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:36:15] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:36:15] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-28 07:36:16] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-28 07:36:16] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-28 07:36:17] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:36:17] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-28 07:36:17] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2024-05-28 07:36:17] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 2 ms to minimize.
[2024-05-28 07:36:17] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:36:17] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:36:18] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 11/641 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-05-28 07:36:25] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:36:25] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:36:26] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:36:27] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:36:27] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:36:27] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:36:27] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 7/648 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/428 variables, and 648 constraints, problems are : Problem set: 0 solved, 211 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 184/184 constraints]
After SMT, in 60048ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 60050ms
Starting structural reductions in LTL mode, iteration 1 : 216/221 places, 212/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60245 ms. Remains : 216/221 places, 212/217 transitions.
Stuttering acceptance computed with spot in 559 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 114 ms.
Product exploration explored 100000 steps with 50000 reset in 119 ms.
Computed a total of 48 stabilizing places and 48 stable transitions
Computed a total of 48 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0) p3), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X p1), (X (NOT (AND p2 p1 (NOT p3)))), (X p3), (X (NOT (AND p2 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 p0 (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND p2 p1 (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (OR (AND p2 (NOT p1) (NOT p3)) (AND (NOT p1) p0 (NOT p3)))))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 29 factoid took 21 ms. Reduced automaton from 11 states, 45 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-004B-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-004B-LTLCardinality-08 finished in 61084 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 217/217 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 220 transition count 195
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 199 transition count 195
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 42 place count 199 transition count 174
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 84 place count 178 transition count 174
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 91 place count 171 transition count 167
Iterating global reduction 2 with 7 rules applied. Total rules applied 98 place count 171 transition count 167
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 98 place count 171 transition count 164
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 104 place count 168 transition count 164
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 234 place count 103 transition count 99
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 236 place count 101 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 237 place count 100 transition count 97
Applied a total of 237 rules in 25 ms. Remains 100 /221 variables (removed 121) and now considering 97/217 (removed 120) transitions.
// Phase 1: matrix 97 rows 100 cols
[2024-05-28 07:36:32] [INFO ] Computed 36 invariants in 1 ms
[2024-05-28 07:36:32] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-28 07:36:32] [INFO ] Invariant cache hit.
[2024-05-28 07:36:32] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2024-05-28 07:36:32] [INFO ] Redundant transitions in 23 ms returned [96]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 95 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 100 cols
[2024-05-28 07:36:32] [INFO ] Computed 36 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:36:32] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:36:32] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:36:32] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:36:32] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:36:32] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:36:32] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:36:32] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-28 07:36:33] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:36:33] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-28 07:36:33] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:36:33] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:36:33] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 96/196 variables, 100/148 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:36:33] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:36:33] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 1 ms to minimize.
[2024-05-28 07:36:33] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:36:34] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 4/152 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:36:34] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 07:36:34] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:36:34] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:36:34] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:36:35] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:36:35] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:36:35] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:36:35] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/196 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/196 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 160 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4553 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 96/196 variables, 100/160 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 95/255 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-28 07:36:37] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:36:37] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 257 constraints, problems are : Problem set: 0 solved, 95 unsolved in 3243 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 26/26 constraints]
After SMT, in 7811ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 7812ms
Starting structural reductions in SI_LTL mode, iteration 1 : 100/221 places, 96/217 transitions.
Applied a total of 0 rules in 7 ms. Remains 100 /100 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8021 ms. Remains : 100/221 places, 96/217 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLCardinality-09
Stuttering criterion allowed to conclude after 198 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-004B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004B-LTLCardinality-09 finished in 8065 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 217/217 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 215 transition count 211
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 215 transition count 211
Applied a total of 12 rules in 7 ms. Remains 215 /221 variables (removed 6) and now considering 211/217 (removed 6) transitions.
// Phase 1: matrix 211 rows 215 cols
[2024-05-28 07:36:40] [INFO ] Computed 37 invariants in 2 ms
[2024-05-28 07:36:40] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-28 07:36:40] [INFO ] Invariant cache hit.
[2024-05-28 07:36:40] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2024-05-28 07:36:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:36:42] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:36:42] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:36:42] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 2 ms to minimize.
[2024-05-28 07:36:42] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-28 07:36:42] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:36:42] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:36:42] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:36:42] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:36:42] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:36:42] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-28 07:36:42] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:36:42] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:36:43] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:36:43] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:36:43] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:36:43] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-05-28 07:36:43] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-05-28 07:36:43] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 07:36:43] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 2 ms to minimize.
[2024-05-28 07:36:43] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:36:43] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:36:43] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:36:43] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:36:43] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:36:43] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:36:44] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:36:44] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:36:44] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-28 07:36:44] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-28 07:36:44] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-28 07:36:44] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:36:44] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-28 07:36:44] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 2 ms to minimize.
[2024-05-28 07:36:44] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 2 ms to minimize.
[2024-05-28 07:36:44] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-28 07:36:44] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:36:44] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:36:44] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:36:44] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:36:44] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:36:45] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:36:45] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-28 07:36:45] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:36:46] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-28 07:36:46] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:36:46] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:36:46] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:36:46] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:36:46] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:36:46] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:36:46] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 0 ms to minimize.
[2024-05-28 07:36:46] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:36:46] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:36:46] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:36:46] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:36:46] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:36:46] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:36:46] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:36:46] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:36:46] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:36:47] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:36:47] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:36:47] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:36:47] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:36:47] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:36:47] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:36:47] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:36:47] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 8/105 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:36:48] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-28 07:36:48] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:36:48] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:36:48] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:36:48] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 5/110 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:36:50] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:36:51] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:36:51] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:36:51] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:36:51] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:36:51] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:36:52] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:36:52] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 7/118 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:36:52] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:36:52] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:36:53] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:36:53] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:36:53] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:36:53] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 6/124 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:36:54] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:36:54] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:36:54] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:36:54] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:36:55] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:36:55] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 6/130 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:36:55] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 13 (OVERLAPS) 211/426 variables, 215/346 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:36:58] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:36:58] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:36:58] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:36:58] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:36:58] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:36:59] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:36:59] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:36:59] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 8/354 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:37:00] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:37:00] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:37:00] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:37:00] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:37:00] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:37:00] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:37:00] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:37:00] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:37:00] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2024-05-28 07:37:00] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:37:00] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:37:00] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:37:01] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 13/367 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:37:03] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:37:03] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:37:03] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:37:03] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:37:03] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-28 07:37:03] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:37:03] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:37:03] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:37:03] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:37:03] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:37:03] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:37:03] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:37:04] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:37:04] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:37:04] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:37:04] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:37:04] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:37:04] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 0 ms to minimize.
[2024-05-28 07:37:04] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 19/386 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:37:05] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:37:06] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:37:06] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 3/389 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:37:06] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-28 07:37:07] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/426 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:37:09] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-05-28 07:37:09] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:37:10] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:37:10] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:37:10] [INFO ] Deduced a trap composed of 32 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:37:10] [INFO ] Deduced a trap composed of 31 places in 22 ms of which 1 ms to minimize.
[2024-05-28 07:37:10] [INFO ] Deduced a trap composed of 23 places in 19 ms of which 1 ms to minimize.
[2024-05-28 07:37:10] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:37:10] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:37:10] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/426 variables, and 401 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 149/149 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 149/186 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:37:11] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:37:11] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:37:12] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:37:12] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 4/190 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (OVERLAPS) 211/426 variables, 215/405 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 210/615 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:37:16] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:37:17] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:37:17] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:37:17] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:37:17] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:37:17] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:37:18] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:37:18] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:37:18] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:37:18] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 10/625 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-28 07:37:29] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:37:30] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-28 07:37:30] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:37:33] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-28 07:37:33] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2024-05-28 07:37:33] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:37:33] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:37:34] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2024-05-28 07:37:34] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:37:34] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:37:34] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 11/636 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 636 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 174/174 constraints]
After SMT, in 60043ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 60046ms
Starting structural reductions in LTL mode, iteration 1 : 215/221 places, 211/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60281 ms. Remains : 215/221 places, 211/217 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 91 ms.
Product exploration explored 100000 steps with 50000 reset in 92 ms.
Computed a total of 47 stabilizing places and 47 stable transitions
Computed a total of 47 stabilizing places and 47 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-004B-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-004B-LTLCardinality-11 finished in 60588 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 217/217 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 220 transition count 196
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 200 transition count 196
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 40 place count 200 transition count 175
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 82 place count 179 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 87 place count 174 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 92 place count 174 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 92 place count 174 transition count 169
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 173 transition count 169
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 230 place count 105 transition count 101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 232 place count 103 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 233 place count 102 transition count 99
Applied a total of 233 rules in 21 ms. Remains 102 /221 variables (removed 119) and now considering 99/217 (removed 118) transitions.
// Phase 1: matrix 99 rows 102 cols
[2024-05-28 07:37:40] [INFO ] Computed 36 invariants in 0 ms
[2024-05-28 07:37:41] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-28 07:37:41] [INFO ] Invariant cache hit.
[2024-05-28 07:37:41] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-05-28 07:37:41] [INFO ] Redundant transitions in 17 ms returned [98]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 96 sub problems to find dead transitions.
// Phase 1: matrix 98 rows 102 cols
[2024-05-28 07:37:41] [INFO ] Computed 36 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:37:41] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:37:41] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-28 07:37:41] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-28 07:37:41] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-28 07:37:41] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:37:41] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:37:41] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:37:41] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
[2024-05-28 07:37:41] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:37:41] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:37:41] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:37:41] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 1/102 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:37:42] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:37:42] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-28 07:37:42] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:37:42] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:37:42] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:37:42] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:37:42] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:37:42] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 98/200 variables, 102/158 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:37:43] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:37:43] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-28 07:37:43] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:37:44] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:37:45] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/200 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 14 (OVERLAPS) 0/200 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 163 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4993 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (OVERLAPS) 98/200 variables, 102/163 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 96/259 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:37:47] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 0/200 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 260 constraints, problems are : Problem set: 0 solved, 96 unsolved in 10167 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 26/26 constraints]
After SMT, in 15174ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 15175ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/221 places, 98/217 transitions.
Applied a total of 0 rules in 7 ms. Remains 102 /102 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15391 ms. Remains : 102/221 places, 98/217 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLCardinality-12
Product exploration explored 100000 steps with 417 reset in 200 ms.
Product exploration explored 100000 steps with 420 reset in 217 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 161 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 13 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 181 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-28 07:37:57] [INFO ] Invariant cache hit.
[2024-05-28 07:37:57] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-28 07:37:57] [INFO ] Invariant cache hit.
[2024-05-28 07:37:57] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-28 07:37:57] [INFO ] Redundant transitions in 16 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-28 07:37:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:37:57] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:37:57] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-05-28 07:37:57] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-28 07:37:57] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-28 07:37:57] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:37:57] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:37:58] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:37:58] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:37:58] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:37:58] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:37:58] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:37:58] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 1/102 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:37:58] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:37:58] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-28 07:37:58] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-28 07:37:59] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:37:59] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:37:59] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:37:59] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:37:59] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-28 07:37:59] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 98/200 variables, 102/159 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:37:59] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:37:59] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 1 ms to minimize.
[2024-05-28 07:37:59] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-28 07:37:59] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-28 07:37:59] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 5/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/200 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 164 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3523 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 26/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (OVERLAPS) 98/200 variables, 102/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 96/260 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:38:01] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:38:02] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/200 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 262 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3970 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 28/28 constraints]
After SMT, in 7508ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 7510ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7672 ms. Remains : 102/102 places, 98/98 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 261 steps (1 resets) in 5 ms. (43 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 181 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 413 reset in 204 ms.
Product exploration explored 100000 steps with 420 reset in 223 ms.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-28 07:38:05] [INFO ] Invariant cache hit.
[2024-05-28 07:38:06] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-28 07:38:06] [INFO ] Invariant cache hit.
[2024-05-28 07:38:06] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2024-05-28 07:38:06] [INFO ] Redundant transitions in 15 ms returned []
Running 96 sub problems to find dead transitions.
[2024-05-28 07:38:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:38:06] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:38:06] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 07:38:06] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 07:38:06] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-05-28 07:38:06] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:38:06] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:38:06] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:38:06] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:38:06] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:38:06] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:38:06] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:38:06] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 1/102 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:38:07] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:38:07] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:38:07] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:38:07] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:38:07] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:38:07] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:38:07] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:38:07] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:38:07] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 98/200 variables, 102/159 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:38:08] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:38:08] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:38:08] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:38:08] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:38:08] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 5/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/200 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 164 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3568 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 26/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (OVERLAPS) 98/200 variables, 102/164 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 96/260 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:38:10] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-28 07:38:11] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/200 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 262 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4189 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 28/28 constraints]
After SMT, in 7773ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 7774ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7935 ms. Remains : 102/102 places, 98/98 transitions.
Treatment of property ShieldIIPs-PT-004B-LTLCardinality-12 finished in 32942 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 217/217 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 214 transition count 210
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 214 transition count 210
Applied a total of 14 rules in 7 ms. Remains 214 /221 variables (removed 7) and now considering 210/217 (removed 7) transitions.
// Phase 1: matrix 210 rows 214 cols
[2024-05-28 07:38:13] [INFO ] Computed 37 invariants in 1 ms
[2024-05-28 07:38:14] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-28 07:38:14] [INFO ] Invariant cache hit.
[2024-05-28 07:38:14] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2024-05-28 07:38:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:38:15] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:38:15] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:38:15] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:38:16] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:38:16] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:38:16] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:38:16] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:38:16] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-28 07:38:16] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-28 07:38:16] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:38:16] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:38:16] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 2 ms to minimize.
[2024-05-28 07:38:16] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:38:16] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:38:16] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:38:16] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:38:16] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:38:16] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-28 07:38:16] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
[2024-05-28 07:38:16] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:38:17] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:38:17] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:38:17] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-05-28 07:38:17] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-28 07:38:17] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:38:17] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-28 07:38:17] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:38:17] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:38:17] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:38:17] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:38:17] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:38:18] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:38:18] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:38:18] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:38:18] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2024-05-28 07:38:18] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:38:18] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:38:18] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:38:18] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:38:18] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:38:19] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:38:19] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:38:19] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:38:19] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:38:20] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:38:20] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:38:20] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:38:20] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:38:20] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:38:20] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:38:20] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:38:20] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:38:20] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:38:21] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-28 07:38:21] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:38:21] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:38:21] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-28 07:38:21] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:38:21] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:38:21] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:38:21] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 8/98 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:38:22] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:38:24] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:38:24] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:38:24] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:38:24] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:38:25] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:38:25] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:38:25] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 10 (OVERLAPS) 210/424 variables, 214/320 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:38:27] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:38:27] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:38:27] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:38:27] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:38:27] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:38:28] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:38:28] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:38:28] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:38:28] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:38:28] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:38:28] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:38:28] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:38:28] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:38:28] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:38:28] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:38:29] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:38:29] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 17/337 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:38:30] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:38:30] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:38:30] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:38:30] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:38:32] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-28 07:38:32] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:38:32] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:38:32] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2024-05-28 07:38:33] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 0 ms to minimize.
[2024-05-28 07:38:33] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:38:33] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:38:33] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:38:33] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:38:33] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:38:33] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-05-28 07:38:33] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:38:33] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:38:33] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:38:33] [INFO ] Deduced a trap composed of 33 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:38:33] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:38:33] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:38:33] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:38:33] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:38:33] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:38:34] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:38:34] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:38:34] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:38:34] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:38:34] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:38:34] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:38:35] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:38:35] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:38:35] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:38:35] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:38:35] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:38:35] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 12/373 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:38:36] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:38:36] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:38:37] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 3/376 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:38:39] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:38:39] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/424 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:38:40] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:38:40] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 0 ms to minimize.
[2024-05-28 07:38:41] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:38:41] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:38:41] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:38:41] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/424 variables, 6/384 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:38:42] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:38:42] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:38:42] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:38:42] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:38:42] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:38:43] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:38:43] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
(s207 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.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 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 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.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 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.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 1.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 18 (INCLUDED_ONLY) 0/424 variables, 7/391 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 424/424 variables, and 391 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 140/140 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 140/177 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/424 variables, 214/391 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 209/600 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:38:47] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:38:48] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-05-28 07:38:48] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:38:48] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:38:49] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:38:49] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2024-05-28 07:38:49] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:38:50] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:38:50] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 9/609 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:38:55] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-05-28 07:38:55] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-28 07:38:55] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-28 07:38:55] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-28 07:38:55] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:38:56] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-28 07:38:56] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:38:56] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:38:57] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-05-28 07:38:57] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 10/619 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:39:03] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:39:03] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-28 07:39:03] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:39:04] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 4/623 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:39:11] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:39:12] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:39:12] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:39:13] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:39:13] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:39:13] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:39:13] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:39:13] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/424 variables, and 631 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 171/171 constraints]
After SMT, in 60049ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 60051ms
Starting structural reductions in LTL mode, iteration 1 : 214/221 places, 210/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60290 ms. Remains : 214/221 places, 210/217 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 87 ms.
Product exploration explored 100000 steps with 50000 reset in 90 ms.
Computed a total of 47 stabilizing places and 47 stable transitions
Computed a total of 47 stabilizing places and 47 stable transitions
Detected a total of 47/214 stabilizing places and 47/210 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-004B-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-004B-LTLCardinality-13 finished in 60642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(p0) U p0))))'
Support contains 2 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 217/217 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 214 transition count 210
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 214 transition count 210
Applied a total of 14 rules in 6 ms. Remains 214 /221 variables (removed 7) and now considering 210/217 (removed 7) transitions.
[2024-05-28 07:39:14] [INFO ] Invariant cache hit.
[2024-05-28 07:39:14] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-28 07:39:14] [INFO ] Invariant cache hit.
[2024-05-28 07:39:14] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2024-05-28 07:39:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:39:16] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:39:16] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:39:16] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-28 07:39:16] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:39:16] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:39:16] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:39:16] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:39:16] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-28 07:39:16] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-28 07:39:16] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
[2024-05-28 07:39:16] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:39:17] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:39:17] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:39:17] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:39:17] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-28 07:39:17] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-28 07:39:17] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:39:17] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:39:17] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:39:17] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:39:17] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-28 07:39:17] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-28 07:39:18] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-28 07:39:18] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:39:18] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:39:18] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:39:18] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:39:18] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:39:18] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:39:18] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:39:18] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:39:18] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:39:18] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:39:18] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:39:18] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:39:18] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:39:18] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:39:18] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:39:18] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:39:18] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:39:19] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:39:20] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:39:20] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:39:20] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:39:20] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:39:20] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:39:20] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:39:20] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:39:20] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:39:20] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:39:20] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:39:20] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:39:20] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:39:21] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2024-05-28 07:39:21] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-28 07:39:21] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:39:21] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:39:21] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:39:21] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:39:22] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:39:22] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 8/98 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:39:23] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:39:24] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-28 07:39:24] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:39:24] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:39:24] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:39:25] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:39:25] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-28 07:39:25] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 10 (OVERLAPS) 210/424 variables, 214/320 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:39:27] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:39:27] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:39:28] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:39:28] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 0 ms to minimize.
[2024-05-28 07:39:28] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2024-05-28 07:39:28] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-05-28 07:39:28] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:39:28] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:39:28] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-28 07:39:28] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:39:28] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:39:29] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:39:29] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:39:29] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:39:29] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:39:29] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:39:29] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 17/337 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:39:30] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-28 07:39:30] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:39:30] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:39:31] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:39:32] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:39:32] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:39:33] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-28 07:39:33] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:39:33] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:39:33] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:39:33] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:39:33] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:39:33] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-28 07:39:33] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:39:33] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:39:33] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:39:33] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:39:33] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:39:33] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:39:34] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-28 07:39:34] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-28 07:39:34] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:39:34] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:39:34] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:39:34] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:39:35] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:39:35] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:39:35] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:39:35] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:39:35] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-28 07:39:35] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:39:35] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:39:35] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:39:35] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:39:35] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-28 07:39:35] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 12/373 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:39:36] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:39:37] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:39:37] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 3/376 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:39:40] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
[2024-05-28 07:39:40] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/424 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:39:40] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:39:41] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-28 07:39:41] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-28 07:39:41] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:39:41] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:39:41] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/424 variables, 6/384 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:39:42] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:39:42] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-28 07:39:42] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:39:43] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-28 07:39:43] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-28 07:39:43] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-28 07:39:43] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/424 variables, 7/391 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 424/424 variables, and 391 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 140/140 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 140/177 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/424 variables, 214/391 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 209/600 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:39:48] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-28 07:39:49] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-28 07:39:49] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-05-28 07:39:49] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-28 07:39:50] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-28 07:39:50] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:39:50] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:39:50] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:39:50] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 9/609 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:39:55] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-05-28 07:39:55] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-05-28 07:39:55] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-28 07:39:55] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-28 07:39:56] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-28 07:39:56] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-28 07:39:56] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 07:39:56] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-28 07:39:57] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:39:57] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 10/619 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:40:03] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:40:03] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:40:04] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-28 07:40:04] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 4/623 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-28 07:40:11] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-28 07:40:12] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-28 07:40:12] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-28 07:40:13] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 07:40:13] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-28 07:40:13] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:40:13] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:40:13] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/424 variables, and 631 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 171/171 constraints]
After SMT, in 60040ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 60042ms
Starting structural reductions in LTL mode, iteration 1 : 214/221 places, 210/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60259 ms. Remains : 214/221 places, 210/217 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 136 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-004B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004B-LTLCardinality-15 finished in 60406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-28 07:40:15] [INFO ] Flatten gal took : 18 ms
[2024-05-28 07:40:15] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-28 07:40:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 221 places, 217 transitions and 674 arcs took 4 ms.
Total runtime 585038 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running ShieldIIPs-PT-004B
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 221
TRANSITIONS: 217
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.000s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 6136
MODEL NAME: /home/mcc/execution/413/model
221 places, 217 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ShieldIIPs-PT-004B-LTLCardinality-06 CANNOT_COMPUTE
FORMULA ShieldIIPs-PT-004B-LTLCardinality-07 CANNOT_COMPUTE
FORMULA ShieldIIPs-PT-004B-LTLCardinality-12 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716883460612
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-004B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldIIPs-PT-004B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683757900059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-004B.tgz
mv ShieldIIPs-PT-004B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;