About the Execution of ITS-Tools for ShieldIIPs-PT-050A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15041.640 | 3600000.00 | 8945841.00 | 4591.30 | FTTFFFF?FTFF??T? | 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-171683760500147.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 ShieldIIPs-PT-050A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760500147
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K 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.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 15:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 15:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 15:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 15:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 426K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-050A-LTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-050A-LTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-050A-LTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-050A-LTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-050A-LTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-050A-LTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-050A-LTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-050A-LTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-050A-LTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-050A-LTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-050A-LTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-050A-LTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-050A-LTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-050A-LTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-050A-LTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-050A-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716913683177
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-050A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-28 16:28:04] [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-28 16:28:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 16:28:04] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2024-05-28 16:28:04] [INFO ] Transformed 1253 places.
[2024-05-28 16:28:04] [INFO ] Transformed 1203 transitions.
[2024-05-28 16:28:04] [INFO ] Found NUPN structural information;
[2024-05-28 16:28:04] [INFO ] Parsed PT model containing 1253 places and 1203 transitions and 5406 arcs in 261 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPs-PT-050A-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050A-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050A-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050A-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050A-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050A-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050A-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 118 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-05-28 16:28:04] [INFO ] Computed 451 invariants in 22 ms
[2024-05-28 16:28:05] [INFO ] Implicit Places using invariants in 879 ms returned []
[2024-05-28 16:28:05] [INFO ] Invariant cache hit.
[2024-05-28 16:28:07] [INFO ] Implicit Places using invariants and state equation in 1397 ms returned []
Implicit Place search using SMT with State Equation took 2303 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:28:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30051 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:28:59] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 9 ms to minimize.
[2024-05-28 16:28:59] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
[2024-05-28 16:29:00] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:29:00] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:29:00] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 16:29:00] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:29:00] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:29:01] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2024-05-28 16:29:01] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-28 16:29:01] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-05-28 16:29:01] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 5 ms to minimize.
[2024-05-28 16:29:02] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-05-28 16:29:02] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:29:02] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-28 16:29:03] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-05-28 16:29:03] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-28 16:29:03] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2024-05-28 16:29:03] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:29:04] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2024-05-28 16:29:04] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 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 1253/2456 variables, and 1724 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30018 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 20/20 constraints]
After SMT, in 60638ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60664ms
Finished structural reductions in LTL mode , in 1 iterations and 63112 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Support contains 25 out of 1253 places after structural reductions.
[2024-05-28 16:29:08] [INFO ] Flatten gal took : 197 ms
[2024-05-28 16:29:08] [INFO ] Flatten gal took : 94 ms
[2024-05-28 16:29:08] [INFO ] Input system was already deterministic with 1203 transitions.
Support contains 23 out of 1253 places (down from 25) after GAL structural reductions.
RANDOM walk for 40000 steps (13 resets) in 1525 ms. (26 steps per ms) remains 1/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 524 ms. (76 steps per ms) remains 1/1 properties
[2024-05-28 16:29:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/14 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1239/1253 variables, 446/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1253 variables, 1239/1704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:29:09] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:29:09] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:29:09] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1253 variables, 3/1707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1253 variables, 0/1707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1203/2456 variables, 1253/2960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:29:10] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 4 ms to minimize.
[2024-05-28 16:29:10] [INFO ] Deduced a trap composed of 18 places in 221 ms of which 4 ms to minimize.
[2024-05-28 16:29:10] [INFO ] Deduced a trap composed of 18 places in 224 ms of which 4 ms to minimize.
[2024-05-28 16:29:10] [INFO ] Deduced a trap composed of 36 places in 214 ms of which 4 ms to minimize.
[2024-05-28 16:29:11] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 4 ms to minimize.
[2024-05-28 16:29:11] [INFO ] Deduced a trap composed of 15 places in 234 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2456 variables, 6/2966 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2456 variables, 0/2966 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/2456 variables, 0/2966 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2456/2456 variables, and 2966 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2564 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 1253/1253 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 10/14 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1239/1253 variables, 446/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1253 variables, 1239/1704 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1253 variables, 9/1713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:29:11] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:29:11] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 16:29:12] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1253 variables, 3/1716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1253 variables, 0/1716 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1203/2456 variables, 1253/2969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2456 variables, 1/2970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 16:29:12] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:29:12] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2456 variables, 2/2972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2456 variables, 0/2972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2456 variables, 0/2972 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2456/2456 variables, and 2972 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1317 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 1253/1253 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 14/14 constraints]
After SMT, in 3898ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 99478 steps, including 910 resets, run visited all 1 properties in 928 ms. (steps per millisecond=107 )
Parikh walk visited 1 properties in 937 ms.
FORMULA ShieldIIPs-PT-050A-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1252 transition count 1201
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1250 transition count 1201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 1249 transition count 1200
Applied a total of 5 rules in 141 ms. Remains 1249 /1253 variables (removed 4) and now considering 1200/1203 (removed 3) transitions.
// Phase 1: matrix 1200 rows 1249 cols
[2024-05-28 16:29:14] [INFO ] Computed 450 invariants in 6 ms
[2024-05-28 16:29:14] [INFO ] Implicit Places using invariants in 603 ms returned []
[2024-05-28 16:29:14] [INFO ] Invariant cache hit.
[2024-05-28 16:29:16] [INFO ] Implicit Places using invariants and state equation in 1215 ms returned []
Implicit Place search using SMT with State Equation took 1819 ms to find 0 implicit places.
[2024-05-28 16:29:16] [INFO ] Redundant transitions in 186 ms returned [1194]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1198 sub problems to find dead transitions.
// Phase 1: matrix 1199 rows 1249 cols
[2024-05-28 16:29:16] [INFO ] Computed 450 invariants in 11 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:29:37] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:29:37] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:29:37] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-28 16:29:38] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:29:38] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 16:29:38] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 2 ms to minimize.
[2024-05-28 16:29:38] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:29:39] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
[2024-05-28 16:29:39] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:29:39] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:29:39] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:29:39] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-28 16:29:40] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:29:40] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-28 16:29:40] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-05-28 16:29:41] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:29:41] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:29:41] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:29:41] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:29:42] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 20/1719 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:29:46] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2024-05-28 16:29:46] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 4 ms to minimize.
[2024-05-28 16:29:46] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2448 variables, and 1722 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30028 ms.
Refiners :[Domain max(s): 1249/1249 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1249 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 23/1722 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:29:51] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 2 ms to minimize.
[2024-05-28 16:29:52] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 3 ms to minimize.
[2024-05-28 16:29:52] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 2 ms to minimize.
[2024-05-28 16:29:52] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:29:53] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:29:53] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 2 ms to minimize.
[2024-05-28 16:29:54] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 2 ms to minimize.
[2024-05-28 16:29:54] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 2 ms to minimize.
[2024-05-28 16:29:54] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 3 ms to minimize.
[2024-05-28 16:29:55] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 3 ms to minimize.
[2024-05-28 16:29:55] [INFO ] Deduced a trap composed of 22 places in 183 ms of which 3 ms to minimize.
[2024-05-28 16:29:56] [INFO ] Deduced a trap composed of 22 places in 191 ms of which 3 ms to minimize.
[2024-05-28 16:29:56] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 3 ms to minimize.
[2024-05-28 16:29:56] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 3 ms to minimize.
[2024-05-28 16:29:57] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 4 ms to minimize.
[2024-05-28 16:29:57] [INFO ] Deduced a trap composed of 22 places in 185 ms of which 3 ms to minimize.
[2024-05-28 16:29:58] [INFO ] Deduced a trap composed of 14 places in 191 ms of which 4 ms to minimize.
[2024-05-28 16:29:58] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 4 ms to minimize.
[2024-05-28 16:29:59] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 4 ms to minimize.
[2024-05-28 16:29:59] [INFO ] Deduced a trap composed of 14 places in 210 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1249 variables, 20/1742 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:30:08] [INFO ] Deduced a trap composed of 14 places in 213 ms of which 4 ms to minimize.
[2024-05-28 16:30:08] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 4 ms to minimize.
[2024-05-28 16:30:08] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 4 ms to minimize.
[2024-05-28 16:30:09] [INFO ] Deduced a trap composed of 22 places in 229 ms of which 4 ms to minimize.
[2024-05-28 16:30:10] [INFO ] Deduced a trap composed of 14 places in 227 ms of which 4 ms to minimize.
[2024-05-28 16:30:10] [INFO ] Deduced a trap composed of 14 places in 240 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1249/2448 variables, and 1748 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30025 ms.
Refiners :[Domain max(s): 1249/1249 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1249 constraints, PredecessorRefiner: 0/1198 constraints, Known Traps: 49/49 constraints]
After SMT, in 60409ms problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 60420ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1249/1253 places, 1199/1203 transitions.
Applied a total of 0 rules in 52 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62633 ms. Remains : 1249/1253 places, 1199/1203 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLCardinality-00
Stuttering criterion allowed to conclude after 2538 steps with 0 reset in 39 ms.
FORMULA ShieldIIPs-PT-050A-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050A-LTLCardinality-00 finished in 62913 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(G(p0)))'
Support contains 1 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 27 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-05-28 16:30:17] [INFO ] Computed 451 invariants in 12 ms
[2024-05-28 16:30:17] [INFO ] Implicit Places using invariants in 602 ms returned []
[2024-05-28 16:30:17] [INFO ] Invariant cache hit.
[2024-05-28 16:30:19] [INFO ] Implicit Places using invariants and state equation in 1352 ms returned []
Implicit Place search using SMT with State Equation took 1958 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:30:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30026 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:31:11] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-28 16:31:11] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:31:11] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-28 16:31:11] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:31:11] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-28 16:31:12] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:31:12] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2024-05-28 16:31:12] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:31:12] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:31:13] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:31:13] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:31:13] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 2 ms to minimize.
[2024-05-28 16:31:13] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:31:13] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-28 16:31:14] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:31:14] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-28 16:31:14] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-05-28 16:31:15] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-05-28 16:31:15] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:31:15] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:31:19] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1725 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30021 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 21/21 constraints]
After SMT, in 60433ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60444ms
Finished structural reductions in LTL mode , in 1 iterations and 62433 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 680 steps with 0 reset in 11 ms.
FORMULA ShieldIIPs-PT-050A-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050A-LTLCardinality-03 finished in 62551 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))'
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 120 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-28 16:31:19] [INFO ] Computed 451 invariants in 4 ms
[2024-05-28 16:31:20] [INFO ] Implicit Places using invariants in 680 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 684 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 1201/1203 transitions.
Applied a total of 0 rules in 38 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 855 ms. Remains : 1250/1253 places, 1201/1203 transitions.
Stuttering acceptance computed with spot in 41 ms :[p0]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLCardinality-04
Stuttering criterion allowed to conclude after 28601 steps with 13 reset in 308 ms.
FORMULA ShieldIIPs-PT-050A-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050A-LTLCardinality-04 finished in 1225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 135 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
[2024-05-28 16:31:20] [INFO ] Invariant cache hit.
[2024-05-28 16:31:21] [INFO ] Implicit Places using invariants in 663 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 664 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 1201/1203 transitions.
Applied a total of 0 rules in 38 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 837 ms. Remains : 1250/1253 places, 1201/1203 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLCardinality-05
Stuttering criterion allowed to conclude after 2514 steps with 0 reset in 27 ms.
FORMULA ShieldIIPs-PT-050A-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-050A-LTLCardinality-05 finished in 1010 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)))'
Support contains 1 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 18 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-05-28 16:31:21] [INFO ] Computed 451 invariants in 5 ms
[2024-05-28 16:31:22] [INFO ] Implicit Places using invariants in 592 ms returned []
[2024-05-28 16:31:22] [INFO ] Invariant cache hit.
[2024-05-28 16:31:23] [INFO ] Implicit Places using invariants and state equation in 1388 ms returned []
Implicit Place search using SMT with State Equation took 1980 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:31:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30021 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:32:15] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:32:15] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 16:32:16] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:32:16] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:32:16] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:32:16] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:32:16] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:32:17] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:32:17] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:32:17] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:32:17] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-05-28 16:32:17] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:32:18] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-28 16:32:18] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-28 16:32:18] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-28 16:32:19] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-05-28 16:32:19] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:32:19] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:32:19] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-05-28 16:32:20] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:32:24] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
(s858 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 0)
(s36 1)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 0)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 1)
(s85 0)
(s86 1)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 0)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 1)
(s135 0)
(s136 1)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 1)
(s160 0)
(s161 1)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 0)
(s172 1)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 1)
(s185 0)
(s186 1)
(s187 0)
(s188 1)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 0)
(s197 1)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 1)
(s210 0)
(s211 1)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 1)
(s217 0)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 1)
(s223 0)
(s224 0)
(s225 0)
(s226 1)
(s227 0)
(s228 1)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 1)
(s235 0)
(s236 1)
(s237 0)
(s238 1)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 1)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 1)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 1)
(s260 0)
(s261 1)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 1)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 1)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 1)
(s283 0)
(s284 1)
(s285 0)
(s286 1)
(s287 0)
(s288 1)
(s289 0)
(s290 0)
(s291 1)
(s292 0)
(s293 1)
(s294 0)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 0)
(s307 1)
(s308 0)
(s309 1)
(s310 0)
(s311 1)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 1)
(s317 0)
(s318 1)
(s319 0)
(s320 0)
(s321 0)
(s322 1)
(s323 0)
(s324 0)
(s325 0)
(s326 1)
(s327 0)
(s328 1)
(s329 0)
(s330 0)
(s331 0)
(s332 1)
(s333 0)
(s334 1)
(s335 0)
(s336 1)
(s337 0)
(s338 1)
(s339 0)
(s340 0)
(s341 1)
(s342 0)
(s343 1)
(s344 0)
(s345 0)
(s346 0)
(s347 1)
(s348 0)
(s349 0)
(s350 0)
(s351 1)
(s352 0)
(s353 1)
(s354 0)
(s355 0)
(s356 0)
(s357 1)
(s358 0)
(s359 1)
(s360 0)
(s361 1)
(s362 0)
(s363 1)
(s364 0)
(s365 0)
(s366 1)
(s367 0)
(s368 1)
(s369 0)
(s370 0)
(s371 0)
(s372 1)
(s373 0)
(s374 0)
(s375 0)
(s376 1)
(s377 0)
(s378 1)
(s379 0)
(s380 0)
(s381 0)
(s382 1)
(s383 0)
(s384 1)
(s385 0)
(s386 1)
(s387 0)
(s388 1)
(s389 0)
(s390 0)
(s391 1)
(s392 0)
(s393 1)
(s394 0)
(s395 0)
(s396 0)
(s397 1)
(s398 0)
(s399 0)
(s400 0)
(s401 1)
(s402 0)
(s403 1)
(s404 0)
(s405 0)
(s406 0)
(s407 1)
(s408 0)
(s409 1)
(s410 0)
(s411 1)
(s412 0)
(s413 1)
(s414 0)
(s415 0)
(s416 1)
(s417 0)
(s418 1)
(s419 0)
(s420 0)
(s421 0)
(s422 1)
(s423 0)
(s424 0)
(s425 0)
(s426 1)
(s427 0)
(s428 1)
(s429 0)
(s430 0)
(s431 0)
(s432 1)
(s433 0)
(s434 1)
(s435 0)
(s436 1)
(s437 0)
(s438 1)
(s439 0)
(s440 0)
(s441 1)
(s442 0)
(s443 1)
(s444 0)
(s445 0)
(s446 0)
(s447 1)
(s448 0)
(s449 0)
(s450 0)
(s451 1)
(s452 0)
(s453 1)
(s454 0)
(s455 0)
(s456 0)
(s457 1)
(s458 0)
(s459 1)
(s460 0)
(s461 1)
(s462 0)
(s463 1)
(s464 0)
(s465 0)
(s466 1)
(s467 0)
(s468 1)
(s469 0)
(s470 0)
(s471 0)
(s472 1)
(s473 0)
(s474 0)
(s475 0)
(s476 1)
(s477 0)
(s478 1)
(s479 0)
(s480 0)
(s481 0)
(s482 1)
(s483 0)
(s484 1)
(s485 0)
(s486 1)
(s487 0)
(s488 1)
(s489 0)
(s490 0)
(s491 1)
(s492 0)
(s493 1)
(s494 0)
(s495 0)
(s496 0)
(s497 1)
(s498 0)
(s499 0)
(s500 0)
(s501 1)
(s502 0)
(s503 1)
(s504 0)
(s505 0)
(s506 0)
(s507 1)
(s508 0)
(s509 1)
(s510 0)
(s511 1)
(s512 0)
(s513 1)
(s514 0)
(s515 0)
(s516 1)
(s517 0)
(s518 1)
(s519 0)
(s520 0)
(s521 0)
(s522 1)
(s523 0)
(s524 0)
(s525 0)
(s526 1)
(s527 0)
(s528 1)
(s529 0)
(s530 0)
(s531 0)
(s532 1)
(s533 0)
(s534 1)
(s535 0)
(s536 1)
(s537 0)
(s538 1)
(s539 0)
(s540 0)
(s541 1)
(s542 0)
(s543 1)
(s544 0)
(s545 0)
(s546 0)
(s547 1)
(s548 0)
(s549 0)
(s550 0)
(s551 1)
(s552 0)
(s553 1)
(s554 0)
(s555 0)
(s556 0)
(s557 1)
(s558 0)
(s559 1)
(s560 0)
(s561 1)
(s562 0)
(s563 1)
(s564 0)
(s565 1)
(s566 0)
(s567 0)
(s568 1)
(s569 0)
(s570 0)
(s571 1)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 1)
(s578 1)
(s579 0)
(s580 1)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 1)
(s587 0)
(s588 1)
(s589 0)
(s590 1)
(s591 0)
(s592 0)
(s593 1)
(s594 0)
(s595 0)
(s596 1)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 1)
(s603 1)
(s604 0)
(s605 1)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 1)
(s612 0)
(s613 1)
(s614 0)
(s615 1)
(s616 0)
(s617 0)
(s618 1)
(s619 0)
(s620 0)
(s621 1)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 1)
(s628 1)
(s629 0)
(s630 1)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 1)
(s637 0)
(s638 1)
(s639 0)
(s640 1)
(s641 0)
(s642 0)
(s643 1)
(s644 0)
(s645 0)
(s646 1)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 1)
(s653 1)
(s654 0)
(s655 1)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 1)
(s662 0)
(s663 1)
(s664 0)
(s665 1)
(s666 0)
(s667 0)
(s668 1)
(s669 0)
(s670 0)
(s671 1)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 1)
(s678 1)
(s679 0)
(s680 1)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 1)
(s687 0)
(s688 1)
(s689 0)
(s690 1)
(s691 0)
(s692 0)
(s693 1)
(s694 0)
(s695 0)
(s696 1)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 1)
(s703 1)
(s704 0)
(s705 1)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 1)
(s712 0)
(s713 1)
(s714 0)
(s715 1)
(s716 0)
(s717 0)
(s718 1)
(s719 0)
(s720 0)
(s721 1)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 1)
(s728 1)
(s729 0)
(s730 1)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 1)
(s737 0)
(s738 1)
(s739 0)
(s740 1)
(s741 0)
(s742 0)
(s743 1)
(s744 0)
(s745 0)
(s746 1)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 1)
(s753 1)
(s754 0)
(s755 1)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 1)
(s762 0)
(s763 1)
(s764 0)
(s765 1)
(s766 0)
(s767 0)
(s768 1)
(s769 0)
(s770 0)
(s771 1)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 1)
(s778 1)
(s779 0)
(s780 1)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 1)
(s787 0)
(s788 1)
(s789 0)
(s790 1)
(s791 0)
(s792 0)
(s793 1)
(s794 0)
(s795 0)
(s796 1)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 1)
(s803 1)
(s804 0)
(s805 1)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 1)
(s812 0)
(s813 1)
(s814 0)
(s815 1)
(s816 0)
(s817 0)
(s818 1)
(s819 0)
(s820 0)
(s821 1)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 1)
(s828 1)
(s829 0)
(s830 1)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 1)
(s837 0)
(s838 1)
(s839 0)
(s840 1)
(s841 0)
(s842 0)
(s843 1)
(s844 0)
(s845 0)
(s846 1)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 1)
(s853 1)
(s854 0)
(s855 1)
(s856 0)
(s857 0)
(s858 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1725 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30038 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 21/21 constraints]
After SMT, in 60411ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60425ms
Finished structural reductions in LTL mode , in 1 iterations and 62428 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLCardinality-07
Product exploration explored 100000 steps with 44 reset in 933 ms.
Product exploration explored 100000 steps with 44 reset in 1107 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 9276 steps (0 resets) in 162 ms. (56 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 79 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 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
[2024-05-28 16:32:26] [INFO ] Invariant cache hit.
[2024-05-28 16:32:27] [INFO ] [Real]Absence check using 451 positive place invariants in 257 ms returned sat
[2024-05-28 16:32:31] [INFO ] [Real]Absence check using state equation in 3538 ms returned sat
[2024-05-28 16:32:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:32:32] [INFO ] [Nat]Absence check using 451 positive place invariants in 220 ms returned sat
[2024-05-28 16:32:35] [INFO ] [Nat]Absence check using state equation in 2761 ms returned sat
[2024-05-28 16:32:35] [INFO ] Computed and/alt/rep : 1104/3823/1104 causal constraints (skipped 98 transitions) in 68 ms.
Could not prove EG (NOT p0)
Support contains 1 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1252 transition count 1201
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1250 transition count 1201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 1249 transition count 1200
Applied a total of 5 rules in 62 ms. Remains 1249 /1253 variables (removed 4) and now considering 1200/1203 (removed 3) transitions.
// Phase 1: matrix 1200 rows 1249 cols
[2024-05-28 16:32:46] [INFO ] Computed 450 invariants in 10 ms
[2024-05-28 16:32:47] [INFO ] Implicit Places using invariants in 599 ms returned []
[2024-05-28 16:32:47] [INFO ] Invariant cache hit.
[2024-05-28 16:32:48] [INFO ] Implicit Places using invariants and state equation in 1340 ms returned []
Implicit Place search using SMT with State Equation took 1942 ms to find 0 implicit places.
[2024-05-28 16:32:48] [INFO ] Redundant transitions in 120 ms returned [1194]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1198 sub problems to find dead transitions.
// Phase 1: matrix 1199 rows 1249 cols
[2024-05-28 16:32:48] [INFO ] Computed 450 invariants in 10 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:33:10] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-28 16:33:10] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:33:10] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:33:10] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:33:10] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:33:11] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:33:11] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:33:11] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:33:11] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:33:12] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:33:12] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:33:12] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:33:12] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-05-28 16:33:12] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-05-28 16:33:13] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-28 16:33:13] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-28 16:33:13] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 3 ms to minimize.
[2024-05-28 16:33:14] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-05-28 16:33:14] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:33:14] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 20/1719 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:33:18] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:33:18] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:33:18] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2448 variables, and 1722 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30023 ms.
Refiners :[Domain max(s): 1249/1249 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1249 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 23/1722 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:33:24] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
[2024-05-28 16:33:24] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 2 ms to minimize.
[2024-05-28 16:33:24] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
[2024-05-28 16:33:25] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 3 ms to minimize.
[2024-05-28 16:33:25] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 2 ms to minimize.
[2024-05-28 16:33:25] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 3 ms to minimize.
[2024-05-28 16:33:26] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 3 ms to minimize.
[2024-05-28 16:33:26] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 3 ms to minimize.
[2024-05-28 16:33:26] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 3 ms to minimize.
[2024-05-28 16:33:27] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 3 ms to minimize.
[2024-05-28 16:33:27] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 3 ms to minimize.
[2024-05-28 16:33:28] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 3 ms to minimize.
[2024-05-28 16:33:28] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 4 ms to minimize.
[2024-05-28 16:33:28] [INFO ] Deduced a trap composed of 22 places in 172 ms of which 3 ms to minimize.
[2024-05-28 16:33:29] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 3 ms to minimize.
[2024-05-28 16:33:29] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 4 ms to minimize.
[2024-05-28 16:33:30] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 3 ms to minimize.
[2024-05-28 16:33:30] [INFO ] Deduced a trap composed of 14 places in 206 ms of which 4 ms to minimize.
[2024-05-28 16:33:31] [INFO ] Deduced a trap composed of 14 places in 199 ms of which 4 ms to minimize.
[2024-05-28 16:33:31] [INFO ] Deduced a trap composed of 14 places in 203 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1249 variables, 20/1742 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:33:40] [INFO ] Deduced a trap composed of 14 places in 233 ms of which 4 ms to minimize.
[2024-05-28 16:33:40] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 4 ms to minimize.
[2024-05-28 16:33:41] [INFO ] Deduced a trap composed of 30 places in 217 ms of which 4 ms to minimize.
[2024-05-28 16:33:41] [INFO ] Deduced a trap composed of 22 places in 238 ms of which 4 ms to minimize.
[2024-05-28 16:33:42] [INFO ] Deduced a trap composed of 14 places in 239 ms of which 4 ms to minimize.
[2024-05-28 16:33:42] [INFO ] Deduced a trap composed of 14 places in 231 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1249/2448 variables, and 1748 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30024 ms.
Refiners :[Domain max(s): 1249/1249 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1249 constraints, PredecessorRefiner: 0/1198 constraints, Known Traps: 49/49 constraints]
After SMT, in 60306ms problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 60317ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1249/1253 places, 1199/1203 transitions.
Applied a total of 0 rules in 34 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62484 ms. Remains : 1249/1253 places, 1199/1203 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 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 122 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 9185 steps (0 resets) in 108 ms. (84 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 97 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 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
[2024-05-28 16:33:49] [INFO ] Invariant cache hit.
[2024-05-28 16:33:50] [INFO ] [Real]Absence check using 450 positive place invariants in 241 ms returned sat
[2024-05-28 16:33:53] [INFO ] [Real]Absence check using state equation in 3016 ms returned sat
[2024-05-28 16:33:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:33:54] [INFO ] [Nat]Absence check using 450 positive place invariants in 212 ms returned sat
[2024-05-28 16:33:57] [INFO ] [Nat]Absence check using state equation in 3115 ms returned sat
[2024-05-28 16:33:57] [INFO ] Computed and/alt/rep : 1198/2987/1198 causal constraints (skipped 0 transitions) in 60 ms.
[2024-05-28 16:34:08] [INFO ] Added : 485 causal constraints over 97 iterations in 10810 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 44 reset in 872 ms.
Product exploration explored 100000 steps with 44 reset in 1147 ms.
Built C files in :
/tmp/ltsmin93532902752156870
[2024-05-28 16:34:10] [INFO ] Computing symmetric may disable matrix : 1199 transitions.
[2024-05-28 16:34:10] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:34:10] [INFO ] Computing symmetric may enable matrix : 1199 transitions.
[2024-05-28 16:34:10] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:34:11] [INFO ] Computing Do-Not-Accords matrix : 1199 transitions.
[2024-05-28 16:34:11] [INFO ] Computation of Completed DNA matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:34:11] [INFO ] Built C files in 253ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin93532902752156870
Running compilation step : cd /tmp/ltsmin93532902752156870;'/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/ltsmin93532902752156870;'/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/ltsmin93532902752156870;'/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 1 out of 1249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1249/1249 places, 1199/1199 transitions.
Applied a total of 0 rules in 25 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
[2024-05-28 16:34:14] [INFO ] Invariant cache hit.
[2024-05-28 16:34:14] [INFO ] Implicit Places using invariants in 649 ms returned []
[2024-05-28 16:34:14] [INFO ] Invariant cache hit.
[2024-05-28 16:34:15] [INFO ] Implicit Places using invariants and state equation in 1160 ms returned []
Implicit Place search using SMT with State Equation took 1812 ms to find 0 implicit places.
[2024-05-28 16:34:16] [INFO ] Redundant transitions in 122 ms returned []
Running 1198 sub problems to find dead transitions.
[2024-05-28 16:34:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:34:37] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 16:34:37] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-28 16:34:37] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:34:38] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:34:38] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-28 16:34:38] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:34:38] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:34:38] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:34:39] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:34:39] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:34:39] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:34:39] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-28 16:34:40] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-28 16:34:40] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-28 16:34:40] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-28 16:34:41] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-05-28 16:34:41] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-28 16:34:41] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
[2024-05-28 16:34:41] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:34:42] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 20/1719 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:34:46] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 3 ms to minimize.
[2024-05-28 16:34:46] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 2 ms to minimize.
SMT process timed out in 30263ms, After SMT, problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 30275ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32246 ms. Remains : 1249/1249 places, 1199/1199 transitions.
Built C files in :
/tmp/ltsmin15647776458344153583
[2024-05-28 16:34:46] [INFO ] Computing symmetric may disable matrix : 1199 transitions.
[2024-05-28 16:34:46] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:34:46] [INFO ] Computing symmetric may enable matrix : 1199 transitions.
[2024-05-28 16:34:46] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:34:46] [INFO ] Computing Do-Not-Accords matrix : 1199 transitions.
[2024-05-28 16:34:46] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:34:46] [INFO ] Built C files in 259ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15647776458344153583
Running compilation step : cd /tmp/ltsmin15647776458344153583;'/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/ltsmin15647776458344153583;'/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/ltsmin15647776458344153583;'/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-28 16:34:49] [INFO ] Flatten gal took : 53 ms
[2024-05-28 16:34:49] [INFO ] Flatten gal took : 54 ms
[2024-05-28 16:34:49] [INFO ] Time to serialize gal into /tmp/LTL16207658230505510165.gal : 15 ms
[2024-05-28 16:34:49] [INFO ] Time to serialize properties into /tmp/LTL17397156482393837191.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/LTL16207658230505510165.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7145845137109666825.hoa' '-atoms' '/tmp/LTL17397156482393837191.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/LTL17397156482393837191.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7145845137109666825.hoa
Detected timeout of ITS tools.
[2024-05-28 16:35:05] [INFO ] Flatten gal took : 53 ms
[2024-05-28 16:35:05] [INFO ] Flatten gal took : 46 ms
[2024-05-28 16:35:05] [INFO ] Time to serialize gal into /tmp/LTL2554448377105955761.gal : 11 ms
[2024-05-28 16:35:05] [INFO ] Time to serialize properties into /tmp/LTL11859895879400727475.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/LTL2554448377105955761.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11859895879400727475.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 : !((X(F("(p70==1)"))))
Formula 0 simplified : XG!"(p70==1)"
Detected timeout of ITS tools.
[2024-05-28 16:35:20] [INFO ] Flatten gal took : 42 ms
[2024-05-28 16:35:20] [INFO ] Applying decomposition
[2024-05-28 16:35:20] [INFO ] Flatten gal took : 42 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/graph16454256497103634713.txt' '-o' '/tmp/graph16454256497103634713.bin' '-w' '/tmp/graph16454256497103634713.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16454256497103634713.bin' '-l' '-1' '-v' '-w' '/tmp/graph16454256497103634713.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:35:20] [INFO ] Decomposing Gal with order
[2024-05-28 16:35:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:35:20] [INFO ] Removed a total of 795 redundant transitions.
[2024-05-28 16:35:20] [INFO ] Flatten gal took : 118 ms
[2024-05-28 16:35:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 596 labels/synchronizations in 21 ms.
[2024-05-28 16:35:20] [INFO ] Time to serialize gal into /tmp/LTL11067631004399837604.gal : 13 ms
[2024-05-28 16:35:20] [INFO ] Time to serialize properties into /tmp/LTL5465287424136174085.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/LTL11067631004399837604.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5465287424136174085.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("(i2.u26.p70==1)"))))
Formula 0 simplified : XG!"(i2.u26.p70==1)"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-050A-LTLCardinality-07 finished in 253994 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((X(X(F(p0)))&&F(p1)))||G(p2)))'
Support contains 6 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 19 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-05-28 16:35:35] [INFO ] Computed 451 invariants in 5 ms
[2024-05-28 16:35:36] [INFO ] Implicit Places using invariants in 665 ms returned []
[2024-05-28 16:35:36] [INFO ] Invariant cache hit.
[2024-05-28 16:35:37] [INFO ] Implicit Places using invariants and state equation in 1311 ms returned []
Implicit Place search using SMT with State Equation took 1977 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:35:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30021 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:36:29] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:36:29] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:36:29] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 4 ms to minimize.
[2024-05-28 16:36:29] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:36:30] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 7 ms to minimize.
[2024-05-28 16:36:30] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:36:30] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:36:30] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:36:30] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:36:31] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:36:31] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:36:31] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
[2024-05-28 16:36:31] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:36:32] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-28 16:36:32] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-28 16:36:32] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-05-28 16:36:32] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-28 16:36:33] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:36:33] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
[2024-05-28 16:36:33] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:36:37] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:36:37] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 3 ms to minimize.
[2024-05-28 16:36:37] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-28 16:36:38] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
SMT process timed out in 60491ms, After SMT, problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60504ms
Finished structural reductions in LTL mode , in 1 iterations and 62504 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Stuttering acceptance computed with spot in 320 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLCardinality-12
Product exploration explored 100000 steps with 106 reset in 890 ms.
Product exploration explored 100000 steps with 110 reset in 1093 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (AND p2 (NOT p1))), (X p2), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p2 (NOT p1)))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 106 ms. Reduced automaton from 9 states, 17 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
RANDOM walk for 5463 steps (0 resets) in 84 ms. (64 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (AND p2 (NOT p1))), (X p2), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p2 (NOT p1)))), (X (X p2))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 9 factoid took 138 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
[2024-05-28 16:36:41] [INFO ] Invariant cache hit.
[2024-05-28 16:36:42] [INFO ] [Real]Absence check using 451 positive place invariants in 232 ms returned sat
[2024-05-28 16:36:45] [INFO ] [Real]Absence check using state equation in 2718 ms returned sat
[2024-05-28 16:36:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:36:46] [INFO ] [Nat]Absence check using 451 positive place invariants in 235 ms returned sat
[2024-05-28 16:36:48] [INFO ] [Nat]Absence check using state equation in 2298 ms returned sat
[2024-05-28 16:36:48] [INFO ] Computed and/alt/rep : 1104/3823/1104 causal constraints (skipped 98 transitions) in 62 ms.
Could not prove EG (NOT p1)
[2024-05-28 16:37:00] [INFO ] Invariant cache hit.
[2024-05-28 16:37:01] [INFO ] [Real]Absence check using 451 positive place invariants in 257 ms returned sat
[2024-05-28 16:37:04] [INFO ] [Real]Absence check using state equation in 2827 ms returned sat
[2024-05-28 16:37:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:37:05] [INFO ] [Nat]Absence check using 451 positive place invariants in 221 ms returned sat
[2024-05-28 16:37:08] [INFO ] [Nat]Absence check using state equation in 2857 ms returned sat
[2024-05-28 16:37:08] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:37:08] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:37:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 265 ms
[2024-05-28 16:37:08] [INFO ] Computed and/alt/rep : 1104/3823/1104 causal constraints (skipped 98 transitions) in 57 ms.
[2024-05-28 16:37:19] [INFO ] Added : 425 causal constraints over 85 iterations in 10796 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 4 out of 1253 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 21 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2024-05-28 16:37:19] [INFO ] Invariant cache hit.
[2024-05-28 16:37:19] [INFO ] Implicit Places using invariants in 594 ms returned []
[2024-05-28 16:37:19] [INFO ] Invariant cache hit.
[2024-05-28 16:37:21] [INFO ] Implicit Places using invariants and state equation in 1356 ms returned []
Implicit Place search using SMT with State Equation took 1952 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:37:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30020 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:38:12] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:38:12] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 16:38:13] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-28 16:38:13] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:38:13] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:38:13] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:38:13] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:38:14] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:38:14] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:38:14] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 16:38:14] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:38:15] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2024-05-28 16:38:15] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:38:15] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:38:15] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-28 16:38:16] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-05-28 16:38:16] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:38:16] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:38:16] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2024-05-28 16:38:17] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:38:20] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:38:21] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-28 16:38:21] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:38:21] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
SMT process timed out in 60389ms, After SMT, problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60402ms
Finished structural reductions in LTL mode , in 1 iterations and 62377 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
RANDOM walk for 5602 steps (0 resets) in 74 ms. (74 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
[2024-05-28 16:38:22] [INFO ] Invariant cache hit.
[2024-05-28 16:38:23] [INFO ] [Real]Absence check using 451 positive place invariants in 267 ms returned sat
[2024-05-28 16:38:26] [INFO ] [Real]Absence check using state equation in 2951 ms returned sat
[2024-05-28 16:38:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:38:27] [INFO ] [Nat]Absence check using 451 positive place invariants in 235 ms returned sat
[2024-05-28 16:38:30] [INFO ] [Nat]Absence check using state equation in 2414 ms returned sat
[2024-05-28 16:38:30] [INFO ] Computed and/alt/rep : 1104/3823/1104 causal constraints (skipped 98 transitions) in 68 ms.
[2024-05-28 16:38:41] [INFO ] Added : 540 causal constraints over 108 iterations in 11416 ms. Result :unknown
Could not prove EG (NOT p1)
[2024-05-28 16:38:41] [INFO ] Invariant cache hit.
[2024-05-28 16:38:42] [INFO ] [Real]Absence check using 451 positive place invariants in 268 ms returned sat
[2024-05-28 16:38:45] [INFO ] [Real]Absence check using state equation in 3020 ms returned sat
[2024-05-28 16:38:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:38:47] [INFO ] [Nat]Absence check using 451 positive place invariants in 231 ms returned sat
[2024-05-28 16:38:49] [INFO ] [Nat]Absence check using state equation in 2928 ms returned sat
[2024-05-28 16:38:50] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:38:50] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:38:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 261 ms
[2024-05-28 16:38:50] [INFO ] Computed and/alt/rep : 1104/3823/1104 causal constraints (skipped 98 transitions) in 63 ms.
[2024-05-28 16:39:00] [INFO ] Added : 435 causal constraints over 87 iterations in 10698 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 112 reset in 874 ms.
Product exploration explored 100000 steps with 101 reset in 1073 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1253 transition count 1203
Deduced a syphon composed of 2 places in 2 ms
Applied a total of 2 rules in 136 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
[2024-05-28 16:39:03] [INFO ] Redundant transitions in 198 ms returned [1195]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1201 sub problems to find dead transitions.
// Phase 1: matrix 1202 rows 1253 cols
[2024-05-28 16:39:03] [INFO ] Computed 451 invariants in 6 ms
[2024-05-28 16:39:03] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2455 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1201 unsolved in 30021 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 1201/1201 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
[2024-05-28 16:39:55] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 16:39:55] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-28 16:39:56] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:39:56] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:39:56] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:39:56] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:39:56] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 2 ms to minimize.
[2024-05-28 16:39:57] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 3 ms to minimize.
[2024-05-28 16:39:57] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:39:57] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-28 16:39:57] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:39:57] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
[2024-05-28 16:39:58] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-05-28 16:39:58] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-28 16:39:58] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-28 16:39:59] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:39:59] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-28 16:39:59] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:39:59] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-05-28 16:40:00] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1201 unsolved
[2024-05-28 16:40:01] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:40:03] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-05-28 16:40:04] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2455 variables, and 1727 constraints, problems are : Problem set: 0 solved, 1201 unsolved in 30026 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 0/1201 constraints, Known Traps: 23/23 constraints]
After SMT, in 60415ms problems are : Problem set: 0 solved, 1201 unsolved
Search for dead transitions found 0 dead transitions in 60425ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1253/1253 places, 1202/1203 transitions.
Deduced a syphon composed of 2 places in 2 ms
Applied a total of 0 rules in 42 ms. Remains 1253 /1253 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60812 ms. Remains : 1253/1253 places, 1202/1203 transitions.
Built C files in :
/tmp/ltsmin9990545111337354972
[2024-05-28 16:40:04] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9990545111337354972
Running compilation step : cd /tmp/ltsmin9990545111337354972;'/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 2768 ms.
Running link step : cd /tmp/ltsmin9990545111337354972;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 213 ms.
Running LTSmin : cd /tmp/ltsmin9990545111337354972;'/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' '--hoa' '/tmp/stateBased16737622411826836979.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 24 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-05-28 16:40:19] [INFO ] Computed 451 invariants in 4 ms
[2024-05-28 16:40:20] [INFO ] Implicit Places using invariants in 602 ms returned []
[2024-05-28 16:40:20] [INFO ] Invariant cache hit.
[2024-05-28 16:40:21] [INFO ] Implicit Places using invariants and state equation in 1361 ms returned []
Implicit Place search using SMT with State Equation took 1966 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:40:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30025 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:41:13] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:41:13] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-28 16:41:13] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:41:13] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-28 16:41:14] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:41:14] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:41:14] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:41:14] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:41:14] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:41:15] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:41:15] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:41:15] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-28 16:41:15] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:41:16] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-28 16:41:16] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-05-28 16:41:16] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-05-28 16:41:16] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-05-28 16:41:17] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-05-28 16:41:17] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:41:17] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:41:21] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-05-28 16:41:21] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1726 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30026 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 22/22 constraints]
After SMT, in 60396ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60408ms
Finished structural reductions in LTL mode , in 1 iterations and 62402 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Built C files in :
/tmp/ltsmin12606523120768950748
[2024-05-28 16:41:21] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12606523120768950748
Running compilation step : cd /tmp/ltsmin12606523120768950748;'/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 2787 ms.
Running link step : cd /tmp/ltsmin12606523120768950748;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12606523120768950748;'/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' '--hoa' '/tmp/stateBased4853090269328475900.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 16:41:36] [INFO ] Flatten gal took : 83 ms
[2024-05-28 16:41:37] [INFO ] Flatten gal took : 62 ms
[2024-05-28 16:41:37] [INFO ] Time to serialize gal into /tmp/LTL5117752499685675125.gal : 21 ms
[2024-05-28 16:41:37] [INFO ] Time to serialize properties into /tmp/LTL10501488181703899326.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/LTL5117752499685675125.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15536315156186582419.hoa' '-atoms' '/tmp/LTL10501488181703899326.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/LTL10501488181703899326.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15536315156186582419.hoa
Detected timeout of ITS tools.
[2024-05-28 16:41:52] [INFO ] Flatten gal took : 49 ms
[2024-05-28 16:41:52] [INFO ] Flatten gal took : 53 ms
[2024-05-28 16:41:52] [INFO ] Time to serialize gal into /tmp/LTL451122915293158115.gal : 6 ms
[2024-05-28 16:41:52] [INFO ] Time to serialize properties into /tmp/LTL61450653119190620.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/LTL451122915293158115.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL61450653119190620.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...272
Read 1 LTL properties
Checking formula 0 : !(((X((X(X(F("((p560==0)&&(p267==1))"))))&&(F("((p349==0)&&(p951==1))"))))||(G("((p743==0)&&(p242==1))"))))
Formula 0 simplified : X(XXG!"((p560==0)&&(p267==1))" | G!"((p349==0)&&(p951==1))") & F!"((p743==0)&&(p242==1))"
Detected timeout of ITS tools.
[2024-05-28 16:42:07] [INFO ] Flatten gal took : 49 ms
[2024-05-28 16:42:07] [INFO ] Applying decomposition
[2024-05-28 16:42:07] [INFO ] Flatten gal took : 49 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/graph2486008266613887709.txt' '-o' '/tmp/graph2486008266613887709.bin' '-w' '/tmp/graph2486008266613887709.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2486008266613887709.bin' '-l' '-1' '-v' '-w' '/tmp/graph2486008266613887709.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:42:07] [INFO ] Decomposing Gal with order
[2024-05-28 16:42:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:42:07] [INFO ] Removed a total of 800 redundant transitions.
[2024-05-28 16:42:07] [INFO ] Flatten gal took : 68 ms
[2024-05-28 16:42:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 748 labels/synchronizations in 117 ms.
[2024-05-28 16:42:07] [INFO ] Time to serialize gal into /tmp/LTL6371437898039635824.gal : 13 ms
[2024-05-28 16:42:07] [INFO ] Time to serialize properties into /tmp/LTL10116079815930295563.ltl : 9 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/LTL6371437898039635824.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10116079815930295563.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((X(X(F("((i12.i1.i0.u202.p560==0)&&(i5.i1.i2.u96.p267==1))"))))&&(F("((i7.u126.p349==0)&&(i21.i0.i2.u342.p951==1))"))))||(G("((i...207
Formula 0 simplified : X(XXG!"((i12.i1.i0.u202.p560==0)&&(i5.i1.i2.u96.p267==1))" | G!"((i7.u126.p349==0)&&(i21.i0.i2.u342.p951==1))") & F!"((i17.i0.i2.u26...191
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-050A-LTLCardinality-12 finished in 407094 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 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 79 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-28 16:42:22] [INFO ] Computed 451 invariants in 6 ms
[2024-05-28 16:42:23] [INFO ] Implicit Places using invariants in 635 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 637 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 1201/1203 transitions.
Applied a total of 0 rules in 30 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 746 ms. Remains : 1250/1253 places, 1201/1203 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLCardinality-13
Product exploration explored 100000 steps with 39 reset in 931 ms.
Product exploration explored 100000 steps with 39 reset in 1103 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 4 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Support contains 2 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 27 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1250 cols
[2024-05-28 16:42:26] [INFO ] Computed 450 invariants in 6 ms
[2024-05-28 16:42:26] [INFO ] Implicit Places using invariants in 603 ms returned []
[2024-05-28 16:42:26] [INFO ] Invariant cache hit.
[2024-05-28 16:42:27] [INFO ] Implicit Places using invariants and state equation in 1327 ms returned []
Implicit Place search using SMT with State Equation took 1931 ms to find 0 implicit places.
[2024-05-28 16:42:28] [INFO ] Redundant transitions in 117 ms returned [1195]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1199 sub problems to find dead transitions.
// Phase 1: matrix 1200 rows 1250 cols
[2024-05-28 16:42:28] [INFO ] Computed 450 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2450 variables, and 1249 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30024 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1199/1199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 2 (OVERLAPS) 1/1250 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:43:20] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:43:20] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:43:20] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:43:20] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:43:21] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:43:21] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:43:21] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:43:21] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:43:21] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:43:22] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:43:22] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:43:22] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:43:22] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-28 16:43:23] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-28 16:43:23] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-28 16:43:23] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:43:23] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-05-28 16:43:24] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:43:24] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-28 16:43:24] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:43:28] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1250/2450 variables, and 1721 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30022 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 0/1199 constraints, Known Traps: 21/21 constraints]
After SMT, in 60441ms problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 60453ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1250 places, 1200/1201 transitions.
Applied a total of 0 rules in 39 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62578 ms. Remains : 1250/1250 places, 1200/1201 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 39 reset in 892 ms.
Product exploration explored 100000 steps with 39 reset in 1103 ms.
Built C files in :
/tmp/ltsmin14749212679965825866
[2024-05-28 16:43:30] [INFO ] Computing symmetric may disable matrix : 1200 transitions.
[2024-05-28 16:43:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:43:30] [INFO ] Computing symmetric may enable matrix : 1200 transitions.
[2024-05-28 16:43:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:43:31] [INFO ] Computing Do-Not-Accords matrix : 1200 transitions.
[2024-05-28 16:43:31] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:43:31] [INFO ] Built C files in 235ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14749212679965825866
Running compilation step : cd /tmp/ltsmin14749212679965825866;'/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/ltsmin14749212679965825866;'/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/ltsmin14749212679965825866;'/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 2 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1250/1250 places, 1200/1200 transitions.
Applied a total of 0 rules in 34 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2024-05-28 16:43:34] [INFO ] Invariant cache hit.
[2024-05-28 16:43:34] [INFO ] Implicit Places using invariants in 607 ms returned []
[2024-05-28 16:43:34] [INFO ] Invariant cache hit.
[2024-05-28 16:43:36] [INFO ] Implicit Places using invariants and state equation in 1294 ms returned []
Implicit Place search using SMT with State Equation took 1902 ms to find 0 implicit places.
[2024-05-28 16:43:36] [INFO ] Redundant transitions in 122 ms returned []
Running 1199 sub problems to find dead transitions.
[2024-05-28 16:43:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2450 variables, and 1249 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30026 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1199/1199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 2 (OVERLAPS) 1/1250 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:44:28] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:44:28] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 16:44:28] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-28 16:44:28] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:44:29] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:44:29] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:44:29] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:44:29] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:44:29] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:44:30] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:44:30] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:44:30] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-28 16:44:30] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:44:31] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-28 16:44:31] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-05-28 16:44:31] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-05-28 16:44:31] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-28 16:44:32] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:44:32] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:44:32] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:44:36] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
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 1250/2450 variables, and 1721 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30021 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 0/1199 constraints, Known Traps: 21/21 constraints]
After SMT, in 60414ms problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 60424ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62489 ms. Remains : 1250/1250 places, 1200/1200 transitions.
Built C files in :
/tmp/ltsmin17924219426997860527
[2024-05-28 16:44:36] [INFO ] Computing symmetric may disable matrix : 1200 transitions.
[2024-05-28 16:44:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:44:36] [INFO ] Computing symmetric may enable matrix : 1200 transitions.
[2024-05-28 16:44:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:44:36] [INFO ] Computing Do-Not-Accords matrix : 1200 transitions.
[2024-05-28 16:44:36] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:44:36] [INFO ] Built C files in 231ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17924219426997860527
Running compilation step : cd /tmp/ltsmin17924219426997860527;'/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/ltsmin17924219426997860527;'/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/ltsmin17924219426997860527;'/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-28 16:44:39] [INFO ] Flatten gal took : 48 ms
[2024-05-28 16:44:40] [INFO ] Flatten gal took : 50 ms
[2024-05-28 16:44:40] [INFO ] Time to serialize gal into /tmp/LTL16847441979080612996.gal : 5 ms
[2024-05-28 16:44:40] [INFO ] Time to serialize properties into /tmp/LTL15708122919318961731.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/LTL16847441979080612996.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6472532122280602126.hoa' '-atoms' '/tmp/LTL15708122919318961731.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/LTL15708122919318961731.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6472532122280602126.hoa
Detected timeout of ITS tools.
[2024-05-28 16:44:55] [INFO ] Flatten gal took : 47 ms
[2024-05-28 16:44:55] [INFO ] Flatten gal took : 48 ms
[2024-05-28 16:44:55] [INFO ] Time to serialize gal into /tmp/LTL14385495264761041513.gal : 6 ms
[2024-05-28 16:44:55] [INFO ] Time to serialize properties into /tmp/LTL10774407407825522792.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/LTL14385495264761041513.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10774407407825522792.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 : !((F(G("((p830==0)||(p939==1))"))))
Formula 0 simplified : GF!"((p830==0)||(p939==1))"
Detected timeout of ITS tools.
[2024-05-28 16:45:10] [INFO ] Flatten gal took : 59 ms
[2024-05-28 16:45:10] [INFO ] Applying decomposition
[2024-05-28 16:45:10] [INFO ] Flatten gal took : 48 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/graph1037041939193489896.txt' '-o' '/tmp/graph1037041939193489896.bin' '-w' '/tmp/graph1037041939193489896.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1037041939193489896.bin' '-l' '-1' '-v' '-w' '/tmp/graph1037041939193489896.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:45:10] [INFO ] Decomposing Gal with order
[2024-05-28 16:45:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:45:10] [INFO ] Removed a total of 795 redundant transitions.
[2024-05-28 16:45:10] [INFO ] Flatten gal took : 74 ms
[2024-05-28 16:45:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 736 labels/synchronizations in 50 ms.
[2024-05-28 16:45:10] [INFO ] Time to serialize gal into /tmp/LTL4454667626947702881.gal : 12 ms
[2024-05-28 16:45:10] [INFO ] Time to serialize properties into /tmp/LTL9810763264449844978.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/LTL4454667626947702881.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9810763264449844978.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 : !((F(G("((i19.i1.i1.u299.p830==0)||(i21.i1.i1.u339.p939==1))"))))
Formula 0 simplified : GF!"((i19.i1.i1.u299.p830==0)||(i21.i1.i1.u339.p939==1))"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-050A-LTLCardinality-13 finished in 182855 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)))'
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 18 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-05-28 16:45:25] [INFO ] Computed 451 invariants in 4 ms
[2024-05-28 16:45:26] [INFO ] Implicit Places using invariants in 594 ms returned []
[2024-05-28 16:45:26] [INFO ] Invariant cache hit.
[2024-05-28 16:45:27] [INFO ] Implicit Places using invariants and state equation in 1331 ms returned []
Implicit Place search using SMT with State Equation took 1926 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-05-28 16:45:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30021 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:46:19] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 16:46:19] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 16:46:19] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-28 16:46:19] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:46:19] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:46:20] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:46:20] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:46:20] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:46:20] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:46:20] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-28 16:46:21] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:46:21] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-05-28 16:46:21] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-05-28 16:46:21] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-28 16:46:22] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-28 16:46:22] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-28 16:46:22] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2024-05-28 16:46:22] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-28 16:46:23] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:46:23] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-05-28 16:46:27] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2024-05-28 16:46:27] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-28 16:46:27] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-28 16:46:28] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1253/2456 variables, and 1728 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30022 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 0/1202 constraints, Known Traps: 24/24 constraints]
After SMT, in 60373ms problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60384ms
Finished structural reductions in LTL mode , in 1 iterations and 62331 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-050A-LTLCardinality-15
Product exploration explored 100000 steps with 173 reset in 924 ms.
Product exploration explored 100000 steps with 172 reset in 1072 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 75 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 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 56 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-28 16:46:30] [INFO ] Computed 451 invariants in 4 ms
[2024-05-28 16:46:31] [INFO ] Implicit Places using invariants in 609 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 610 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1253 places, 1201/1203 transitions.
Applied a total of 0 rules in 25 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 692 ms. Remains : 1250/1253 places, 1201/1203 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 58 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 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 7 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 84 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 167 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 178 reset in 876 ms.
Product exploration explored 100000 steps with 172 reset in 1090 ms.
Built C files in :
/tmp/ltsmin7206368618962627717
[2024-05-28 16:46:33] [INFO ] Computing symmetric may disable matrix : 1201 transitions.
[2024-05-28 16:46:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:46:33] [INFO ] Computing symmetric may enable matrix : 1201 transitions.
[2024-05-28 16:46:33] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:46:34] [INFO ] Computing Do-Not-Accords matrix : 1201 transitions.
[2024-05-28 16:46:34] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:46:34] [INFO ] Built C files in 224ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7206368618962627717
Running compilation step : cd /tmp/ltsmin7206368618962627717;'/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/ltsmin7206368618962627717;'/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/ltsmin7206368618962627717;'/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 2 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 27 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1250 cols
[2024-05-28 16:46:37] [INFO ] Computed 450 invariants in 2 ms
[2024-05-28 16:46:37] [INFO ] Implicit Places using invariants in 588 ms returned []
[2024-05-28 16:46:37] [INFO ] Invariant cache hit.
[2024-05-28 16:46:38] [INFO ] Implicit Places using invariants and state equation in 1307 ms returned []
Implicit Place search using SMT with State Equation took 1896 ms to find 0 implicit places.
[2024-05-28 16:46:39] [INFO ] Redundant transitions in 122 ms returned [1195]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1199 sub problems to find dead transitions.
// Phase 1: matrix 1200 rows 1250 cols
[2024-05-28 16:46:39] [INFO ] Computed 450 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2450 variables, and 1249 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30019 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1199/1199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 2 (OVERLAPS) 1/1250 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:47:31] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 16:47:31] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:47:31] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 16:47:31] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-28 16:47:31] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-28 16:47:32] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2024-05-28 16:47:32] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:47:32] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:47:32] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:47:33] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:47:33] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:47:33] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2024-05-28 16:47:33] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-28 16:47:34] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-28 16:47:34] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-28 16:47:34] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-05-28 16:47:34] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:47:35] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-28 16:47:35] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-28 16:47:35] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:47:39] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1250/2450 variables, and 1721 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30019 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 0/1199 constraints, Known Traps: 21/21 constraints]
After SMT, in 60399ms problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 60410ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1250 places, 1200/1201 transitions.
Applied a total of 0 rules in 24 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62486 ms. Remains : 1250/1250 places, 1200/1201 transitions.
Built C files in :
/tmp/ltsmin16565544871572208268
[2024-05-28 16:47:39] [INFO ] Computing symmetric may disable matrix : 1200 transitions.
[2024-05-28 16:47:39] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:47:39] [INFO ] Computing symmetric may enable matrix : 1200 transitions.
[2024-05-28 16:47:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:47:39] [INFO ] Computing Do-Not-Accords matrix : 1200 transitions.
[2024-05-28 16:47:39] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:47:39] [INFO ] Built C files in 242ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16565544871572208268
Running compilation step : cd /tmp/ltsmin16565544871572208268;'/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/ltsmin16565544871572208268;'/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/ltsmin16565544871572208268;'/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-28 16:47:42] [INFO ] Flatten gal took : 54 ms
[2024-05-28 16:47:42] [INFO ] Flatten gal took : 49 ms
[2024-05-28 16:47:42] [INFO ] Time to serialize gal into /tmp/LTL7849612778681270258.gal : 6 ms
[2024-05-28 16:47:42] [INFO ] Time to serialize properties into /tmp/LTL4194025873448332874.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/LTL7849612778681270258.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17760938034386744574.hoa' '-atoms' '/tmp/LTL4194025873448332874.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/LTL4194025873448332874.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17760938034386744574.hoa
Detected timeout of ITS tools.
[2024-05-28 16:47:58] [INFO ] Flatten gal took : 47 ms
[2024-05-28 16:47:58] [INFO ] Flatten gal took : 47 ms
[2024-05-28 16:47:58] [INFO ] Time to serialize gal into /tmp/LTL4453412359835151426.gal : 5 ms
[2024-05-28 16:47:58] [INFO ] Time to serialize properties into /tmp/LTL456140786647099040.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/LTL4453412359835151426.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL456140786647099040.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 : !((X(F("((p487==0)||(p961==1))"))))
Formula 0 simplified : XG!"((p487==0)||(p961==1))"
Detected timeout of ITS tools.
[2024-05-28 16:48:13] [INFO ] Flatten gal took : 49 ms
[2024-05-28 16:48:13] [INFO ] Applying decomposition
[2024-05-28 16:48:13] [INFO ] Flatten gal took : 49 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/graph6994778258078253022.txt' '-o' '/tmp/graph6994778258078253022.bin' '-w' '/tmp/graph6994778258078253022.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6994778258078253022.bin' '-l' '-1' '-v' '-w' '/tmp/graph6994778258078253022.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:48:13] [INFO ] Decomposing Gal with order
[2024-05-28 16:48:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:48:13] [INFO ] Removed a total of 797 redundant transitions.
[2024-05-28 16:48:13] [INFO ] Flatten gal took : 76 ms
[2024-05-28 16:48:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 732 labels/synchronizations in 52 ms.
[2024-05-28 16:48:13] [INFO ] Time to serialize gal into /tmp/LTL1400835856514672786.gal : 13 ms
[2024-05-28 16:48:13] [INFO ] Time to serialize properties into /tmp/LTL7777841019248630581.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/LTL1400835856514672786.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7777841019248630581.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 : !((X(F("((i12.i0.i2.u176.p487==0)||(i23.i0.i0.u346.p961==1))"))))
Formula 0 simplified : XG!"((i12.i0.i2.u176.p487==0)||(i23.i0.i0.u346.p961==1))"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-050A-LTLCardinality-15 finished in 182917 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)))'
Found a Shortening insensitive property : ShieldIIPs-PT-050A-LTLCardinality-07
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1252 transition count 1201
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 1250 transition count 1201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 1249 transition count 1200
Applied a total of 5 rules in 61 ms. Remains 1249 /1253 variables (removed 4) and now considering 1200/1203 (removed 3) transitions.
// Phase 1: matrix 1200 rows 1249 cols
[2024-05-28 16:48:28] [INFO ] Computed 450 invariants in 3 ms
[2024-05-28 16:48:29] [INFO ] Implicit Places using invariants in 571 ms returned []
[2024-05-28 16:48:29] [INFO ] Invariant cache hit.
[2024-05-28 16:48:30] [INFO ] Implicit Places using invariants and state equation in 1252 ms returned []
Implicit Place search using SMT with State Equation took 1837 ms to find 0 implicit places.
Running 1199 sub problems to find dead transitions.
[2024-05-28 16:48:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:48:52] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 16:48:52] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:48:53] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:48:53] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:48:53] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:48:53] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:48:53] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:48:54] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-28 16:48:54] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-05-28 16:48:54] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-28 16:48:54] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:48:55] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
[2024-05-28 16:48:55] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
[2024-05-28 16:48:55] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-05-28 16:48:55] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-05-28 16:48:56] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-05-28 16:48:56] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:48:56] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
[2024-05-28 16:48:56] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2024-05-28 16:48:57] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 20/1719 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:49:00] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2449 variables, and 1720 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30020 ms.
Refiners :[Domain max(s): 1249/1249 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1249 constraints, PredecessorRefiner: 1199/1199 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 21/1720 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:49:05] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2024-05-28 16:49:06] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:49:06] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 2 ms to minimize.
[2024-05-28 16:49:06] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 2 ms to minimize.
[2024-05-28 16:49:07] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 2 ms to minimize.
[2024-05-28 16:49:07] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 3 ms to minimize.
[2024-05-28 16:49:07] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 2 ms to minimize.
[2024-05-28 16:49:08] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 2 ms to minimize.
[2024-05-28 16:49:08] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 2 ms to minimize.
[2024-05-28 16:49:08] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 3 ms to minimize.
[2024-05-28 16:49:09] [INFO ] Deduced a trap composed of 14 places in 152 ms of which 3 ms to minimize.
[2024-05-28 16:49:09] [INFO ] Deduced a trap composed of 14 places in 154 ms of which 3 ms to minimize.
[2024-05-28 16:49:09] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 3 ms to minimize.
[2024-05-28 16:49:10] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 3 ms to minimize.
[2024-05-28 16:49:10] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 3 ms to minimize.
[2024-05-28 16:49:11] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 4 ms to minimize.
[2024-05-28 16:49:11] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 4 ms to minimize.
[2024-05-28 16:49:11] [INFO ] Deduced a trap composed of 22 places in 188 ms of which 3 ms to minimize.
[2024-05-28 16:49:12] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 3 ms to minimize.
[2024-05-28 16:49:12] [INFO ] Deduced a trap composed of 14 places in 199 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1249 variables, 20/1740 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:49:20] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 3 ms to minimize.
[2024-05-28 16:49:21] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 4 ms to minimize.
[2024-05-28 16:49:21] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 3 ms to minimize.
[2024-05-28 16:49:22] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 4 ms to minimize.
[2024-05-28 16:49:22] [INFO ] Deduced a trap composed of 30 places in 217 ms of which 4 ms to minimize.
[2024-05-28 16:49:23] [INFO ] Deduced a trap composed of 22 places in 245 ms of which 4 ms to minimize.
[2024-05-28 16:49:23] [INFO ] Deduced a trap composed of 14 places in 228 ms of which 4 ms to minimize.
[2024-05-28 16:49:24] [INFO ] Deduced a trap composed of 14 places in 231 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1249/2449 variables, and 1748 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30020 ms.
Refiners :[Domain max(s): 1249/1249 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1249 constraints, PredecessorRefiner: 0/1199 constraints, Known Traps: 49/49 constraints]
After SMT, in 60279ms problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 60290ms
Starting structural reductions in LI_LTL mode, iteration 1 : 1249/1253 places, 1200/1203 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 62192 ms. Remains : 1249/1253 places, 1200/1203 transitions.
Running random walk in product with property : ShieldIIPs-PT-050A-LTLCardinality-07
Product exploration explored 100000 steps with 44 reset in 872 ms.
Product exploration explored 100000 steps with 44 reset in 1088 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 9078 steps (0 resets) in 131 ms. (68 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 81 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 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
[2024-05-28 16:49:33] [INFO ] Invariant cache hit.
[2024-05-28 16:49:34] [INFO ] [Real]Absence check using 450 positive place invariants in 248 ms returned sat
[2024-05-28 16:49:37] [INFO ] [Real]Absence check using state equation in 2600 ms returned sat
[2024-05-28 16:49:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:49:38] [INFO ] [Nat]Absence check using 450 positive place invariants in 208 ms returned sat
[2024-05-28 16:49:40] [INFO ] [Nat]Absence check using state equation in 2704 ms returned sat
[2024-05-28 16:49:40] [INFO ] Computed and/alt/rep : 1199/2992/1199 causal constraints (skipped 0 transitions) in 55 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:619)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:252)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:960)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 16:49:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 1 out of 1249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1249/1249 places, 1200/1200 transitions.
Applied a total of 0 rules in 23 ms. Remains 1249 /1249 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2024-05-28 16:49:52] [INFO ] Invariant cache hit.
[2024-05-28 16:49:52] [INFO ] Implicit Places using invariants in 594 ms returned []
[2024-05-28 16:49:52] [INFO ] Invariant cache hit.
[2024-05-28 16:49:53] [INFO ] Implicit Places using invariants and state equation in 1218 ms returned []
Implicit Place search using SMT with State Equation took 1813 ms to find 0 implicit places.
[2024-05-28 16:49:54] [INFO ] Redundant transitions in 118 ms returned [1194]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1198 sub problems to find dead transitions.
// Phase 1: matrix 1199 rows 1249 cols
[2024-05-28 16:49:54] [INFO ] Computed 450 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:50:15] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:50:15] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-28 16:50:15] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-28 16:50:16] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 16:50:16] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:50:16] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 16:50:16] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:50:16] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:50:17] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:50:17] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-05-28 16:50:17] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:50:17] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-28 16:50:18] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-28 16:50:18] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-28 16:50:18] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-05-28 16:50:18] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-28 16:50:19] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:50:19] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:50:19] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:50:19] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 20/1719 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:50:23] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 3 ms to minimize.
[2024-05-28 16:50:23] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 3 ms to minimize.
[2024-05-28 16:50:24] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 1.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 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 1.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 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 1.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 1.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 1.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 1.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 1.0)
(s363 0.0)
(s364 0.0)
(s365 1.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 1.0)
(s388 0.0)
(s389 0.0)
(s390 1.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 1.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 1.0)
(s401 0.0)
(s402 1.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 1.0)
(s407 0.0)
(s408 1.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 0.0)
(s421 1.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 1.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 1.0)
(s432 0.0)
(s433 1.0)
(s434 0.0)
(s435 1.0)
(s436 0.0)
(s437 1.0)
(s438 0.0)
(s439 0.0)
(s440 1.0)
(s441 0.0)
(s442 1.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 1.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 0.0)
(s452 1.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 1.0)
(s457 0.0)
(s458 1.0)
(s459 0.0)
(s460 1.0)
(s461 0.0)
(s462 1.0)
(s463 0.0)
(s464 0.0)
(s465 1.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 1.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 1.0)
(s476 0.0)
(s477 1.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 1.0)
(s482 0.0)
(s483 1.0)
(s484 0.0)
(s485 1.0)
(s486 0.0)
(s487 1.0)
(s488 0.0)
(s489 0.0)
(s490 1.0)
(s491 0.0)
(s492 1.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 1.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 1.0)
(s501 0.0)
(s502 1.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 1.0)
(s507 0.0)
(s508 1.0)
(s509 0.0)
(s510 1.0)
(s511 0.0)
(s512 1.0)
(s513 0.0)
(s514 0.0)
(s515 1.0)
(s516 0.0)
(s517 1.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 1.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 1.0)
(s526 0.0)
(s527 1.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 1.0)
(s532 0.0)
(s533 1.0)
(s534 0.0)
(s535 1.0)
(s536 0.0)
(s537 1.0)
(s538 0.0)
(s539 0.0)
(s540 1.0)
(s541 0.0)
(s542 1.0)
(s543 0.0)
(s544 0.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 1.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 0.0)
(s571 1.0)
(s572 0.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 1.0)
(s586 0.0)
(s587 1.0)
(s588 0.0)
(s589 0.0)
(s590 1.0)
(s591 0.0)
(s592 1.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 1.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 1.0)
(s601 0.0)
(s602 1.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 1.0)
(s607 0.0)
(s608 1.0)
(s609 0.0)
(s610 1.0)
(s611 0.0)
(s612 1.0)
(s613 0.0)
(s614 0.0)
(s615 1.0)
(s616 0.0)
(s617 1.0)
(s618 0.0)
(s619 0.0)
(s620 1.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 1.0)
(s627 1.0)
(s628 0.0)
(s629 1.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 1.0)
(s636 0.0)
(s637 1.0)
(s638 0.0)
(s639 1.0)
(s640 0.0)
(s641 0.0)
(s642 1.0)
(s643 0.0)
(s644 0.0)
(s645 1.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 1.0)
(s652 1.0)
(s653 0.0)
(s654 1.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 1.0)
(s661 0.0)
(s662 1.0)
(s663 0.0)
(s664 1.0)
(s665 0.0)
(s666 0.0)
(s667 1.0)
(s668 0.0)
(s669 0.0)
(s670 1.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 1.0)
(s677 1.0)
(s678 0.0)
(s679 1.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 1.0)
(s686 0.0)
(s687 1.0)
(s688 0.0)
(s689 1.0)
(s690 0.0)
(s691 0.0)
(s692 1.0)
(s693 0.0)
(s694 0.0)
(s695 1.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 1.0)
(s702 1.0)
(s703 0.0)
(s704 1.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 1.0)
(s711 0.0)
(s712 1.0)
(s713 0.0)
(s714 1.0)
(s715 0.0)
(s716 0.0)
(s717 1.0)
(s718 0.0)
(s719 0.0)
(s720 1.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 1.0)
(s727 1.0)
(s728 0.0)
(s729 1.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 1.0)
(s736 0.0)
(s737 1.0)
(s738 0.0)
(s739 1.0)
(s740 0.0)
(s741 0.0)
(s742 1.0)
(s743 0.0)
(s744 0.0)
(s745 1.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 1.0)
(s752 1.0)
(s753 0.0)
(s754 1.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 1.0)
(s761 0.0)
(s762 1.0)
(s763 0.0)
(s764 1.0)
(s765 0.0)
(s766 0.0)
(s767 1.0)
(s768 0.0)
(s769 0.0)
(s770 1.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 1.0)
(s777 1.0)
(s778 0.0)
(s779 1.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 1.0)
(s786 0.0)
(s787 1.0)
(s788 0.0)
(s789 1.0)
(s790 0.0)
(s791 0.0)
(s792 1.0)
(s793 0.0)
(s794 0.0)
(s795 1.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 1.0)
(s802 1.0)
(s803 0.0)
(s804 1.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 1.0)
(s811 0.0)
(s812 1.0)
(s813 0.0)
(s814 1.0)
(s815 0.0)
(s816 0.0)
(s817 1.0)
(s818 0.0)
(s819 0.0)
(s820 1.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 1.0)
(s827 1.0)
(s828 0.0)
(s829 1.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 1.0)
(s836 0.0)
(s837 1.0)
(s838 0.0)
(s839 1.0)
(s840 0.0)
(s841 0.0)
(s842 1.0)
(s843 0.0)
(s844 0.0)
(s845 1.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 1.0)
(s852 1.0)
(s853 0.0)
(s854 1.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 1.0)
(s861 0.0)
(s862 1.0)
(s863 0.0)
(s864 1.0)
(s865 0.0)
(s866 0.0)
(s867 1.0)
(s868 0.0)
(s869 0.0)
(s870 1.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 1.0)
(s877 1.0)
(s878 0.0)
(s879 1.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 1.0)
(s886 0.0)
(s887 1.0)
(s888 0.0)
(s889 1.0)
(s890 0.0)
(s891 0.0)
(s892 1.0)
(s893 0.0)
(s894 0.0)
(s895 1.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 1.0)
(s902 1.0)
(s903 0.0)
(s904 1.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 1.0)
(s911 0.0)
(s912 1.0)
(s913 0.0)
(s914 1.0)
(s915 0.0)
(s916 0.0)
(s917 1.0)
(s918 0.0)
(s919 0.0)
(s920 1.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 1.0)
(s927 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2448 variables, and 1722 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30027 ms.
Refiners :[Domain max(s): 1249/1249 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1249 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 23/1722 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:50:29] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 2 ms to minimize.
[2024-05-28 16:50:29] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 3 ms to minimize.
[2024-05-28 16:50:29] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 2 ms to minimize.
[2024-05-28 16:50:30] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 2 ms to minimize.
[2024-05-28 16:50:30] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 2 ms to minimize.
[2024-05-28 16:50:30] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 3 ms to minimize.
[2024-05-28 16:50:31] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 3 ms to minimize.
[2024-05-28 16:50:31] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 3 ms to minimize.
[2024-05-28 16:50:32] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 3 ms to minimize.
[2024-05-28 16:50:32] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 3 ms to minimize.
[2024-05-28 16:50:32] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 2 ms to minimize.
[2024-05-28 16:50:33] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 3 ms to minimize.
[2024-05-28 16:50:33] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 4 ms to minimize.
[2024-05-28 16:50:34] [INFO ] Deduced a trap composed of 22 places in 167 ms of which 4 ms to minimize.
[2024-05-28 16:50:34] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 4 ms to minimize.
[2024-05-28 16:50:34] [INFO ] Deduced a trap composed of 22 places in 184 ms of which 4 ms to minimize.
[2024-05-28 16:50:35] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 3 ms to minimize.
[2024-05-28 16:50:35] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 4 ms to minimize.
[2024-05-28 16:50:36] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 4 ms to minimize.
[2024-05-28 16:50:36] [INFO ] Deduced a trap composed of 14 places in 209 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1249 variables, 20/1742 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:50:45] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 4 ms to minimize.
[2024-05-28 16:50:45] [INFO ] Deduced a trap composed of 14 places in 218 ms of which 4 ms to minimize.
[2024-05-28 16:50:46] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 4 ms to minimize.
[2024-05-28 16:50:46] [INFO ] Deduced a trap composed of 22 places in 225 ms of which 4 ms to minimize.
[2024-05-28 16:50:47] [INFO ] Deduced a trap composed of 14 places in 229 ms of which 4 ms to minimize.
[2024-05-28 16:50:47] [INFO ] Deduced a trap composed of 14 places in 225 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1249/2448 variables, and 1748 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30025 ms.
Refiners :[Domain max(s): 1249/1249 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1249 constraints, PredecessorRefiner: 0/1198 constraints, Known Traps: 49/49 constraints]
After SMT, in 60275ms problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 60285ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1249/1249 places, 1199/1200 transitions.
Applied a total of 0 rules in 23 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62272 ms. Remains : 1249/1249 places, 1199/1200 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 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 130 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 9021 steps (0 resets) in 109 ms. (82 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 81 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
[2024-05-28 16:50:54] [INFO ] Invariant cache hit.
[2024-05-28 16:50:55] [INFO ] [Real]Absence check using 450 positive place invariants in 244 ms returned sat
[2024-05-28 16:50:59] [INFO ] [Real]Absence check using state equation in 3161 ms returned sat
[2024-05-28 16:50:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:51:00] [INFO ] [Nat]Absence check using 450 positive place invariants in 219 ms returned sat
[2024-05-28 16:51:03] [INFO ] [Nat]Absence check using state equation in 3216 ms returned sat
[2024-05-28 16:51:03] [INFO ] Computed and/alt/rep : 1198/2987/1198 causal constraints (skipped 0 transitions) in 56 ms.
[2024-05-28 16:51:14] [INFO ] Added : 480 causal constraints over 96 iterations in 10700 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 44 reset in 872 ms.
Product exploration explored 100000 steps with 44 reset in 1082 ms.
Built C files in :
/tmp/ltsmin15619919113229647557
[2024-05-28 16:51:16] [INFO ] Computing symmetric may disable matrix : 1199 transitions.
[2024-05-28 16:51:16] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:51:16] [INFO ] Computing symmetric may enable matrix : 1199 transitions.
[2024-05-28 16:51:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:51:16] [INFO ] Computing Do-Not-Accords matrix : 1199 transitions.
[2024-05-28 16:51:16] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:51:16] [INFO ] Built C files in 226ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15619919113229647557
Running compilation step : cd /tmp/ltsmin15619919113229647557;'/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/ltsmin15619919113229647557;'/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/ltsmin15619919113229647557;'/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 1 out of 1249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1249/1249 places, 1199/1199 transitions.
Applied a total of 0 rules in 27 ms. Remains 1249 /1249 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
[2024-05-28 16:51:19] [INFO ] Invariant cache hit.
[2024-05-28 16:51:20] [INFO ] Implicit Places using invariants in 573 ms returned []
[2024-05-28 16:51:20] [INFO ] Invariant cache hit.
[2024-05-28 16:51:21] [INFO ] Implicit Places using invariants and state equation in 1230 ms returned []
Implicit Place search using SMT with State Equation took 1805 ms to find 0 implicit places.
[2024-05-28 16:51:21] [INFO ] Redundant transitions in 115 ms returned []
Running 1198 sub problems to find dead transitions.
[2024-05-28 16:51:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:51:42] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-28 16:51:42] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:51:42] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 16:51:42] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 16:51:42] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:51:43] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2024-05-28 16:51:43] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:51:43] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-28 16:51:43] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:51:44] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:51:44] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
[2024-05-28 16:51:44] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-28 16:51:44] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-05-28 16:51:44] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-28 16:51:45] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-28 16:51:45] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-05-28 16:51:45] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-28 16:51:46] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-05-28 16:51:46] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-05-28 16:51:46] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 20/1719 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:51:50] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:51:50] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 2 ms to minimize.
[2024-05-28 16:51:50] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 2 ms to minimize.
[2024-05-28 16:51:51] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:51:51] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2448 variables, and 1724 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30021 ms.
Refiners :[Domain max(s): 1249/1249 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1249 constraints, PredecessorRefiner: 1198/1198 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1249 variables, 25/1724 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:51:57] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 3 ms to minimize.
[2024-05-28 16:51:57] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 3 ms to minimize.
[2024-05-28 16:51:57] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 3 ms to minimize.
[2024-05-28 16:51:58] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 3 ms to minimize.
[2024-05-28 16:51:58] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 2 ms to minimize.
[2024-05-28 16:51:58] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 3 ms to minimize.
[2024-05-28 16:51:59] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 3 ms to minimize.
[2024-05-28 16:51:59] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 3 ms to minimize.
[2024-05-28 16:51:59] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 3 ms to minimize.
[2024-05-28 16:52:00] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 3 ms to minimize.
[2024-05-28 16:52:00] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 3 ms to minimize.
[2024-05-28 16:52:01] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 3 ms to minimize.
[2024-05-28 16:52:01] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 3 ms to minimize.
[2024-05-28 16:52:01] [INFO ] Deduced a trap composed of 22 places in 185 ms of which 4 ms to minimize.
[2024-05-28 16:52:02] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 4 ms to minimize.
[2024-05-28 16:52:02] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 3 ms to minimize.
[2024-05-28 16:52:03] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 4 ms to minimize.
[2024-05-28 16:52:03] [INFO ] Deduced a trap composed of 14 places in 199 ms of which 3 ms to minimize.
[2024-05-28 16:52:04] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 4 ms to minimize.
[2024-05-28 16:52:04] [INFO ] Deduced a trap composed of 14 places in 210 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1249 variables, 20/1744 constraints. Problems are: Problem set: 0 solved, 1198 unsolved
[2024-05-28 16:52:10] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 3 ms to minimize.
[2024-05-28 16:52:13] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 3 ms to minimize.
[2024-05-28 16:52:14] [INFO ] Deduced a trap composed of 22 places in 229 ms of which 4 ms to minimize.
[2024-05-28 16:52:14] [INFO ] Deduced a trap composed of 14 places in 241 ms of which 4 ms to minimize.
[2024-05-28 16:52:15] [INFO ] Deduced a trap composed of 14 places in 229 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1249/2448 variables, and 1749 constraints, problems are : Problem set: 0 solved, 1198 unsolved in 30022 ms.
Refiners :[Domain max(s): 1249/1249 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1249 constraints, PredecessorRefiner: 0/1198 constraints, Known Traps: 50/50 constraints]
After SMT, in 60272ms problems are : Problem set: 0 solved, 1198 unsolved
Search for dead transitions found 0 dead transitions in 60282ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62236 ms. Remains : 1249/1249 places, 1199/1199 transitions.
Built C files in :
/tmp/ltsmin5322708733585898134
[2024-05-28 16:52:21] [INFO ] Computing symmetric may disable matrix : 1199 transitions.
[2024-05-28 16:52:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:52:21] [INFO ] Computing symmetric may enable matrix : 1199 transitions.
[2024-05-28 16:52:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:52:21] [INFO ] Computing Do-Not-Accords matrix : 1199 transitions.
[2024-05-28 16:52:21] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:52:21] [INFO ] Built C files in 232ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5322708733585898134
Running compilation step : cd /tmp/ltsmin5322708733585898134;'/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/ltsmin5322708733585898134;'/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/ltsmin5322708733585898134;'/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-28 16:52:25] [INFO ] Flatten gal took : 36 ms
[2024-05-28 16:52:25] [INFO ] Flatten gal took : 36 ms
[2024-05-28 16:52:25] [INFO ] Time to serialize gal into /tmp/LTL16205298907092992247.gal : 12 ms
[2024-05-28 16:52:25] [INFO ] Time to serialize properties into /tmp/LTL9477716353897632393.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/LTL16205298907092992247.gal' '-t' 'CGAL' '-hoa' '/tmp/aut908806488596041518.hoa' '-atoms' '/tmp/LTL9477716353897632393.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/LTL9477716353897632393.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut908806488596041518.hoa
Detected timeout of ITS tools.
[2024-05-28 16:52:40] [INFO ] Flatten gal took : 47 ms
[2024-05-28 16:52:40] [INFO ] Flatten gal took : 35 ms
[2024-05-28 16:52:40] [INFO ] Time to serialize gal into /tmp/LTL384125611287008526.gal : 6 ms
[2024-05-28 16:52:40] [INFO ] Time to serialize properties into /tmp/LTL5622808096162907553.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/LTL384125611287008526.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5622808096162907553.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 : !((X(F("(p70==1)"))))
Formula 0 simplified : XG!"(p70==1)"
Detected timeout of ITS tools.
[2024-05-28 16:52:55] [INFO ] Flatten gal took : 36 ms
[2024-05-28 16:52:55] [INFO ] Applying decomposition
[2024-05-28 16:52:55] [INFO ] Flatten gal took : 40 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/graph12730083883463401185.txt' '-o' '/tmp/graph12730083883463401185.bin' '-w' '/tmp/graph12730083883463401185.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12730083883463401185.bin' '-l' '-1' '-v' '-w' '/tmp/graph12730083883463401185.weights' '-q' '0' '-e' '0.001'
[2024-05-28 16:52:55] [INFO ] Decomposing Gal with order
[2024-05-28 16:52:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 16:52:55] [INFO ] Removed a total of 795 redundant transitions.
[2024-05-28 16:52:55] [INFO ] Flatten gal took : 53 ms
[2024-05-28 16:52:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 596 labels/synchronizations in 5 ms.
[2024-05-28 16:52:55] [INFO ] Time to serialize gal into /tmp/LTL14822642991209582019.gal : 8 ms
[2024-05-28 16:52:55] [INFO ] Time to serialize properties into /tmp/LTL15928175328393284150.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/LTL14822642991209582019.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15928175328393284150.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 : !((X(F("(i1.u26.p70==1)"))))
Formula 0 simplified : XG!"(i1.u26.p70==1)"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-050A-LTLCardinality-07 finished in 281984 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((X(X(F(p0)))&&F(p1)))||G(p2)))'
Found a Shortening insensitive property : ShieldIIPs-PT-050A-LTLCardinality-12
Stuttering acceptance computed with spot in 350 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 54 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-28 16:53:11] [INFO ] Computed 451 invariants in 5 ms
[2024-05-28 16:53:11] [INFO ] Implicit Places using invariants in 594 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 595 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1250/1253 places, 1201/1203 transitions.
Applied a total of 0 rules in 23 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 672 ms. Remains : 1250/1253 places, 1201/1203 transitions.
Running random walk in product with property : ShieldIIPs-PT-050A-LTLCardinality-12
Product exploration explored 100000 steps with 106 reset in 867 ms.
Product exploration explored 100000 steps with 104 reset in 1079 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (AND p2 (NOT p1))), (X p2), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p2 (NOT p1)))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 111 ms. Reduced automaton from 9 states, 17 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
RANDOM walk for 5562 steps (0 resets) in 104 ms. (52 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (AND p2 (NOT p1))), (X p2), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p2 (NOT p1)))), (X (X p2))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 9 factoid took 156 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
// Phase 1: matrix 1201 rows 1250 cols
[2024-05-28 16:53:14] [INFO ] Computed 450 invariants in 5 ms
[2024-05-28 16:53:15] [INFO ] [Real]Absence check using 450 positive place invariants in 266 ms returned sat
[2024-05-28 16:53:19] [INFO ] [Real]Absence check using state equation in 3310 ms returned sat
[2024-05-28 16:53:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:53:20] [INFO ] [Nat]Absence check using 450 positive place invariants in 227 ms returned sat
[2024-05-28 16:53:22] [INFO ] [Nat]Absence check using state equation in 2435 ms returned sat
[2024-05-28 16:53:22] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:53:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2024-05-28 16:53:22] [INFO ] Computed and/alt/rep : 1102/3821/1102 causal constraints (skipped 98 transitions) in 62 ms.
Could not prove EG (NOT p1)
[2024-05-28 16:53:34] [INFO ] Invariant cache hit.
[2024-05-28 16:53:35] [INFO ] [Real]Absence check using 450 positive place invariants in 229 ms returned sat
[2024-05-28 16:53:37] [INFO ] [Real]Absence check using state equation in 2743 ms returned sat
[2024-05-28 16:53:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:53:39] [INFO ] [Nat]Absence check using 450 positive place invariants in 221 ms returned sat
[2024-05-28 16:53:41] [INFO ] [Nat]Absence check using state equation in 2604 ms returned sat
[2024-05-28 16:53:41] [INFO ] Computed and/alt/rep : 1102/3821/1102 causal constraints (skipped 98 transitions) in 66 ms.
[2024-05-28 16:53:52] [INFO ] Added : 530 causal constraints over 106 iterations in 11262 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 4 out of 1250 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 22 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2024-05-28 16:53:52] [INFO ] Invariant cache hit.
[2024-05-28 16:53:53] [INFO ] Implicit Places using invariants in 624 ms returned []
[2024-05-28 16:53:53] [INFO ] Invariant cache hit.
[2024-05-28 16:53:54] [INFO ] Implicit Places using invariants and state equation in 1379 ms returned []
Implicit Place search using SMT with State Equation took 2003 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-28 16:53:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2451 variables, and 1249 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30027 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (OVERLAPS) 1/1250 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 16:54:46] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-28 16:54:47] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-28 16:54:47] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 16:54:47] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:54:47] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:54:47] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:54:48] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:54:48] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:54:48] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:54:48] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-28 16:54:48] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:54:49] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 2 ms to minimize.
[2024-05-28 16:54:49] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-05-28 16:54:49] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-28 16:54:49] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-28 16:54:50] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-28 16:54:50] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-05-28 16:54:50] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-28 16:54:50] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-05-28 16:54:51] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 16:54:54] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-28 16:54:55] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
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 1250/2451 variables, and 1722 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30021 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 22/22 constraints]
After SMT, in 60382ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60393ms
Finished structural reductions in LTL mode , in 1 iterations and 62421 ms. Remains : 1250/1250 places, 1201/1201 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
RANDOM walk for 5716 steps (0 resets) in 87 ms. (64 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
[2024-05-28 16:54:56] [INFO ] Invariant cache hit.
[2024-05-28 16:54:57] [INFO ] [Real]Absence check using 450 positive place invariants in 242 ms returned sat
[2024-05-28 16:55:00] [INFO ] [Real]Absence check using state equation in 2963 ms returned sat
[2024-05-28 16:55:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:55:01] [INFO ] [Nat]Absence check using 450 positive place invariants in 210 ms returned sat
[2024-05-28 16:55:03] [INFO ] [Nat]Absence check using state equation in 2663 ms returned sat
[2024-05-28 16:55:04] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-28 16:55:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2024-05-28 16:55:04] [INFO ] Computed and/alt/rep : 1102/3821/1102 causal constraints (skipped 98 transitions) in 67 ms.
[2024-05-28 16:55:15] [INFO ] Added : 470 causal constraints over 94 iterations in 11169 ms. Result :unknown
Could not prove EG (NOT p1)
[2024-05-28 16:55:15] [INFO ] Invariant cache hit.
[2024-05-28 16:55:16] [INFO ] [Real]Absence check using 450 positive place invariants in 262 ms returned sat
[2024-05-28 16:55:19] [INFO ] [Real]Absence check using state equation in 2676 ms returned sat
[2024-05-28 16:55:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:55:20] [INFO ] [Nat]Absence check using 450 positive place invariants in 217 ms returned sat
[2024-05-28 16:55:22] [INFO ] [Nat]Absence check using state equation in 2535 ms returned sat
[2024-05-28 16:55:22] [INFO ] Computed and/alt/rep : 1102/3821/1102 causal constraints (skipped 98 transitions) in 59 ms.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 108 reset in 874 ms.
Product exploration explored 100000 steps with 117 reset in 1079 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Support contains 4 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 27 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2024-05-28 16:55:36] [INFO ] Redundant transitions in 112 ms returned [1195]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1199 sub problems to find dead transitions.
// Phase 1: matrix 1200 rows 1250 cols
[2024-05-28 16:55:36] [INFO ] Computed 450 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 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 1249/2450 variables, and 1249 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30041 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1199/1199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 2 (OVERLAPS) 1/1250 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:56:28] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 16:56:28] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-28 16:56:29] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:56:29] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 16:56:29] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:56:29] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:56:29] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-28 16:56:30] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:56:30] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-28 16:56:30] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-28 16:56:30] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:56:31] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
[2024-05-28 16:56:31] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-28 16:56:31] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-28 16:56:31] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:56:32] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-05-28 16:56:32] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-28 16:56:32] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-28 16:56:32] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-28 16:56:33] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:56:36] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-05-28 16:56:37] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
SMT process timed out in 60486ms, After SMT, problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 60497ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1250 places, 1200/1201 transitions.
Applied a total of 0 rules in 22 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60669 ms. Remains : 1250/1250 places, 1200/1201 transitions.
Built C files in :
/tmp/ltsmin13745611325295058142
[2024-05-28 16:56:37] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13745611325295058142
Running compilation step : cd /tmp/ltsmin13745611325295058142;'/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 2737 ms.
Running link step : cd /tmp/ltsmin13745611325295058142;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13745611325295058142;'/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' '--hoa' '/tmp/stateBased3670270660935044400.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 1250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 15 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1250 cols
[2024-05-28 16:56:52] [INFO ] Computed 450 invariants in 4 ms
[2024-05-28 16:56:52] [INFO ] Implicit Places using invariants in 680 ms returned []
[2024-05-28 16:56:52] [INFO ] Invariant cache hit.
[2024-05-28 16:56:54] [INFO ] Implicit Places using invariants and state equation in 1338 ms returned []
Implicit Place search using SMT with State Equation took 2020 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-05-28 16:56:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2451 variables, and 1249 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30025 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (OVERLAPS) 1/1250 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 16:57:45] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:57:45] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 16:57:46] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-28 16:57:46] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2024-05-28 16:57:46] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 16:57:46] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 16:57:46] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-28 16:57:47] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:57:47] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:57:47] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 16:57:47] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-28 16:57:48] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:57:48] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-28 16:57:48] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-28 16:57:48] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-05-28 16:57:49] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-28 16:57:49] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-05-28 16:57:49] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-28 16:57:50] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:57:50] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-28 16:57:54] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
[2024-05-28 16:57:54] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-28 16:57:54] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
SMT process timed out in 60485ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60496ms
Finished structural reductions in LTL mode , in 1 iterations and 62533 ms. Remains : 1250/1250 places, 1201/1201 transitions.
Built C files in :
/tmp/ltsmin7285925937530308983
[2024-05-28 16:57:54] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7285925937530308983
Running compilation step : cd /tmp/ltsmin7285925937530308983;'/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 2786 ms.
Running link step : cd /tmp/ltsmin7285925937530308983;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin7285925937530308983;'/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' '--hoa' '/tmp/stateBased5198569383011949018.hoa' '--buchi-type=spotba'
LTSmin run took 4693 ms.
Treatment of property ShieldIIPs-PT-050A-LTLCardinality-12 finished in 291680 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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)))'
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)))'
Found a Shortening insensitive property : ShieldIIPs-PT-050A-LTLCardinality-15
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 57 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-28 16:58:02] [INFO ] Computed 451 invariants in 3 ms
[2024-05-28 16:58:03] [INFO ] Implicit Places using invariants in 675 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 675 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1250/1253 places, 1201/1203 transitions.
Applied a total of 0 rules in 22 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 756 ms. Remains : 1250/1253 places, 1201/1203 transitions.
Running random walk in product with property : ShieldIIPs-PT-050A-LTLCardinality-15
Product exploration explored 100000 steps with 177 reset in 863 ms.
Product exploration explored 100000 steps with 173 reset in 1088 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 114 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 87 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 31 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1250 cols
[2024-05-28 16:58:05] [INFO ] Computed 450 invariants in 6 ms
[2024-05-28 16:58:06] [INFO ] Implicit Places using invariants in 653 ms returned []
[2024-05-28 16:58:06] [INFO ] Invariant cache hit.
[2024-05-28 16:58:07] [INFO ] Implicit Places using invariants and state equation in 1402 ms returned []
Implicit Place search using SMT with State Equation took 2056 ms to find 0 implicit places.
[2024-05-28 16:58:07] [INFO ] Redundant transitions in 126 ms returned [1195]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 1199 sub problems to find dead transitions.
// Phase 1: matrix 1200 rows 1250 cols
[2024-05-28 16:58:08] [INFO ] Computed 450 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2450 variables, and 1249 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30024 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1199/1199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 2 (OVERLAPS) 1/1250 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:59:00] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:59:00] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-28 16:59:00] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-28 16:59:00] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 16:59:00] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 16:59:01] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-28 16:59:01] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 16:59:01] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 16:59:01] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 16:59:01] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 16:59:02] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-05-28 16:59:02] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-05-28 16:59:02] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-28 16:59:02] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-28 16:59:03] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-28 16:59:03] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-28 16:59:03] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-28 16:59:03] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-05-28 16:59:04] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-05-28 16:59:04] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 16:59:08] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:59:08] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
SMT process timed out in 60447ms, After SMT, problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 60459ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1250/1250 places, 1200/1201 transitions.
Applied a total of 0 rules in 26 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62710 ms. Remains : 1250/1250 places, 1200/1201 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 85 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 52 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 173 reset in 861 ms.
Product exploration explored 100000 steps with 176 reset in 1075 ms.
Built C files in :
/tmp/ltsmin6900475282411554982
[2024-05-28 16:59:10] [INFO ] Computing symmetric may disable matrix : 1200 transitions.
[2024-05-28 16:59:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:59:10] [INFO ] Computing symmetric may enable matrix : 1200 transitions.
[2024-05-28 16:59:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:59:11] [INFO ] Computing Do-Not-Accords matrix : 1200 transitions.
[2024-05-28 16:59:11] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 16:59:11] [INFO ] Built C files in 234ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6900475282411554982
Running compilation step : cd /tmp/ltsmin6900475282411554982;'/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/ltsmin6900475282411554982;'/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/ltsmin6900475282411554982;'/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 2 out of 1250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1250/1250 places, 1200/1200 transitions.
Applied a total of 0 rules in 23 ms. Remains 1250 /1250 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2024-05-28 16:59:14] [INFO ] Invariant cache hit.
[2024-05-28 16:59:14] [INFO ] Implicit Places using invariants in 619 ms returned []
[2024-05-28 16:59:14] [INFO ] Invariant cache hit.
[2024-05-28 16:59:16] [INFO ] Implicit Places using invariants and state equation in 1278 ms returned []
Implicit Place search using SMT with State Equation took 1899 ms to find 0 implicit places.
[2024-05-28 16:59:16] [INFO ] Redundant transitions in 121 ms returned []
Running 1199 sub problems to find dead transitions.
[2024-05-28 16:59:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1249/2450 variables, and 1249 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30023 ms.
Refiners :[Domain max(s): 1249/1250 constraints, Positive P Invariants (semi-flows): 0/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 1199/1199 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1249 variables, 1249/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1249 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 2 (OVERLAPS) 1/1250 variables, 450/1699 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1250 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 17:00:07] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 17:00:07] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-28 17:00:08] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 17:00:08] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:00:08] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:00:08] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2024-05-28 17:00:08] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:00:09] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 17:00:09] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:00:09] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-28 17:00:09] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-28 17:00:10] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2024-05-28 17:00:10] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-28 17:00:10] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-05-28 17:00:10] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-05-28 17:00:11] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-28 17:00:11] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-28 17:00:11] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-28 17:00:12] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-05-28 17:00:12] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 20/1720 constraints. Problems are: Problem set: 0 solved, 1199 unsolved
[2024-05-28 17:00:16] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
[2024-05-28 17:00:16] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1250/2450 variables, and 1722 constraints, problems are : Problem set: 0 solved, 1199 unsolved in 30024 ms.
Refiners :[Domain max(s): 1250/1250 constraints, Positive P Invariants (semi-flows): 450/450 constraints, State Equation: 0/1250 constraints, PredecessorRefiner: 0/1199 constraints, Known Traps: 22/22 constraints]
After SMT, in 60357ms problems are : Problem set: 0 solved, 1199 unsolved
Search for dead transitions found 0 dead transitions in 60367ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62421 ms. Remains : 1250/1250 places, 1200/1200 transitions.
Built C files in :
/tmp/ltsmin9284113352662724463
[2024-05-28 17:00:16] [INFO ] Computing symmetric may disable matrix : 1200 transitions.
[2024-05-28 17:00:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:00:16] [INFO ] Computing symmetric may enable matrix : 1200 transitions.
[2024-05-28 17:00:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:00:16] [INFO ] Computing Do-Not-Accords matrix : 1200 transitions.
[2024-05-28 17:00:16] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:00:16] [INFO ] Built C files in 231ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9284113352662724463
Running compilation step : cd /tmp/ltsmin9284113352662724463;'/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/ltsmin9284113352662724463;'/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/ltsmin9284113352662724463;'/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-28 17:00:19] [INFO ] Flatten gal took : 58 ms
[2024-05-28 17:00:19] [INFO ] Flatten gal took : 47 ms
[2024-05-28 17:00:19] [INFO ] Time to serialize gal into /tmp/LTL7404945280741228718.gal : 5 ms
[2024-05-28 17:00:19] [INFO ] Time to serialize properties into /tmp/LTL16993916843476495852.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/LTL7404945280741228718.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15082014924447292821.hoa' '-atoms' '/tmp/LTL16993916843476495852.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/LTL16993916843476495852.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15082014924447292821.hoa
Detected timeout of ITS tools.
[2024-05-28 17:00:35] [INFO ] Flatten gal took : 47 ms
[2024-05-28 17:00:35] [INFO ] Flatten gal took : 47 ms
[2024-05-28 17:00:35] [INFO ] Time to serialize gal into /tmp/LTL9417948318194261568.gal : 6 ms
[2024-05-28 17:00:35] [INFO ] Time to serialize properties into /tmp/LTL5064337815429718984.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/LTL9417948318194261568.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5064337815429718984.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("((p487==0)||(p961==1))"))))
Formula 0 simplified : XG!"((p487==0)||(p961==1))"
Detected timeout of ITS tools.
[2024-05-28 17:00:50] [INFO ] Flatten gal took : 46 ms
[2024-05-28 17:00:50] [INFO ] Applying decomposition
[2024-05-28 17:00:50] [INFO ] Flatten gal took : 46 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/graph2793727511308805675.txt' '-o' '/tmp/graph2793727511308805675.bin' '-w' '/tmp/graph2793727511308805675.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2793727511308805675.bin' '-l' '-1' '-v' '-w' '/tmp/graph2793727511308805675.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:00:50] [INFO ] Decomposing Gal with order
[2024-05-28 17:00:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:00:50] [INFO ] Removed a total of 795 redundant transitions.
[2024-05-28 17:00:50] [INFO ] Flatten gal took : 53 ms
[2024-05-28 17:00:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 596 labels/synchronizations in 30 ms.
[2024-05-28 17:00:50] [INFO ] Time to serialize gal into /tmp/LTL1072636357708419700.gal : 9 ms
[2024-05-28 17:00:50] [INFO ] Time to serialize properties into /tmp/LTL13210080932889900658.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/LTL1072636357708419700.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13210080932889900658.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("((i11.u176.p487==0)||(i21.u346.p961==1))"))))
Formula 0 simplified : XG!"((i11.u176.p487==0)||(i21.u346.p961==1))"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-050A-LTLCardinality-15 finished in 183109 ms.
[2024-05-28 17:01:05] [INFO ] Flatten gal took : 48 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10851644959598108950
[2024-05-28 17:01:05] [INFO ] Computing symmetric may disable matrix : 1203 transitions.
[2024-05-28 17:01:05] [INFO ] Applying decomposition
[2024-05-28 17:01:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:01:05] [INFO ] Computing symmetric may enable matrix : 1203 transitions.
[2024-05-28 17:01:05] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:01:05] [INFO ] Flatten gal took : 48 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/graph11236888656056925920.txt' '-o' '/tmp/graph11236888656056925920.bin' '-w' '/tmp/graph11236888656056925920.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11236888656056925920.bin' '-l' '-1' '-v' '-w' '/tmp/graph11236888656056925920.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:01:05] [INFO ] Decomposing Gal with order
[2024-05-28 17:01:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:01:05] [INFO ] Computing Do-Not-Accords matrix : 1203 transitions.
[2024-05-28 17:01:05] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 17:01:05] [INFO ] Built C files in 243ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10851644959598108950
Running compilation step : cd /tmp/ltsmin10851644959598108950;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '180' '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-28 17:01:05] [INFO ] Removed a total of 800 redundant transitions.
[2024-05-28 17:01:05] [INFO ] Flatten gal took : 52 ms
[2024-05-28 17:01:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 740 labels/synchronizations in 51 ms.
[2024-05-28 17:01:05] [INFO ] Time to serialize gal into /tmp/LTLCardinality12109435512454791201.gal : 12 ms
[2024-05-28 17:01:05] [INFO ] Time to serialize properties into /tmp/LTLCardinality12907417754241630341.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/LTLCardinality12109435512454791201.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12907417754241630341.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...278
Read 4 LTL properties
Checking formula 0 : !((X(F("(i1.i1.i2.u26.p70==1)"))))
Formula 0 simplified : XG!"(i1.i1.i2.u26.p70==1)"
Compilation finished in 4617 ms.
Running link step : cd /tmp/ltsmin10851644959598108950;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin10851644959598108950;'/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(<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin10851644959598108950;'/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(<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10851644959598108950;'/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(X(<>((LTLAPp1==true))))&&<>((LTLAPp2==true))))||[]((LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin10851644959598108950;'/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(X(<>((LTLAPp1==true))))&&<>((LTLAPp2==true))))||[]((LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10851644959598108950;'/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' '<>([]((LTLAPp4==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin10851644959598108950;'/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' '<>([]((LTLAPp4==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10851644959598108950;'/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(<>((LTLAPp5==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin10851644959598108950;'/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(<>((LTLAPp5==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin10851644959598108950;'/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(<>((LTLAPp0==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="ShieldIIPs-PT-050A"
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 ShieldIIPs-PT-050A, 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-171683760500147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-050A.tgz
mv ShieldIIPs-PT-050A 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 ;