About the Execution of ITS-Tools for ShieldPPPs-PT-030B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13996.371 | 3600000.00 | 9457840.00 | 4458.70 | TF??FF?FT??TF?FT | 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.r356-tall-171683761200475.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ShieldPPPs-PT-030B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761200475
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 992K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.1K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 19 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 13 11:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 13 11:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 528K 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 ShieldPPPs-PT-030B-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-030B-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716979697152
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-030B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-29 10:48:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 10:48:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 10:48:18] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2024-05-29 10:48:18] [INFO ] Transformed 2043 places.
[2024-05-29 10:48:18] [INFO ] Transformed 1893 transitions.
[2024-05-29 10:48:18] [INFO ] Found NUPN structural information;
[2024-05-29 10:48:18] [INFO ] Parsed PT model containing 2043 places and 1893 transitions and 5226 arcs in 348 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldPPPs-PT-030B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-030B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 2043 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2043/2043 places, 1893/1893 transitions.
Discarding 208 places :
Symmetric choice reduction at 0 with 208 rule applications. Total rules 208 place count 1835 transition count 1685
Iterating global reduction 0 with 208 rules applied. Total rules applied 416 place count 1835 transition count 1685
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 417 place count 1834 transition count 1684
Iterating global reduction 0 with 1 rules applied. Total rules applied 418 place count 1834 transition count 1684
Applied a total of 418 rules in 1159 ms. Remains 1834 /2043 variables (removed 209) and now considering 1684/1893 (removed 209) transitions.
// Phase 1: matrix 1684 rows 1834 cols
[2024-05-29 10:48:20] [INFO ] Computed 331 invariants in 31 ms
[2024-05-29 10:48:20] [INFO ] Implicit Places using invariants in 963 ms returned []
[2024-05-29 10:48:21] [INFO ] Invariant cache hit.
[2024-05-29 10:48:22] [INFO ] Implicit Places using invariants and state equation in 1542 ms returned []
Implicit Place search using SMT with State Equation took 2532 ms to find 0 implicit places.
Running 1683 sub problems to find dead transitions.
[2024-05-29 10:48:22] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1833/3518 variables, and 0 constraints, problems are : Problem set: 0 solved, 1683 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1834 constraints, PredecessorRefiner: 1683/1683 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1683 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1833/3518 variables, and 0 constraints, problems are : Problem set: 0 solved, 1683 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1834 constraints, PredecessorRefiner: 0/1683 constraints, Known Traps: 0/0 constraints]
After SMT, in 60613ms problems are : Problem set: 0 solved, 1683 unsolved
Search for dead transitions found 0 dead transitions in 60686ms
Starting structural reductions in LTL mode, iteration 1 : 1834/2043 places, 1684/1893 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64411 ms. Remains : 1834/2043 places, 1684/1893 transitions.
Support contains 22 out of 1834 places after structural reductions.
[2024-05-29 10:49:23] [INFO ] Flatten gal took : 146 ms
[2024-05-29 10:49:23] [INFO ] Flatten gal took : 80 ms
[2024-05-29 10:49:23] [INFO ] Input system was already deterministic with 1684 transitions.
RANDOM walk for 40000 steps (8 resets) in 1499 ms. (26 steps per ms) remains 1/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 1/1 properties
[2024-05-29 10:49:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/77 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1757/1834 variables, 326/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1834 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1684/3518 variables, 1834/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3518 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3518 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3518/3518 variables, and 2165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 759 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 1834/1834 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/77 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1757/1834 variables, 326/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 10:49:25] [INFO ] Deduced a trap composed of 24 places in 212 ms of which 35 ms to minimize.
[2024-05-29 10:49:25] [INFO ] Deduced a trap composed of 16 places in 182 ms of which 4 ms to minimize.
[2024-05-29 10:49:26] [INFO ] Deduced a trap composed of 22 places in 177 ms of which 3 ms to minimize.
[2024-05-29 10:49:26] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 3 ms to minimize.
[2024-05-29 10:49:26] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 3 ms to minimize.
[2024-05-29 10:49:26] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 3 ms to minimize.
[2024-05-29 10:49:26] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 3 ms to minimize.
[2024-05-29 10:49:26] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 3 ms to minimize.
[2024-05-29 10:49:26] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 2 ms to minimize.
[2024-05-29 10:49:26] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 2 ms to minimize.
[2024-05-29 10:49:27] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2024-05-29 10:49:27] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 2 ms to minimize.
[2024-05-29 10:49:27] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2024-05-29 10:49:27] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 2 ms to minimize.
[2024-05-29 10:49:27] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2024-05-29 10:49:27] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 2 ms to minimize.
[2024-05-29 10:49:27] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 2 ms to minimize.
[2024-05-29 10:49:27] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-05-29 10:49:27] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1834 variables, 19/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1834 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1684/3518 variables, 1834/2184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3518 variables, 1/2185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 10:49:28] [INFO ] Deduced a trap composed of 24 places in 271 ms of which 6 ms to minimize.
[2024-05-29 10:49:28] [INFO ] Deduced a trap composed of 21 places in 302 ms of which 6 ms to minimize.
[2024-05-29 10:49:29] [INFO ] Deduced a trap composed of 65 places in 308 ms of which 6 ms to minimize.
[2024-05-29 10:49:29] [INFO ] Deduced a trap composed of 48 places in 278 ms of which 6 ms to minimize.
[2024-05-29 10:49:29] [INFO ] Deduced a trap composed of 22 places in 285 ms of which 6 ms to minimize.
[2024-05-29 10:49:30] [INFO ] Deduced a trap composed of 26 places in 281 ms of which 5 ms to minimize.
SMT process timed out in 5860ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1834 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1834/1834 places, 1684/1684 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 211 rules applied. Total rules applied 211 place count 1834 transition count 1473
Reduce places removed 211 places and 0 transitions.
Iterating post reduction 1 with 211 rules applied. Total rules applied 422 place count 1623 transition count 1473
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 422 place count 1623 transition count 1323
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 722 place count 1473 transition count 1323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 723 place count 1472 transition count 1322
Iterating global reduction 2 with 1 rules applied. Total rules applied 724 place count 1472 transition count 1322
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 724 place count 1472 transition count 1321
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 726 place count 1471 transition count 1321
Performed 535 Post agglomeration using F-continuation condition.Transition count delta: 535
Deduced a syphon composed of 535 places in 2 ms
Reduce places removed 535 places and 0 transitions.
Iterating global reduction 2 with 1070 rules applied. Total rules applied 1796 place count 936 transition count 786
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 267 times.
Drop transitions (Partial Free agglomeration) removed 267 transitions
Iterating global reduction 2 with 267 rules applied. Total rules applied 2063 place count 936 transition count 786
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2064 place count 935 transition count 785
Applied a total of 2064 rules in 474 ms. Remains 935 /1834 variables (removed 899) and now considering 785/1684 (removed 899) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 474 ms. Remains : 935/1834 places, 785/1684 transitions.
RANDOM walk for 40000 steps (8 resets) in 781 ms. (51 steps per ms) remains 1/1 properties
BEST_FIRST walk for 25611 steps (4 resets) in 158 ms. (161 steps per ms) remains 0/1 properties
Computed a total of 361 stabilizing places and 361 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' '!(G((X(X(p1))||p0)))'
Support contains 4 out of 1834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1834/1834 places, 1684/1684 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1833 transition count 1683
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1833 transition count 1683
Applied a total of 2 rules in 159 ms. Remains 1833 /1834 variables (removed 1) and now considering 1683/1684 (removed 1) transitions.
// Phase 1: matrix 1683 rows 1833 cols
[2024-05-29 10:49:31] [INFO ] Computed 331 invariants in 10 ms
[2024-05-29 10:49:31] [INFO ] Implicit Places using invariants in 578 ms returned []
[2024-05-29 10:49:31] [INFO ] Invariant cache hit.
[2024-05-29 10:49:33] [INFO ] Implicit Places using invariants and state equation in 1627 ms returned []
Implicit Place search using SMT with State Equation took 2211 ms to find 0 implicit places.
Running 1682 sub problems to find dead transitions.
[2024-05-29 10:49:33] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1832/3516 variables, and 0 constraints, problems are : Problem set: 0 solved, 1682 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1833 constraints, PredecessorRefiner: 1682/1682 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1682 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1832/3516 variables, and 0 constraints, problems are : Problem set: 0 solved, 1682 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1833 constraints, PredecessorRefiner: 0/1682 constraints, Known Traps: 0/0 constraints]
After SMT, in 60511ms problems are : Problem set: 0 solved, 1682 unsolved
Search for dead transitions found 0 dead transitions in 60531ms
Starting structural reductions in LTL mode, iteration 1 : 1833/1834 places, 1683/1684 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62906 ms. Remains : 1833/1834 places, 1683/1684 transitions.
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLCardinality-02
Product exploration explored 100000 steps with 388 reset in 645 ms.
Product exploration explored 100000 steps with 256 reset in 743 ms.
Computed a total of 360 stabilizing places and 360 stable transitions
Computed a total of 360 stabilizing places and 360 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
RANDOM walk for 40000 steps (8 resets) in 439 ms. (90 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
[2024-05-29 10:50:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/77 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1756/1833 variables, 326/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1833 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1683/3516 variables, 1833/2164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3516 variables, 0/2164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3516 variables, 0/2164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3516/3516 variables, and 2164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 769 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 1833/1833 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/77 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1756/1833 variables, 326/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 10:50:37] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 3 ms to minimize.
[2024-05-29 10:50:37] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 3 ms to minimize.
[2024-05-29 10:50:37] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 3 ms to minimize.
[2024-05-29 10:50:37] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
[2024-05-29 10:50:38] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 2 ms to minimize.
[2024-05-29 10:50:38] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 3 ms to minimize.
[2024-05-29 10:50:38] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 3 ms to minimize.
[2024-05-29 10:50:38] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 2 ms to minimize.
[2024-05-29 10:50:38] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 4 ms to minimize.
[2024-05-29 10:50:38] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 2 ms to minimize.
[2024-05-29 10:50:38] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 2 ms to minimize.
[2024-05-29 10:50:38] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
[2024-05-29 10:50:38] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-05-29 10:50:38] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 2 ms to minimize.
[2024-05-29 10:50:39] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 2 ms to minimize.
[2024-05-29 10:50:39] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2024-05-29 10:50:39] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2024-05-29 10:50:39] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-05-29 10:50:39] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1833 variables, 19/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1833 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1683/3516 variables, 1833/2183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3516 variables, 1/2184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 10:50:40] [INFO ] Deduced a trap composed of 22 places in 289 ms of which 6 ms to minimize.
[2024-05-29 10:50:40] [INFO ] Deduced a trap composed of 42 places in 256 ms of which 5 ms to minimize.
[2024-05-29 10:50:40] [INFO ] Deduced a trap composed of 27 places in 256 ms of which 5 ms to minimize.
[2024-05-29 10:50:40] [INFO ] Deduced a trap composed of 37 places in 230 ms of which 9 ms to minimize.
[2024-05-29 10:50:41] [INFO ] Deduced a trap composed of 33 places in 223 ms of which 4 ms to minimize.
[2024-05-29 10:50:41] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 4 ms to minimize.
[2024-05-29 10:50:41] [INFO ] Deduced a trap composed of 56 places in 210 ms of which 5 ms to minimize.
[2024-05-29 10:50:42] [INFO ] Deduced a trap composed of 56 places in 220 ms of which 4 ms to minimize.
SMT process timed out in 5816ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1833 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1833/1833 places, 1683/1683 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 211 rules applied. Total rules applied 211 place count 1833 transition count 1472
Reduce places removed 211 places and 0 transitions.
Iterating post reduction 1 with 211 rules applied. Total rules applied 422 place count 1622 transition count 1472
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 422 place count 1622 transition count 1322
Deduced a syphon composed of 150 places in 3 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 722 place count 1472 transition count 1322
Performed 536 Post agglomeration using F-continuation condition.Transition count delta: 536
Deduced a syphon composed of 536 places in 0 ms
Reduce places removed 536 places and 0 transitions.
Iterating global reduction 2 with 1072 rules applied. Total rules applied 1794 place count 936 transition count 786
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 267 times.
Drop transitions (Partial Free agglomeration) removed 267 transitions
Iterating global reduction 2 with 267 rules applied. Total rules applied 2061 place count 936 transition count 786
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2062 place count 935 transition count 785
Applied a total of 2062 rules in 231 ms. Remains 935 /1833 variables (removed 898) and now considering 785/1683 (removed 898) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 231 ms. Remains : 935/1833 places, 785/1683 transitions.
RANDOM walk for 40000 steps (8 resets) in 538 ms. (74 steps per ms) remains 1/1 properties
BEST_FIRST walk for 36156 steps (7 resets) in 212 ms. (169 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 4 out of 1833 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1833/1833 places, 1683/1683 transitions.
Applied a total of 0 rules in 53 ms. Remains 1833 /1833 variables (removed 0) and now considering 1683/1683 (removed 0) transitions.
[2024-05-29 10:50:42] [INFO ] Invariant cache hit.
[2024-05-29 10:50:43] [INFO ] Implicit Places using invariants in 562 ms returned []
[2024-05-29 10:50:43] [INFO ] Invariant cache hit.
[2024-05-29 10:50:45] [INFO ] Implicit Places using invariants and state equation in 1561 ms returned []
Implicit Place search using SMT with State Equation took 2125 ms to find 0 implicit places.
Running 1682 sub problems to find dead transitions.
[2024-05-29 10:50:45] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1832/3516 variables, and 0 constraints, problems are : Problem set: 0 solved, 1682 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1833 constraints, PredecessorRefiner: 1682/1682 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1682 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1832/3516 variables, and 0 constraints, problems are : Problem set: 0 solved, 1682 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1833 constraints, PredecessorRefiner: 0/1682 constraints, Known Traps: 0/0 constraints]
After SMT, in 60399ms problems are : Problem set: 0 solved, 1682 unsolved
Search for dead transitions found 0 dead transitions in 60415ms
Finished structural reductions in LTL mode , in 1 iterations and 62598 ms. Remains : 1833/1833 places, 1683/1683 transitions.
Computed a total of 360 stabilizing places and 360 stable transitions
Computed a total of 360 stabilizing places and 360 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
RANDOM walk for 40000 steps (8 resets) in 378 ms. (105 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
[2024-05-29 10:51:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/77 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1756/1833 variables, 326/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1833 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1683/3516 variables, 1833/2164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3516 variables, 0/2164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3516 variables, 0/2164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3516/3516 variables, and 2164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 686 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 1833/1833 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/77 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1756/1833 variables, 326/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 10:51:46] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 4 ms to minimize.
[2024-05-29 10:51:47] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 3 ms to minimize.
[2024-05-29 10:51:47] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 3 ms to minimize.
[2024-05-29 10:51:47] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 4 ms to minimize.
[2024-05-29 10:51:47] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 2 ms to minimize.
[2024-05-29 10:51:47] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 3 ms to minimize.
[2024-05-29 10:51:47] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 3 ms to minimize.
[2024-05-29 10:51:48] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 3 ms to minimize.
[2024-05-29 10:51:48] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-05-29 10:51:48] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2024-05-29 10:51:48] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 2 ms to minimize.
[2024-05-29 10:51:48] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 2 ms to minimize.
[2024-05-29 10:51:48] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-05-29 10:51:48] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 2 ms to minimize.
[2024-05-29 10:51:48] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2024-05-29 10:51:48] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-05-29 10:51:48] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
[2024-05-29 10:51:48] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 2 ms to minimize.
[2024-05-29 10:51:48] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1833 variables, 19/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1833 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1683/3516 variables, 1833/2183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3516 variables, 1/2184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 10:51:49] [INFO ] Deduced a trap composed of 22 places in 297 ms of which 6 ms to minimize.
[2024-05-29 10:51:50] [INFO ] Deduced a trap composed of 42 places in 270 ms of which 6 ms to minimize.
[2024-05-29 10:51:50] [INFO ] Deduced a trap composed of 27 places in 264 ms of which 6 ms to minimize.
[2024-05-29 10:51:50] [INFO ] Deduced a trap composed of 37 places in 224 ms of which 5 ms to minimize.
[2024-05-29 10:51:50] [INFO ] Deduced a trap composed of 33 places in 222 ms of which 5 ms to minimize.
[2024-05-29 10:51:51] [INFO ] Deduced a trap composed of 32 places in 222 ms of which 4 ms to minimize.
[2024-05-29 10:51:51] [INFO ] Deduced a trap composed of 56 places in 220 ms of which 4 ms to minimize.
[2024-05-29 10:51:51] [INFO ] Deduced a trap composed of 56 places in 206 ms of which 4 ms to minimize.
SMT process timed out in 5784ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1833 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1833/1833 places, 1683/1683 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 211 rules applied. Total rules applied 211 place count 1833 transition count 1472
Reduce places removed 211 places and 0 transitions.
Iterating post reduction 1 with 211 rules applied. Total rules applied 422 place count 1622 transition count 1472
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 422 place count 1622 transition count 1322
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 722 place count 1472 transition count 1322
Performed 536 Post agglomeration using F-continuation condition.Transition count delta: 536
Deduced a syphon composed of 536 places in 0 ms
Reduce places removed 536 places and 0 transitions.
Iterating global reduction 2 with 1072 rules applied. Total rules applied 1794 place count 936 transition count 786
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 267 times.
Drop transitions (Partial Free agglomeration) removed 267 transitions
Iterating global reduction 2 with 267 rules applied. Total rules applied 2061 place count 936 transition count 786
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2062 place count 935 transition count 785
Applied a total of 2062 rules in 193 ms. Remains 935 /1833 variables (removed 898) and now considering 785/1683 (removed 898) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 935/1833 places, 785/1683 transitions.
RANDOM walk for 40000 steps (8 resets) in 545 ms. (73 steps per ms) remains 1/1 properties
BEST_FIRST walk for 32056 steps (6 resets) in 154 ms. (206 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 216 reset in 646 ms.
Product exploration explored 100000 steps with 360 reset in 630 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 4 out of 1833 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1833/1833 places, 1683/1683 transitions.
Performed 210 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 1833 transition count 1683
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 62 Pre rules applied. Total rules applied 210 place count 1833 transition count 1685
Deduced a syphon composed of 272 places in 2 ms
Iterating global reduction 1 with 62 rules applied. Total rules applied 272 place count 1833 transition count 1685
Performed 625 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 897 places in 1 ms
Iterating global reduction 1 with 625 rules applied. Total rules applied 897 place count 1833 transition count 1685
Renaming transitions due to excessive name length > 1024 char.
Discarding 210 places :
Symmetric choice reduction at 1 with 210 rule applications. Total rules 1107 place count 1623 transition count 1475
Deduced a syphon composed of 687 places in 1 ms
Iterating global reduction 1 with 210 rules applied. Total rules applied 1317 place count 1623 transition count 1475
Deduced a syphon composed of 687 places in 1 ms
Applied a total of 1317 rules in 559 ms. Remains 1623 /1833 variables (removed 210) and now considering 1475/1683 (removed 208) transitions.
[2024-05-29 10:51:54] [INFO ] Redundant transitions in 90 ms returned []
Running 1474 sub problems to find dead transitions.
// Phase 1: matrix 1475 rows 1623 cols
[2024-05-29 10:51:54] [INFO ] Computed 331 invariants in 20 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1622/3098 variables, and 0 constraints, problems are : Problem set: 0 solved, 1474 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1623 constraints, PredecessorRefiner: 1474/1474 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1474 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1622/3098 variables, and 0 constraints, problems are : Problem set: 0 solved, 1474 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1623 constraints, PredecessorRefiner: 0/1474 constraints, Known Traps: 0/0 constraints]
After SMT, in 60851ms problems are : Problem set: 0 solved, 1474 unsolved
Search for dead transitions found 0 dead transitions in 60864ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1623/1833 places, 1475/1683 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61525 ms. Remains : 1623/1833 places, 1475/1683 transitions.
Built C files in :
/tmp/ltsmin13080796235311665916
[2024-05-29 10:52:55] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13080796235311665916
Running compilation step : cd /tmp/ltsmin13080796235311665916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13080796235311665916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13080796235311665916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 1833 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1833/1833 places, 1683/1683 transitions.
Applied a total of 0 rules in 78 ms. Remains 1833 /1833 variables (removed 0) and now considering 1683/1683 (removed 0) transitions.
// Phase 1: matrix 1683 rows 1833 cols
[2024-05-29 10:52:58] [INFO ] Computed 331 invariants in 14 ms
[2024-05-29 10:52:59] [INFO ] Implicit Places using invariants in 570 ms returned []
[2024-05-29 10:52:59] [INFO ] Invariant cache hit.
[2024-05-29 10:53:01] [INFO ] Implicit Places using invariants and state equation in 1607 ms returned []
Implicit Place search using SMT with State Equation took 2185 ms to find 0 implicit places.
Running 1682 sub problems to find dead transitions.
[2024-05-29 10:53:01] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1832/3516 variables, and 0 constraints, problems are : Problem set: 0 solved, 1682 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1833 constraints, PredecessorRefiner: 1682/1682 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1682 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1832/3516 variables, and 0 constraints, problems are : Problem set: 0 solved, 1682 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/331 constraints, State Equation: 0/1833 constraints, PredecessorRefiner: 0/1682 constraints, Known Traps: 0/0 constraints]
After SMT, in 60347ms problems are : Problem set: 0 solved, 1682 unsolved
Search for dead transitions found 0 dead transitions in 60363ms
Finished structural reductions in LTL mode , in 1 iterations and 62629 ms. Remains : 1833/1833 places, 1683/1683 transitions.
Built C files in :
/tmp/ltsmin8762201732435767239
[2024-05-29 10:54:01] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8762201732435767239
Running compilation step : cd /tmp/ltsmin8762201732435767239;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8762201732435767239;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8762201732435767239;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 10:54:04] [INFO ] Flatten gal took : 57 ms
[2024-05-29 10:54:04] [INFO ] Flatten gal took : 54 ms
[2024-05-29 10:54:04] [INFO ] Time to serialize gal into /tmp/LTL1224312498937160040.gal : 16 ms
[2024-05-29 10:54:04] [INFO ] Time to serialize properties into /tmp/LTL12956345723031489287.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1224312498937160040.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5679632895235121711.hoa' '-atoms' '/tmp/LTL12956345723031489287.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12956345723031489287.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5679632895235121711.hoa
Detected timeout of ITS tools.
[2024-05-29 10:54:19] [INFO ] Flatten gal took : 45 ms
[2024-05-29 10:54:19] [INFO ] Flatten gal took : 44 ms
[2024-05-29 10:54:19] [INFO ] Time to serialize gal into /tmp/LTL372123246243462203.gal : 9 ms
[2024-05-29 10:54:19] [INFO ] Time to serialize properties into /tmp/LTL3300397153770547182.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL372123246243462203.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3300397153770547182.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((G(("((p1950==0)||(p310==1))")||(X(X("(((p1054==0)||(p462==1))||((p1950==0)||(p310==1)))"))))))
Formula 0 simplified : F(!"((p1950==0)||(p310==1))" & XX!"(((p1054==0)||(p462==1))||((p1950==0)||(p310==1)))")
Detected timeout of ITS tools.
[2024-05-29 10:54:35] [INFO ] Flatten gal took : 43 ms
[2024-05-29 10:54:35] [INFO ] Applying decomposition
[2024-05-29 10:54:35] [INFO ] Flatten gal took : 58 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4019742306111807615.txt' '-o' '/tmp/graph4019742306111807615.bin' '-w' '/tmp/graph4019742306111807615.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4019742306111807615.bin' '-l' '-1' '-v' '-w' '/tmp/graph4019742306111807615.weights' '-q' '0' '-e' '0.001'
[2024-05-29 10:54:35] [INFO ] Decomposing Gal with order
[2024-05-29 10:54:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 10:54:35] [INFO ] Removed a total of 270 redundant transitions.
[2024-05-29 10:54:35] [INFO ] Flatten gal took : 225 ms
[2024-05-29 10:54:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 23 ms.
[2024-05-29 10:54:36] [INFO ] Time to serialize gal into /tmp/LTL14570637181363659997.gal : 56 ms
[2024-05-29 10:54:36] [INFO ] Time to serialize properties into /tmp/LTL7845900307731232515.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14570637181363659997.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7845900307731232515.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(("((i28.u692.p1950==0)||(i5.i1.i1.u113.p310==1))")||(X(X("(((i16.i3.i0.u378.p1054==0)||(i7.i2.i0.u168.p462==1))||((i28.u692.p1950...193
Formula 0 simplified : F(!"((i28.u692.p1950==0)||(i5.i1.i1.u113.p310==1))" & XX!"(((i16.i3.i0.u378.p1054==0)||(i7.i2.i0.u168.p462==1))||((i28.u692.p1950==0...185
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-030B-LTLCardinality-02 finished in 320019 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&F(p1)) U p0))'
Support contains 3 out of 1834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1834/1834 places, 1684/1684 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 1833 transition count 1473
Reduce places removed 210 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 211 rules applied. Total rules applied 421 place count 1623 transition count 1472
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 422 place count 1622 transition count 1472
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 150 Pre rules applied. Total rules applied 422 place count 1622 transition count 1322
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 300 rules applied. Total rules applied 722 place count 1472 transition count 1322
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 724 place count 1470 transition count 1320
Iterating global reduction 3 with 2 rules applied. Total rules applied 726 place count 1470 transition count 1320
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 726 place count 1470 transition count 1318
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 730 place count 1468 transition count 1318
Performed 533 Post agglomeration using F-continuation condition.Transition count delta: 533
Deduced a syphon composed of 533 places in 1 ms
Reduce places removed 533 places and 0 transitions.
Iterating global reduction 3 with 1066 rules applied. Total rules applied 1796 place count 935 transition count 785
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1798 place count 933 transition count 783
Applied a total of 1798 rules in 270 ms. Remains 933 /1834 variables (removed 901) and now considering 783/1684 (removed 901) transitions.
// Phase 1: matrix 783 rows 933 cols
[2024-05-29 10:54:51] [INFO ] Computed 331 invariants in 3 ms
[2024-05-29 10:54:51] [INFO ] Implicit Places using invariants in 507 ms returned []
[2024-05-29 10:54:51] [INFO ] Invariant cache hit.
[2024-05-29 10:54:52] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 1238 ms to find 0 implicit places.
[2024-05-29 10:54:52] [INFO ] Redundant transitions in 8 ms returned []
Running 780 sub problems to find dead transitions.
[2024-05-29 10:54:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (OVERLAPS) 1/933 variables, 309/331 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 10:55:21] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-29 10:55:21] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-29 10:55:21] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-05-29 10:55:21] [INFO ] Deduced a trap composed of 59 places in 40 ms of which 1 ms to minimize.
[2024-05-29 10:55:22] [INFO ] Deduced a trap composed of 73 places in 35 ms of which 1 ms to minimize.
[2024-05-29 10:55:22] [INFO ] Deduced a trap composed of 87 places in 52 ms of which 1 ms to minimize.
[2024-05-29 10:55:22] [INFO ] Deduced a trap composed of 102 places in 44 ms of which 1 ms to minimize.
[2024-05-29 10:55:22] [INFO ] Deduced a trap composed of 118 places in 56 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 933/1716 variables, and 339 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (OVERLAPS) 1/933 variables, 309/331 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/933 variables, 8/339 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 10:55:33] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-29 10:55:33] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-29 10:55:33] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-29 10:55:33] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 10:55:34] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-29 10:55:34] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-05-29 10:55:34] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-29 10:55:34] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-29 10:55:34] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-29 10:55:35] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-29 10:55:42] [INFO ] Deduced a trap composed of 29 places in 24 ms of which 0 ms to minimize.
[2024-05-29 10:55:42] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 0 ms to minimize.
[2024-05-29 10:55:42] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 1 ms to minimize.
[2024-05-29 10:55:43] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-29 10:55:43] [INFO ] Deduced a trap composed of 135 places in 58 ms of which 2 ms to minimize.
[2024-05-29 10:55:44] [INFO ] Deduced a trap composed of 147 places in 63 ms of which 1 ms to minimize.
[2024-05-29 10:55:44] [INFO ] Deduced a trap composed of 161 places in 66 ms of which 1 ms to minimize.
[2024-05-29 10:55:44] [INFO ] Deduced a trap composed of 176 places in 73 ms of which 1 ms to minimize.
[2024-05-29 10:55:44] [INFO ] Deduced a trap composed of 190 places in 72 ms of which 2 ms to minimize.
[2024-05-29 10:55:45] [INFO ] Deduced a trap composed of 208 places in 76 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/933 variables, 20/359 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 10:55:45] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 1)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 1)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 1)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 1)
(s75 0)
(s76 1)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 1)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 1)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 1)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 1)
(s108 0)
(s109 0)
(s110 1)
(s111 0)
(s112 1)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 1)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 1)
(s125 0)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 1)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 1)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 1)
(s151 1)
(s152 0)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 0)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 1)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 1)
(s168 0)
(s169 1)
(s170 0)
(s171 0)
(s172 1)
(s173 0)
(s174 1)
(s175 0)
(s176 1)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 1)
(s182 1)
(s183 0)
(s184 0)
(s185 0)
(s186 1)
(s187 0)
(s188 0)
(s189 0)
(s190 1)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 1)
(s196 0)
(s197 0)
(s198 1)
(s199 0)
(s200 1)
(s201 0)
(s202 0)
(s203 1)
(s204 0)
(s205 1)
(s206 0)
(s207 1)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 1)
(s213 1)
(s214 0)
(s215 0)
(s216 0)
(s217 1)
(s218 0)
(s219 0)
(s220 0)
(s221 1)
(s222 0)
(s223 0)
(s224 1)
(s225 0)
(s226 1)
(s227 0)
(s228 0)
(s229 1)
(s230 0)
(s231 1)
(s232 0)
(s233 0)
(s234 1)
(s235 0)
(s236 1)
(s237 0)
(s238 1)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 1)
(s244 1)
(s245 0)
(s246 0)
(s247 0)
(s248 1)
(s249 0)
(s250 0)
(s251 0)
(s252 1)
(s253 0)
(s254 0)
(s255 1)
(s256 0)
(s257 1)
(s258 0)
(s259 0)
(s260 1)
(s261 0)
(s262 1)
(s263 0)
(s264 0)
(s265 1)
(s266 0)
(s267 1)
(s268 0)
(s269 1)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 1)
(s275 1)
(s276 0)
(s277 0)
(s278 0)
(s279 1)
(s280 0)
(s281 0)
(s282 0)
(s283 1)
(s284 0)
(s285 0)
(s286 1)
(s287 0)
(s288 1)
(s289 0)
(s290 0)
(s291 1)
(s292 0)
(s293 1)
(s294 0)
(s295 0)
(s296 1)
(s297 0)
(s298 1)
(s299 0)
(s300 1)
(s301 0)
(s302 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 933/1716 variables, and 360 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 0/780 constraints, Known Traps: 29/29 constraints]
After SMT, in 60181ms problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Starting structural reductions in SI_LTL mode, iteration 1 : 933/1834 places, 783/1684 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61709 ms. Remains : 933/1834 places, 783/1684 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLCardinality-03
Product exploration explored 100000 steps with 22800 reset in 221 ms.
Product exploration explored 100000 steps with 22806 reset in 226 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/933 stabilizing places and 2/783 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 214 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p1)]
RANDOM walk for 5353 steps (0 resets) in 53 ms. (99 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 6 factoid took 325 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p1)]
[2024-05-29 10:55:54] [INFO ] Invariant cache hit.
[2024-05-29 10:55:54] [INFO ] [Real]Absence check using 331 positive place invariants in 167 ms returned sat
[2024-05-29 10:55:57] [INFO ] [Real]Absence check using state equation in 2033 ms returned sat
[2024-05-29 10:55:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 10:55:57] [INFO ] [Nat]Absence check using 331 positive place invariants in 85 ms returned sat
[2024-05-29 10:55:57] [INFO ] [Nat]Absence check using state equation in 391 ms returned sat
[2024-05-29 10:55:58] [INFO ] Computed and/alt/rep : 780/2113/780 causal constraints (skipped 0 transitions) in 44 ms.
[2024-05-29 10:55:58] [INFO ] Added : 32 causal constraints over 7 iterations in 557 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Applied a total of 0 rules in 24 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
[2024-05-29 10:55:58] [INFO ] Invariant cache hit.
[2024-05-29 10:55:59] [INFO ] Implicit Places using invariants in 523 ms returned []
[2024-05-29 10:55:59] [INFO ] Invariant cache hit.
[2024-05-29 10:55:59] [INFO ] Implicit Places using invariants and state equation in 763 ms returned []
Implicit Place search using SMT with State Equation took 1289 ms to find 0 implicit places.
[2024-05-29 10:55:59] [INFO ] Redundant transitions in 7 ms returned []
Running 780 sub problems to find dead transitions.
[2024-05-29 10:55:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (OVERLAPS) 1/933 variables, 309/331 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 10:56:28] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-29 10:56:28] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
[2024-05-29 10:56:28] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-05-29 10:56:29] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 0 ms to minimize.
[2024-05-29 10:56:29] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 1 ms to minimize.
[2024-05-29 10:56:29] [INFO ] Deduced a trap composed of 87 places in 47 ms of which 1 ms to minimize.
[2024-05-29 10:56:29] [INFO ] Deduced a trap composed of 102 places in 48 ms of which 1 ms to minimize.
[2024-05-29 10:56:29] [INFO ] Deduced a trap composed of 118 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 933/1716 variables, and 339 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (OVERLAPS) 1/933 variables, 309/331 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/933 variables, 8/339 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 10:56:40] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-29 10:56:40] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-29 10:56:40] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-29 10:56:40] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-29 10:56:41] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-29 10:56:41] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-29 10:56:41] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-29 10:56:41] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2024-05-29 10:56:41] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-29 10:56:42] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 10:56:49] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-29 10:56:49] [INFO ] Deduced a trap composed of 31 places in 22 ms of which 1 ms to minimize.
[2024-05-29 10:56:49] [INFO ] Deduced a trap composed of 30 places in 22 ms of which 0 ms to minimize.
[2024-05-29 10:56:50] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2024-05-29 10:56:50] [INFO ] Deduced a trap composed of 135 places in 60 ms of which 1 ms to minimize.
[2024-05-29 10:56:51] [INFO ] Deduced a trap composed of 147 places in 68 ms of which 1 ms to minimize.
[2024-05-29 10:56:51] [INFO ] Deduced a trap composed of 161 places in 70 ms of which 2 ms to minimize.
[2024-05-29 10:56:51] [INFO ] Deduced a trap composed of 176 places in 63 ms of which 1 ms to minimize.
[2024-05-29 10:56:51] [INFO ] Deduced a trap composed of 190 places in 69 ms of which 2 ms to minimize.
[2024-05-29 10:56:52] [INFO ] Deduced a trap composed of 208 places in 82 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/933 variables, 20/359 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 10:56:52] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 933/1716 variables, and 360 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 0/780 constraints, Known Traps: 29/29 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 60167ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61494 ms. Remains : 933/933 places, 783/783 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/933 stabilizing places and 2/783 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 228 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p1)]
RANDOM walk for 5128 steps (0 resets) in 76 ms. (66 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 6 factoid took 321 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p1)]
[2024-05-29 10:57:00] [INFO ] Invariant cache hit.
[2024-05-29 10:57:01] [INFO ] [Real]Absence check using 331 positive place invariants in 158 ms returned sat
[2024-05-29 10:57:03] [INFO ] [Real]Absence check using state equation in 1920 ms returned sat
[2024-05-29 10:57:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 10:57:03] [INFO ] [Nat]Absence check using 331 positive place invariants in 85 ms returned sat
[2024-05-29 10:57:04] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2024-05-29 10:57:04] [INFO ] Computed and/alt/rep : 780/2113/780 causal constraints (skipped 0 transitions) in 44 ms.
[2024-05-29 10:57:04] [INFO ] Added : 32 causal constraints over 7 iterations in 536 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 22452 reset in 199 ms.
Product exploration explored 100000 steps with 22540 reset in 215 ms.
Built C files in :
/tmp/ltsmin7753281882524885654
[2024-05-29 10:57:05] [INFO ] Computing symmetric may disable matrix : 783 transitions.
[2024-05-29 10:57:05] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:57:05] [INFO ] Computing symmetric may enable matrix : 783 transitions.
[2024-05-29 10:57:05] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:57:05] [INFO ] Computing Do-Not-Accords matrix : 783 transitions.
[2024-05-29 10:57:05] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:57:05] [INFO ] Built C files in 157ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7753281882524885654
Running compilation step : cd /tmp/ltsmin7753281882524885654;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2457 ms.
Running link step : cd /tmp/ltsmin7753281882524885654;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin7753281882524885654;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3163899257605625221.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Applied a total of 0 rules in 21 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
[2024-05-29 10:57:20] [INFO ] Invariant cache hit.
[2024-05-29 10:57:20] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-05-29 10:57:20] [INFO ] Invariant cache hit.
[2024-05-29 10:57:21] [INFO ] Implicit Places using invariants and state equation in 755 ms returned []
Implicit Place search using SMT with State Equation took 1144 ms to find 0 implicit places.
[2024-05-29 10:57:21] [INFO ] Redundant transitions in 8 ms returned []
Running 780 sub problems to find dead transitions.
[2024-05-29 10:57:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (OVERLAPS) 1/933 variables, 309/331 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 10:57:50] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-29 10:57:50] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-29 10:57:50] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-05-29 10:57:50] [INFO ] Deduced a trap composed of 59 places in 38 ms of which 1 ms to minimize.
[2024-05-29 10:57:50] [INFO ] Deduced a trap composed of 73 places in 47 ms of which 2 ms to minimize.
[2024-05-29 10:57:51] [INFO ] Deduced a trap composed of 87 places in 49 ms of which 1 ms to minimize.
[2024-05-29 10:57:51] [INFO ] Deduced a trap composed of 102 places in 52 ms of which 1 ms to minimize.
[2024-05-29 10:57:51] [INFO ] Deduced a trap composed of 118 places in 54 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 933/1716 variables, and 339 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 2 (OVERLAPS) 1/933 variables, 309/331 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/933 variables, 8/339 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 10:58:02] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-29 10:58:02] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-29 10:58:02] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-29 10:58:02] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 10:58:02] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-29 10:58:03] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-29 10:58:03] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 0 ms to minimize.
[2024-05-29 10:58:03] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-29 10:58:03] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-29 10:58:03] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-29 10:58:11] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-29 10:58:11] [INFO ] Deduced a trap composed of 31 places in 23 ms of which 0 ms to minimize.
[2024-05-29 10:58:11] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
[2024-05-29 10:58:12] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-29 10:58:12] [INFO ] Deduced a trap composed of 135 places in 56 ms of which 1 ms to minimize.
[2024-05-29 10:58:13] [INFO ] Deduced a trap composed of 147 places in 66 ms of which 1 ms to minimize.
[2024-05-29 10:58:13] [INFO ] Deduced a trap composed of 161 places in 69 ms of which 2 ms to minimize.
[2024-05-29 10:58:13] [INFO ] Deduced a trap composed of 176 places in 69 ms of which 2 ms to minimize.
[2024-05-29 10:58:13] [INFO ] Deduced a trap composed of 190 places in 74 ms of which 1 ms to minimize.
[2024-05-29 10:58:14] [INFO ] Deduced a trap composed of 208 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/933 variables, 20/359 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 10:58:14] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 933/1716 variables, and 360 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 0/780 constraints, Known Traps: 29/29 constraints]
After SMT, in 60161ms problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 60168ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61346 ms. Remains : 933/933 places, 783/783 transitions.
Built C files in :
/tmp/ltsmin6693233004414020566
[2024-05-29 10:58:21] [INFO ] Computing symmetric may disable matrix : 783 transitions.
[2024-05-29 10:58:21] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:58:21] [INFO ] Computing symmetric may enable matrix : 783 transitions.
[2024-05-29 10:58:21] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:58:21] [INFO ] Computing Do-Not-Accords matrix : 783 transitions.
[2024-05-29 10:58:21] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 10:58:21] [INFO ] Built C files in 127ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6693233004414020566
Running compilation step : cd /tmp/ltsmin6693233004414020566;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2379 ms.
Running link step : cd /tmp/ltsmin6693233004414020566;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin6693233004414020566;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1456518120554193029.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 10:58:36] [INFO ] Flatten gal took : 33 ms
[2024-05-29 10:58:36] [INFO ] Flatten gal took : 31 ms
[2024-05-29 10:58:36] [INFO ] Time to serialize gal into /tmp/LTL4507188674617041675.gal : 5 ms
[2024-05-29 10:58:36] [INFO ] Time to serialize properties into /tmp/LTL10285562876461735792.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4507188674617041675.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3452358486008410116.hoa' '-atoms' '/tmp/LTL10285562876461735792.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10285562876461735792.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3452358486008410116.hoa
Detected timeout of ITS tools.
[2024-05-29 10:58:52] [INFO ] Flatten gal took : 29 ms
[2024-05-29 10:58:52] [INFO ] Flatten gal took : 28 ms
[2024-05-29 10:58:52] [INFO ] Time to serialize gal into /tmp/LTL14160140346324611224.gal : 5 ms
[2024-05-29 10:58:52] [INFO ] Time to serialize properties into /tmp/LTL4479649308951265787.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14160140346324611224.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4479649308951265787.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((((F("(p3==1)"))&&(F("((p517==0)||(p729==1))")))U("(p3==1)")))
Formula 0 simplified : (G!"(p3==1)" | G!"((p517==0)||(p729==1))") R !"(p3==1)"
Detected timeout of ITS tools.
[2024-05-29 10:59:07] [INFO ] Flatten gal took : 28 ms
[2024-05-29 10:59:07] [INFO ] Applying decomposition
[2024-05-29 10:59:07] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4394069083200823224.txt' '-o' '/tmp/graph4394069083200823224.bin' '-w' '/tmp/graph4394069083200823224.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4394069083200823224.bin' '-l' '-1' '-v' '-w' '/tmp/graph4394069083200823224.weights' '-q' '0' '-e' '0.001'
[2024-05-29 10:59:07] [INFO ] Decomposing Gal with order
[2024-05-29 10:59:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 10:59:07] [INFO ] Removed a total of 180 redundant transitions.
[2024-05-29 10:59:07] [INFO ] Flatten gal took : 43 ms
[2024-05-29 10:59:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 360 labels/synchronizations in 41 ms.
[2024-05-29 10:59:07] [INFO ] Time to serialize gal into /tmp/LTL14129577931969364476.gal : 15 ms
[2024-05-29 10:59:07] [INFO ] Time to serialize properties into /tmp/LTL10953780334906795833.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14129577931969364476.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10953780334906795833.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((((F("(i27.i0.u307.p3==1)"))&&(F("((i7.i1.u79.p517==0)||(i10.i0.u116.p729==1))")))U("(i27.i0.u307.p3==1)")))
Formula 0 simplified : (G!"(i27.i0.u307.p3==1)" | G!"((i7.i1.u79.p517==0)||(i10.i0.u116.p729==1))") R !"(i27.i0.u307.p3==1)"
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-030B-LTLCardinality-03 finished in 271263 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(F(p0)) U G(!p1)))'
Support contains 4 out of 1834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1834/1834 places, 1684/1684 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 212 place count 1833 transition count 1471
Reduce places removed 212 places and 0 transitions.
Iterating post reduction 1 with 212 rules applied. Total rules applied 424 place count 1621 transition count 1471
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 424 place count 1621 transition count 1321
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 724 place count 1471 transition count 1321
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 725 place count 1470 transition count 1320
Iterating global reduction 2 with 1 rules applied. Total rules applied 726 place count 1470 transition count 1320
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 726 place count 1470 transition count 1319
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 728 place count 1469 transition count 1319
Performed 531 Post agglomeration using F-continuation condition.Transition count delta: 531
Deduced a syphon composed of 531 places in 0 ms
Reduce places removed 531 places and 0 transitions.
Iterating global reduction 2 with 1062 rules applied. Total rules applied 1790 place count 938 transition count 788
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1792 place count 936 transition count 786
Applied a total of 1792 rules in 225 ms. Remains 936 /1834 variables (removed 898) and now considering 786/1684 (removed 898) transitions.
// Phase 1: matrix 786 rows 936 cols
[2024-05-29 10:59:22] [INFO ] Computed 331 invariants in 4 ms
[2024-05-29 10:59:23] [INFO ] Implicit Places using invariants in 408 ms returned []
[2024-05-29 10:59:23] [INFO ] Invariant cache hit.
[2024-05-29 10:59:23] [INFO ] Implicit Places using invariants and state equation in 735 ms returned []
Implicit Place search using SMT with State Equation took 1143 ms to find 0 implicit places.
[2024-05-29 10:59:23] [INFO ] Redundant transitions in 8 ms returned []
Running 782 sub problems to find dead transitions.
[2024-05-29 10:59:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/934 variables, 316/316 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-29 10:59:42] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-29 10:59:42] [INFO ] Deduced a trap composed of 28 places in 22 ms of which 0 ms to minimize.
[2024-05-29 10:59:42] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
[2024-05-29 10:59:42] [INFO ] Deduced a trap composed of 56 places in 36 ms of which 1 ms to minimize.
[2024-05-29 10:59:42] [INFO ] Deduced a trap composed of 73 places in 35 ms of which 1 ms to minimize.
[2024-05-29 10:59:42] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 5 ms to minimize.
[2024-05-29 10:59:43] [INFO ] Deduced a trap composed of 103 places in 51 ms of which 1 ms to minimize.
[2024-05-29 10:59:43] [INFO ] Deduced a trap composed of 113 places in 52 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/934 variables, 8/324 constraints. Problems are: Problem set: 0 solved, 782 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 934/1722 variables, and 324 constraints, problems are : Problem set: 0 solved, 782 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 316/331 constraints, State Equation: 0/936 constraints, PredecessorRefiner: 782/782 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 782 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/934 variables, 316/316 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/934 variables, 8/324 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/934 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 3 (OVERLAPS) 2/936 variables, 15/339 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-29 11:00:12] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 11:00:12] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-29 11:00:12] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-29 11:00:12] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 11:00:12] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-29 11:00:12] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/936 variables, 6/345 constraints. Problems are: Problem set: 0 solved, 782 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 936/1722 variables, and 345 constraints, problems are : Problem set: 0 solved, 782 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/936 constraints, PredecessorRefiner: 0/782 constraints, Known Traps: 14/14 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 782 unsolved
Search for dead transitions found 0 dead transitions in 60144ms
Starting structural reductions in SI_LTL mode, iteration 1 : 936/1834 places, 786/1684 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61526 ms. Remains : 936/1834 places, 786/1684 transitions.
Stuttering acceptance computed with spot in 81 ms :[p1, (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLCardinality-06
Product exploration explored 100000 steps with 22507 reset in 494 ms.
Product exploration explored 100000 steps with 22802 reset in 638 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[p1, (NOT p0)]
RANDOM walk for 4732 steps (0 resets) in 46 ms. (100 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 216 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[p1, (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[p1, (NOT p0)]
[2024-05-29 11:00:25] [INFO ] Invariant cache hit.
[2024-05-29 11:00:26] [INFO ] [Real]Absence check using 331 positive place invariants in 145 ms returned sat
[2024-05-29 11:00:28] [INFO ] [Real]Absence check using state equation in 1514 ms returned sat
[2024-05-29 11:00:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:00:28] [INFO ] [Nat]Absence check using 331 positive place invariants in 143 ms returned sat
[2024-05-29 11:00:30] [INFO ] [Nat]Absence check using state equation in 1360 ms returned sat
[2024-05-29 11:00:30] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-29 11:00:30] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-29 11:00:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 187 ms
[2024-05-29 11:00:30] [INFO ] Computed and/alt/rep : 782/1521/782 causal constraints (skipped 0 transitions) in 39 ms.
[2024-05-29 11:00:43] [INFO ] Added : 680 causal constraints over 136 iterations in 12854 ms. Result :unknown
Could not prove EG p1
Support contains 4 out of 936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 936/936 places, 786/786 transitions.
Applied a total of 0 rules in 21 ms. Remains 936 /936 variables (removed 0) and now considering 786/786 (removed 0) transitions.
[2024-05-29 11:00:43] [INFO ] Invariant cache hit.
[2024-05-29 11:00:43] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-05-29 11:00:43] [INFO ] Invariant cache hit.
[2024-05-29 11:00:44] [INFO ] Implicit Places using invariants and state equation in 760 ms returned []
Implicit Place search using SMT with State Equation took 1160 ms to find 0 implicit places.
[2024-05-29 11:00:44] [INFO ] Redundant transitions in 8 ms returned []
Running 782 sub problems to find dead transitions.
[2024-05-29 11:00:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/934 variables, 316/316 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-29 11:01:02] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-29 11:01:02] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-05-29 11:01:02] [INFO ] Deduced a trap composed of 42 places in 30 ms of which 1 ms to minimize.
[2024-05-29 11:01:02] [INFO ] Deduced a trap composed of 56 places in 38 ms of which 1 ms to minimize.
[2024-05-29 11:01:03] [INFO ] Deduced a trap composed of 73 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:01:03] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:01:03] [INFO ] Deduced a trap composed of 103 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:01:03] [INFO ] Deduced a trap composed of 113 places in 53 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/934 variables, 8/324 constraints. Problems are: Problem set: 0 solved, 782 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 934/1722 variables, and 324 constraints, problems are : Problem set: 0 solved, 782 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 316/331 constraints, State Equation: 0/936 constraints, PredecessorRefiner: 782/782 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 782 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/934 variables, 316/316 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/934 variables, 8/324 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/934 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 3 (OVERLAPS) 2/936 variables, 15/339 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-29 11:01:32] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-29 11:01:32] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-29 11:01:32] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-29 11:01:32] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 11:01:32] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-29 11:01:32] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/936 variables, 6/345 constraints. Problems are: Problem set: 0 solved, 782 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 936/1722 variables, and 345 constraints, problems are : Problem set: 0 solved, 782 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/936 constraints, PredecessorRefiner: 0/782 constraints, Known Traps: 14/14 constraints]
After SMT, in 60143ms problems are : Problem set: 0 solved, 782 unsolved
Search for dead transitions found 0 dead transitions in 60151ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61346 ms. Remains : 936/936 places, 786/786 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[p1, (NOT p0)]
RANDOM walk for 5007 steps (0 resets) in 60 ms. (82 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 286 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[p1, (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[p1, (NOT p0)]
[2024-05-29 11:01:45] [INFO ] Invariant cache hit.
[2024-05-29 11:01:45] [INFO ] [Real]Absence check using 331 positive place invariants in 142 ms returned sat
[2024-05-29 11:01:47] [INFO ] [Real]Absence check using state equation in 1555 ms returned sat
[2024-05-29 11:01:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:01:47] [INFO ] [Nat]Absence check using 331 positive place invariants in 143 ms returned sat
[2024-05-29 11:01:49] [INFO ] [Nat]Absence check using state equation in 1407 ms returned sat
[2024-05-29 11:01:49] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 11:01:49] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-29 11:01:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 171 ms
[2024-05-29 11:01:49] [INFO ] Computed and/alt/rep : 782/1521/782 causal constraints (skipped 0 transitions) in 40 ms.
[2024-05-29 11:02:02] [INFO ] Added : 680 causal constraints over 136 iterations in 12820 ms. Result :unknown
Could not prove EG p1
Stuttering acceptance computed with spot in 71 ms :[p1, (NOT p0)]
Product exploration explored 100000 steps with 22660 reset in 499 ms.
Product exploration explored 100000 steps with 22681 reset in 598 ms.
Built C files in :
/tmp/ltsmin3126086125337068667
[2024-05-29 11:02:03] [INFO ] Computing symmetric may disable matrix : 786 transitions.
[2024-05-29 11:02:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:02:03] [INFO ] Computing symmetric may enable matrix : 786 transitions.
[2024-05-29 11:02:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:02:03] [INFO ] Computing Do-Not-Accords matrix : 786 transitions.
[2024-05-29 11:02:03] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:02:03] [INFO ] Built C files in 110ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3126086125337068667
Running compilation step : cd /tmp/ltsmin3126086125337068667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2415 ms.
Running link step : cd /tmp/ltsmin3126086125337068667;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin3126086125337068667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18135458041559507149.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 936 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 936/936 places, 786/786 transitions.
Applied a total of 0 rules in 20 ms. Remains 936 /936 variables (removed 0) and now considering 786/786 (removed 0) transitions.
[2024-05-29 11:02:18] [INFO ] Invariant cache hit.
[2024-05-29 11:02:18] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-29 11:02:18] [INFO ] Invariant cache hit.
[2024-05-29 11:02:19] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 1112 ms to find 0 implicit places.
[2024-05-29 11:02:19] [INFO ] Redundant transitions in 8 ms returned []
Running 782 sub problems to find dead transitions.
[2024-05-29 11:02:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/934 variables, 316/316 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-29 11:02:37] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-29 11:02:37] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-05-29 11:02:37] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 0 ms to minimize.
[2024-05-29 11:02:38] [INFO ] Deduced a trap composed of 56 places in 37 ms of which 1 ms to minimize.
[2024-05-29 11:02:38] [INFO ] Deduced a trap composed of 73 places in 33 ms of which 1 ms to minimize.
[2024-05-29 11:02:38] [INFO ] Deduced a trap composed of 85 places in 46 ms of which 0 ms to minimize.
[2024-05-29 11:02:38] [INFO ] Deduced a trap composed of 103 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:02:39] [INFO ] Deduced a trap composed of 113 places in 62 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/934 variables, 8/324 constraints. Problems are: Problem set: 0 solved, 782 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 934/1722 variables, and 324 constraints, problems are : Problem set: 0 solved, 782 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 316/331 constraints, State Equation: 0/936 constraints, PredecessorRefiner: 782/782 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 782 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/934 variables, 316/316 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/934 variables, 8/324 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/934 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 782 unsolved
At refinement iteration 3 (OVERLAPS) 2/936 variables, 15/339 constraints. Problems are: Problem set: 0 solved, 782 unsolved
[2024-05-29 11:03:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 11:03:07] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-29 11:03:07] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-29 11:03:07] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-29 11:03:07] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-29 11:03:07] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/936 variables, 6/345 constraints. Problems are: Problem set: 0 solved, 782 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 936/1722 variables, and 345 constraints, problems are : Problem set: 0 solved, 782 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/936 constraints, PredecessorRefiner: 0/782 constraints, Known Traps: 14/14 constraints]
After SMT, in 60133ms problems are : Problem set: 0 solved, 782 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61289 ms. Remains : 936/936 places, 786/786 transitions.
Built C files in :
/tmp/ltsmin1511898748549646071
[2024-05-29 11:03:19] [INFO ] Computing symmetric may disable matrix : 786 transitions.
[2024-05-29 11:03:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:03:19] [INFO ] Computing symmetric may enable matrix : 786 transitions.
[2024-05-29 11:03:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:03:19] [INFO ] Computing Do-Not-Accords matrix : 786 transitions.
[2024-05-29 11:03:19] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:03:19] [INFO ] Built C files in 104ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1511898748549646071
Running compilation step : cd /tmp/ltsmin1511898748549646071;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2422 ms.
Running link step : cd /tmp/ltsmin1511898748549646071;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin1511898748549646071;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1954259016879867329.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 11:03:34] [INFO ] Flatten gal took : 21 ms
[2024-05-29 11:03:34] [INFO ] Flatten gal took : 21 ms
[2024-05-29 11:03:34] [INFO ] Time to serialize gal into /tmp/LTL14706561217589787587.gal : 4 ms
[2024-05-29 11:03:34] [INFO ] Time to serialize properties into /tmp/LTL1890377516368620519.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14706561217589787587.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11868249290812360019.hoa' '-atoms' '/tmp/LTL1890377516368620519.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL1890377516368620519.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11868249290812360019.hoa
Detected timeout of ITS tools.
[2024-05-29 11:03:50] [INFO ] Flatten gal took : 20 ms
[2024-05-29 11:03:50] [INFO ] Flatten gal took : 21 ms
[2024-05-29 11:03:50] [INFO ] Time to serialize gal into /tmp/LTL5594962685724526683.gal : 4 ms
[2024-05-29 11:03:50] [INFO ] Time to serialize properties into /tmp/LTL8397229710469764792.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5594962685724526683.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8397229710469764792.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X(F("((p1246==0)||(p1942==1))")))U(G(!("((p578==0)||(p1017==1))")))))
Formula 0 simplified : XG!"((p1246==0)||(p1942==1))" R F"((p578==0)||(p1017==1))"
Detected timeout of ITS tools.
[2024-05-29 11:04:05] [INFO ] Flatten gal took : 25 ms
[2024-05-29 11:04:05] [INFO ] Applying decomposition
[2024-05-29 11:04:05] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8897724077820915666.txt' '-o' '/tmp/graph8897724077820915666.bin' '-w' '/tmp/graph8897724077820915666.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8897724077820915666.bin' '-l' '-1' '-v' '-w' '/tmp/graph8897724077820915666.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:04:05] [INFO ] Decomposing Gal with order
[2024-05-29 11:04:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:04:05] [INFO ] Removed a total of 182 redundant transitions.
[2024-05-29 11:04:05] [INFO ] Flatten gal took : 43 ms
[2024-05-29 11:04:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 352 labels/synchronizations in 6 ms.
[2024-05-29 11:04:05] [INFO ] Time to serialize gal into /tmp/LTL12613803240776606232.gal : 8 ms
[2024-05-29 11:04:05] [INFO ] Time to serialize properties into /tmp/LTL4488162835434684436.ltl : 66 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12613803240776606232.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4488162835434684436.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((X(F("((i18.i1.u200.p1246==0)||(i28.i2.u319.p1942==1))")))U(G(!("((i8.i0.u89.p578==0)||(i14.i2.u164.p1017==1))")))))
Formula 0 simplified : XG!"((i18.i1.u200.p1246==0)||(i28.i2.u319.p1942==1))" R F"((i8.i0.u89.p578==0)||(i14.i2.u164.p1017==1))"
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-030B-LTLCardinality-06 finished in 297971 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 1834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1834/1834 places, 1684/1684 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 1833 transition count 1473
Reduce places removed 210 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 211 rules applied. Total rules applied 421 place count 1623 transition count 1472
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 422 place count 1622 transition count 1472
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 151 Pre rules applied. Total rules applied 422 place count 1622 transition count 1321
Deduced a syphon composed of 151 places in 2 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 3 with 302 rules applied. Total rules applied 724 place count 1471 transition count 1321
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 726 place count 1469 transition count 1319
Iterating global reduction 3 with 2 rules applied. Total rules applied 728 place count 1469 transition count 1319
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 728 place count 1469 transition count 1317
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 732 place count 1467 transition count 1317
Performed 534 Post agglomeration using F-continuation condition.Transition count delta: 534
Deduced a syphon composed of 534 places in 1 ms
Reduce places removed 534 places and 0 transitions.
Iterating global reduction 3 with 1068 rules applied. Total rules applied 1800 place count 933 transition count 783
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1802 place count 931 transition count 781
Applied a total of 1802 rules in 217 ms. Remains 931 /1834 variables (removed 903) and now considering 781/1684 (removed 903) transitions.
// Phase 1: matrix 781 rows 931 cols
[2024-05-29 11:04:20] [INFO ] Computed 331 invariants in 2 ms
[2024-05-29 11:04:21] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-29 11:04:21] [INFO ] Invariant cache hit.
[2024-05-29 11:04:21] [INFO ] Implicit Places using invariants and state equation in 727 ms returned []
Implicit Place search using SMT with State Equation took 1124 ms to find 0 implicit places.
[2024-05-29 11:04:21] [INFO ] Redundant transitions in 7 ms returned []
Running 778 sub problems to find dead transitions.
[2024-05-29 11:04:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/930 variables, 328/328 constraints. Problems are: Problem set: 0 solved, 778 unsolved
[2024-05-29 11:04:39] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-29 11:04:40] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-29 11:04:40] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2024-05-29 11:04:40] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 1 ms to minimize.
[2024-05-29 11:04:40] [INFO ] Deduced a trap composed of 73 places in 39 ms of which 1 ms to minimize.
[2024-05-29 11:04:40] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 1 ms to minimize.
[2024-05-29 11:04:41] [INFO ] Deduced a trap composed of 103 places in 55 ms of which 1 ms to minimize.
[2024-05-29 11:04:41] [INFO ] Deduced a trap composed of 113 places in 49 ms of which 1 ms to minimize.
[2024-05-29 11:04:41] [INFO ] Deduced a trap composed of 129 places in 56 ms of which 2 ms to minimize.
[2024-05-29 11:04:41] [INFO ] Deduced a trap composed of 144 places in 64 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/930 variables, 10/338 constraints. Problems are: Problem set: 0 solved, 778 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 930/1712 variables, and 338 constraints, problems are : Problem set: 0 solved, 778 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 328/331 constraints, State Equation: 0/931 constraints, PredecessorRefiner: 778/778 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 778 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/930 variables, 328/328 constraints. Problems are: Problem set: 0 solved, 778 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/930 variables, 10/338 constraints. Problems are: Problem set: 0 solved, 778 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/930 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 778 unsolved
At refinement iteration 3 (OVERLAPS) 1/931 variables, 3/341 constraints. Problems are: Problem set: 0 solved, 778 unsolved
[2024-05-29 11:05:15] [INFO ] Deduced a trap composed of 159 places in 67 ms of which 2 ms to minimize.
[2024-05-29 11:05:16] [INFO ] Deduced a trap composed of 176 places in 69 ms of which 2 ms to minimize.
[2024-05-29 11:05:16] [INFO ] Deduced a trap composed of 190 places in 75 ms of which 1 ms to minimize.
[2024-05-29 11:05:16] [INFO ] Deduced a trap composed of 204 places in 72 ms of which 2 ms to minimize.
[2024-05-29 11:05:17] [INFO ] Deduced a trap composed of 220 places in 84 ms of which 2 ms to minimize.
[2024-05-29 11:05:17] [INFO ] Deduced a trap composed of 234 places in 85 ms of which 2 ms to minimize.
[2024-05-29 11:05:17] [INFO ] Deduced a trap composed of 253 places in 92 ms of which 3 ms to minimize.
[2024-05-29 11:05:17] [INFO ] Deduced a trap composed of 262 places in 103 ms of which 3 ms to minimize.
[2024-05-29 11:05:18] [INFO ] Deduced a trap composed of 277 places in 101 ms of which 2 ms to minimize.
[2024-05-29 11:05:18] [INFO ] Deduced a trap composed of 292 places in 104 ms of which 2 ms to minimize.
[2024-05-29 11:05:19] [INFO ] Deduced a trap composed of 308 places in 112 ms of which 2 ms to minimize.
[2024-05-29 11:05:19] [INFO ] Deduced a trap composed of 315 places in 122 ms of which 3 ms to minimize.
[2024-05-29 11:05:19] [INFO ] Deduced a trap composed of 335 places in 123 ms of which 2 ms to minimize.
[2024-05-29 11:05:20] [INFO ] Deduced a trap composed of 353 places in 126 ms of which 3 ms to minimize.
[2024-05-29 11:05:20] [INFO ] Deduced a trap composed of 368 places in 140 ms of which 3 ms to minimize.
[2024-05-29 11:05:21] [INFO ] Deduced a trap composed of 378 places in 157 ms of which 3 ms to minimize.
[2024-05-29 11:05:21] [INFO ] Deduced a trap composed of 392 places in 145 ms of which 3 ms to minimize.
[2024-05-29 11:05:21] [INFO ] Deduced a trap composed of 408 places in 141 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 931/1712 variables, and 359 constraints, problems are : Problem set: 0 solved, 778 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/931 constraints, PredecessorRefiner: 0/778 constraints, Known Traps: 28/28 constraints]
After SMT, in 60154ms problems are : Problem set: 0 solved, 778 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Starting structural reductions in SI_LTL mode, iteration 1 : 931/1834 places, 781/1684 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61515 ms. Remains : 931/1834 places, 781/1684 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLCardinality-07
Stuttering criterion allowed to conclude after 2009 steps with 0 reset in 18 ms.
FORMULA ShieldPPPs-PT-030B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030B-LTLCardinality-07 finished in 61581 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 1834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1834/1834 places, 1684/1684 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 1833 transition count 1473
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1623 transition count 1473
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 420 place count 1623 transition count 1323
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 720 place count 1473 transition count 1323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 721 place count 1472 transition count 1322
Iterating global reduction 2 with 1 rules applied. Total rules applied 722 place count 1472 transition count 1322
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 722 place count 1472 transition count 1321
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 724 place count 1471 transition count 1321
Performed 536 Post agglomeration using F-continuation condition.Transition count delta: 536
Deduced a syphon composed of 536 places in 0 ms
Reduce places removed 536 places and 0 transitions.
Iterating global reduction 2 with 1072 rules applied. Total rules applied 1796 place count 935 transition count 785
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1798 place count 933 transition count 783
Applied a total of 1798 rules in 257 ms. Remains 933 /1834 variables (removed 901) and now considering 783/1684 (removed 901) transitions.
// Phase 1: matrix 783 rows 933 cols
[2024-05-29 11:05:22] [INFO ] Computed 331 invariants in 7 ms
[2024-05-29 11:05:22] [INFO ] Implicit Places using invariants in 373 ms returned []
[2024-05-29 11:05:22] [INFO ] Invariant cache hit.
[2024-05-29 11:05:23] [INFO ] Implicit Places using invariants and state equation in 725 ms returned []
Implicit Place search using SMT with State Equation took 1099 ms to find 0 implicit places.
[2024-05-29 11:05:23] [INFO ] Redundant transitions in 8 ms returned []
Running 779 sub problems to find dead transitions.
[2024-05-29 11:05:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 329/329 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:05:41] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-29 11:05:41] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-29 11:05:42] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 1 ms to minimize.
[2024-05-29 11:05:42] [INFO ] Deduced a trap composed of 56 places in 34 ms of which 1 ms to minimize.
[2024-05-29 11:05:42] [INFO ] Deduced a trap composed of 73 places in 36 ms of which 1 ms to minimize.
[2024-05-29 11:05:42] [INFO ] Deduced a trap composed of 85 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:05:42] [INFO ] Deduced a trap composed of 103 places in 52 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 7/336 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 931/1716 variables, and 336 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 329/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 779/779 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 779 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 329/329 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 7/336 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/931 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 3 (OVERLAPS) 2/933 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:06:12] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-29 11:06:12] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-29 11:06:12] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-29 11:06:16] [INFO ] Deduced a trap composed of 116 places in 54 ms of which 1 ms to minimize.
[2024-05-29 11:06:16] [INFO ] Deduced a trap composed of 130 places in 59 ms of which 1 ms to minimize.
[2024-05-29 11:06:17] [INFO ] Deduced a trap composed of 143 places in 66 ms of which 2 ms to minimize.
[2024-05-29 11:06:17] [INFO ] Deduced a trap composed of 159 places in 60 ms of which 1 ms to minimize.
[2024-05-29 11:06:17] [INFO ] Deduced a trap composed of 177 places in 75 ms of which 2 ms to minimize.
[2024-05-29 11:06:17] [INFO ] Deduced a trap composed of 189 places in 78 ms of which 1 ms to minimize.
[2024-05-29 11:06:18] [INFO ] Deduced a trap composed of 203 places in 78 ms of which 2 ms to minimize.
[2024-05-29 11:06:18] [INFO ] Deduced a trap composed of 216 places in 81 ms of which 2 ms to minimize.
[2024-05-29 11:06:18] [INFO ] Deduced a trap composed of 233 places in 88 ms of which 2 ms to minimize.
[2024-05-29 11:06:19] [INFO ] Deduced a trap composed of 248 places in 97 ms of which 2 ms to minimize.
[2024-05-29 11:06:19] [INFO ] Deduced a trap composed of 262 places in 92 ms of which 2 ms to minimize.
[2024-05-29 11:06:19] [INFO ] Deduced a trap composed of 273 places in 103 ms of which 2 ms to minimize.
[2024-05-29 11:06:20] [INFO ] Deduced a trap composed of 300 places in 107 ms of which 3 ms to minimize.
[2024-05-29 11:06:20] [INFO ] Deduced a trap composed of 304 places in 107 ms of which 2 ms to minimize.
[2024-05-29 11:06:20] [INFO ] Deduced a trap composed of 324 places in 116 ms of which 3 ms to minimize.
[2024-05-29 11:06:21] [INFO ] Deduced a trap composed of 337 places in 127 ms of which 3 ms to minimize.
[2024-05-29 11:06:21] [INFO ] Deduced a trap composed of 347 places in 133 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/933 variables, 20/358 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 933/1716 variables, and 358 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 0/779 constraints, Known Traps: 27/27 constraints]
After SMT, in 60151ms problems are : Problem set: 0 solved, 779 unsolved
Search for dead transitions found 0 dead transitions in 60158ms
Starting structural reductions in SI_LTL mode, iteration 1 : 933/1834 places, 783/1684 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61527 ms. Remains : 933/1834 places, 783/1684 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLCardinality-09
Product exploration explored 100000 steps with 78 reset in 667 ms.
Product exploration explored 100000 steps with 74 reset in 777 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 185 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 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 12328 steps (6 resets) in 104 ms. (117 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 343 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 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Applied a total of 0 rules in 32 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
[2024-05-29 11:06:25] [INFO ] Invariant cache hit.
[2024-05-29 11:06:26] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-05-29 11:06:26] [INFO ] Invariant cache hit.
[2024-05-29 11:06:27] [INFO ] Implicit Places using invariants and state equation in 759 ms returned []
Implicit Place search using SMT with State Equation took 1134 ms to find 0 implicit places.
[2024-05-29 11:06:27] [INFO ] Redundant transitions in 7 ms returned []
Running 779 sub problems to find dead transitions.
[2024-05-29 11:06:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 329/329 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:06:45] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-29 11:06:45] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
[2024-05-29 11:06:45] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
[2024-05-29 11:06:46] [INFO ] Deduced a trap composed of 56 places in 39 ms of which 0 ms to minimize.
[2024-05-29 11:06:46] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 0 ms to minimize.
[2024-05-29 11:06:46] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:06:46] [INFO ] Deduced a trap composed of 103 places in 48 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 7/336 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 1.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 1.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 1.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 1.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 1.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 1.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 1.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 1.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 1.0)
(s413 0.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 0.0)
(s420 1.0)
(s421 0.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 1.0)
(s427 0.0)
(s428 1.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 1.0)
(s439 0.0)
(s440 0.0)
(s441 1.0)
(s442 0.0)
(s443 1.0)
(s444 0.0)
(s445 0.0)
(s446 1.0)
(s447 0.0)
(s448 1.0)
(s449 0.0)
(s450 0.0)
(s451 1.0)
(s452 0.0)
(s453 1.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 1.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 1.0)
(s470 0.0)
(s471 0.0)
(s472 1.0)
(s473 0.0)
(s474 1.0)
(s475 0.0)
(s476 0.0)
(s477 1.0)
(s478 0.0)
(s479 1.0)
(s480 0.0)
(s481 0.0)
(s482 1.0)
(s483 0.0)
(s484 1.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 1.0)
(s489 0.0)
(s490 1.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 1.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 1.0)
(s499 0.0)
(s500 1.0)
(s501 0.0)
(s502 0.0)
(s503 1.0)
(s504 0.0)
(s505 1.0)
(s506 0.0)
(s507 0.0)
(s508 1.0)
(s509 0.0)
(s510 1.0)
(s511 0.0)
(s512 0.0)
(s513 1.0)
(s514 0.0)
(s515 1.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 1.0)
(s520 0.0)
(s521 1.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 1.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 1.0)
(s530 0.0)
(s531 1.0)
(s532 0.0)
(s533 0.0)
(s534 1.0)
(s535 0.0)
(s536 1.0)
(s537 0.0)
(s538 0.0)
(s539 1.0)
(s540 0.0)
(s541 1.0)
(s542 0.0)
(s543 0.0)
(s544 1.0)
(s545 0.0)
(s546 1.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 1.0)
(s551 0.0)
(s552 1.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 1.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 1.0)
(s561 0.0)
(s562 1.0)
(s563 0.0)
(s564 0.0)
(s565 1.0)
(s566 0.0)
(s567 1.0)
(s568 0.0)
(s569 0.0)
(s570 1.0)
(s571 0.0)
(s572 1.0)
(s573 0.0)
(s574 0.0)
(s575 1.0)
(s576 0.0)
(s577 1.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 1.0)
(s582 0.0)
(s583 1.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 1.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 1.0)
(s592 0.0)
(s593 1.0)
(s594 0.0)
(s595 0.0)
(s596 1.0)
(s597 0.0)
(s598 1.0)
(s599 0.0)
(s600 0.0)
(s601 1.0)
(s602 0.0)
(s603 1.0)
(s604 0.0)
(s605 0.0)
(s606 1.0)
(s607 0.0)
(s608 1.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 1.0)
(s613 0.0)
(s614 1.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 1.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 1.0)
(s623 0.0)
(s624 1.0)
(s625 0.0)
(s626 0.0)
(s627 1.0)
(s628 0.0)
(s629 1.0)
(s630 0.0)
(s631 0.0)
(s632 1.0)
(s633 0.0)
(s634 1.0)
(s635 0.0)
(s636 0.0)
(s637 1.0)
(s638 0.0)
(s639 1.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 1.0)
(s644 0.0)
(s645 1.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 1.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 1.0)
(s654 0.0)
(s655 1.0)
(s656 0.0)
(s657 0.0)
(s658 1.0)
(s659 0.0)
(s660 1.0)
(s661 0.0)
(s662 0.0)
(s663 1.0)
(s664 0.0)
(s665 1.0)
(s666 0.0)
(s667 0.0)
(s668 1.0)
(s669 0.0)
(s670 1.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 1.0)
(s675 0.0)
(s676 1.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 1.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 1.0)
(s685 0.0)
(s686 1.0)
(s687 0.0)
(s688 0.0)
(s689 1.0)
(s690 0.0)
(s691 1.0)
(s692 0.0)
(s693 0.0)
(s694 1.0)
(s695 0.0)
(s696 1.0)
(s697 0.0)
(s698 0.0)
(s699 1.0)
(s700 0.0)
(s701 1.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 1.0)
(s706 0.0)
(s707 1.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 1.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 1.0)
(s716 0.0)
(s717 1.0)
(s718 0.0)
(s719 0.0)
(s720 1.0)
(s721 0.0)
(s722 1.0)
(s723 0.0)
(s724 0.0)
(s725 1.0)
(s726 0.0)
(s727 1.0)
(s728 0.0)
(s729 0.0)
(s730 1.0)
(s731 0.0)
(s732 1.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 1.0)
(s737 0.0)
(s738 1.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 1.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 1.0)
(s747 0.0)
(s748 1.0)
(s749 0.0)
(s750 0.0)
(s751 1.0)
(s752 0.0)
(s753 1.0)
(s754 0.0)
(s755 0.0)
(s756 1.0)
(s757 0.0)
(s758 1.0)
(s759 0.0)
(s760 0.0)
(s761 1.0)
(s762 timeout
0.0)
(s763 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 931/1716 variables, and 336 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 329/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 779/779 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 779 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 329/329 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 7/336 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/931 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 3 (OVERLAPS) 2/933 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:07:16] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-29 11:07:16] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 11:07:16] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-05-29 11:07:20] [INFO ] Deduced a trap composed of 116 places in 54 ms of which 2 ms to minimize.
[2024-05-29 11:07:20] [INFO ] Deduced a trap composed of 130 places in 59 ms of which 1 ms to minimize.
[2024-05-29 11:07:21] [INFO ] Deduced a trap composed of 143 places in 61 ms of which 1 ms to minimize.
[2024-05-29 11:07:21] [INFO ] Deduced a trap composed of 159 places in 70 ms of which 2 ms to minimize.
[2024-05-29 11:07:21] [INFO ] Deduced a trap composed of 177 places in 78 ms of which 1 ms to minimize.
[2024-05-29 11:07:21] [INFO ] Deduced a trap composed of 189 places in 76 ms of which 2 ms to minimize.
[2024-05-29 11:07:22] [INFO ] Deduced a trap composed of 203 places in 83 ms of which 2 ms to minimize.
[2024-05-29 11:07:22] [INFO ] Deduced a trap composed of 216 places in 90 ms of which 1 ms to minimize.
[2024-05-29 11:07:22] [INFO ] Deduced a trap composed of 233 places in 92 ms of which 2 ms to minimize.
[2024-05-29 11:07:22] [INFO ] Deduced a trap composed of 248 places in 94 ms of which 2 ms to minimize.
[2024-05-29 11:07:23] [INFO ] Deduced a trap composed of 262 places in 100 ms of which 2 ms to minimize.
[2024-05-29 11:07:23] [INFO ] Deduced a trap composed of 273 places in 103 ms of which 2 ms to minimize.
[2024-05-29 11:07:24] [INFO ] Deduced a trap composed of 300 places in 114 ms of which 2 ms to minimize.
[2024-05-29 11:07:24] [INFO ] Deduced a trap composed of 304 places in 107 ms of which 2 ms to minimize.
[2024-05-29 11:07:24] [INFO ] Deduced a trap composed of 324 places in 122 ms of which 3 ms to minimize.
[2024-05-29 11:07:25] [INFO ] Deduced a trap composed of 337 places in 125 ms of which 3 ms to minimize.
[2024-05-29 11:07:25] [INFO ] Deduced a trap composed of 347 places in 128 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/933 variables, 20/358 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 933/1716 variables, and 358 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 0/779 constraints, Known Traps: 27/27 constraints]
After SMT, in 60152ms problems are : Problem set: 0 solved, 779 unsolved
Search for dead transitions found 0 dead transitions in 60159ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61339 ms. Remains : 933/933 places, 783/783 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 183 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 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 6090 steps (3 resets) in 60 ms. (99 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 184 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 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 78 reset in 644 ms.
Product exploration explored 100000 steps with 74 reset in 794 ms.
Built C files in :
/tmp/ltsmin9983073480631010401
[2024-05-29 11:07:29] [INFO ] Computing symmetric may disable matrix : 783 transitions.
[2024-05-29 11:07:29] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:07:29] [INFO ] Computing symmetric may enable matrix : 783 transitions.
[2024-05-29 11:07:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:07:29] [INFO ] Computing Do-Not-Accords matrix : 783 transitions.
[2024-05-29 11:07:29] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:07:29] [INFO ] Built C files in 104ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9983073480631010401
Running compilation step : cd /tmp/ltsmin9983073480631010401;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2433 ms.
Running link step : cd /tmp/ltsmin9983073480631010401;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin9983073480631010401;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13099786593721268347.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 933 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 933/933 places, 783/783 transitions.
Applied a total of 0 rules in 20 ms. Remains 933 /933 variables (removed 0) and now considering 783/783 (removed 0) transitions.
[2024-05-29 11:07:44] [INFO ] Invariant cache hit.
[2024-05-29 11:07:44] [INFO ] Implicit Places using invariants in 368 ms returned []
[2024-05-29 11:07:44] [INFO ] Invariant cache hit.
[2024-05-29 11:07:45] [INFO ] Implicit Places using invariants and state equation in 751 ms returned []
Implicit Place search using SMT with State Equation took 1120 ms to find 0 implicit places.
[2024-05-29 11:07:45] [INFO ] Redundant transitions in 8 ms returned []
Running 779 sub problems to find dead transitions.
[2024-05-29 11:07:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 329/329 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:08:04] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-29 11:08:04] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-05-29 11:08:04] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-05-29 11:08:04] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:08:04] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:08:05] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 1 ms to minimize.
[2024-05-29 11:08:05] [INFO ] Deduced a trap composed of 103 places in 54 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 7/336 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 931/1716 variables, and 336 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 329/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 779/779 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 779 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/931 variables, 329/329 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/931 variables, 7/336 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/931 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 3 (OVERLAPS) 2/933 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-05-29 11:08:34] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-29 11:08:34] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 11:08:34] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-29 11:08:38] [INFO ] Deduced a trap composed of 116 places in 55 ms of which 1 ms to minimize.
[2024-05-29 11:08:39] [INFO ] Deduced a trap composed of 130 places in 59 ms of which 1 ms to minimize.
[2024-05-29 11:08:39] [INFO ] Deduced a trap composed of 143 places in 65 ms of which 1 ms to minimize.
[2024-05-29 11:08:39] [INFO ] Deduced a trap composed of 159 places in 66 ms of which 1 ms to minimize.
[2024-05-29 11:08:39] [INFO ] Deduced a trap composed of 177 places in 70 ms of which 1 ms to minimize.
[2024-05-29 11:08:40] [INFO ] Deduced a trap composed of 189 places in 75 ms of which 2 ms to minimize.
[2024-05-29 11:08:40] [INFO ] Deduced a trap composed of 203 places in 78 ms of which 1 ms to minimize.
[2024-05-29 11:08:40] [INFO ] Deduced a trap composed of 216 places in 84 ms of which 2 ms to minimize.
[2024-05-29 11:08:41] [INFO ] Deduced a trap composed of 233 places in 88 ms of which 2 ms to minimize.
[2024-05-29 11:08:41] [INFO ] Deduced a trap composed of 248 places in 95 ms of which 2 ms to minimize.
[2024-05-29 11:08:41] [INFO ] Deduced a trap composed of 262 places in 101 ms of which 2 ms to minimize.
[2024-05-29 11:08:42] [INFO ] Deduced a trap composed of 273 places in 102 ms of which 2 ms to minimize.
[2024-05-29 11:08:42] [INFO ] Deduced a trap composed of 300 places in 107 ms of which 2 ms to minimize.
[2024-05-29 11:08:42] [INFO ] Deduced a trap composed of 304 places in 112 ms of which 2 ms to minimize.
[2024-05-29 11:08:43] [INFO ] Deduced a trap composed of 324 places in 120 ms of which 3 ms to minimize.
[2024-05-29 11:08:43] [INFO ] Deduced a trap composed of 337 places in 121 ms of which 2 ms to minimize.
[2024-05-29 11:08:43] [INFO ] Deduced a trap composed of 347 places in 129 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/933 variables, 20/358 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 933/1716 variables, and 358 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 0/779 constraints, Known Traps: 27/27 constraints]
After SMT, in 60133ms problems are : Problem set: 0 solved, 779 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61293 ms. Remains : 933/933 places, 783/783 transitions.
Built C files in :
/tmp/ltsmin11683697138776949217
[2024-05-29 11:08:45] [INFO ] Computing symmetric may disable matrix : 783 transitions.
[2024-05-29 11:08:45] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:08:45] [INFO ] Computing symmetric may enable matrix : 783 transitions.
[2024-05-29 11:08:45] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:08:45] [INFO ] Computing Do-Not-Accords matrix : 783 transitions.
[2024-05-29 11:08:45] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:08:45] [INFO ] Built C files in 113ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11683697138776949217
Running compilation step : cd /tmp/ltsmin11683697138776949217;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2527 ms.
Running link step : cd /tmp/ltsmin11683697138776949217;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin11683697138776949217;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7999695615110518365.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 11:09:00] [INFO ] Flatten gal took : 20 ms
[2024-05-29 11:09:00] [INFO ] Flatten gal took : 19 ms
[2024-05-29 11:09:00] [INFO ] Time to serialize gal into /tmp/LTL7916105760588507933.gal : 5 ms
[2024-05-29 11:09:00] [INFO ] Time to serialize properties into /tmp/LTL1739154817865045282.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7916105760588507933.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9054563795800720697.hoa' '-atoms' '/tmp/LTL1739154817865045282.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1739154817865045282.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9054563795800720697.hoa
Detected timeout of ITS tools.
[2024-05-29 11:09:15] [INFO ] Flatten gal took : 19 ms
[2024-05-29 11:09:15] [INFO ] Flatten gal took : 19 ms
[2024-05-29 11:09:15] [INFO ] Time to serialize gal into /tmp/LTL2133091170931358683.gal : 3 ms
[2024-05-29 11:09:15] [INFO ] Time to serialize properties into /tmp/LTL15572515631097025334.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2133091170931358683.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15572515631097025334.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((p1950==0)||(p566==1))"))))
Formula 0 simplified : FG!"((p1950==0)||(p566==1))"
Detected timeout of ITS tools.
[2024-05-29 11:09:30] [INFO ] Flatten gal took : 24 ms
[2024-05-29 11:09:30] [INFO ] Applying decomposition
[2024-05-29 11:09:31] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15079800933006551092.txt' '-o' '/tmp/graph15079800933006551092.bin' '-w' '/tmp/graph15079800933006551092.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15079800933006551092.bin' '-l' '-1' '-v' '-w' '/tmp/graph15079800933006551092.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:09:31] [INFO ] Decomposing Gal with order
[2024-05-29 11:09:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:09:31] [INFO ] Removed a total of 182 redundant transitions.
[2024-05-29 11:09:31] [INFO ] Flatten gal took : 33 ms
[2024-05-29 11:09:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 352 labels/synchronizations in 5 ms.
[2024-05-29 11:09:31] [INFO ] Time to serialize gal into /tmp/LTL7311204829743930401.gal : 6 ms
[2024-05-29 11:09:31] [INFO ] Time to serialize properties into /tmp/LTL5214381255581266264.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7311204829743930401.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5214381255581266264.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i28.i2.u317.p1950==0)||(i7.i3.u89.p566==1))"))))
Formula 0 simplified : FG!"((i28.i2.u317.p1950==0)||(i7.i3.u89.p566==1))"
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-030B-LTLCardinality-09 finished in 264225 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 1 out of 1834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1834/1834 places, 1684/1684 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 212 place count 1833 transition count 1471
Reduce places removed 212 places and 0 transitions.
Iterating post reduction 1 with 212 rules applied. Total rules applied 424 place count 1621 transition count 1471
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 424 place count 1621 transition count 1322
Deduced a syphon composed of 149 places in 2 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 722 place count 1472 transition count 1322
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 724 place count 1470 transition count 1320
Iterating global reduction 2 with 2 rules applied. Total rules applied 726 place count 1470 transition count 1320
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 726 place count 1470 transition count 1318
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 730 place count 1468 transition count 1318
Performed 535 Post agglomeration using F-continuation condition.Transition count delta: 535
Deduced a syphon composed of 535 places in 1 ms
Reduce places removed 535 places and 0 transitions.
Iterating global reduction 2 with 1070 rules applied. Total rules applied 1800 place count 933 transition count 783
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1802 place count 931 transition count 781
Applied a total of 1802 rules in 200 ms. Remains 931 /1834 variables (removed 903) and now considering 781/1684 (removed 903) transitions.
// Phase 1: matrix 781 rows 931 cols
[2024-05-29 11:09:46] [INFO ] Computed 331 invariants in 5 ms
[2024-05-29 11:09:46] [INFO ] Implicit Places using invariants in 369 ms returned []
[2024-05-29 11:09:46] [INFO ] Invariant cache hit.
[2024-05-29 11:09:47] [INFO ] Implicit Places using invariants and state equation in 711 ms returned []
Implicit Place search using SMT with State Equation took 1082 ms to find 0 implicit places.
[2024-05-29 11:09:47] [INFO ] Redundant transitions in 14 ms returned []
Running 778 sub problems to find dead transitions.
[2024-05-29 11:09:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/930 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 778 unsolved
[2024-05-29 11:10:05] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-29 11:10:05] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
[2024-05-29 11:10:05] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 0 ms to minimize.
[2024-05-29 11:10:05] [INFO ] Deduced a trap composed of 56 places in 38 ms of which 0 ms to minimize.
[2024-05-29 11:10:06] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:10:06] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 1 ms to minimize.
[2024-05-29 11:10:06] [INFO ] Deduced a trap composed of 103 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:10:06] [INFO ] Deduced a trap composed of 113 places in 57 ms of which 1 ms to minimize.
[2024-05-29 11:10:07] [INFO ] Deduced a trap composed of 129 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:10:07] [INFO ] Deduced a trap composed of 144 places in 60 ms of which 1 ms to minimize.
[2024-05-29 11:10:07] [INFO ] Deduced a trap composed of 159 places in 62 ms of which 2 ms to minimize.
[2024-05-29 11:10:07] [INFO ] Deduced a trap composed of 175 places in 69 ms of which 1 ms to minimize.
[2024-05-29 11:10:07] [INFO ] Deduced a trap composed of 190 places in 72 ms of which 1 ms to minimize.
[2024-05-29 11:10:08] [INFO ] Deduced a trap composed of 206 places in 83 ms of which 2 ms to minimize.
[2024-05-29 11:10:08] [INFO ] Deduced a trap composed of 219 places in 86 ms of which 2 ms to minimize.
[2024-05-29 11:10:08] [INFO ] Deduced a trap composed of 232 places in 88 ms of which 2 ms to minimize.
[2024-05-29 11:10:09] [INFO ] Deduced a trap composed of 252 places in 90 ms of which 2 ms to minimize.
[2024-05-29 11:10:09] [INFO ] Deduced a trap composed of 267 places in 99 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/930 variables, 18/348 constraints. Problems are: Problem set: 0 solved, 778 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 930/1712 variables, and 348 constraints, problems are : Problem set: 0 solved, 778 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 330/331 constraints, State Equation: 0/931 constraints, PredecessorRefiner: 778/778 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 778 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/930 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 778 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/930 variables, 18/348 constraints. Problems are: Problem set: 0 solved, 778 unsolved
[2024-05-29 11:10:26] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:10:26] [INFO ] Deduced a trap composed of 101 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:10:26] [INFO ] Deduced a trap composed of 105 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:10:27] [INFO ] Deduced a trap composed of 99 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:10:27] [INFO ] Deduced a trap composed of 55 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:10:27] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:10:27] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:10:27] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2024-05-29 11:10:27] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:10:27] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 2 ms to minimize.
[2024-05-29 11:10:27] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:10:27] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 1 ms to minimize.
[2024-05-29 11:10:27] [INFO ] Deduced a trap composed of 73 places in 46 ms of which 1 ms to minimize.
[2024-05-29 11:10:27] [INFO ] Deduced a trap composed of 70 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:10:27] [INFO ] Deduced a trap composed of 70 places in 45 ms of which 1 ms to minimize.
[2024-05-29 11:10:27] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 1 ms to minimize.
[2024-05-29 11:10:27] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:10:27] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 1 ms to minimize.
[2024-05-29 11:10:27] [INFO ] Deduced a trap composed of 67 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:10:28] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/930 variables, 20/368 constraints. Problems are: Problem set: 0 solved, 778 unsolved
[2024-05-29 11:10:36] [INFO ] Deduced a trap composed of 71 places in 38 ms of which 1 ms to minimize.
[2024-05-29 11:10:36] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:10:36] [INFO ] Deduced a trap composed of 72 places in 36 ms of which 1 ms to minimize.
[2024-05-29 11:10:36] [INFO ] Deduced a trap composed of 72 places in 35 ms of which 0 ms to minimize.
[2024-05-29 11:10:36] [INFO ] Deduced a trap composed of 69 places in 40 ms of which 1 ms to minimize.
[2024-05-29 11:10:37] [INFO ] Deduced a trap composed of 130 places in 59 ms of which 1 ms to minimize.
[2024-05-29 11:10:37] [INFO ] Deduced a trap composed of 130 places in 56 ms of which 1 ms to minimize.
[2024-05-29 11:10:37] [INFO ] Deduced a trap composed of 132 places in 56 ms of which 1 ms to minimize.
[2024-05-29 11:10:37] [INFO ] Deduced a trap composed of 131 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/930 variables, 9/377 constraints. Problems are: Problem set: 0 solved, 778 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 930/1712 variables, and 377 constraints, problems are : Problem set: 0 solved, 778 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 330/331 constraints, State Equation: 0/931 constraints, PredecessorRefiner: 0/778 constraints, Known Traps: 47/47 constraints]
After SMT, in 60152ms problems are : Problem set: 0 solved, 778 unsolved
Search for dead transitions found 0 dead transitions in 60159ms
Starting structural reductions in SI_LTL mode, iteration 1 : 931/1834 places, 781/1684 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61460 ms. Remains : 931/1834 places, 781/1684 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLCardinality-10
Product exploration explored 100000 steps with 187 reset in 576 ms.
Product exploration explored 100000 steps with 184 reset in 716 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 : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 159 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 89 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 16 steps (0 resets) in 5 ms. (2 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 174 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 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 931 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 931/931 places, 781/781 transitions.
Applied a total of 0 rules in 21 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
[2024-05-29 11:10:49] [INFO ] Invariant cache hit.
[2024-05-29 11:10:50] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-05-29 11:10:50] [INFO ] Invariant cache hit.
[2024-05-29 11:10:50] [INFO ] Implicit Places using invariants and state equation in 747 ms returned []
Implicit Place search using SMT with State Equation took 1120 ms to find 0 implicit places.
[2024-05-29 11:10:50] [INFO ] Redundant transitions in 8 ms returned []
Running 778 sub problems to find dead transitions.
[2024-05-29 11:10:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/930 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 778 unsolved
[2024-05-29 11:11:08] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-05-29 11:11:09] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-29 11:11:09] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 0 ms to minimize.
[2024-05-29 11:11:09] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:11:09] [INFO ] Deduced a trap composed of 73 places in 37 ms of which 1 ms to minimize.
[2024-05-29 11:11:09] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 1 ms to minimize.
[2024-05-29 11:11:10] [INFO ] Deduced a trap composed of 103 places in 49 ms of which 1 ms to minimize.
[2024-05-29 11:11:10] [INFO ] Deduced a trap composed of 113 places in 57 ms of which 1 ms to minimize.
[2024-05-29 11:11:10] [INFO ] Deduced a trap composed of 129 places in 56 ms of which 1 ms to minimize.
[2024-05-29 11:11:10] [INFO ] Deduced a trap composed of 144 places in 63 ms of which 1 ms to minimize.
[2024-05-29 11:11:11] [INFO ] Deduced a trap composed of 159 places in 69 ms of which 1 ms to minimize.
[2024-05-29 11:11:11] [INFO ] Deduced a trap composed of 175 places in 69 ms of which 2 ms to minimize.
[2024-05-29 11:11:11] [INFO ] Deduced a trap composed of 190 places in 83 ms of which 1 ms to minimize.
[2024-05-29 11:11:11] [INFO ] Deduced a trap composed of 206 places in 82 ms of which 2 ms to minimize.
[2024-05-29 11:11:12] [INFO ] Deduced a trap composed of 219 places in 81 ms of which 1 ms to minimize.
[2024-05-29 11:11:12] [INFO ] Deduced a trap composed of 232 places in 81 ms of which 2 ms to minimize.
[2024-05-29 11:11:12] [INFO ] Deduced a trap composed of 252 places in 92 ms of which 2 ms to minimize.
[2024-05-29 11:11:13] [INFO ] Deduced a trap composed of 267 places in 98 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/930 variables, 18/348 constraints. Problems are: Problem set: 0 solved, 778 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 930/1712 variables, and 348 constraints, problems are : Problem set: 0 solved, 778 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 330/331 constraints, State Equation: 0/931 constraints, PredecessorRefiner: 778/778 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 778 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/930 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 778 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/930 variables, 18/348 constraints. Problems are: Problem set: 0 solved, 778 unsolved
[2024-05-29 11:11:29] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:11:30] [INFO ] Deduced a trap composed of 101 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:11:30] [INFO ] Deduced a trap composed of 105 places in 48 ms of which 1 ms to minimize.
[2024-05-29 11:11:30] [INFO ] Deduced a trap composed of 99 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:11:30] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:11:30] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:11:30] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:11:30] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2024-05-29 11:11:30] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 2 ms to minimize.
[2024-05-29 11:11:30] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2024-05-29 11:11:30] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 1 ms to minimize.
[2024-05-29 11:11:30] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:11:30] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 2 ms to minimize.
[2024-05-29 11:11:30] [INFO ] Deduced a trap composed of 70 places in 48 ms of which 1 ms to minimize.
[2024-05-29 11:11:30] [INFO ] Deduced a trap composed of 70 places in 46 ms of which 1 ms to minimize.
[2024-05-29 11:11:30] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 1 ms to minimize.
[2024-05-29 11:11:30] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 2 ms to minimize.
[2024-05-29 11:11:31] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:11:31] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 1 ms to minimize.
[2024-05-29 11:11:31] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/930 variables, 20/368 constraints. Problems are: Problem set: 0 solved, 778 unsolved
[2024-05-29 11:11:39] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 1 ms to minimize.
[2024-05-29 11:11:39] [INFO ] Deduced a trap composed of 56 places in 34 ms of which 0 ms to minimize.
[2024-05-29 11:11:39] [INFO ] Deduced a trap composed of 72 places in 35 ms of which 1 ms to minimize.
[2024-05-29 11:11:39] [INFO ] Deduced a trap composed of 72 places in 35 ms of which 1 ms to minimize.
[2024-05-29 11:11:39] [INFO ] Deduced a trap composed of 69 places in 34 ms of which 0 ms to minimize.
[2024-05-29 11:11:40] [INFO ] Deduced a trap composed of 130 places in 57 ms of which 2 ms to minimize.
[2024-05-29 11:11:40] [INFO ] Deduced a trap composed of 130 places in 55 ms of which 1 ms to minimize.
[2024-05-29 11:11:40] [INFO ] Deduced a trap composed of 132 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:11:40] [INFO ] Deduced a trap composed of 131 places in 66 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/930 variables, 9/377 constraints. Problems are: Problem set: 0 solved, 778 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 930/1712 variables, and 377 constraints, problems are : Problem set: 0 solved, 778 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 330/331 constraints, State Equation: 0/931 constraints, PredecessorRefiner: 0/778 constraints, Known Traps: 47/47 constraints]
After SMT, in 60153ms problems are : Problem set: 0 solved, 778 unsolved
Search for dead transitions found 0 dead transitions in 60161ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61316 ms. Remains : 931/931 places, 781/781 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 : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 188 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 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 5 steps (0 resets) in 6 ms. (0 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 169 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 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 185 reset in 569 ms.
Product exploration explored 100000 steps with 184 reset in 688 ms.
Built C files in :
/tmp/ltsmin11686160937585490142
[2024-05-29 11:11:52] [INFO ] Computing symmetric may disable matrix : 781 transitions.
[2024-05-29 11:11:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:11:52] [INFO ] Computing symmetric may enable matrix : 781 transitions.
[2024-05-29 11:11:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:11:53] [INFO ] Computing Do-Not-Accords matrix : 781 transitions.
[2024-05-29 11:11:53] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:11:53] [INFO ] Built C files in 111ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11686160937585490142
Running compilation step : cd /tmp/ltsmin11686160937585490142;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2379 ms.
Running link step : cd /tmp/ltsmin11686160937585490142;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin11686160937585490142;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16200184904801937305.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 931 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 931/931 places, 781/781 transitions.
Applied a total of 0 rules in 20 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
[2024-05-29 11:12:07] [INFO ] Invariant cache hit.
[2024-05-29 11:12:08] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-29 11:12:08] [INFO ] Invariant cache hit.
[2024-05-29 11:12:09] [INFO ] Implicit Places using invariants and state equation in 751 ms returned []
Implicit Place search using SMT with State Equation took 1118 ms to find 0 implicit places.
[2024-05-29 11:12:09] [INFO ] Redundant transitions in 8 ms returned []
Running 778 sub problems to find dead transitions.
[2024-05-29 11:12:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/930 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 778 unsolved
[2024-05-29 11:12:26] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-29 11:12:26] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-29 11:12:27] [INFO ] Deduced a trap composed of 42 places in 27 ms of which 0 ms to minimize.
[2024-05-29 11:12:27] [INFO ] Deduced a trap composed of 56 places in 38 ms of which 1 ms to minimize.
[2024-05-29 11:12:27] [INFO ] Deduced a trap composed of 73 places in 40 ms of which 1 ms to minimize.
[2024-05-29 11:12:27] [INFO ] Deduced a trap composed of 85 places in 41 ms of which 1 ms to minimize.
[2024-05-29 11:12:27] [INFO ] Deduced a trap composed of 103 places in 43 ms of which 1 ms to minimize.
[2024-05-29 11:12:28] [INFO ] Deduced a trap composed of 113 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:12:28] [INFO ] Deduced a trap composed of 129 places in 50 ms of which 2 ms to minimize.
[2024-05-29 11:12:28] [INFO ] Deduced a trap composed of 144 places in 63 ms of which 1 ms to minimize.
[2024-05-29 11:12:28] [INFO ] Deduced a trap composed of 159 places in 65 ms of which 2 ms to minimize.
[2024-05-29 11:12:29] [INFO ] Deduced a trap composed of 175 places in 67 ms of which 2 ms to minimize.
[2024-05-29 11:12:29] [INFO ] Deduced a trap composed of 190 places in 68 ms of which 1 ms to minimize.
[2024-05-29 11:12:29] [INFO ] Deduced a trap composed of 206 places in 74 ms of which 2 ms to minimize.
[2024-05-29 11:12:29] [INFO ] Deduced a trap composed of 219 places in 83 ms of which 1 ms to minimize.
[2024-05-29 11:12:30] [INFO ] Deduced a trap composed of 232 places in 87 ms of which 2 ms to minimize.
[2024-05-29 11:12:30] [INFO ] Deduced a trap composed of 252 places in 95 ms of which 2 ms to minimize.
[2024-05-29 11:12:30] [INFO ] Deduced a trap composed of 267 places in 98 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/930 variables, 18/348 constraints. Problems are: Problem set: 0 solved, 778 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 930/1712 variables, and 348 constraints, problems are : Problem set: 0 solved, 778 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 330/331 constraints, State Equation: 0/931 constraints, PredecessorRefiner: 778/778 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 778 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/930 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 778 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/930 variables, 18/348 constraints. Problems are: Problem set: 0 solved, 778 unsolved
[2024-05-29 11:12:47] [INFO ] Deduced a trap composed of 72 places in 40 ms of which 1 ms to minimize.
[2024-05-29 11:12:48] [INFO ] Deduced a trap composed of 101 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:12:48] [INFO ] Deduced a trap composed of 105 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:12:48] [INFO ] Deduced a trap composed of 99 places in 43 ms of which 1 ms to minimize.
[2024-05-29 11:12:48] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:12:48] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:12:48] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-29 11:12:48] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2024-05-29 11:12:48] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 2 ms to minimize.
[2024-05-29 11:12:48] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:12:48] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:12:48] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:12:49] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:12:49] [INFO ] Deduced a trap composed of 70 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:12:49] [INFO ] Deduced a trap composed of 70 places in 53 ms of which 1 ms to minimize.
[2024-05-29 11:12:49] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:12:49] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:12:49] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:12:49] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 1 ms to minimize.
[2024-05-29 11:12:49] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/930 variables, 20/368 constraints. Problems are: Problem set: 0 solved, 778 unsolved
[2024-05-29 11:12:57] [INFO ] Deduced a trap composed of 71 places in 42 ms of which 0 ms to minimize.
[2024-05-29 11:12:57] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 1 ms to minimize.
[2024-05-29 11:12:57] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 1 ms to minimize.
[2024-05-29 11:12:57] [INFO ] Deduced a trap composed of 72 places in 37 ms of which 1 ms to minimize.
[2024-05-29 11:12:58] [INFO ] Deduced a trap composed of 69 places in 43 ms of which 1 ms to minimize.
[2024-05-29 11:12:58] [INFO ] Deduced a trap composed of 130 places in 61 ms of which 1 ms to minimize.
[2024-05-29 11:12:58] [INFO ] Deduced a trap composed of 130 places in 57 ms of which 1 ms to minimize.
[2024-05-29 11:12:58] [INFO ] Deduced a trap composed of 132 places in 55 ms of which 1 ms to minimize.
[2024-05-29 11:12:58] [INFO ] Deduced a trap composed of 131 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/930 variables, 9/377 constraints. Problems are: Problem set: 0 solved, 778 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 930/1712 variables, and 377 constraints, problems are : Problem set: 0 solved, 778 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 330/331 constraints, State Equation: 0/931 constraints, PredecessorRefiner: 0/778 constraints, Known Traps: 47/47 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 778 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61309 ms. Remains : 931/931 places, 781/781 transitions.
Built C files in :
/tmp/ltsmin13036938015157562554
[2024-05-29 11:13:09] [INFO ] Computing symmetric may disable matrix : 781 transitions.
[2024-05-29 11:13:09] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:13:09] [INFO ] Computing symmetric may enable matrix : 781 transitions.
[2024-05-29 11:13:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:13:09] [INFO ] Computing Do-Not-Accords matrix : 781 transitions.
[2024-05-29 11:13:09] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:13:09] [INFO ] Built C files in 110ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13036938015157562554
Running compilation step : cd /tmp/ltsmin13036938015157562554;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2382 ms.
Running link step : cd /tmp/ltsmin13036938015157562554;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin13036938015157562554;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4175780775928140532.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 11:13:24] [INFO ] Flatten gal took : 20 ms
[2024-05-29 11:13:24] [INFO ] Flatten gal took : 19 ms
[2024-05-29 11:13:24] [INFO ] Time to serialize gal into /tmp/LTL6121201041172915188.gal : 3 ms
[2024-05-29 11:13:24] [INFO ] Time to serialize properties into /tmp/LTL5378199982096006046.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6121201041172915188.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17251137380142941879.hoa' '-atoms' '/tmp/LTL5378199982096006046.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5378199982096006046.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17251137380142941879.hoa
Detected timeout of ITS tools.
[2024-05-29 11:13:39] [INFO ] Flatten gal took : 19 ms
[2024-05-29 11:13:39] [INFO ] Flatten gal took : 19 ms
[2024-05-29 11:13:39] [INFO ] Time to serialize gal into /tmp/LTL15033522980785042552.gal : 3 ms
[2024-05-29 11:13:39] [INFO ] Time to serialize properties into /tmp/LTL10857160508935421309.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15033522980785042552.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10857160508935421309.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(p1284==0)"))))
Formula 0 simplified : FG!"(p1284==0)"
Detected timeout of ITS tools.
[2024-05-29 11:13:54] [INFO ] Flatten gal took : 19 ms
[2024-05-29 11:13:54] [INFO ] Applying decomposition
[2024-05-29 11:13:54] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3049871070337133660.txt' '-o' '/tmp/graph3049871070337133660.bin' '-w' '/tmp/graph3049871070337133660.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3049871070337133660.bin' '-l' '-1' '-v' '-w' '/tmp/graph3049871070337133660.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:13:54] [INFO ] Decomposing Gal with order
[2024-05-29 11:13:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:13:54] [INFO ] Removed a total of 180 redundant transitions.
[2024-05-29 11:13:54] [INFO ] Flatten gal took : 54 ms
[2024-05-29 11:13:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 360 labels/synchronizations in 5 ms.
[2024-05-29 11:13:54] [INFO ] Time to serialize gal into /tmp/LTL940114079021793438.gal : 6 ms
[2024-05-29 11:13:54] [INFO ] Time to serialize properties into /tmp/LTL16512502327740134561.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL940114079021793438.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16512502327740134561.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("(i18.i2.u207.p1284==0)"))))
Formula 0 simplified : FG!"(i18.i2.u207.p1284==0)"
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-030B-LTLCardinality-10 finished in 263504 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 4 out of 1834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1834/1834 places, 1684/1684 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 1833 transition count 1473
Reduce places removed 210 places and 0 transitions.
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 1623 transition count 1473
Performed 152 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 152 Pre rules applied. Total rules applied 420 place count 1623 transition count 1321
Deduced a syphon composed of 152 places in 2 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 304 rules applied. Total rules applied 724 place count 1471 transition count 1321
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 726 place count 1469 transition count 1319
Iterating global reduction 2 with 2 rules applied. Total rules applied 728 place count 1469 transition count 1319
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 728 place count 1469 transition count 1317
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 732 place count 1467 transition count 1317
Performed 531 Post agglomeration using F-continuation condition.Transition count delta: 531
Deduced a syphon composed of 531 places in 0 ms
Reduce places removed 531 places and 0 transitions.
Iterating global reduction 2 with 1062 rules applied. Total rules applied 1794 place count 936 transition count 786
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1796 place count 934 transition count 784
Applied a total of 1796 rules in 206 ms. Remains 934 /1834 variables (removed 900) and now considering 784/1684 (removed 900) transitions.
// Phase 1: matrix 784 rows 934 cols
[2024-05-29 11:14:09] [INFO ] Computed 331 invariants in 2 ms
[2024-05-29 11:14:10] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-05-29 11:14:10] [INFO ] Invariant cache hit.
[2024-05-29 11:14:11] [INFO ] Implicit Places using invariants and state equation in 747 ms returned []
Implicit Place search using SMT with State Equation took 1146 ms to find 0 implicit places.
[2024-05-29 11:14:11] [INFO ] Redundant transitions in 26 ms returned []
Running 780 sub problems to find dead transitions.
[2024-05-29 11:14:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 317/317 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:14:28] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-29 11:14:28] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-29 11:14:29] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-05-29 11:14:29] [INFO ] Deduced a trap composed of 56 places in 38 ms of which 0 ms to minimize.
[2024-05-29 11:14:29] [INFO ] Deduced a trap composed of 73 places in 41 ms of which 1 ms to minimize.
[2024-05-29 11:14:29] [INFO ] Deduced a trap composed of 85 places in 51 ms of which 0 ms to minimize.
[2024-05-29 11:14:29] [INFO ] Deduced a trap composed of 103 places in 48 ms of which 1 ms to minimize.
[2024-05-29 11:14:30] [INFO ] Deduced a trap composed of 113 places in 56 ms of which 1 ms to minimize.
[2024-05-29 11:14:30] [INFO ] Deduced a trap composed of 129 places in 62 ms of which 1 ms to minimize.
[2024-05-29 11:14:30] [INFO ] Deduced a trap composed of 144 places in 65 ms of which 2 ms to minimize.
[2024-05-29 11:14:30] [INFO ] Deduced a trap composed of 159 places in 66 ms of which 2 ms to minimize.
[2024-05-29 11:14:31] [INFO ] Deduced a trap composed of 175 places in 72 ms of which 2 ms to minimize.
[2024-05-29 11:14:31] [INFO ] Deduced a trap composed of 190 places in 65 ms of which 1 ms to minimize.
[2024-05-29 11:14:31] [INFO ] Deduced a trap composed of 206 places in 76 ms of which 2 ms to minimize.
[2024-05-29 11:14:32] [INFO ] Deduced a trap composed of 219 places in 81 ms of which 1 ms to minimize.
[2024-05-29 11:14:32] [INFO ] Deduced a trap composed of 232 places in 87 ms of which 2 ms to minimize.
[2024-05-29 11:14:32] [INFO ] Deduced a trap composed of 252 places in 88 ms of which 2 ms to minimize.
[2024-05-29 11:14:32] [INFO ] Deduced a trap composed of 267 places in 101 ms of which 3 ms to minimize.
[2024-05-29 11:14:33] [INFO ] Deduced a trap composed of 277 places in 102 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 19/336 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 932/1718 variables, and 336 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 317/331 constraints, State Equation: 0/934 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 317/317 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 19/336 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:14:50] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2024-05-29 11:14:50] [INFO ] Deduced a trap composed of 142 places in 64 ms of which 2 ms to minimize.
[2024-05-29 11:14:51] [INFO ] Deduced a trap composed of 146 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/932 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:15:03] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 0 ms to minimize.
[2024-05-29 11:15:03] [INFO ] Deduced a trap composed of 41 places in 29 ms of which 1 ms to minimize.
[2024-05-29 11:15:04] [INFO ] Deduced a trap composed of 101 places in 49 ms of which 1 ms to minimize.
[2024-05-29 11:15:04] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-29 11:15:04] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 1 ms to minimize.
[2024-05-29 11:15:04] [INFO ] Deduced a trap composed of 104 places in 41 ms of which 1 ms to minimize.
[2024-05-29 11:15:04] [INFO ] Deduced a trap composed of 101 places in 45 ms of which 1 ms to minimize.
[2024-05-29 11:15:04] [INFO ] Deduced a trap composed of 99 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/932 variables, 8/347 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 932/1718 variables, and 347 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 317/331 constraints, State Equation: 0/934 constraints, PredecessorRefiner: 0/780 constraints, Known Traps: 30/30 constraints]
After SMT, in 60134ms problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 60141ms
Starting structural reductions in SI_LTL mode, iteration 1 : 934/1834 places, 784/1684 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61528 ms. Remains : 934/1834 places, 784/1684 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLCardinality-13
Product exploration explored 100000 steps with 257 reset in 631 ms.
Product exploration explored 100000 steps with 305 reset in 773 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 193 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)]
RANDOM walk for 3201 steps (0 resets) in 35 ms. (88 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 226 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 934 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 934/934 places, 784/784 transitions.
Applied a total of 0 rules in 19 ms. Remains 934 /934 variables (removed 0) and now considering 784/784 (removed 0) transitions.
[2024-05-29 11:15:13] [INFO ] Invariant cache hit.
[2024-05-29 11:15:14] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-29 11:15:14] [INFO ] Invariant cache hit.
[2024-05-29 11:15:14] [INFO ] Implicit Places using invariants and state equation in 735 ms returned []
Implicit Place search using SMT with State Equation took 1107 ms to find 0 implicit places.
[2024-05-29 11:15:14] [INFO ] Redundant transitions in 7 ms returned []
Running 780 sub problems to find dead transitions.
[2024-05-29 11:15:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 317/317 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:15:32] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-05-29 11:15:32] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-29 11:15:32] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 0 ms to minimize.
[2024-05-29 11:15:33] [INFO ] Deduced a trap composed of 56 places in 32 ms of which 1 ms to minimize.
[2024-05-29 11:15:33] [INFO ] Deduced a trap composed of 73 places in 40 ms of which 0 ms to minimize.
[2024-05-29 11:15:33] [INFO ] Deduced a trap composed of 85 places in 50 ms of which 0 ms to minimize.
[2024-05-29 11:15:33] [INFO ] Deduced a trap composed of 103 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:15:33] [INFO ] Deduced a trap composed of 113 places in 55 ms of which 1 ms to minimize.
[2024-05-29 11:15:34] [INFO ] Deduced a trap composed of 129 places in 57 ms of which 1 ms to minimize.
[2024-05-29 11:15:34] [INFO ] Deduced a trap composed of 144 places in 63 ms of which 1 ms to minimize.
[2024-05-29 11:15:34] [INFO ] Deduced a trap composed of 159 places in 67 ms of which 1 ms to minimize.
[2024-05-29 11:15:34] [INFO ] Deduced a trap composed of 175 places in 74 ms of which 1 ms to minimize.
[2024-05-29 11:15:35] [INFO ] Deduced a trap composed of 190 places in 70 ms of which 2 ms to minimize.
[2024-05-29 11:15:35] [INFO ] Deduced a trap composed of 206 places in 85 ms of which 2 ms to minimize.
[2024-05-29 11:15:35] [INFO ] Deduced a trap composed of 219 places in 84 ms of which 2 ms to minimize.
[2024-05-29 11:15:36] [INFO ] Deduced a trap composed of 232 places in 98 ms of which 2 ms to minimize.
[2024-05-29 11:15:36] [INFO ] Deduced a trap composed of 252 places in 90 ms of which 2 ms to minimize.
[2024-05-29 11:15:36] [INFO ] Deduced a trap composed of 267 places in 96 ms of which 2 ms to minimize.
[2024-05-29 11:15:37] [INFO ] Deduced a trap composed of 277 places in 94 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 19/336 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 932/1718 variables, and 336 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 317/331 constraints, State Equation: 0/934 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 317/317 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 19/336 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:15:53] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 4 ms to minimize.
[2024-05-29 11:15:54] [INFO ] Deduced a trap composed of 142 places in 63 ms of which 1 ms to minimize.
[2024-05-29 11:15:54] [INFO ] Deduced a trap composed of 146 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/932 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:16:06] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2024-05-29 11:16:06] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
[2024-05-29 11:16:07] [INFO ] Deduced a trap composed of 101 places in 52 ms of which 1 ms to minimize.
[2024-05-29 11:16:07] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:16:07] [INFO ] Deduced a trap composed of 55 places in 45 ms of which 1 ms to minimize.
[2024-05-29 11:16:07] [INFO ] Deduced a trap composed of 104 places in 47 ms of which 1 ms to minimize.
[2024-05-29 11:16:07] [INFO ] Deduced a trap composed of 101 places in 45 ms of which 1 ms to minimize.
[2024-05-29 11:16:07] [INFO ] Deduced a trap composed of 99 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/932 variables, 8/347 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 932/1718 variables, and 347 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 317/331 constraints, State Equation: 0/934 constraints, PredecessorRefiner: 0/780 constraints, Known Traps: 30/30 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 60146ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61285 ms. Remains : 934/934 places, 784/784 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 163 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 214 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 2577 steps (0 resets) in 26 ms. (95 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 208 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 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 252 reset in 633 ms.
Product exploration explored 100000 steps with 198 reset in 773 ms.
Built C files in :
/tmp/ltsmin12721694889242989768
[2024-05-29 11:16:17] [INFO ] Computing symmetric may disable matrix : 784 transitions.
[2024-05-29 11:16:17] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:16:17] [INFO ] Computing symmetric may enable matrix : 784 transitions.
[2024-05-29 11:16:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:16:17] [INFO ] Computing Do-Not-Accords matrix : 784 transitions.
[2024-05-29 11:16:17] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:16:17] [INFO ] Built C files in 119ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12721694889242989768
Running compilation step : cd /tmp/ltsmin12721694889242989768;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2385 ms.
Running link step : cd /tmp/ltsmin12721694889242989768;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin12721694889242989768;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6359678507940307205.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 934 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 934/934 places, 784/784 transitions.
Applied a total of 0 rules in 20 ms. Remains 934 /934 variables (removed 0) and now considering 784/784 (removed 0) transitions.
[2024-05-29 11:16:32] [INFO ] Invariant cache hit.
[2024-05-29 11:16:32] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-29 11:16:32] [INFO ] Invariant cache hit.
[2024-05-29 11:16:33] [INFO ] Implicit Places using invariants and state equation in 793 ms returned []
Implicit Place search using SMT with State Equation took 1191 ms to find 0 implicit places.
[2024-05-29 11:16:33] [INFO ] Redundant transitions in 7 ms returned []
Running 780 sub problems to find dead transitions.
[2024-05-29 11:16:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 317/317 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:16:51] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-29 11:16:51] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-05-29 11:16:51] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-05-29 11:16:52] [INFO ] Deduced a trap composed of 56 places in 39 ms of which 1 ms to minimize.
[2024-05-29 11:16:52] [INFO ] Deduced a trap composed of 73 places in 45 ms of which 1 ms to minimize.
[2024-05-29 11:16:52] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 1 ms to minimize.
[2024-05-29 11:16:52] [INFO ] Deduced a trap composed of 103 places in 55 ms of which 1 ms to minimize.
[2024-05-29 11:16:53] [INFO ] Deduced a trap composed of 113 places in 58 ms of which 1 ms to minimize.
[2024-05-29 11:16:53] [INFO ] Deduced a trap composed of 129 places in 67 ms of which 1 ms to minimize.
[2024-05-29 11:16:53] [INFO ] Deduced a trap composed of 144 places in 67 ms of which 1 ms to minimize.
[2024-05-29 11:16:53] [INFO ] Deduced a trap composed of 159 places in 73 ms of which 2 ms to minimize.
[2024-05-29 11:16:54] [INFO ] Deduced a trap composed of 175 places in 75 ms of which 1 ms to minimize.
[2024-05-29 11:16:54] [INFO ] Deduced a trap composed of 190 places in 82 ms of which 2 ms to minimize.
[2024-05-29 11:16:54] [INFO ] Deduced a trap composed of 206 places in 86 ms of which 2 ms to minimize.
[2024-05-29 11:16:54] [INFO ] Deduced a trap composed of 219 places in 94 ms of which 2 ms to minimize.
[2024-05-29 11:16:55] [INFO ] Deduced a trap composed of 232 places in 91 ms of which 2 ms to minimize.
[2024-05-29 11:16:55] [INFO ] Deduced a trap composed of 252 places in 101 ms of which 2 ms to minimize.
[2024-05-29 11:16:55] [INFO ] Deduced a trap composed of 267 places in 111 ms of which 3 ms to minimize.
[2024-05-29 11:16:56] [INFO ] Deduced a trap composed of 277 places in 111 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 19/336 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 932/1718 variables, and 336 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 317/331 constraints, State Equation: 0/934 constraints, PredecessorRefiner: 780/780 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/932 variables, 317/317 constraints. Problems are: Problem set: 0 solved, 780 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/932 variables, 19/336 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:17:12] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2024-05-29 11:17:13] [INFO ] Deduced a trap composed of 142 places in 64 ms of which 1 ms to minimize.
[2024-05-29 11:17:13] [INFO ] Deduced a trap composed of 146 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/932 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 780 unsolved
[2024-05-29 11:17:25] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-05-29 11:17:25] [INFO ] Deduced a trap composed of 41 places in 30 ms of which 0 ms to minimize.
[2024-05-29 11:17:25] [INFO ] Deduced a trap composed of 101 places in 45 ms of which 1 ms to minimize.
[2024-05-29 11:17:25] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-29 11:17:26] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:17:26] [INFO ] Deduced a trap composed of 104 places in 43 ms of which 1 ms to minimize.
[2024-05-29 11:17:26] [INFO ] Deduced a trap composed of 101 places in 45 ms of which 1 ms to minimize.
[2024-05-29 11:17:26] [INFO ] Deduced a trap composed of 99 places in 43 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/932 variables, 8/347 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 932/1718 variables, and 347 constraints, problems are : Problem set: 0 solved, 780 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 317/331 constraints, State Equation: 0/934 constraints, PredecessorRefiner: 0/780 constraints, Known Traps: 30/30 constraints]
After SMT, in 60144ms problems are : Problem set: 0 solved, 780 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61376 ms. Remains : 934/934 places, 784/784 transitions.
Built C files in :
/tmp/ltsmin30123201784799428
[2024-05-29 11:17:33] [INFO ] Computing symmetric may disable matrix : 784 transitions.
[2024-05-29 11:17:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:17:33] [INFO ] Computing symmetric may enable matrix : 784 transitions.
[2024-05-29 11:17:33] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:17:33] [INFO ] Computing Do-Not-Accords matrix : 784 transitions.
[2024-05-29 11:17:33] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:17:33] [INFO ] Built C files in 114ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin30123201784799428
Running compilation step : cd /tmp/ltsmin30123201784799428;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2428 ms.
Running link step : cd /tmp/ltsmin30123201784799428;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin30123201784799428;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13441811219821839955.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 11:17:48] [INFO ] Flatten gal took : 19 ms
[2024-05-29 11:17:48] [INFO ] Flatten gal took : 19 ms
[2024-05-29 11:17:48] [INFO ] Time to serialize gal into /tmp/LTL10082952302922794701.gal : 3 ms
[2024-05-29 11:17:48] [INFO ] Time to serialize properties into /tmp/LTL14218170320122557238.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10082952302922794701.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13262989478459974279.hoa' '-atoms' '/tmp/LTL14218170320122557238.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL14218170320122557238.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13262989478459974279.hoa
Detected timeout of ITS tools.
[2024-05-29 11:18:03] [INFO ] Flatten gal took : 19 ms
[2024-05-29 11:18:03] [INFO ] Flatten gal took : 19 ms
[2024-05-29 11:18:03] [INFO ] Time to serialize gal into /tmp/LTL18184970226013413526.gal : 3 ms
[2024-05-29 11:18:03] [INFO ] Time to serialize properties into /tmp/LTL17650445924282167633.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18184970226013413526.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17650445924282167633.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((F("((p1362==0)||(p1555==1))"))&&(F(G("((p1222==0)||(p1719==1))"))))))
Formula 0 simplified : F(G!"((p1362==0)||(p1555==1))" | GF!"((p1222==0)||(p1719==1))")
Detected timeout of ITS tools.
[2024-05-29 11:18:18] [INFO ] Flatten gal took : 21 ms
[2024-05-29 11:18:18] [INFO ] Applying decomposition
[2024-05-29 11:18:18] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17600851929215353922.txt' '-o' '/tmp/graph17600851929215353922.bin' '-w' '/tmp/graph17600851929215353922.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17600851929215353922.bin' '-l' '-1' '-v' '-w' '/tmp/graph17600851929215353922.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:18:19] [INFO ] Decomposing Gal with order
[2024-05-29 11:18:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:18:19] [INFO ] Removed a total of 181 redundant transitions.
[2024-05-29 11:18:19] [INFO ] Flatten gal took : 34 ms
[2024-05-29 11:18:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 356 labels/synchronizations in 5 ms.
[2024-05-29 11:18:19] [INFO ] Time to serialize gal into /tmp/LTL3212847634203966324.gal : 6 ms
[2024-05-29 11:18:19] [INFO ] Time to serialize properties into /tmp/LTL608478232559197635.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3212847634203966324.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL608478232559197635.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((G((F("((i19.i3.u220.p1362==0)||(i22.i1.u253.p1555==1))"))&&(F(G("((i17.i3.u197.p1222==0)||(i25.i1.u278.p1719==1))"))))))
Formula 0 simplified : F(G!"((i19.i3.u220.p1362==0)||(i22.i1.u253.p1555==1))" | GF!"((i17.i3.u197.p1222==0)||(i25.i1.u278.p1719==1))")
Detected timeout of ITS tools.
Treatment of property ShieldPPPs-PT-030B-LTLCardinality-13 finished in 264433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||G(p1)) U !p1))'
Support contains 3 out of 1834 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1834/1834 places, 1684/1684 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 212 place count 1833 transition count 1471
Reduce places removed 212 places and 0 transitions.
Iterating post reduction 1 with 212 rules applied. Total rules applied 424 place count 1621 transition count 1471
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 424 place count 1621 transition count 1321
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 724 place count 1471 transition count 1321
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 725 place count 1470 transition count 1320
Iterating global reduction 2 with 1 rules applied. Total rules applied 726 place count 1470 transition count 1320
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 726 place count 1470 transition count 1319
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 728 place count 1469 transition count 1319
Performed 534 Post agglomeration using F-continuation condition.Transition count delta: 534
Deduced a syphon composed of 534 places in 1 ms
Reduce places removed 534 places and 0 transitions.
Iterating global reduction 2 with 1068 rules applied. Total rules applied 1796 place count 935 transition count 785
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1798 place count 933 transition count 783
Applied a total of 1798 rules in 199 ms. Remains 933 /1834 variables (removed 901) and now considering 783/1684 (removed 901) transitions.
// Phase 1: matrix 783 rows 933 cols
[2024-05-29 11:18:34] [INFO ] Computed 331 invariants in 5 ms
[2024-05-29 11:18:34] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-05-29 11:18:34] [INFO ] Invariant cache hit.
[2024-05-29 11:18:35] [INFO ] Implicit Places using invariants and state equation in 796 ms returned []
Implicit Place search using SMT with State Equation took 1170 ms to find 0 implicit places.
[2024-05-29 11:18:35] [INFO ] Redundant transitions in 7 ms returned []
Running 781 sub problems to find dead transitions.
[2024-05-29 11:18:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/933 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2024-05-29 11:18:53] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-29 11:18:53] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-29 11:18:53] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 0 ms to minimize.
[2024-05-29 11:18:53] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 1 ms to minimize.
[2024-05-29 11:18:53] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 1 ms to minimize.
[2024-05-29 11:18:54] [INFO ] Deduced a trap composed of 85 places in 50 ms of which 1 ms to minimize.
[2024-05-29 11:18:54] [INFO ] Deduced a trap composed of 103 places in 54 ms of which 1 ms to minimize.
[2024-05-29 11:18:54] [INFO ] Deduced a trap composed of 113 places in 57 ms of which 1 ms to minimize.
[2024-05-29 11:18:54] [INFO ] Deduced a trap composed of 129 places in 63 ms of which 1 ms to minimize.
[2024-05-29 11:18:55] [INFO ] Deduced a trap composed of 144 places in 65 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/933 variables, 10/341 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 933/1716 variables, and 341 constraints, problems are : Problem set: 0 solved, 781 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 781/781 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 781 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/933 variables, 331/331 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/933 variables, 10/341 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/933 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 3 (OVERLAPS) 783/1716 variables, 933/1274 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1716 variables, 781/2055 constraints. Problems are: Problem set: 0 solved, 781 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1716/1716 variables, and 2055 constraints, problems are : Problem set: 0 solved, 781 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 331/331 constraints, State Equation: 933/933 constraints, PredecessorRefiner: 781/781 constraints, Known Traps: 10/10 constraints]
After SMT, in 60154ms problems are : Problem set: 0 solved, 781 unsolved
Search for dead transitions found 0 dead transitions in 60161ms
Starting structural reductions in SI_LTL mode, iteration 1 : 933/1834 places, 783/1684 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61544 ms. Remains : 933/1834 places, 783/1684 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), p1, (OR (NOT p0) p1), true]
Running random walk in product with property : ShieldPPPs-PT-030B-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 553 steps with 0 reset in 9 ms.
FORMULA ShieldPPPs-PT-030B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-030B-LTLCardinality-14 finished in 61707 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(p1))||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' '!(((F(p0)&&F(p1)) U 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' '!((X(F(p0)) U 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' '!(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)))'
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)))))'
[2024-05-29 11:19:36] [INFO ] Flatten gal took : 32 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13304506149208663798
[2024-05-29 11:19:36] [INFO ] Too many transitions (1684) to apply POR reductions. Disabling POR matrices.
[2024-05-29 11:19:36] [INFO ] Applying decomposition
[2024-05-29 11:19:36] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13304506149208663798
Running compilation step : cd /tmp/ltsmin13304506149208663798;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '120' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 11:19:36] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6857871779982521770.txt' '-o' '/tmp/graph6857871779982521770.bin' '-w' '/tmp/graph6857871779982521770.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6857871779982521770.bin' '-l' '-1' '-v' '-w' '/tmp/graph6857871779982521770.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:19:36] [INFO ] Decomposing Gal with order
[2024-05-29 11:19:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:19:36] [INFO ] Removed a total of 270 redundant transitions.
[2024-05-29 11:19:36] [INFO ] Flatten gal took : 58 ms
[2024-05-29 11:19:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-29 11:19:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality7019370525211364234.gal : 16 ms
[2024-05-29 11:19:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality124480390328571157.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7019370525211364234.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality124480390328571157.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 6 LTL properties
Checking formula 0 : !((G(("((i28.u689.p1950==0)||(i4.i0.i1.u111.p310==1))")||(X(X("(((i15.i1.i0.u374.p1054==0)||(i6.u166.p462==1))||((i28.u689.p1950==0)||...187
Formula 0 simplified : F(!"((i28.u689.p1950==0)||(i4.i0.i1.u111.p310==1))" & XX!"(((i15.i1.i0.u374.p1054==0)||(i6.u166.p462==1))||((i28.u689.p1950==0)||(i4...179
Compilation finished in 4083 ms.
Running link step : cd /tmp/ltsmin13304506149208663798;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin13304506149208663798;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X(X((LTLAPp1==true)))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin13304506149208663798;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X(X((LTLAPp1==true)))||(LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13304506149208663798;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '((<>((LTLAPp2==true))&&<>((LTLAPp3==true))) U (LTLAPp2==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin13304506149208663798;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '((<>((LTLAPp2==true))&&<>((LTLAPp3==true))) U (LTLAPp2==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13304506149208663798;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>((LTLAPp4==true))) U [](!(LTLAPp5==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin13304506149208663798;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>((LTLAPp4==true))) U [](!(LTLAPp5==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13304506149208663798;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp6==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin13304506149208663798;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp6==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13304506149208663798;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp7==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin13304506149208663798;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp7==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13304506149208663798;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp8==true))&&<>([]((LTLAPp9==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin13304506149208663798;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp8==true))&&<>([]((LTLAPp9==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 4800 s
Running LTSmin : cd /tmp/ltsmin13304506149208663798;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X(X((LTLAPp1==true)))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>800 s) on command cd /tmp/ltsmin13304506149208663798;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X(X((LTLAPp1==true)))||(LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13304506149208663798;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '((<>((LTLAPp2==true))&&<>((LTLAPp3==true))) U (LTLAPp2==true))' '--buchi-type=spotba'
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-030B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ShieldPPPs-PT-030B, 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 r356-tall-171683761200475"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-030B.tgz
mv ShieldPPPs-PT-030B 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 ;