About the Execution of 2023-gold for ShieldIIPt-PT-040B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16216.928 | 3600000.00 | 5587027.00 | 210964.50 | FFFFFF??F??FFFFF | 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.r373-tall-171683788700198.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 gold2023
Input is ShieldIIPt-PT-040B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788700198
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 20:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Apr 12 20:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 20:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 20:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 686K 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 ShieldIIPt-PT-040B-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716955641555
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-040B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 04:07:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 04:07:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 04:07:23] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2024-05-29 04:07:23] [INFO ] Transformed 2803 places.
[2024-05-29 04:07:23] [INFO ] Transformed 2603 transitions.
[2024-05-29 04:07:23] [INFO ] Found NUPN structural information;
[2024-05-29 04:07:23] [INFO ] Parsed PT model containing 2803 places and 2603 transitions and 6486 arcs in 313 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPt-PT-040B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 2803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Discarding 433 places :
Symmetric choice reduction at 0 with 433 rule applications. Total rules 433 place count 2370 transition count 2170
Iterating global reduction 0 with 433 rules applied. Total rules applied 866 place count 2370 transition count 2170
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 867 place count 2369 transition count 2169
Iterating global reduction 0 with 1 rules applied. Total rules applied 868 place count 2369 transition count 2169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 869 place count 2368 transition count 2168
Iterating global reduction 0 with 1 rules applied. Total rules applied 870 place count 2368 transition count 2168
Applied a total of 870 rules in 955 ms. Remains 2368 /2803 variables (removed 435) and now considering 2168/2603 (removed 435) transitions.
// Phase 1: matrix 2168 rows 2368 cols
[2024-05-29 04:07:28] [INFO ] Computed 361 invariants in 49 ms
[2024-05-29 04:07:30] [INFO ] Implicit Places using invariants in 1178 ms returned []
[2024-05-29 04:07:30] [INFO ] Invariant cache hit.
[2024-05-29 04:07:32] [INFO ] Implicit Places using invariants and state equation in 2437 ms returned []
Implicit Place search using SMT with State Equation took 7682 ms to find 0 implicit places.
[2024-05-29 04:07:32] [INFO ] Invariant cache hit.
[2024-05-29 04:07:34] [INFO ] Dead Transitions using invariants and state equation in 1727 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2368/2803 places, 2168/2603 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10381 ms. Remains : 2368/2803 places, 2168/2603 transitions.
Support contains 44 out of 2368 places after structural reductions.
[2024-05-29 04:07:34] [INFO ] Flatten gal took : 163 ms
[2024-05-29 04:07:34] [INFO ] Flatten gal took : 90 ms
[2024-05-29 04:07:34] [INFO ] Input system was already deterministic with 2168 transitions.
Support contains 43 out of 2368 places (down from 44) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 614 ms. (steps per millisecond=16 ) properties (out of 32) seen :14
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2024-05-29 04:07:35] [INFO ] Invariant cache hit.
[2024-05-29 04:07:36] [INFO ] [Real]Absence check using 361 positive place invariants in 141 ms returned sat
[2024-05-29 04:07:36] [INFO ] After 1284ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2024-05-29 04:07:38] [INFO ] [Nat]Absence check using 361 positive place invariants in 151 ms returned sat
[2024-05-29 04:07:41] [INFO ] After 2393ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2024-05-29 04:07:41] [INFO ] Deduced a trap composed of 19 places in 531 ms of which 10 ms to minimize.
[2024-05-29 04:07:42] [INFO ] Deduced a trap composed of 28 places in 475 ms of which 8 ms to minimize.
[2024-05-29 04:07:42] [INFO ] Deduced a trap composed of 17 places in 451 ms of which 2 ms to minimize.
[2024-05-29 04:07:43] [INFO ] Deduced a trap composed of 29 places in 500 ms of which 3 ms to minimize.
[2024-05-29 04:07:43] [INFO ] Deduced a trap composed of 16 places in 423 ms of which 2 ms to minimize.
[2024-05-29 04:07:44] [INFO ] Deduced a trap composed of 24 places in 499 ms of which 2 ms to minimize.
[2024-05-29 04:07:45] [INFO ] Deduced a trap composed of 31 places in 468 ms of which 1 ms to minimize.
[2024-05-29 04:07:45] [INFO ] Deduced a trap composed of 29 places in 480 ms of which 2 ms to minimize.
[2024-05-29 04:07:46] [INFO ] Deduced a trap composed of 38 places in 453 ms of which 1 ms to minimize.
[2024-05-29 04:07:46] [INFO ] Deduced a trap composed of 32 places in 452 ms of which 1 ms to minimize.
[2024-05-29 04:07:47] [INFO ] Deduced a trap composed of 28 places in 419 ms of which 1 ms to minimize.
[2024-05-29 04:07:47] [INFO ] Deduced a trap composed of 37 places in 437 ms of which 1 ms to minimize.
[2024-05-29 04:07:48] [INFO ] Deduced a trap composed of 24 places in 423 ms of which 1 ms to minimize.
[2024-05-29 04:07:48] [INFO ] Deduced a trap composed of 19 places in 395 ms of which 2 ms to minimize.
[2024-05-29 04:07:49] [INFO ] Deduced a trap composed of 16 places in 413 ms of which 1 ms to minimize.
[2024-05-29 04:07:49] [INFO ] Deduced a trap composed of 21 places in 485 ms of which 1 ms to minimize.
[2024-05-29 04:07:50] [INFO ] Deduced a trap composed of 23 places in 415 ms of which 1 ms to minimize.
[2024-05-29 04:07:50] [INFO ] Deduced a trap composed of 20 places in 384 ms of which 1 ms to minimize.
[2024-05-29 04:07:51] [INFO ] Deduced a trap composed of 30 places in 373 ms of which 1 ms to minimize.
[2024-05-29 04:07:51] [INFO ] Deduced a trap composed of 26 places in 385 ms of which 1 ms to minimize.
[2024-05-29 04:07:51] [INFO ] Deduced a trap composed of 22 places in 369 ms of which 1 ms to minimize.
[2024-05-29 04:07:52] [INFO ] Deduced a trap composed of 28 places in 334 ms of which 1 ms to minimize.
[2024-05-29 04:07:52] [INFO ] Deduced a trap composed of 29 places in 346 ms of which 2 ms to minimize.
[2024-05-29 04:07:53] [INFO ] Deduced a trap composed of 28 places in 350 ms of which 1 ms to minimize.
[2024-05-29 04:07:53] [INFO ] Deduced a trap composed of 27 places in 343 ms of which 0 ms to minimize.
[2024-05-29 04:07:53] [INFO ] Deduced a trap composed of 20 places in 330 ms of which 0 ms to minimize.
[2024-05-29 04:07:54] [INFO ] Deduced a trap composed of 35 places in 302 ms of which 1 ms to minimize.
[2024-05-29 04:07:54] [INFO ] Deduced a trap composed of 29 places in 310 ms of which 1 ms to minimize.
[2024-05-29 04:07:55] [INFO ] Deduced a trap composed of 36 places in 288 ms of which 1 ms to minimize.
[2024-05-29 04:07:55] [INFO ] Deduced a trap composed of 32 places in 285 ms of which 1 ms to minimize.
[2024-05-29 04:07:55] [INFO ] Deduced a trap composed of 26 places in 293 ms of which 1 ms to minimize.
[2024-05-29 04:07:56] [INFO ] Deduced a trap composed of 37 places in 305 ms of which 1 ms to minimize.
[2024-05-29 04:07:56] [INFO ] Deduced a trap composed of 39 places in 295 ms of which 1 ms to minimize.
[2024-05-29 04:07:56] [INFO ] Deduced a trap composed of 38 places in 292 ms of which 5 ms to minimize.
[2024-05-29 04:07:57] [INFO ] Deduced a trap composed of 40 places in 268 ms of which 1 ms to minimize.
[2024-05-29 04:07:57] [INFO ] Deduced a trap composed of 39 places in 264 ms of which 1 ms to minimize.
[2024-05-29 04:07:57] [INFO ] Deduced a trap composed of 43 places in 246 ms of which 1 ms to minimize.
[2024-05-29 04:07:58] [INFO ] Deduced a trap composed of 31 places in 242 ms of which 1 ms to minimize.
[2024-05-29 04:07:58] [INFO ] Deduced a trap composed of 48 places in 238 ms of which 1 ms to minimize.
[2024-05-29 04:07:58] [INFO ] Deduced a trap composed of 42 places in 243 ms of which 1 ms to minimize.
[2024-05-29 04:07:59] [INFO ] Deduced a trap composed of 40 places in 236 ms of which 1 ms to minimize.
[2024-05-29 04:07:59] [INFO ] Deduced a trap composed of 52 places in 245 ms of which 1 ms to minimize.
[2024-05-29 04:07:59] [INFO ] Deduced a trap composed of 37 places in 224 ms of which 1 ms to minimize.
[2024-05-29 04:08:00] [INFO ] Deduced a trap composed of 50 places in 227 ms of which 0 ms to minimize.
[2024-05-29 04:08:00] [INFO ] Deduced a trap composed of 55 places in 208 ms of which 1 ms to minimize.
[2024-05-29 04:08:00] [INFO ] Deduced a trap composed of 53 places in 207 ms of which 1 ms to minimize.
[2024-05-29 04:08:00] [INFO ] Deduced a trap composed of 54 places in 211 ms of which 1 ms to minimize.
[2024-05-29 04:08:01] [INFO ] Deduced a trap composed of 51 places in 203 ms of which 1 ms to minimize.
[2024-05-29 04:08:01] [INFO ] Deduced a trap composed of 53 places in 193 ms of which 1 ms to minimize.
[2024-05-29 04:08:01] [INFO ] Deduced a trap composed of 50 places in 189 ms of which 1 ms to minimize.
[2024-05-29 04:08:02] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 04:08:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 04:08:02] [INFO ] After 25112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:18
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 1903 ms.
Support contains 29 out of 2368 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Drop transitions removed 462 transitions
Trivial Post-agglo rules discarded 462 transitions
Performed 462 trivial Post agglomeration. Transition count delta: 462
Iterating post reduction 0 with 462 rules applied. Total rules applied 462 place count 2368 transition count 1706
Reduce places removed 462 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 467 rules applied. Total rules applied 929 place count 1906 transition count 1701
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 934 place count 1901 transition count 1701
Performed 312 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 312 Pre rules applied. Total rules applied 934 place count 1901 transition count 1389
Deduced a syphon composed of 312 places in 3 ms
Reduce places removed 312 places and 0 transitions.
Iterating global reduction 3 with 624 rules applied. Total rules applied 1558 place count 1589 transition count 1389
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1560 place count 1587 transition count 1387
Iterating global reduction 3 with 2 rules applied. Total rules applied 1562 place count 1587 transition count 1387
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1562 place count 1587 transition count 1385
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1566 place count 1585 transition count 1385
Performed 677 Post agglomeration using F-continuation condition.Transition count delta: 677
Deduced a syphon composed of 677 places in 7 ms
Reduce places removed 677 places and 0 transitions.
Iterating global reduction 3 with 1354 rules applied. Total rules applied 2920 place count 908 transition count 708
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2921 place count 908 transition count 707
Renaming transitions due to excessive name length > 1024 char.
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 4 with 2 rules applied. Total rules applied 2923 place count 907 transition count 706
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3125 place count 806 transition count 769
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 3153 place count 792 transition count 778
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3154 place count 792 transition count 777
Partial Free-agglomeration rule applied 37 times.
Drop transitions removed 37 transitions
Iterating global reduction 5 with 37 rules applied. Total rules applied 3191 place count 792 transition count 777
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3192 place count 791 transition count 776
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3194 place count 789 transition count 776
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3194 place count 789 transition count 775
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3196 place count 788 transition count 775
Applied a total of 3196 rules in 645 ms. Remains 788 /2368 variables (removed 1580) and now considering 775/2168 (removed 1393) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 646 ms. Remains : 788/2368 places, 775/2168 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 18) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 775 rows 788 cols
[2024-05-29 04:08:05] [INFO ] Computed 359 invariants in 7 ms
[2024-05-29 04:08:06] [INFO ] [Real]Absence check using 359 positive place invariants in 58 ms returned sat
[2024-05-29 04:08:06] [INFO ] After 378ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-29 04:08:06] [INFO ] [Nat]Absence check using 359 positive place invariants in 57 ms returned sat
[2024-05-29 04:08:07] [INFO ] After 674ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-05-29 04:08:07] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 04:08:07] [INFO ] After 413ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2024-05-29 04:08:08] [INFO ] After 1082ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 381 ms.
[2024-05-29 04:08:08] [INFO ] After 2634ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 178 ms.
Support contains 23 out of 788 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 788/788 places, 775/775 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 788 transition count 773
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 786 transition count 773
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 783 transition count 770
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 783 transition count 770
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 782 transition count 769
Applied a total of 12 rules in 73 ms. Remains 782 /788 variables (removed 6) and now considering 769/775 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 782/788 places, 769/775 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 100953 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 100953 steps, saw 85456 distinct states, run finished after 3008 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 769 rows 782 cols
[2024-05-29 04:08:13] [INFO ] Computed 359 invariants in 4 ms
[2024-05-29 04:08:13] [INFO ] [Real]Absence check using 359 positive place invariants in 57 ms returned sat
[2024-05-29 04:08:13] [INFO ] After 361ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-29 04:08:14] [INFO ] [Nat]Absence check using 359 positive place invariants in 56 ms returned sat
[2024-05-29 04:08:15] [INFO ] After 679ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-05-29 04:08:15] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 04:08:15] [INFO ] After 402ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2024-05-29 04:08:15] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2024-05-29 04:08:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2024-05-29 04:08:16] [INFO ] After 1166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 426 ms.
[2024-05-29 04:08:16] [INFO ] After 2751ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 229 ms.
Support contains 23 out of 782 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 782/782 places, 769/769 transitions.
Applied a total of 0 rules in 16 ms. Remains 782 /782 variables (removed 0) and now considering 769/769 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 782/782 places, 769/769 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 782/782 places, 769/769 transitions.
Applied a total of 0 rules in 19 ms. Remains 782 /782 variables (removed 0) and now considering 769/769 (removed 0) transitions.
[2024-05-29 04:08:16] [INFO ] Invariant cache hit.
[2024-05-29 04:08:17] [INFO ] Implicit Places using invariants in 443 ms returned [771]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 446 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 781/782 places, 769/769 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 780 transition count 768
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 780 transition count 768
Applied a total of 2 rules in 26 ms. Remains 780 /781 variables (removed 1) and now considering 768/769 (removed 1) transitions.
// Phase 1: matrix 768 rows 780 cols
[2024-05-29 04:08:17] [INFO ] Computed 358 invariants in 3 ms
[2024-05-29 04:08:18] [INFO ] Implicit Places using invariants in 625 ms returned []
[2024-05-29 04:08:18] [INFO ] Invariant cache hit.
[2024-05-29 04:08:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 04:08:18] [INFO ] Implicit Places using invariants and state equation in 913 ms returned []
Implicit Place search using SMT with State Equation took 1540 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 780/782 places, 768/769 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2031 ms. Remains : 780/782 places, 768/769 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 97820 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97820 steps, saw 82769 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 14 properties.
[2024-05-29 04:08:23] [INFO ] Invariant cache hit.
[2024-05-29 04:08:23] [INFO ] [Real]Absence check using 358 positive place invariants in 50 ms returned sat
[2024-05-29 04:08:23] [INFO ] After 358ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2024-05-29 04:08:23] [INFO ] [Nat]Absence check using 358 positive place invariants in 52 ms returned sat
[2024-05-29 04:08:24] [INFO ] After 650ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2024-05-29 04:08:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 04:08:25] [INFO ] After 401ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2024-05-29 04:08:25] [INFO ] After 1032ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 385 ms.
[2024-05-29 04:08:26] [INFO ] After 2530ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 9 different solutions.
Parikh walk visited 4 properties in 357 ms.
Support contains 17 out of 780 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 780/780 places, 768/768 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 780 transition count 767
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 779 transition count 767
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 779 transition count 765
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 777 transition count 765
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 776 transition count 764
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 773 transition count 767
Applied a total of 14 rules in 49 ms. Remains 773 /780 variables (removed 7) and now considering 767/768 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 773/780 places, 767/768 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 158896 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 158896 steps, saw 132650 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 767 rows 773 cols
[2024-05-29 04:08:30] [INFO ] Computed 358 invariants in 5 ms
[2024-05-29 04:08:30] [INFO ] [Real]Absence check using 358 positive place invariants in 54 ms returned sat
[2024-05-29 04:08:30] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-29 04:08:31] [INFO ] [Nat]Absence check using 358 positive place invariants in 52 ms returned sat
[2024-05-29 04:08:31] [INFO ] After 556ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-29 04:08:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 04:08:31] [INFO ] After 295ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2024-05-29 04:08:32] [INFO ] After 772ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 298 ms.
[2024-05-29 04:08:32] [INFO ] After 1994ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 134 ms.
Support contains 17 out of 773 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 773/773 places, 767/767 transitions.
Applied a total of 0 rules in 18 ms. Remains 773 /773 variables (removed 0) and now considering 767/767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 773/773 places, 767/767 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 773/773 places, 767/767 transitions.
Applied a total of 0 rules in 23 ms. Remains 773 /773 variables (removed 0) and now considering 767/767 (removed 0) transitions.
[2024-05-29 04:08:32] [INFO ] Invariant cache hit.
[2024-05-29 04:08:33] [INFO ] Implicit Places using invariants in 507 ms returned []
[2024-05-29 04:08:33] [INFO ] Invariant cache hit.
[2024-05-29 04:08:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 04:08:34] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1394 ms to find 0 implicit places.
[2024-05-29 04:08:34] [INFO ] Redundant transitions in 38 ms returned []
[2024-05-29 04:08:34] [INFO ] Invariant cache hit.
[2024-05-29 04:08:34] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1870 ms. Remains : 773/773 places, 767/767 transitions.
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 0 with 79 rules applied. Total rules applied 79 place count 773 transition count 767
Applied a total of 79 rules in 30 ms. Remains 773 /773 variables (removed 0) and now considering 767/767 (removed 0) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 767 rows 773 cols
[2024-05-29 04:08:34] [INFO ] Computed 358 invariants in 4 ms
[2024-05-29 04:08:35] [INFO ] [Real]Absence check using 358 positive place invariants in 55 ms returned sat
[2024-05-29 04:08:35] [INFO ] After 287ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-29 04:08:35] [INFO ] [Nat]Absence check using 358 positive place invariants in 56 ms returned sat
[2024-05-29 04:08:36] [INFO ] After 580ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-29 04:08:36] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-29 04:08:36] [INFO ] After 488ms SMT Verify possible using 74 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2024-05-29 04:08:37] [INFO ] After 1019ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 348 ms.
[2024-05-29 04:08:37] [INFO ] After 2321ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Computed a total of 638 stabilizing places and 638 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||((p0 U p1)&&(p2||X(p3))))))'
Support contains 3 out of 2368 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2363 transition count 2163
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2363 transition count 2163
Applied a total of 10 rules in 222 ms. Remains 2363 /2368 variables (removed 5) and now considering 2163/2168 (removed 5) transitions.
// Phase 1: matrix 2163 rows 2363 cols
[2024-05-29 04:08:38] [INFO ] Computed 361 invariants in 10 ms
[2024-05-29 04:08:38] [INFO ] Implicit Places using invariants in 799 ms returned []
[2024-05-29 04:08:38] [INFO ] Invariant cache hit.
[2024-05-29 04:08:41] [INFO ] Implicit Places using invariants and state equation in 2372 ms returned []
Implicit Place search using SMT with State Equation took 3173 ms to find 0 implicit places.
[2024-05-29 04:08:41] [INFO ] Invariant cache hit.
[2024-05-29 04:08:42] [INFO ] Dead Transitions using invariants and state equation in 1458 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2363/2368 places, 2163/2168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4855 ms. Remains : 2363/2368 places, 2163/2168 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 404 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3)), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 2}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s1760 1), p1:(EQ s693 1), p2:(EQ s854 1), p3:(EQ s1760 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 5 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-00 finished in 5348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(p1)))||F(p2)))'
Support contains 4 out of 2368 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2361 transition count 2161
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2361 transition count 2161
Applied a total of 14 rules in 222 ms. Remains 2361 /2368 variables (removed 7) and now considering 2161/2168 (removed 7) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2024-05-29 04:08:43] [INFO ] Computed 361 invariants in 11 ms
[2024-05-29 04:08:44] [INFO ] Implicit Places using invariants in 804 ms returned []
[2024-05-29 04:08:44] [INFO ] Invariant cache hit.
[2024-05-29 04:08:46] [INFO ] Implicit Places using invariants and state equation in 2394 ms returned []
Implicit Place search using SMT with State Equation took 3201 ms to find 0 implicit places.
[2024-05-29 04:08:46] [INFO ] Invariant cache hit.
[2024-05-29 04:08:47] [INFO ] Dead Transitions using invariants and state equation in 1367 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2368 places, 2161/2168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4791 ms. Remains : 2361/2368 places, 2161/2168 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s2285 1), p2:(AND (EQ s638 1) (EQ s640 1)), p1:(EQ s801 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 856 ms.
Stack based approach found an accepted trace after 4077 steps with 0 reset with depth 4078 and stack size 4078 in 41 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-01 finished in 5848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(G(p1)||F(p2))))'
Support contains 4 out of 2368 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2361 transition count 2161
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2361 transition count 2161
Applied a total of 14 rules in 250 ms. Remains 2361 /2368 variables (removed 7) and now considering 2161/2168 (removed 7) transitions.
[2024-05-29 04:08:49] [INFO ] Invariant cache hit.
[2024-05-29 04:08:50] [INFO ] Implicit Places using invariants in 789 ms returned []
[2024-05-29 04:08:50] [INFO ] Invariant cache hit.
[2024-05-29 04:08:52] [INFO ] Implicit Places using invariants and state equation in 2404 ms returned []
Implicit Place search using SMT with State Equation took 3198 ms to find 0 implicit places.
[2024-05-29 04:08:52] [INFO ] Invariant cache hit.
[2024-05-29 04:08:53] [INFO ] Dead Transitions using invariants and state equation in 1467 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2368 places, 2161/2168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4916 ms. Remains : 2361/2368 places, 2161/2168 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1)), true]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s827 0), p2:(EQ s80 1), p0:(AND (EQ s2083 1) (EQ s2112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-02 finished in 5174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X((p1&&F(G(p2))))))))'
Support contains 3 out of 2368 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 2362 transition count 2162
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 2362 transition count 2162
Applied a total of 12 rules in 214 ms. Remains 2362 /2368 variables (removed 6) and now considering 2162/2168 (removed 6) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2024-05-29 04:08:54] [INFO ] Computed 361 invariants in 15 ms
[2024-05-29 04:08:55] [INFO ] Implicit Places using invariants in 818 ms returned []
[2024-05-29 04:08:55] [INFO ] Invariant cache hit.
[2024-05-29 04:08:57] [INFO ] Implicit Places using invariants and state equation in 2175 ms returned []
Implicit Place search using SMT with State Equation took 2997 ms to find 0 implicit places.
[2024-05-29 04:08:57] [INFO ] Invariant cache hit.
[2024-05-29 04:08:58] [INFO ] Dead Transitions using invariants and state equation in 1431 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2362/2368 places, 2162/2168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4644 ms. Remains : 2362/2368 places, 2162/2168 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1705 1), p1:(EQ s1466 1), p2:(EQ s1574 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 707 ms.
Stack based approach found an accepted trace after 2480 steps with 0 reset with depth 2481 and stack size 2481 in 20 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-03 finished in 5653 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 2368 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 473 transitions
Trivial Post-agglo rules discarded 473 transitions
Performed 473 trivial Post agglomeration. Transition count delta: 473
Iterating post reduction 0 with 473 rules applied. Total rules applied 473 place count 2367 transition count 1694
Reduce places removed 473 places and 0 transitions.
Iterating post reduction 1 with 473 rules applied. Total rules applied 946 place count 1894 transition count 1694
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 946 place count 1894 transition count 1375
Deduced a syphon composed of 319 places in 2 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 2 with 638 rules applied. Total rules applied 1584 place count 1575 transition count 1375
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1590 place count 1569 transition count 1369
Iterating global reduction 2 with 6 rules applied. Total rules applied 1596 place count 1569 transition count 1369
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1596 place count 1569 transition count 1363
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1608 place count 1563 transition count 1363
Performed 678 Post agglomeration using F-continuation condition.Transition count delta: 678
Deduced a syphon composed of 678 places in 1 ms
Reduce places removed 678 places and 0 transitions.
Iterating global reduction 2 with 1356 rules applied. Total rules applied 2964 place count 885 transition count 685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2965 place count 885 transition count 684
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2967 place count 884 transition count 683
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3169 place count 783 transition count 749
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3205 place count 765 transition count 762
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3207 place count 763 transition count 760
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3209 place count 761 transition count 760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3209 place count 761 transition count 759
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3211 place count 760 transition count 759
Applied a total of 3211 rules in 406 ms. Remains 760 /2368 variables (removed 1608) and now considering 759/2168 (removed 1409) transitions.
// Phase 1: matrix 759 rows 760 cols
[2024-05-29 04:09:00] [INFO ] Computed 359 invariants in 3 ms
[2024-05-29 04:09:00] [INFO ] Implicit Places using invariants in 580 ms returned [749]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 581 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 759/2368 places, 759/2168 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 758
Applied a total of 2 rules in 29 ms. Remains 758 /759 variables (removed 1) and now considering 758/759 (removed 1) transitions.
// Phase 1: matrix 758 rows 758 cols
[2024-05-29 04:09:00] [INFO ] Computed 358 invariants in 4 ms
[2024-05-29 04:09:01] [INFO ] Implicit Places using invariants in 461 ms returned []
[2024-05-29 04:09:01] [INFO ] Invariant cache hit.
[2024-05-29 04:09:02] [INFO ] Implicit Places using invariants and state equation in 884 ms returned []
Implicit Place search using SMT with State Equation took 1357 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 758/2368 places, 758/2168 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2373 ms. Remains : 758/2368 places, 758/2168 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s551 1) (AND (EQ s119 1) (EQ s131 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-04 finished in 2483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 2368 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 473 transitions
Trivial Post-agglo rules discarded 473 transitions
Performed 473 trivial Post agglomeration. Transition count delta: 473
Iterating post reduction 0 with 473 rules applied. Total rules applied 473 place count 2367 transition count 1694
Reduce places removed 473 places and 0 transitions.
Iterating post reduction 1 with 473 rules applied. Total rules applied 946 place count 1894 transition count 1694
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 946 place count 1894 transition count 1375
Deduced a syphon composed of 319 places in 1 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 2 with 638 rules applied. Total rules applied 1584 place count 1575 transition count 1375
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1590 place count 1569 transition count 1369
Iterating global reduction 2 with 6 rules applied. Total rules applied 1596 place count 1569 transition count 1369
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1596 place count 1569 transition count 1363
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1608 place count 1563 transition count 1363
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 1 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 2 with 1358 rules applied. Total rules applied 2966 place count 884 transition count 684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2967 place count 884 transition count 683
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2969 place count 883 transition count 682
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3171 place count 782 transition count 749
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 7 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3205 place count 765 transition count 760
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3207 place count 763 transition count 758
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3209 place count 761 transition count 758
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3209 place count 761 transition count 757
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3211 place count 760 transition count 757
Applied a total of 3211 rules in 468 ms. Remains 760 /2368 variables (removed 1608) and now considering 757/2168 (removed 1411) transitions.
// Phase 1: matrix 757 rows 760 cols
[2024-05-29 04:09:02] [INFO ] Computed 359 invariants in 2 ms
[2024-05-29 04:09:03] [INFO ] Implicit Places using invariants in 550 ms returned [749]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 552 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 759/2368 places, 757/2168 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 756
Applied a total of 2 rules in 21 ms. Remains 758 /759 variables (removed 1) and now considering 756/757 (removed 1) transitions.
// Phase 1: matrix 756 rows 758 cols
[2024-05-29 04:09:03] [INFO ] Computed 358 invariants in 3 ms
[2024-05-29 04:09:03] [INFO ] Implicit Places using invariants in 495 ms returned []
[2024-05-29 04:09:03] [INFO ] Invariant cache hit.
[2024-05-29 04:09:04] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1386 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 758/2368 places, 756/2168 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2427 ms. Remains : 758/2368 places, 756/2168 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s35 1), p1:(EQ s653 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-05 finished in 2556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((((!p1&&F(p2)&&X(!p1)) U (G((!p1&&F(p2)&&X(!p1)))||(F(p2)&&X(!p1)&&p3)))||p0))))'
Support contains 7 out of 2368 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2363 transition count 2163
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2363 transition count 2163
Applied a total of 10 rules in 208 ms. Remains 2363 /2368 variables (removed 5) and now considering 2163/2168 (removed 5) transitions.
// Phase 1: matrix 2163 rows 2363 cols
[2024-05-29 04:09:05] [INFO ] Computed 361 invariants in 13 ms
[2024-05-29 04:09:05] [INFO ] Implicit Places using invariants in 821 ms returned []
[2024-05-29 04:09:05] [INFO ] Invariant cache hit.
[2024-05-29 04:09:08] [INFO ] Implicit Places using invariants and state equation in 2298 ms returned []
Implicit Place search using SMT with State Equation took 3122 ms to find 0 implicit places.
[2024-05-29 04:09:08] [INFO ] Invariant cache hit.
[2024-05-29 04:09:09] [INFO ] Dead Transitions using invariants and state equation in 1481 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2363/2368 places, 2163/2168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4814 ms. Remains : 2363/2368 places, 2163/2168 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(OR (AND p3 (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p1))), acceptance={} source=0 dest: 2}, { cond=(OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(OR (AND p3 (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p1))), acceptance={} source=1 dest: 2}, { cond=(OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND p3 (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND p3 (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(AND (NEQ s260 1) (NOT (AND (EQ s471 1) (EQ s482 1) (EQ s508 1)))), p0:(OR (EQ s983 0) (EQ s1012 0)), p1:(AND (EQ s471 1) (EQ s482 1) (EQ s508 1)), p2:...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 692 ms.
Product exploration explored 100000 steps with 0 reset in 907 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND p3 p0 (NOT p1) p2), (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (NOT (OR (AND p3 (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p1))))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p3 (NOT p0) (NOT p2) p1))), (X (NOT (AND p3 (NOT p0) p1))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT (OR (AND p3 (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p1)))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p3 (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p3 (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 130 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter sensitive) to 4 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 116051 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 116051 steps, saw 75299 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 7 properties.
[2024-05-29 04:09:15] [INFO ] Invariant cache hit.
[2024-05-29 04:09:15] [INFO ] After 429ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:5
[2024-05-29 04:09:16] [INFO ] [Nat]Absence check using 361 positive place invariants in 129 ms returned sat
[2024-05-29 04:09:17] [INFO ] After 1442ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2024-05-29 04:09:18] [INFO ] Deduced a trap composed of 17 places in 567 ms of which 1 ms to minimize.
[2024-05-29 04:09:19] [INFO ] Deduced a trap composed of 27 places in 501 ms of which 1 ms to minimize.
[2024-05-29 04:09:19] [INFO ] Deduced a trap composed of 30 places in 521 ms of which 1 ms to minimize.
[2024-05-29 04:09:20] [INFO ] Deduced a trap composed of 27 places in 537 ms of which 1 ms to minimize.
[2024-05-29 04:09:20] [INFO ] Deduced a trap composed of 21 places in 513 ms of which 1 ms to minimize.
[2024-05-29 04:09:21] [INFO ] Deduced a trap composed of 22 places in 522 ms of which 1 ms to minimize.
[2024-05-29 04:09:22] [INFO ] Deduced a trap composed of 18 places in 520 ms of which 2 ms to minimize.
[2024-05-29 04:09:22] [INFO ] Deduced a trap composed of 17 places in 518 ms of which 1 ms to minimize.
[2024-05-29 04:09:23] [INFO ] Deduced a trap composed of 17 places in 494 ms of which 1 ms to minimize.
[2024-05-29 04:09:23] [INFO ] Deduced a trap composed of 29 places in 506 ms of which 3 ms to minimize.
[2024-05-29 04:09:24] [INFO ] Deduced a trap composed of 18 places in 512 ms of which 3 ms to minimize.
[2024-05-29 04:09:24] [INFO ] Deduced a trap composed of 21 places in 496 ms of which 1 ms to minimize.
[2024-05-29 04:09:25] [INFO ] Deduced a trap composed of 22 places in 487 ms of which 3 ms to minimize.
[2024-05-29 04:09:26] [INFO ] Deduced a trap composed of 20 places in 483 ms of which 2 ms to minimize.
[2024-05-29 04:09:26] [INFO ] Deduced a trap composed of 16 places in 468 ms of which 2 ms to minimize.
[2024-05-29 04:09:27] [INFO ] Deduced a trap composed of 26 places in 458 ms of which 1 ms to minimize.
[2024-05-29 04:09:27] [INFO ] Deduced a trap composed of 29 places in 443 ms of which 1 ms to minimize.
[2024-05-29 04:09:28] [INFO ] Deduced a trap composed of 26 places in 443 ms of which 1 ms to minimize.
[2024-05-29 04:09:28] [INFO ] Deduced a trap composed of 31 places in 446 ms of which 1 ms to minimize.
[2024-05-29 04:09:29] [INFO ] Deduced a trap composed of 27 places in 453 ms of which 1 ms to minimize.
[2024-05-29 04:09:29] [INFO ] Deduced a trap composed of 31 places in 419 ms of which 1 ms to minimize.
[2024-05-29 04:09:30] [INFO ] Deduced a trap composed of 33 places in 411 ms of which 1 ms to minimize.
[2024-05-29 04:09:30] [INFO ] Deduced a trap composed of 22 places in 422 ms of which 1 ms to minimize.
[2024-05-29 04:09:31] [INFO ] Deduced a trap composed of 29 places in 410 ms of which 1 ms to minimize.
[2024-05-29 04:09:31] [INFO ] Deduced a trap composed of 28 places in 410 ms of which 1 ms to minimize.
[2024-05-29 04:09:32] [INFO ] Deduced a trap composed of 26 places in 410 ms of which 1 ms to minimize.
[2024-05-29 04:09:32] [INFO ] Deduced a trap composed of 42 places in 391 ms of which 1 ms to minimize.
[2024-05-29 04:09:33] [INFO ] Deduced a trap composed of 38 places in 394 ms of which 1 ms to minimize.
[2024-05-29 04:09:33] [INFO ] Deduced a trap composed of 29 places in 377 ms of which 1 ms to minimize.
[2024-05-29 04:09:33] [INFO ] Deduced a trap composed of 40 places in 379 ms of which 1 ms to minimize.
[2024-05-29 04:09:34] [INFO ] Deduced a trap composed of 37 places in 354 ms of which 1 ms to minimize.
[2024-05-29 04:09:34] [INFO ] Deduced a trap composed of 40 places in 373 ms of which 1 ms to minimize.
[2024-05-29 04:09:35] [INFO ] Deduced a trap composed of 37 places in 373 ms of which 2 ms to minimize.
[2024-05-29 04:09:35] [INFO ] Deduced a trap composed of 35 places in 359 ms of which 1 ms to minimize.
[2024-05-29 04:09:36] [INFO ] Deduced a trap composed of 32 places in 351 ms of which 2 ms to minimize.
[2024-05-29 04:09:36] [INFO ] Deduced a trap composed of 41 places in 345 ms of which 1 ms to minimize.
[2024-05-29 04:09:36] [INFO ] Deduced a trap composed of 39 places in 311 ms of which 1 ms to minimize.
[2024-05-29 04:09:37] [INFO ] Deduced a trap composed of 39 places in 301 ms of which 1 ms to minimize.
[2024-05-29 04:09:37] [INFO ] Deduced a trap composed of 39 places in 298 ms of which 1 ms to minimize.
[2024-05-29 04:09:38] [INFO ] Deduced a trap composed of 52 places in 318 ms of which 0 ms to minimize.
[2024-05-29 04:09:38] [INFO ] Deduced a trap composed of 41 places in 303 ms of which 1 ms to minimize.
[2024-05-29 04:09:38] [INFO ] Deduced a trap composed of 43 places in 298 ms of which 1 ms to minimize.
[2024-05-29 04:09:39] [INFO ] Deduced a trap composed of 53 places in 278 ms of which 1 ms to minimize.
[2024-05-29 04:09:39] [INFO ] Deduced a trap composed of 45 places in 269 ms of which 1 ms to minimize.
[2024-05-29 04:09:39] [INFO ] Deduced a trap composed of 43 places in 284 ms of which 1 ms to minimize.
[2024-05-29 04:09:40] [INFO ] Deduced a trap composed of 53 places in 268 ms of which 1 ms to minimize.
[2024-05-29 04:09:40] [INFO ] Deduced a trap composed of 51 places in 255 ms of which 1 ms to minimize.
[2024-05-29 04:09:40] [INFO ] Deduced a trap composed of 51 places in 283 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 04:09:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 04:09:40] [INFO ] After 25234ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0 real:5
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 258 ms.
Support contains 7 out of 2363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2363/2363 places, 2163/2163 transitions.
Drop transitions removed 477 transitions
Trivial Post-agglo rules discarded 477 transitions
Performed 477 trivial Post agglomeration. Transition count delta: 477
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2363 transition count 1686
Reduce places removed 477 places and 0 transitions.
Iterating post reduction 1 with 477 rules applied. Total rules applied 954 place count 1886 transition count 1686
Performed 318 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 318 Pre rules applied. Total rules applied 954 place count 1886 transition count 1368
Deduced a syphon composed of 318 places in 2 ms
Reduce places removed 318 places and 0 transitions.
Iterating global reduction 2 with 636 rules applied. Total rules applied 1590 place count 1568 transition count 1368
Performed 682 Post agglomeration using F-continuation condition.Transition count delta: 682
Deduced a syphon composed of 682 places in 1 ms
Reduce places removed 682 places and 0 transitions.
Iterating global reduction 2 with 1364 rules applied. Total rules applied 2954 place count 886 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2955 place count 886 transition count 685
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2957 place count 885 transition count 684
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3159 place count 784 transition count 749
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3195 place count 766 transition count 762
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3196 place count 766 transition count 761
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 4 with 40 rules applied. Total rules applied 3236 place count 766 transition count 761
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3237 place count 765 transition count 760
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3239 place count 763 transition count 760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3239 place count 763 transition count 759
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3241 place count 762 transition count 759
Applied a total of 3241 rules in 280 ms. Remains 762 /2363 variables (removed 1601) and now considering 759/2163 (removed 1404) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 762/2363 places, 759/2163 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 145067 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 145067 steps, saw 93170 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 759 rows 762 cols
[2024-05-29 04:09:44] [INFO ] Computed 359 invariants in 4 ms
[2024-05-29 04:09:45] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 04:09:45] [INFO ] [Nat]Absence check using 359 positive place invariants in 57 ms returned sat
[2024-05-29 04:09:45] [INFO ] After 424ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 04:09:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 04:09:45] [INFO ] After 139ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 04:09:46] [INFO ] After 378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 143 ms.
[2024-05-29 04:09:46] [INFO ] After 1204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 69 ms.
Support contains 7 out of 762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 759/759 transitions.
Applied a total of 0 rules in 13 ms. Remains 762 /762 variables (removed 0) and now considering 759/759 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 762/762 places, 759/759 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 759/759 transitions.
Applied a total of 0 rules in 11 ms. Remains 762 /762 variables (removed 0) and now considering 759/759 (removed 0) transitions.
[2024-05-29 04:09:46] [INFO ] Invariant cache hit.
[2024-05-29 04:09:46] [INFO ] Implicit Places using invariants in 459 ms returned [751]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 460 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 761/762 places, 759/759 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 760 transition count 758
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 760 transition count 758
Applied a total of 2 rules in 19 ms. Remains 760 /761 variables (removed 1) and now considering 758/759 (removed 1) transitions.
// Phase 1: matrix 758 rows 760 cols
[2024-05-29 04:09:46] [INFO ] Computed 358 invariants in 3 ms
[2024-05-29 04:09:47] [INFO ] Implicit Places using invariants in 436 ms returned []
[2024-05-29 04:09:47] [INFO ] Invariant cache hit.
[2024-05-29 04:09:48] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 1345 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 760/762 places, 758/759 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1835 ms. Remains : 760/762 places, 758/759 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 137969 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 137969 steps, saw 88055 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-29 04:09:51] [INFO ] Invariant cache hit.
[2024-05-29 04:09:51] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 04:09:52] [INFO ] [Nat]Absence check using 358 positive place invariants in 55 ms returned sat
[2024-05-29 04:09:52] [INFO ] After 410ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 04:09:52] [INFO ] After 643ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 157 ms.
[2024-05-29 04:09:52] [INFO ] After 1061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 62 ms.
Support contains 7 out of 760 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 760/760 places, 758/758 transitions.
Applied a total of 0 rules in 11 ms. Remains 760 /760 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 760/760 places, 758/758 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 760/760 places, 758/758 transitions.
Applied a total of 0 rules in 11 ms. Remains 760 /760 variables (removed 0) and now considering 758/758 (removed 0) transitions.
[2024-05-29 04:09:52] [INFO ] Invariant cache hit.
[2024-05-29 04:09:53] [INFO ] Implicit Places using invariants in 466 ms returned []
[2024-05-29 04:09:53] [INFO ] Invariant cache hit.
[2024-05-29 04:09:54] [INFO ] Implicit Places using invariants and state equation in 849 ms returned []
Implicit Place search using SMT with State Equation took 1320 ms to find 0 implicit places.
[2024-05-29 04:09:54] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-29 04:09:54] [INFO ] Invariant cache hit.
[2024-05-29 04:09:54] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1802 ms. Remains : 760/760 places, 758/758 transitions.
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 0 with 78 rules applied. Total rules applied 78 place count 760 transition count 758
Applied a total of 78 rules in 22 ms. Remains 760 /760 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 758 rows 760 cols
[2024-05-29 04:09:54] [INFO ] Computed 358 invariants in 3 ms
[2024-05-29 04:09:54] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 04:09:55] [INFO ] [Nat]Absence check using 358 positive place invariants in 53 ms returned sat
[2024-05-29 04:09:55] [INFO ] After 404ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 04:09:55] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-29 04:09:55] [INFO ] After 266ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 04:09:56] [INFO ] After 537ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 195 ms.
[2024-05-29 04:09:56] [INFO ] After 1389ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p3 p0 (NOT p1) p2), (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (NOT (OR (AND p3 (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p1))))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p3 (NOT p0) (NOT p2) p1))), (X (NOT (AND p3 (NOT p0) p1))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT (OR (AND p3 (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p1)))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p3 (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p3 (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) p3 p1))), (G (NOT (AND (NOT p0) p3 p1 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 123 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 169 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Support contains 7 out of 2363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2363/2363 places, 2163/2163 transitions.
Applied a total of 0 rules in 104 ms. Remains 2363 /2363 variables (removed 0) and now considering 2163/2163 (removed 0) transitions.
// Phase 1: matrix 2163 rows 2363 cols
[2024-05-29 04:09:56] [INFO ] Computed 361 invariants in 17 ms
[2024-05-29 04:09:57] [INFO ] Implicit Places using invariants in 803 ms returned []
[2024-05-29 04:09:57] [INFO ] Invariant cache hit.
[2024-05-29 04:09:59] [INFO ] Implicit Places using invariants and state equation in 2267 ms returned []
Implicit Place search using SMT with State Equation took 3071 ms to find 0 implicit places.
[2024-05-29 04:09:59] [INFO ] Invariant cache hit.
[2024-05-29 04:10:01] [INFO ] Dead Transitions using invariants and state equation in 1481 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4659 ms. Remains : 2363/2363 places, 2163/2163 transitions.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2 p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 98 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 125027 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 125027 steps, saw 81295 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-29 04:10:05] [INFO ] Invariant cache hit.
[2024-05-29 04:10:05] [INFO ] After 407ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 04:10:06] [INFO ] [Nat]Absence check using 361 positive place invariants in 132 ms returned sat
[2024-05-29 04:10:07] [INFO ] After 1453ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 04:10:08] [INFO ] Deduced a trap composed of 27 places in 589 ms of which 2 ms to minimize.
[2024-05-29 04:10:09] [INFO ] Deduced a trap composed of 17 places in 584 ms of which 1 ms to minimize.
[2024-05-29 04:10:09] [INFO ] Deduced a trap composed of 23 places in 542 ms of which 1 ms to minimize.
[2024-05-29 04:10:10] [INFO ] Deduced a trap composed of 21 places in 494 ms of which 1 ms to minimize.
[2024-05-29 04:10:10] [INFO ] Deduced a trap composed of 22 places in 500 ms of which 2 ms to minimize.
[2024-05-29 04:10:11] [INFO ] Deduced a trap composed of 20 places in 533 ms of which 2 ms to minimize.
[2024-05-29 04:10:11] [INFO ] Deduced a trap composed of 21 places in 480 ms of which 1 ms to minimize.
[2024-05-29 04:10:12] [INFO ] Deduced a trap composed of 30 places in 521 ms of which 2 ms to minimize.
[2024-05-29 04:10:13] [INFO ] Deduced a trap composed of 21 places in 525 ms of which 2 ms to minimize.
[2024-05-29 04:10:13] [INFO ] Deduced a trap composed of 21 places in 507 ms of which 2 ms to minimize.
[2024-05-29 04:10:14] [INFO ] Deduced a trap composed of 23 places in 515 ms of which 1 ms to minimize.
[2024-05-29 04:10:14] [INFO ] Deduced a trap composed of 18 places in 503 ms of which 1 ms to minimize.
[2024-05-29 04:10:15] [INFO ] Deduced a trap composed of 23 places in 501 ms of which 2 ms to minimize.
[2024-05-29 04:10:16] [INFO ] Deduced a trap composed of 23 places in 456 ms of which 1 ms to minimize.
[2024-05-29 04:10:16] [INFO ] Deduced a trap composed of 26 places in 471 ms of which 2 ms to minimize.
[2024-05-29 04:10:17] [INFO ] Deduced a trap composed of 29 places in 469 ms of which 1 ms to minimize.
[2024-05-29 04:10:17] [INFO ] Deduced a trap composed of 33 places in 464 ms of which 2 ms to minimize.
[2024-05-29 04:10:18] [INFO ] Deduced a trap composed of 17 places in 445 ms of which 1 ms to minimize.
[2024-05-29 04:10:18] [INFO ] Deduced a trap composed of 20 places in 444 ms of which 1 ms to minimize.
[2024-05-29 04:10:19] [INFO ] Deduced a trap composed of 21 places in 449 ms of which 1 ms to minimize.
[2024-05-29 04:10:19] [INFO ] Deduced a trap composed of 21 places in 431 ms of which 1 ms to minimize.
[2024-05-29 04:10:20] [INFO ] Deduced a trap composed of 30 places in 419 ms of which 1 ms to minimize.
[2024-05-29 04:10:20] [INFO ] Deduced a trap composed of 31 places in 420 ms of which 1 ms to minimize.
[2024-05-29 04:10:21] [INFO ] Deduced a trap composed of 25 places in 403 ms of which 1 ms to minimize.
[2024-05-29 04:10:21] [INFO ] Deduced a trap composed of 27 places in 396 ms of which 1 ms to minimize.
[2024-05-29 04:10:22] [INFO ] Deduced a trap composed of 35 places in 378 ms of which 1 ms to minimize.
[2024-05-29 04:10:22] [INFO ] Deduced a trap composed of 32 places in 384 ms of which 1 ms to minimize.
[2024-05-29 04:10:23] [INFO ] Deduced a trap composed of 31 places in 348 ms of which 1 ms to minimize.
[2024-05-29 04:10:23] [INFO ] Deduced a trap composed of 35 places in 374 ms of which 1 ms to minimize.
[2024-05-29 04:10:23] [INFO ] Deduced a trap composed of 34 places in 369 ms of which 1 ms to minimize.
[2024-05-29 04:10:24] [INFO ] Deduced a trap composed of 36 places in 366 ms of which 1 ms to minimize.
[2024-05-29 04:10:24] [INFO ] Deduced a trap composed of 37 places in 390 ms of which 1 ms to minimize.
[2024-05-29 04:10:25] [INFO ] Deduced a trap composed of 50 places in 336 ms of which 1 ms to minimize.
[2024-05-29 04:10:25] [INFO ] Deduced a trap composed of 38 places in 355 ms of which 1 ms to minimize.
[2024-05-29 04:10:26] [INFO ] Deduced a trap composed of 37 places in 326 ms of which 1 ms to minimize.
[2024-05-29 04:10:26] [INFO ] Deduced a trap composed of 38 places in 320 ms of which 1 ms to minimize.
[2024-05-29 04:10:26] [INFO ] Deduced a trap composed of 47 places in 321 ms of which 1 ms to minimize.
[2024-05-29 04:10:27] [INFO ] Deduced a trap composed of 40 places in 290 ms of which 1 ms to minimize.
[2024-05-29 04:10:27] [INFO ] Deduced a trap composed of 34 places in 310 ms of which 0 ms to minimize.
[2024-05-29 04:10:27] [INFO ] Deduced a trap composed of 35 places in 306 ms of which 1 ms to minimize.
[2024-05-29 04:10:28] [INFO ] Deduced a trap composed of 34 places in 302 ms of which 1 ms to minimize.
[2024-05-29 04:10:28] [INFO ] Deduced a trap composed of 50 places in 301 ms of which 1 ms to minimize.
[2024-05-29 04:10:29] [INFO ] Deduced a trap composed of 40 places in 290 ms of which 1 ms to minimize.
[2024-05-29 04:10:29] [INFO ] Deduced a trap composed of 43 places in 297 ms of which 1 ms to minimize.
[2024-05-29 04:10:29] [INFO ] Deduced a trap composed of 35 places in 302 ms of which 1 ms to minimize.
[2024-05-29 04:10:30] [INFO ] Deduced a trap composed of 37 places in 291 ms of which 1 ms to minimize.
[2024-05-29 04:10:30] [INFO ] Deduced a trap composed of 50 places in 286 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 04:10:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 04:10:30] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 348 ms.
Support contains 7 out of 2363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2363/2363 places, 2163/2163 transitions.
Drop transitions removed 477 transitions
Trivial Post-agglo rules discarded 477 transitions
Performed 477 trivial Post agglomeration. Transition count delta: 477
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2363 transition count 1686
Reduce places removed 477 places and 0 transitions.
Iterating post reduction 1 with 477 rules applied. Total rules applied 954 place count 1886 transition count 1686
Performed 318 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 318 Pre rules applied. Total rules applied 954 place count 1886 transition count 1368
Deduced a syphon composed of 318 places in 2 ms
Reduce places removed 318 places and 0 transitions.
Iterating global reduction 2 with 636 rules applied. Total rules applied 1590 place count 1568 transition count 1368
Performed 682 Post agglomeration using F-continuation condition.Transition count delta: 682
Deduced a syphon composed of 682 places in 1 ms
Reduce places removed 682 places and 0 transitions.
Iterating global reduction 2 with 1364 rules applied. Total rules applied 2954 place count 886 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2955 place count 886 transition count 685
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2957 place count 885 transition count 684
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3159 place count 784 transition count 749
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3195 place count 766 transition count 762
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3196 place count 766 transition count 761
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 4 with 40 rules applied. Total rules applied 3236 place count 766 transition count 761
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3237 place count 765 transition count 760
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3239 place count 763 transition count 760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3239 place count 763 transition count 759
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3241 place count 762 transition count 759
Applied a total of 3241 rules in 246 ms. Remains 762 /2363 variables (removed 1601) and now considering 759/2163 (removed 1404) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 762/2363 places, 759/2163 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 150279 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 150279 steps, saw 96650 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 759 rows 762 cols
[2024-05-29 04:10:34] [INFO ] Computed 359 invariants in 3 ms
[2024-05-29 04:10:34] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 04:10:35] [INFO ] [Nat]Absence check using 359 positive place invariants in 55 ms returned sat
[2024-05-29 04:10:35] [INFO ] After 422ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 04:10:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 04:10:35] [INFO ] After 151ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 04:10:35] [INFO ] After 388ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 148 ms.
[2024-05-29 04:10:36] [INFO ] After 1228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 120 ms.
Support contains 7 out of 762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 759/759 transitions.
Applied a total of 0 rules in 11 ms. Remains 762 /762 variables (removed 0) and now considering 759/759 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 762/762 places, 759/759 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 759/759 transitions.
Applied a total of 0 rules in 11 ms. Remains 762 /762 variables (removed 0) and now considering 759/759 (removed 0) transitions.
[2024-05-29 04:10:36] [INFO ] Invariant cache hit.
[2024-05-29 04:10:36] [INFO ] Implicit Places using invariants in 456 ms returned [751]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 458 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 761/762 places, 759/759 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 760 transition count 758
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 760 transition count 758
Applied a total of 2 rules in 18 ms. Remains 760 /761 variables (removed 1) and now considering 758/759 (removed 1) transitions.
// Phase 1: matrix 758 rows 760 cols
[2024-05-29 04:10:36] [INFO ] Computed 358 invariants in 4 ms
[2024-05-29 04:10:37] [INFO ] Implicit Places using invariants in 452 ms returned []
[2024-05-29 04:10:37] [INFO ] Invariant cache hit.
[2024-05-29 04:10:38] [INFO ] Implicit Places using invariants and state equation in 912 ms returned []
Implicit Place search using SMT with State Equation took 1365 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 760/762 places, 758/759 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1854 ms. Remains : 760/762 places, 758/759 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 150475 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 150475 steps, saw 96121 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-29 04:10:41] [INFO ] Invariant cache hit.
[2024-05-29 04:10:41] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 04:10:41] [INFO ] [Nat]Absence check using 358 positive place invariants in 59 ms returned sat
[2024-05-29 04:10:42] [INFO ] After 419ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 04:10:42] [INFO ] After 667ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 153 ms.
[2024-05-29 04:10:42] [INFO ] After 1099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 175 ms.
Support contains 7 out of 760 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 760/760 places, 758/758 transitions.
Applied a total of 0 rules in 11 ms. Remains 760 /760 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 760/760 places, 758/758 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 760/760 places, 758/758 transitions.
Applied a total of 0 rules in 12 ms. Remains 760 /760 variables (removed 0) and now considering 758/758 (removed 0) transitions.
[2024-05-29 04:10:43] [INFO ] Invariant cache hit.
[2024-05-29 04:10:43] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-05-29 04:10:43] [INFO ] Invariant cache hit.
[2024-05-29 04:10:44] [INFO ] Implicit Places using invariants and state equation in 883 ms returned []
Implicit Place search using SMT with State Equation took 1336 ms to find 0 implicit places.
[2024-05-29 04:10:44] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 04:10:44] [INFO ] Invariant cache hit.
[2024-05-29 04:10:44] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1792 ms. Remains : 760/760 places, 758/758 transitions.
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 0 with 78 rules applied. Total rules applied 78 place count 760 transition count 758
Applied a total of 78 rules in 22 ms. Remains 760 /760 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 758 rows 760 cols
[2024-05-29 04:10:44] [INFO ] Computed 358 invariants in 2 ms
[2024-05-29 04:10:45] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 04:10:45] [INFO ] [Nat]Absence check using 358 positive place invariants in 54 ms returned sat
[2024-05-29 04:10:45] [INFO ] After 404ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 04:10:45] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-29 04:10:45] [INFO ] After 243ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-29 04:10:46] [INFO ] After 540ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 182 ms.
[2024-05-29 04:10:46] [INFO ] After 1377ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p0 (NOT p1) p2 p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 114 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 156 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 674 ms.
Product exploration explored 100000 steps with 0 reset in 929 ms.
Applying partial POR strategy [false, false, true, false]
Stuttering acceptance computed with spot in 170 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Support contains 7 out of 2363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2363/2363 places, 2163/2163 transitions.
Performed 477 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2363 transition count 2163
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 161 Pre rules applied. Total rules applied 477 place count 2363 transition count 2285
Deduced a syphon composed of 638 places in 4 ms
Iterating global reduction 1 with 161 rules applied. Total rules applied 638 place count 2363 transition count 2285
Performed 800 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1438 places in 2 ms
Iterating global reduction 1 with 800 rules applied. Total rules applied 1438 place count 2363 transition count 2286
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1439 place count 2363 transition count 2285
Renaming transitions due to excessive name length > 1024 char.
Discarding 318 places :
Symmetric choice reduction at 2 with 318 rule applications. Total rules 1757 place count 2045 transition count 1966
Deduced a syphon composed of 1120 places in 1 ms
Iterating global reduction 2 with 318 rules applied. Total rules applied 2075 place count 2045 transition count 1966
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1121 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2076 place count 2045 transition count 1966
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2078 place count 2043 transition count 1964
Deduced a syphon composed of 1119 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2080 place count 2043 transition count 1964
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -522
Deduced a syphon composed of 1220 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2181 place count 2043 transition count 2486
Discarding 103 places :
Symmetric choice reduction at 2 with 103 rule applications. Total rules 2284 place count 1940 transition count 2280
Deduced a syphon composed of 1117 places in 2 ms
Iterating global reduction 2 with 103 rules applied. Total rules applied 2387 place count 1940 transition count 2280
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -307
Deduced a syphon composed of 1174 places in 3 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2444 place count 1940 transition count 2587
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 2501 place count 1883 transition count 2473
Deduced a syphon composed of 1117 places in 2 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2558 place count 1883 transition count 2473
Deduced a syphon composed of 1117 places in 2 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 2567 place count 1883 transition count 2464
Deduced a syphon composed of 1117 places in 2 ms
Applied a total of 2567 rules in 1528 ms. Remains 1883 /2363 variables (removed 480) and now considering 2464/2163 (removed -301) transitions.
[2024-05-29 04:10:50] [INFO ] Redundant transitions in 43 ms returned []
// Phase 1: matrix 2464 rows 1883 cols
[2024-05-29 04:10:50] [INFO ] Computed 361 invariants in 23 ms
[2024-05-29 04:10:52] [INFO ] Dead Transitions using invariants and state equation in 1389 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1883/2363 places, 2464/2163 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2971 ms. Remains : 1883/2363 places, 2464/2163 transitions.
Built C files in :
/tmp/ltsmin4217552084533816664
[2024-05-29 04:10:52] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4217552084533816664
Running compilation step : cd /tmp/ltsmin4217552084533816664;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4217552084533816664;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin4217552084533816664;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 7 out of 2363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2363/2363 places, 2163/2163 transitions.
Applied a total of 0 rules in 92 ms. Remains 2363 /2363 variables (removed 0) and now considering 2163/2163 (removed 0) transitions.
// Phase 1: matrix 2163 rows 2363 cols
[2024-05-29 04:10:55] [INFO ] Computed 361 invariants in 12 ms
[2024-05-29 04:10:56] [INFO ] Implicit Places using invariants in 828 ms returned []
[2024-05-29 04:10:56] [INFO ] Invariant cache hit.
[2024-05-29 04:10:58] [INFO ] Implicit Places using invariants and state equation in 2402 ms returned []
Implicit Place search using SMT with State Equation took 3232 ms to find 0 implicit places.
[2024-05-29 04:10:58] [INFO ] Invariant cache hit.
[2024-05-29 04:10:59] [INFO ] Dead Transitions using invariants and state equation in 1394 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4720 ms. Remains : 2363/2363 places, 2163/2163 transitions.
Built C files in :
/tmp/ltsmin2659719092090300558
[2024-05-29 04:10:59] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2659719092090300558
Running compilation step : cd /tmp/ltsmin2659719092090300558;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2659719092090300558;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2659719092090300558;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 04:11:03] [INFO ] Flatten gal took : 71 ms
[2024-05-29 04:11:03] [INFO ] Flatten gal took : 67 ms
[2024-05-29 04:11:03] [INFO ] Time to serialize gal into /tmp/LTL6150369939889241648.gal : 15 ms
[2024-05-29 04:11:03] [INFO ] Time to serialize properties into /tmp/LTL17479698822831340812.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6150369939889241648.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15209583280553323433.hoa' '-atoms' '/tmp/LTL17479698822831340812.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17479698822831340812.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15209583280553323433.hoa
Detected timeout of ITS tools.
[2024-05-29 04:11:18] [INFO ] Flatten gal took : 57 ms
[2024-05-29 04:11:18] [INFO ] Flatten gal took : 55 ms
[2024-05-29 04:11:18] [INFO ] Time to serialize gal into /tmp/LTL462274808924428588.gal : 13 ms
[2024-05-29 04:11:18] [INFO ] Time to serialize properties into /tmp/LTL13878401480195687767.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL462274808924428588.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13878401480195687767.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("((p1157==0)||(p1190==0))")||((((!("(((p546==1)&&(p559==1))&&(p593==1))"))&&(F("(p240!=1)")))&&(X(!("(((p546==1)&&(p559==1))&&...418
Formula 0 simplified : FG(!"((p1157==0)||(p1190==0))" & (("(((p546==1)&&(p559==1))&&(p593==1))" | G!"(p240!=1)" | X"(((p546==1)&&(p559==1))&&(p593==1))") M...271
Detected timeout of ITS tools.
[2024-05-29 04:11:33] [INFO ] Flatten gal took : 63 ms
[2024-05-29 04:11:33] [INFO ] Applying decomposition
[2024-05-29 04:11:33] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1292453912277781061.txt' '-o' '/tmp/graph1292453912277781061.bin' '-w' '/tmp/graph1292453912277781061.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1292453912277781061.bin' '-l' '-1' '-v' '-w' '/tmp/graph1292453912277781061.weights' '-q' '0' '-e' '0.001'
[2024-05-29 04:11:33] [INFO ] Decomposing Gal with order
[2024-05-29 04:11:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:11:34] [INFO ] Removed a total of 399 redundant transitions.
[2024-05-29 04:11:34] [INFO ] Flatten gal took : 179 ms
[2024-05-29 04:11:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2024-05-29 04:11:34] [INFO ] Time to serialize gal into /tmp/LTL10844753253751984718.gal : 34 ms
[2024-05-29 04:11:34] [INFO ] Time to serialize properties into /tmp/LTL517918019204109884.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10844753253751984718.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL517918019204109884.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i17.u365.p1157==0)||(i17.u373.p1190==0))")||((((!("(((i8.i0.i0.u174.p546==1)&&(i8.i0.i2.u176.p559==1))&&(i8.i1.i2.u186.p593...716
Formula 0 simplified : FG(!"((i17.u365.p1157==0)||(i17.u373.p1190==0))" & (("(((i8.i0.i0.u174.p546==1)&&(i8.i0.i2.u176.p559==1))&&(i8.i1.i2.u186.p593==1))"...478
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12337733989754907753
[2024-05-29 04:11:49] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12337733989754907753
Running compilation step : cd /tmp/ltsmin12337733989754907753;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12337733989754907753;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12337733989754907753;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldIIPt-PT-040B-LTLFireability-06 finished in 167789 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 2368 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2361 transition count 2161
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2361 transition count 2161
Applied a total of 14 rules in 194 ms. Remains 2361 /2368 variables (removed 7) and now considering 2161/2168 (removed 7) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2024-05-29 04:11:52] [INFO ] Computed 361 invariants in 16 ms
[2024-05-29 04:11:53] [INFO ] Implicit Places using invariants in 793 ms returned []
[2024-05-29 04:11:53] [INFO ] Invariant cache hit.
[2024-05-29 04:11:56] [INFO ] Implicit Places using invariants and state equation in 2489 ms returned []
Implicit Place search using SMT with State Equation took 3285 ms to find 0 implicit places.
[2024-05-29 04:11:56] [INFO ] Invariant cache hit.
[2024-05-29 04:11:57] [INFO ] Dead Transitions using invariants and state equation in 1473 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2368 places, 2161/2168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4953 ms. Remains : 2361/2368 places, 2161/2168 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s200 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 119 reset in 585 ms.
Product exploration explored 100000 steps with 119 reset in 634 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Detected a total of 638/2361 stabilizing places and 638/2161 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 788 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=98 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 04:11:59] [INFO ] Invariant cache hit.
[2024-05-29 04:12:01] [INFO ] [Real]Absence check using 361 positive place invariants in 488 ms returned sat
[2024-05-29 04:12:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 04:12:14] [INFO ] [Real]Absence check using state equation in 13353 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 2361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Applied a total of 0 rules in 95 ms. Remains 2361 /2361 variables (removed 0) and now considering 2161/2161 (removed 0) transitions.
[2024-05-29 04:12:14] [INFO ] Invariant cache hit.
[2024-05-29 04:12:15] [INFO ] Implicit Places using invariants in 761 ms returned []
[2024-05-29 04:12:15] [INFO ] Invariant cache hit.
[2024-05-29 04:12:17] [INFO ] Implicit Places using invariants and state equation in 2269 ms returned []
Implicit Place search using SMT with State Equation took 3033 ms to find 0 implicit places.
[2024-05-29 04:12:17] [INFO ] Invariant cache hit.
[2024-05-29 04:12:19] [INFO ] Dead Transitions using invariants and state equation in 1442 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4575 ms. Remains : 2361/2361 places, 2161/2161 transitions.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Detected a total of 638/2361 stabilizing places and 638/2161 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 735 steps, including 0 resets, run visited all 1 properties in 22 ms. (steps per millisecond=33 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 04:12:20] [INFO ] Invariant cache hit.
[2024-05-29 04:12:21] [INFO ] [Real]Absence check using 361 positive place invariants in 520 ms returned sat
[2024-05-29 04:12:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 04:12:35] [INFO ] [Real]Absence check using state equation in 13320 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 118 reset in 539 ms.
Product exploration explored 100000 steps with 119 reset in 618 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 2361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Performed 479 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2361 transition count 2161
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 161 Pre rules applied. Total rules applied 479 place count 2361 transition count 2282
Deduced a syphon composed of 640 places in 2 ms
Iterating global reduction 1 with 161 rules applied. Total rules applied 640 place count 2361 transition count 2282
Performed 798 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1438 places in 2 ms
Iterating global reduction 1 with 798 rules applied. Total rules applied 1438 place count 2361 transition count 2282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1439 place count 2361 transition count 2281
Renaming transitions due to excessive name length > 1024 char.
Discarding 319 places :
Symmetric choice reduction at 2 with 319 rule applications. Total rules 1758 place count 2042 transition count 1962
Deduced a syphon composed of 1119 places in 1 ms
Iterating global reduction 2 with 319 rules applied. Total rules applied 2077 place count 2042 transition count 1962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1120 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2078 place count 2042 transition count 1962
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2080 place count 2040 transition count 1960
Deduced a syphon composed of 1118 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2082 place count 2040 transition count 1960
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -530
Deduced a syphon composed of 1219 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2183 place count 2040 transition count 2490
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2284 place count 1939 transition count 2288
Deduced a syphon composed of 1118 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2385 place count 1939 transition count 2288
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -309
Deduced a syphon composed of 1176 places in 2 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 2443 place count 1939 transition count 2597
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 2501 place count 1881 transition count 2481
Deduced a syphon composed of 1118 places in 2 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 2559 place count 1881 transition count 2481
Deduced a syphon composed of 1118 places in 2 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 2568 place count 1881 transition count 2472
Deduced a syphon composed of 1118 places in 3 ms
Applied a total of 2568 rules in 973 ms. Remains 1881 /2361 variables (removed 480) and now considering 2472/2161 (removed -311) transitions.
[2024-05-29 04:12:37] [INFO ] Redundant transitions in 45 ms returned []
// Phase 1: matrix 2472 rows 1881 cols
[2024-05-29 04:12:37] [INFO ] Computed 361 invariants in 22 ms
[2024-05-29 04:12:39] [INFO ] Dead Transitions using invariants and state equation in 1378 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1881/2361 places, 2472/2161 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2412 ms. Remains : 1881/2361 places, 2472/2161 transitions.
Built C files in :
/tmp/ltsmin18418551130200930549
[2024-05-29 04:12:39] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18418551130200930549
Running compilation step : cd /tmp/ltsmin18418551130200930549;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin18418551130200930549;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin18418551130200930549;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 2361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Applied a total of 0 rules in 99 ms. Remains 2361 /2361 variables (removed 0) and now considering 2161/2161 (removed 0) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2024-05-29 04:12:42] [INFO ] Computed 361 invariants in 13 ms
[2024-05-29 04:12:42] [INFO ] Implicit Places using invariants in 805 ms returned []
[2024-05-29 04:12:42] [INFO ] Invariant cache hit.
[2024-05-29 04:12:45] [INFO ] Implicit Places using invariants and state equation in 2434 ms returned []
Implicit Place search using SMT with State Equation took 3243 ms to find 0 implicit places.
[2024-05-29 04:12:45] [INFO ] Invariant cache hit.
[2024-05-29 04:12:46] [INFO ] Dead Transitions using invariants and state equation in 1447 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4791 ms. Remains : 2361/2361 places, 2161/2161 transitions.
Built C files in :
/tmp/ltsmin9517389879117099122
[2024-05-29 04:12:46] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9517389879117099122
Running compilation step : cd /tmp/ltsmin9517389879117099122;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin9517389879117099122;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin9517389879117099122;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 04:12:50] [INFO ] Flatten gal took : 51 ms
[2024-05-29 04:12:50] [INFO ] Flatten gal took : 50 ms
[2024-05-29 04:12:50] [INFO ] Time to serialize gal into /tmp/LTL5413193505159503178.gal : 8 ms
[2024-05-29 04:12:50] [INFO ] Time to serialize properties into /tmp/LTL17559809999820051000.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5413193505159503178.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8922234326768616927.hoa' '-atoms' '/tmp/LTL17559809999820051000.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17559809999820051000.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8922234326768616927.hoa
Detected timeout of ITS tools.
[2024-05-29 04:13:05] [INFO ] Flatten gal took : 80 ms
[2024-05-29 04:13:05] [INFO ] Flatten gal took : 98 ms
[2024-05-29 04:13:05] [INFO ] Time to serialize gal into /tmp/LTL14192588445582884967.gal : 8 ms
[2024-05-29 04:13:05] [INFO ] Time to serialize properties into /tmp/LTL15773201769019762450.ltl : 17 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14192588445582884967.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15773201769019762450.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(p227==1)"))))))
Formula 0 simplified : XXXG!"(p227==1)"
Detected timeout of ITS tools.
[2024-05-29 04:13:20] [INFO ] Flatten gal took : 43 ms
[2024-05-29 04:13:20] [INFO ] Applying decomposition
[2024-05-29 04:13:20] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3462659278767295844.txt' '-o' '/tmp/graph3462659278767295844.bin' '-w' '/tmp/graph3462659278767295844.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3462659278767295844.bin' '-l' '-1' '-v' '-w' '/tmp/graph3462659278767295844.weights' '-q' '0' '-e' '0.001'
[2024-05-29 04:13:20] [INFO ] Decomposing Gal with order
[2024-05-29 04:13:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:13:20] [INFO ] Removed a total of 399 redundant transitions.
[2024-05-29 04:13:20] [INFO ] Flatten gal took : 101 ms
[2024-05-29 04:13:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2024-05-29 04:13:21] [INFO ] Time to serialize gal into /tmp/LTL15967708303656805143.gal : 17 ms
[2024-05-29 04:13:21] [INFO ] Time to serialize properties into /tmp/LTL14699047823013216452.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15967708303656805143.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14699047823013216452.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(i2.u78.p227==1)"))))))
Formula 0 simplified : XXXG!"(i2.u78.p227==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1226252765708002565
[2024-05-29 04:13:36] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1226252765708002565
Running compilation step : cd /tmp/ltsmin1226252765708002565;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin1226252765708002565;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin1226252765708002565;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldIIPt-PT-040B-LTLFireability-07 finished in 106502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 2368 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2361 transition count 2161
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2361 transition count 2161
Applied a total of 14 rules in 216 ms. Remains 2361 /2368 variables (removed 7) and now considering 2161/2168 (removed 7) transitions.
[2024-05-29 04:13:39] [INFO ] Invariant cache hit.
[2024-05-29 04:13:40] [INFO ] Implicit Places using invariants in 820 ms returned []
[2024-05-29 04:13:40] [INFO ] Invariant cache hit.
[2024-05-29 04:13:42] [INFO ] Implicit Places using invariants and state equation in 2470 ms returned []
Implicit Place search using SMT with State Equation took 3296 ms to find 0 implicit places.
[2024-05-29 04:13:42] [INFO ] Invariant cache hit.
[2024-05-29 04:13:44] [INFO ] Dead Transitions using invariants and state equation in 1458 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2368 places, 2161/2168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4972 ms. Remains : 2361/2368 places, 2161/2168 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s122 0) (EQ s203 0) (EQ s1575 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 656 ms.
Product exploration explored 100000 steps with 0 reset in 895 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 66 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 160309 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 160309 steps, saw 98737 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 04:13:49] [INFO ] Invariant cache hit.
[2024-05-29 04:13:49] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:13:49] [INFO ] [Nat]Absence check using 361 positive place invariants in 133 ms returned sat
[2024-05-29 04:13:50] [INFO ] After 1051ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:13:51] [INFO ] Deduced a trap composed of 20 places in 539 ms of which 1 ms to minimize.
[2024-05-29 04:13:52] [INFO ] Deduced a trap composed of 17 places in 525 ms of which 1 ms to minimize.
[2024-05-29 04:13:52] [INFO ] Deduced a trap composed of 13 places in 510 ms of which 2 ms to minimize.
[2024-05-29 04:13:53] [INFO ] Deduced a trap composed of 21 places in 529 ms of which 1 ms to minimize.
[2024-05-29 04:13:53] [INFO ] Deduced a trap composed of 17 places in 518 ms of which 2 ms to minimize.
[2024-05-29 04:13:54] [INFO ] Deduced a trap composed of 18 places in 528 ms of which 2 ms to minimize.
[2024-05-29 04:13:54] [INFO ] Deduced a trap composed of 26 places in 507 ms of which 1 ms to minimize.
[2024-05-29 04:13:55] [INFO ] Deduced a trap composed of 25 places in 488 ms of which 1 ms to minimize.
[2024-05-29 04:13:56] [INFO ] Deduced a trap composed of 16 places in 492 ms of which 1 ms to minimize.
[2024-05-29 04:13:56] [INFO ] Deduced a trap composed of 21 places in 475 ms of which 2 ms to minimize.
[2024-05-29 04:13:57] [INFO ] Deduced a trap composed of 22 places in 473 ms of which 1 ms to minimize.
[2024-05-29 04:13:57] [INFO ] Deduced a trap composed of 24 places in 473 ms of which 1 ms to minimize.
[2024-05-29 04:13:58] [INFO ] Deduced a trap composed of 24 places in 443 ms of which 2 ms to minimize.
[2024-05-29 04:13:58] [INFO ] Deduced a trap composed of 23 places in 428 ms of which 1 ms to minimize.
[2024-05-29 04:13:59] [INFO ] Deduced a trap composed of 27 places in 427 ms of which 2 ms to minimize.
[2024-05-29 04:13:59] [INFO ] Deduced a trap composed of 27 places in 427 ms of which 1 ms to minimize.
[2024-05-29 04:14:00] [INFO ] Deduced a trap composed of 26 places in 408 ms of which 1 ms to minimize.
[2024-05-29 04:14:00] [INFO ] Deduced a trap composed of 27 places in 424 ms of which 1 ms to minimize.
[2024-05-29 04:14:01] [INFO ] Deduced a trap composed of 26 places in 418 ms of which 1 ms to minimize.
[2024-05-29 04:14:01] [INFO ] Deduced a trap composed of 27 places in 401 ms of which 1 ms to minimize.
[2024-05-29 04:14:02] [INFO ] Deduced a trap composed of 30 places in 386 ms of which 1 ms to minimize.
[2024-05-29 04:14:02] [INFO ] Deduced a trap composed of 29 places in 377 ms of which 1 ms to minimize.
[2024-05-29 04:14:03] [INFO ] Deduced a trap composed of 37 places in 381 ms of which 1 ms to minimize.
[2024-05-29 04:14:03] [INFO ] Deduced a trap composed of 31 places in 378 ms of which 1 ms to minimize.
[2024-05-29 04:14:04] [INFO ] Deduced a trap composed of 20 places in 366 ms of which 1 ms to minimize.
[2024-05-29 04:14:04] [INFO ] Deduced a trap composed of 30 places in 357 ms of which 1 ms to minimize.
[2024-05-29 04:14:04] [INFO ] Deduced a trap composed of 39 places in 354 ms of which 1 ms to minimize.
[2024-05-29 04:14:05] [INFO ] Deduced a trap composed of 35 places in 327 ms of which 1 ms to minimize.
[2024-05-29 04:14:05] [INFO ] Deduced a trap composed of 31 places in 337 ms of which 1 ms to minimize.
[2024-05-29 04:14:06] [INFO ] Deduced a trap composed of 34 places in 331 ms of which 1 ms to minimize.
[2024-05-29 04:14:06] [INFO ] Deduced a trap composed of 31 places in 339 ms of which 1 ms to minimize.
[2024-05-29 04:14:06] [INFO ] Deduced a trap composed of 43 places in 337 ms of which 1 ms to minimize.
[2024-05-29 04:14:07] [INFO ] Deduced a trap composed of 39 places in 317 ms of which 1 ms to minimize.
[2024-05-29 04:14:07] [INFO ] Deduced a trap composed of 32 places in 314 ms of which 0 ms to minimize.
[2024-05-29 04:14:08] [INFO ] Deduced a trap composed of 50 places in 298 ms of which 1 ms to minimize.
[2024-05-29 04:14:08] [INFO ] Deduced a trap composed of 43 places in 308 ms of which 1 ms to minimize.
[2024-05-29 04:14:08] [INFO ] Deduced a trap composed of 43 places in 327 ms of which 1 ms to minimize.
[2024-05-29 04:14:09] [INFO ] Deduced a trap composed of 38 places in 302 ms of which 1 ms to minimize.
[2024-05-29 04:14:09] [INFO ] Deduced a trap composed of 45 places in 305 ms of which 1 ms to minimize.
[2024-05-29 04:14:09] [INFO ] Deduced a trap composed of 49 places in 279 ms of which 1 ms to minimize.
[2024-05-29 04:14:10] [INFO ] Deduced a trap composed of 38 places in 300 ms of which 1 ms to minimize.
[2024-05-29 04:14:10] [INFO ] Deduced a trap composed of 39 places in 287 ms of which 0 ms to minimize.
[2024-05-29 04:14:11] [INFO ] Deduced a trap composed of 42 places in 273 ms of which 0 ms to minimize.
[2024-05-29 04:14:11] [INFO ] Deduced a trap composed of 35 places in 271 ms of which 1 ms to minimize.
[2024-05-29 04:14:11] [INFO ] Deduced a trap composed of 39 places in 266 ms of which 1 ms to minimize.
[2024-05-29 04:14:12] [INFO ] Deduced a trap composed of 54 places in 250 ms of which 1 ms to minimize.
[2024-05-29 04:14:12] [INFO ] Deduced a trap composed of 41 places in 244 ms of which 1 ms to minimize.
[2024-05-29 04:14:12] [INFO ] Deduced a trap composed of 40 places in 246 ms of which 1 ms to minimize.
[2024-05-29 04:14:12] [INFO ] Deduced a trap composed of 52 places in 245 ms of which 1 ms to minimize.
[2024-05-29 04:14:13] [INFO ] Deduced a trap composed of 46 places in 260 ms of which 2 ms to minimize.
[2024-05-29 04:14:13] [INFO ] Deduced a trap composed of 38 places in 248 ms of which 1 ms to minimize.
[2024-05-29 04:14:13] [INFO ] Deduced a trap composed of 48 places in 244 ms of which 0 ms to minimize.
[2024-05-29 04:14:14] [INFO ] Deduced a trap composed of 39 places in 233 ms of which 0 ms to minimize.
[2024-05-29 04:14:15] [INFO ] Deduced a trap composed of 14 places in 1228 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 04:14:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 04:14:15] [INFO ] After 26244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 22 ms.
Support contains 3 out of 2361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Drop transitions removed 477 transitions
Trivial Post-agglo rules discarded 477 transitions
Performed 477 trivial Post agglomeration. Transition count delta: 477
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2361 transition count 1684
Reduce places removed 477 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 478 rules applied. Total rules applied 955 place count 1884 transition count 1683
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 956 place count 1883 transition count 1683
Performed 321 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 321 Pre rules applied. Total rules applied 956 place count 1883 transition count 1362
Deduced a syphon composed of 321 places in 2 ms
Reduce places removed 321 places and 0 transitions.
Iterating global reduction 3 with 642 rules applied. Total rules applied 1598 place count 1562 transition count 1362
Performed 676 Post agglomeration using F-continuation condition.Transition count delta: 676
Deduced a syphon composed of 676 places in 1 ms
Reduce places removed 676 places and 0 transitions.
Iterating global reduction 3 with 1352 rules applied. Total rules applied 2950 place count 886 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2951 place count 886 transition count 685
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2953 place count 885 transition count 684
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3155 place count 784 transition count 750
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 3191 place count 766 transition count 763
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3192 place count 766 transition count 762
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3232 place count 766 transition count 762
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3233 place count 765 transition count 761
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3235 place count 763 transition count 761
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3235 place count 763 transition count 760
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3237 place count 762 transition count 760
Applied a total of 3237 rules in 261 ms. Remains 762 /2361 variables (removed 1599) and now considering 760/2161 (removed 1401) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 261 ms. Remains : 762/2361 places, 760/2161 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 240934 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 240934 steps, saw 154802 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 760 rows 762 cols
[2024-05-29 04:14:18] [INFO ] Computed 359 invariants in 4 ms
[2024-05-29 04:14:19] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:14:19] [INFO ] [Nat]Absence check using 359 positive place invariants in 54 ms returned sat
[2024-05-29 04:14:19] [INFO ] After 303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:14:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 04:14:19] [INFO ] After 33ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 04:14:19] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-29 04:14:19] [INFO ] After 586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 760/760 transitions.
Applied a total of 0 rules in 10 ms. Remains 762 /762 variables (removed 0) and now considering 760/760 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 762/762 places, 760/760 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 760/760 transitions.
Applied a total of 0 rules in 10 ms. Remains 762 /762 variables (removed 0) and now considering 760/760 (removed 0) transitions.
[2024-05-29 04:14:19] [INFO ] Invariant cache hit.
[2024-05-29 04:14:20] [INFO ] Implicit Places using invariants in 450 ms returned [751]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 454 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 761/762 places, 760/760 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 760 transition count 759
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 760 transition count 759
Applied a total of 2 rules in 18 ms. Remains 760 /761 variables (removed 1) and now considering 759/760 (removed 1) transitions.
// Phase 1: matrix 759 rows 760 cols
[2024-05-29 04:14:20] [INFO ] Computed 358 invariants in 2 ms
[2024-05-29 04:14:20] [INFO ] Implicit Places using invariants in 454 ms returned []
[2024-05-29 04:14:20] [INFO ] Invariant cache hit.
[2024-05-29 04:14:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 04:14:21] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1337 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 760/762 places, 759/760 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1820 ms. Remains : 760/762 places, 759/760 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 233572 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 233572 steps, saw 151023 distinct states, run finished after 3002 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 04:14:24] [INFO ] Invariant cache hit.
[2024-05-29 04:14:24] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:14:24] [INFO ] [Nat]Absence check using 358 positive place invariants in 52 ms returned sat
[2024-05-29 04:14:25] [INFO ] After 284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:14:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 04:14:25] [INFO ] After 28ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 04:14:25] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-29 04:14:25] [INFO ] After 545ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 760 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 760/760 places, 759/759 transitions.
Applied a total of 0 rules in 25 ms. Remains 760 /760 variables (removed 0) and now considering 759/759 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 760/760 places, 759/759 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 760/760 places, 759/759 transitions.
Applied a total of 0 rules in 10 ms. Remains 760 /760 variables (removed 0) and now considering 759/759 (removed 0) transitions.
[2024-05-29 04:14:25] [INFO ] Invariant cache hit.
[2024-05-29 04:14:25] [INFO ] Implicit Places using invariants in 419 ms returned []
[2024-05-29 04:14:25] [INFO ] Invariant cache hit.
[2024-05-29 04:14:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 04:14:26] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 1349 ms to find 0 implicit places.
[2024-05-29 04:14:26] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-29 04:14:26] [INFO ] Invariant cache hit.
[2024-05-29 04:14:27] [INFO ] Dead Transitions using invariants and state equation in 423 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1794 ms. Remains : 760/760 places, 759/759 transitions.
Partial Free-agglomeration rule applied 86 times.
Drop transitions removed 86 transitions
Iterating global reduction 0 with 86 rules applied. Total rules applied 86 place count 760 transition count 759
Applied a total of 86 rules in 30 ms. Remains 760 /760 variables (removed 0) and now considering 759/759 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 759 rows 760 cols
[2024-05-29 04:14:27] [INFO ] Computed 358 invariants in 2 ms
[2024-05-29 04:14:27] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:14:27] [INFO ] [Nat]Absence check using 358 positive place invariants in 56 ms returned sat
[2024-05-29 04:14:27] [INFO ] After 317ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:14:27] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-29 04:14:27] [INFO ] After 99ms SMT Verify possible using 83 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 04:14:27] [INFO ] After 172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2024-05-29 04:14:27] [INFO ] After 697ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Support contains 3 out of 2361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 477 transitions
Trivial Post-agglo rules discarded 477 transitions
Performed 477 trivial Post agglomeration. Transition count delta: 477
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2360 transition count 1683
Reduce places removed 477 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 478 rules applied. Total rules applied 955 place count 1883 transition count 1682
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 956 place count 1882 transition count 1682
Performed 321 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 321 Pre rules applied. Total rules applied 956 place count 1882 transition count 1361
Deduced a syphon composed of 321 places in 2 ms
Reduce places removed 321 places and 0 transitions.
Iterating global reduction 3 with 642 rules applied. Total rules applied 1598 place count 1561 transition count 1361
Performed 674 Post agglomeration using F-continuation condition.Transition count delta: 674
Deduced a syphon composed of 674 places in 1 ms
Reduce places removed 674 places and 0 transitions.
Iterating global reduction 3 with 1348 rules applied. Total rules applied 2946 place count 887 transition count 687
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2947 place count 887 transition count 686
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2949 place count 886 transition count 685
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3151 place count 785 transition count 751
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 3187 place count 767 transition count 764
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3189 place count 765 transition count 762
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3191 place count 763 transition count 762
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3191 place count 763 transition count 761
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3193 place count 762 transition count 761
Applied a total of 3193 rules in 296 ms. Remains 762 /2361 variables (removed 1599) and now considering 761/2161 (removed 1400) transitions.
// Phase 1: matrix 761 rows 762 cols
[2024-05-29 04:14:28] [INFO ] Computed 359 invariants in 3 ms
[2024-05-29 04:14:28] [INFO ] Implicit Places using invariants in 419 ms returned [751]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 420 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 761/2361 places, 761/2161 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 760 transition count 760
Applied a total of 2 rules in 19 ms. Remains 760 /761 variables (removed 1) and now considering 760/761 (removed 1) transitions.
// Phase 1: matrix 760 rows 760 cols
[2024-05-29 04:14:28] [INFO ] Computed 358 invariants in 7 ms
[2024-05-29 04:14:29] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-05-29 04:14:29] [INFO ] Invariant cache hit.
[2024-05-29 04:14:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 04:14:30] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 1352 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 760/2361 places, 760/2161 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2087 ms. Remains : 760/2361 places, 760/2161 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 72 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 43 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 265777 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 265777 steps, saw 162983 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 04:14:33] [INFO ] Invariant cache hit.
[2024-05-29 04:14:33] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:14:33] [INFO ] [Nat]Absence check using 358 positive place invariants in 54 ms returned sat
[2024-05-29 04:14:34] [INFO ] After 297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:14:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 04:14:34] [INFO ] After 29ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 04:14:34] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-29 04:14:34] [INFO ] After 570ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 3 out of 760 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 760/760 places, 760/760 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 760 transition count 759
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 760 transition count 759
Applied a total of 3 rules in 28 ms. Remains 760 /760 variables (removed 0) and now considering 759/760 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 760/760 places, 759/760 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 261349 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 261349 steps, saw 165176 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 759 rows 760 cols
[2024-05-29 04:14:37] [INFO ] Computed 358 invariants in 3 ms
[2024-05-29 04:14:37] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:14:37] [INFO ] [Nat]Absence check using 358 positive place invariants in 59 ms returned sat
[2024-05-29 04:14:37] [INFO ] After 292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:14:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 04:14:37] [INFO ] After 32ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 04:14:38] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2024-05-29 04:14:38] [INFO ] After 563ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 760 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 760/760 places, 759/759 transitions.
Applied a total of 0 rules in 13 ms. Remains 760 /760 variables (removed 0) and now considering 759/759 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 760/760 places, 759/759 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 760/760 places, 759/759 transitions.
Applied a total of 0 rules in 11 ms. Remains 760 /760 variables (removed 0) and now considering 759/759 (removed 0) transitions.
[2024-05-29 04:14:38] [INFO ] Invariant cache hit.
[2024-05-29 04:14:38] [INFO ] Implicit Places using invariants in 444 ms returned []
[2024-05-29 04:14:38] [INFO ] Invariant cache hit.
[2024-05-29 04:14:38] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 04:14:39] [INFO ] Implicit Places using invariants and state equation in 869 ms returned []
Implicit Place search using SMT with State Equation took 1314 ms to find 0 implicit places.
[2024-05-29 04:14:39] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-29 04:14:39] [INFO ] Invariant cache hit.
[2024-05-29 04:14:39] [INFO ] Dead Transitions using invariants and state equation in 427 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1763 ms. Remains : 760/760 places, 759/759 transitions.
Partial Free-agglomeration rule applied 86 times.
Drop transitions removed 86 transitions
Iterating global reduction 0 with 86 rules applied. Total rules applied 86 place count 760 transition count 759
Applied a total of 86 rules in 20 ms. Remains 760 /760 variables (removed 0) and now considering 759/759 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 759 rows 760 cols
[2024-05-29 04:14:39] [INFO ] Computed 358 invariants in 2 ms
[2024-05-29 04:14:39] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:14:40] [INFO ] [Nat]Absence check using 358 positive place invariants in 55 ms returned sat
[2024-05-29 04:14:40] [INFO ] After 309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:14:40] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 04:14:40] [INFO ] After 31ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 04:14:40] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-29 04:14:40] [INFO ] After 602ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 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 46 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 643 ms.
Product exploration explored 100000 steps with 0 reset in 846 ms.
Built C files in :
/tmp/ltsmin10943839825092496204
[2024-05-29 04:14:42] [INFO ] Computing symmetric may disable matrix : 760 transitions.
[2024-05-29 04:14:42] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:14:42] [INFO ] Computing symmetric may enable matrix : 760 transitions.
[2024-05-29 04:14:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:14:42] [INFO ] Computing Do-Not-Accords matrix : 760 transitions.
[2024-05-29 04:14:42] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:14:42] [INFO ] Built C files in 145ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10943839825092496204
Running compilation step : cd /tmp/ltsmin10943839825092496204;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2077 ms.
Running link step : cd /tmp/ltsmin10943839825092496204;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin10943839825092496204;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6124306114580109171.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 760 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 760/760 places, 760/760 transitions.
Applied a total of 0 rules in 12 ms. Remains 760 /760 variables (removed 0) and now considering 760/760 (removed 0) transitions.
// Phase 1: matrix 760 rows 760 cols
[2024-05-29 04:14:57] [INFO ] Computed 358 invariants in 2 ms
[2024-05-29 04:14:57] [INFO ] Implicit Places using invariants in 442 ms returned []
[2024-05-29 04:14:57] [INFO ] Invariant cache hit.
[2024-05-29 04:14:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 04:14:58] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 1367 ms to find 0 implicit places.
[2024-05-29 04:14:58] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-29 04:14:58] [INFO ] Invariant cache hit.
[2024-05-29 04:14:59] [INFO ] Dead Transitions using invariants and state equation in 431 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1825 ms. Remains : 760/760 places, 760/760 transitions.
Built C files in :
/tmp/ltsmin13733815542841862958
[2024-05-29 04:14:59] [INFO ] Computing symmetric may disable matrix : 760 transitions.
[2024-05-29 04:14:59] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:14:59] [INFO ] Computing symmetric may enable matrix : 760 transitions.
[2024-05-29 04:14:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:14:59] [INFO ] Computing Do-Not-Accords matrix : 760 transitions.
[2024-05-29 04:14:59] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:14:59] [INFO ] Built C files in 138ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13733815542841862958
Running compilation step : cd /tmp/ltsmin13733815542841862958;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2101 ms.
Running link step : cd /tmp/ltsmin13733815542841862958;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin13733815542841862958;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9138538907606485117.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 04:15:14] [INFO ] Flatten gal took : 20 ms
[2024-05-29 04:15:14] [INFO ] Flatten gal took : 19 ms
[2024-05-29 04:15:14] [INFO ] Time to serialize gal into /tmp/LTL13113555536366300343.gal : 3 ms
[2024-05-29 04:15:14] [INFO ] Time to serialize properties into /tmp/LTL2394271119992024260.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13113555536366300343.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3944092366787869809.hoa' '-atoms' '/tmp/LTL2394271119992024260.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2394271119992024260.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3944092366787869809.hoa
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...1395
Computing Next relation with stutter on 1.60065e+49 deadlock states
Detected timeout of ITS tools.
[2024-05-29 04:15:29] [INFO ] Flatten gal took : 20 ms
[2024-05-29 04:15:29] [INFO ] Flatten gal took : 19 ms
[2024-05-29 04:15:29] [INFO ] Time to serialize gal into /tmp/LTL11393119318801902969.gal : 4 ms
[2024-05-29 04:15:29] [INFO ] Time to serialize properties into /tmp/LTL1936642403889547757.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11393119318801902969.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1936642403889547757.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G("(((p133==0)||(p231==0))||(p1861==0))"))))
Formula 0 simplified : XF!"(((p133==0)||(p231==0))||(p1861==0))"
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...1395
Computing Next relation with stutter on 1.60065e+49 deadlock states
Detected timeout of ITS tools.
[2024-05-29 04:15:44] [INFO ] Flatten gal took : 30 ms
[2024-05-29 04:15:44] [INFO ] Applying decomposition
[2024-05-29 04:15:44] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2666825444066664542.txt' '-o' '/tmp/graph2666825444066664542.bin' '-w' '/tmp/graph2666825444066664542.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2666825444066664542.bin' '-l' '-1' '-v' '-w' '/tmp/graph2666825444066664542.weights' '-q' '0' '-e' '0.001'
[2024-05-29 04:15:44] [INFO ] Decomposing Gal with order
[2024-05-29 04:15:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:15:44] [INFO ] Removed a total of 868 redundant transitions.
[2024-05-29 04:15:44] [INFO ] Flatten gal took : 39 ms
[2024-05-29 04:15:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 366 labels/synchronizations in 14 ms.
[2024-05-29 04:15:44] [INFO ] Time to serialize gal into /tmp/LTL249286601162858147.gal : 6 ms
[2024-05-29 04:15:44] [INFO ] Time to serialize properties into /tmp/LTL7959340110611089145.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL249286601162858147.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7959340110611089145.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(G("(((i1.u13.p133==0)||(i1.u23.p231==0))||(i14.u214.p1861==0))"))))
Formula 0 simplified : XF!"(((i1.u13.p133==0)||(i1.u23.p231==0))||(i14.u214.p1861==0))"
Reverse transition relation is NOT exact ! Due to transitions i0.t484_t166_t169, i0.t483_t163_t169, i0.t0, i0.u1.t486, i1.t494_t182_t185, i1.t493_t180_t185...2185
Computing Next relation with stutter on 1.60065e+49 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11758561605453517138
[2024-05-29 04:15:59] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11758561605453517138
Running compilation step : cd /tmp/ltsmin11758561605453517138;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1772 ms.
Running link step : cd /tmp/ltsmin11758561605453517138;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11758561605453517138;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPt-PT-040B-LTLFireability-09 finished in 155694 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((!p0||F(p1)))) U (X(p0)||(p2 U p3))))'
Support contains 6 out of 2368 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2361 transition count 2161
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2361 transition count 2161
Applied a total of 14 rules in 205 ms. Remains 2361 /2368 variables (removed 7) and now considering 2161/2168 (removed 7) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2024-05-29 04:16:15] [INFO ] Computed 361 invariants in 9 ms
[2024-05-29 04:16:15] [INFO ] Implicit Places using invariants in 808 ms returned []
[2024-05-29 04:16:15] [INFO ] Invariant cache hit.
[2024-05-29 04:16:18] [INFO ] Implicit Places using invariants and state equation in 2492 ms returned []
Implicit Place search using SMT with State Equation took 3301 ms to find 0 implicit places.
[2024-05-29 04:16:18] [INFO ] Invariant cache hit.
[2024-05-29 04:16:19] [INFO ] Dead Transitions using invariants and state equation in 1435 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2368 places, 2161/2168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4944 ms. Remains : 2361/2368 places, 2161/2168 transitions.
Stuttering acceptance computed with spot in 344 ms :[(AND (NOT p0) (NOT p3)), false, (AND (NOT p0) (NOT p3)), false, (AND (NOT p1) p0), (NOT p1), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p3:(EQ s27 1), p2:(EQ s333 1), p0:(AND (EQ s817 1) (EQ s828 1) (EQ s854 1)), p1:(EQ s84 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24953 reset in 1024 ms.
Product exploration explored 100000 steps with 25028 reset in 998 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Detected a total of 638/2361 stabilizing places and 638/2161 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p3) (NOT p2) (NOT p0))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT p0)), (X (X (AND (NOT p3) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) p2 p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 464 ms. Reduced automaton from 8 states, 15 edges and 4 AP (stutter sensitive) to 8 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p0) (NOT p3)), false, (AND (NOT p0) (NOT p3)), false, (AND (NOT p1) p0), (NOT p1), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-29 04:16:23] [INFO ] Invariant cache hit.
[2024-05-29 04:16:23] [INFO ] [Real]Absence check using 361 positive place invariants in 135 ms returned sat
[2024-05-29 04:16:25] [INFO ] After 2011ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 04:16:25] [INFO ] [Nat]Absence check using 361 positive place invariants in 134 ms returned sat
[2024-05-29 04:16:27] [INFO ] After 1318ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 04:16:28] [INFO ] Deduced a trap composed of 21 places in 637 ms of which 2 ms to minimize.
[2024-05-29 04:16:28] [INFO ] Deduced a trap composed of 18 places in 623 ms of which 2 ms to minimize.
[2024-05-29 04:16:29] [INFO ] Deduced a trap composed of 32 places in 617 ms of which 2 ms to minimize.
[2024-05-29 04:16:30] [INFO ] Deduced a trap composed of 16 places in 598 ms of which 1 ms to minimize.
[2024-05-29 04:16:30] [INFO ] Deduced a trap composed of 20 places in 624 ms of which 1 ms to minimize.
[2024-05-29 04:16:31] [INFO ] Deduced a trap composed of 21 places in 560 ms of which 1 ms to minimize.
[2024-05-29 04:16:32] [INFO ] Deduced a trap composed of 16 places in 578 ms of which 2 ms to minimize.
[2024-05-29 04:16:32] [INFO ] Deduced a trap composed of 16 places in 578 ms of which 2 ms to minimize.
[2024-05-29 04:16:33] [INFO ] Deduced a trap composed of 27 places in 575 ms of which 1 ms to minimize.
[2024-05-29 04:16:34] [INFO ] Deduced a trap composed of 25 places in 575 ms of which 1 ms to minimize.
[2024-05-29 04:16:34] [INFO ] Deduced a trap composed of 15 places in 565 ms of which 2 ms to minimize.
[2024-05-29 04:16:35] [INFO ] Deduced a trap composed of 17 places in 566 ms of which 4 ms to minimize.
[2024-05-29 04:16:35] [INFO ] Deduced a trap composed of 27 places in 527 ms of which 1 ms to minimize.
[2024-05-29 04:16:36] [INFO ] Deduced a trap composed of 29 places in 528 ms of which 1 ms to minimize.
[2024-05-29 04:16:37] [INFO ] Deduced a trap composed of 30 places in 511 ms of which 1 ms to minimize.
[2024-05-29 04:16:37] [INFO ] Deduced a trap composed of 30 places in 493 ms of which 1 ms to minimize.
[2024-05-29 04:16:38] [INFO ] Deduced a trap composed of 26 places in 529 ms of which 2 ms to minimize.
[2024-05-29 04:16:38] [INFO ] Deduced a trap composed of 41 places in 503 ms of which 2 ms to minimize.
[2024-05-29 04:16:39] [INFO ] Deduced a trap composed of 31 places in 512 ms of which 5 ms to minimize.
[2024-05-29 04:16:40] [INFO ] Deduced a trap composed of 19 places in 493 ms of which 1 ms to minimize.
[2024-05-29 04:16:40] [INFO ] Deduced a trap composed of 41 places in 487 ms of which 1 ms to minimize.
[2024-05-29 04:16:41] [INFO ] Deduced a trap composed of 21 places in 471 ms of which 1 ms to minimize.
[2024-05-29 04:16:41] [INFO ] Deduced a trap composed of 29 places in 450 ms of which 1 ms to minimize.
[2024-05-29 04:16:42] [INFO ] Deduced a trap composed of 50 places in 472 ms of which 1 ms to minimize.
[2024-05-29 04:16:42] [INFO ] Deduced a trap composed of 31 places in 462 ms of which 1 ms to minimize.
[2024-05-29 04:16:43] [INFO ] Deduced a trap composed of 32 places in 464 ms of which 1 ms to minimize.
[2024-05-29 04:16:43] [INFO ] Deduced a trap composed of 32 places in 455 ms of which 1 ms to minimize.
[2024-05-29 04:16:44] [INFO ] Deduced a trap composed of 39 places in 464 ms of which 2 ms to minimize.
[2024-05-29 04:16:44] [INFO ] Deduced a trap composed of 38 places in 448 ms of which 2 ms to minimize.
[2024-05-29 04:16:45] [INFO ] Deduced a trap composed of 34 places in 436 ms of which 1 ms to minimize.
[2024-05-29 04:16:45] [INFO ] Deduced a trap composed of 40 places in 414 ms of which 2 ms to minimize.
[2024-05-29 04:16:46] [INFO ] Deduced a trap composed of 22 places in 434 ms of which 3 ms to minimize.
[2024-05-29 04:16:46] [INFO ] Deduced a trap composed of 34 places in 400 ms of which 2 ms to minimize.
[2024-05-29 04:16:47] [INFO ] Deduced a trap composed of 31 places in 384 ms of which 1 ms to minimize.
[2024-05-29 04:16:47] [INFO ] Deduced a trap composed of 21 places in 387 ms of which 1 ms to minimize.
[2024-05-29 04:16:48] [INFO ] Deduced a trap composed of 29 places in 381 ms of which 1 ms to minimize.
[2024-05-29 04:16:48] [INFO ] Deduced a trap composed of 18 places in 370 ms of which 1 ms to minimize.
[2024-05-29 04:16:49] [INFO ] Deduced a trap composed of 38 places in 318 ms of which 2 ms to minimize.
[2024-05-29 04:16:49] [INFO ] Deduced a trap composed of 36 places in 355 ms of which 1 ms to minimize.
[2024-05-29 04:16:50] [INFO ] Deduced a trap composed of 19 places in 364 ms of which 1 ms to minimize.
[2024-05-29 04:16:50] [INFO ] Deduced a trap composed of 22 places in 359 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 04:16:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 04:16:50] [INFO ] After 25126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 222 ms.
Support contains 6 out of 2361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Drop transitions removed 477 transitions
Trivial Post-agglo rules discarded 477 transitions
Performed 477 trivial Post agglomeration. Transition count delta: 477
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2361 transition count 1684
Reduce places removed 477 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 479 rules applied. Total rules applied 956 place count 1884 transition count 1682
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 958 place count 1882 transition count 1682
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 319 Pre rules applied. Total rules applied 958 place count 1882 transition count 1363
Deduced a syphon composed of 319 places in 2 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 1596 place count 1563 transition count 1363
Performed 674 Post agglomeration using F-continuation condition.Transition count delta: 674
Deduced a syphon composed of 674 places in 1 ms
Reduce places removed 674 places and 0 transitions.
Iterating global reduction 3 with 1348 rules applied. Total rules applied 2944 place count 889 transition count 689
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2945 place count 889 transition count 688
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2947 place count 888 transition count 687
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3149 place count 787 transition count 753
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 3185 place count 769 transition count 766
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3186 place count 769 transition count 765
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3226 place count 769 transition count 765
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3227 place count 768 transition count 764
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3229 place count 766 transition count 764
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3229 place count 766 transition count 763
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3231 place count 765 transition count 763
Applied a total of 3231 rules in 251 ms. Remains 765 /2361 variables (removed 1596) and now considering 763/2161 (removed 1398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 765/2361 places, 763/2161 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 153576 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 153576 steps, saw 97596 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 763 rows 765 cols
[2024-05-29 04:16:54] [INFO ] Computed 359 invariants in 2 ms
[2024-05-29 04:16:54] [INFO ] [Real]Absence check using 359 positive place invariants in 58 ms returned sat
[2024-05-29 04:16:54] [INFO ] After 610ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 04:16:55] [INFO ] [Nat]Absence check using 359 positive place invariants in 58 ms returned sat
[2024-05-29 04:16:55] [INFO ] After 419ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 04:16:55] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-29 04:16:56] [INFO ] After 521ms SMT Verify possible using 122 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 04:16:56] [INFO ] After 1066ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 463 ms.
[2024-05-29 04:16:57] [INFO ] After 2209ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 66 ms.
Support contains 6 out of 765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 765/765 places, 763/763 transitions.
Applied a total of 0 rules in 10 ms. Remains 765 /765 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 765/765 places, 763/763 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 765/765 places, 763/763 transitions.
Applied a total of 0 rules in 10 ms. Remains 765 /765 variables (removed 0) and now considering 763/763 (removed 0) transitions.
[2024-05-29 04:16:57] [INFO ] Invariant cache hit.
[2024-05-29 04:16:57] [INFO ] Implicit Places using invariants in 459 ms returned [754]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 461 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 764/765 places, 763/763 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 763 transition count 762
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 763 transition count 762
Applied a total of 2 rules in 18 ms. Remains 763 /764 variables (removed 1) and now considering 762/763 (removed 1) transitions.
// Phase 1: matrix 762 rows 763 cols
[2024-05-29 04:16:57] [INFO ] Computed 358 invariants in 3 ms
[2024-05-29 04:16:58] [INFO ] Implicit Places using invariants in 446 ms returned []
[2024-05-29 04:16:58] [INFO ] Invariant cache hit.
[2024-05-29 04:16:58] [INFO ] State equation strengthened by 121 read => feed constraints.
[2024-05-29 04:17:00] [INFO ] Implicit Places using invariants and state equation in 1941 ms returned []
Implicit Place search using SMT with State Equation took 2391 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 763/765 places, 762/763 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2881 ms. Remains : 763/765 places, 762/763 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 150522 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 150522 steps, saw 96975 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-29 04:17:03] [INFO ] Invariant cache hit.
[2024-05-29 04:17:03] [INFO ] [Real]Absence check using 358 positive place invariants in 58 ms returned sat
[2024-05-29 04:17:04] [INFO ] After 667ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 04:17:04] [INFO ] [Nat]Absence check using 358 positive place invariants in 61 ms returned sat
[2024-05-29 04:17:04] [INFO ] After 414ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 04:17:04] [INFO ] State equation strengthened by 121 read => feed constraints.
[2024-05-29 04:17:07] [INFO ] After 2283ms SMT Verify possible using 121 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 04:17:07] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2024-05-29 04:17:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2024-05-29 04:17:07] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2024-05-29 04:17:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 577 ms
[2024-05-29 04:17:09] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-29 04:17:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2024-05-29 04:17:09] [INFO ] After 4651ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1207 ms.
[2024-05-29 04:17:10] [INFO ] After 6541ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 108 ms.
Support contains 6 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 762/762 transitions.
Applied a total of 0 rules in 10 ms. Remains 763 /763 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 763/763 places, 762/762 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 762/762 transitions.
Applied a total of 0 rules in 10 ms. Remains 763 /763 variables (removed 0) and now considering 762/762 (removed 0) transitions.
[2024-05-29 04:17:10] [INFO ] Invariant cache hit.
[2024-05-29 04:17:11] [INFO ] Implicit Places using invariants in 455 ms returned []
[2024-05-29 04:17:11] [INFO ] Invariant cache hit.
[2024-05-29 04:17:11] [INFO ] State equation strengthened by 121 read => feed constraints.
[2024-05-29 04:17:13] [INFO ] Implicit Places using invariants and state equation in 1866 ms returned []
Implicit Place search using SMT with State Equation took 2323 ms to find 0 implicit places.
[2024-05-29 04:17:13] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-29 04:17:13] [INFO ] Invariant cache hit.
[2024-05-29 04:17:13] [INFO ] Dead Transitions using invariants and state equation in 475 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2832 ms. Remains : 763/763 places, 762/762 transitions.
Partial Free-agglomeration rule applied 119 times.
Drop transitions removed 119 transitions
Iterating global reduction 0 with 119 rules applied. Total rules applied 119 place count 763 transition count 762
Applied a total of 119 rules in 29 ms. Remains 763 /763 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 762 rows 763 cols
[2024-05-29 04:17:13] [INFO ] Computed 358 invariants in 5 ms
[2024-05-29 04:17:13] [INFO ] [Real]Absence check using 358 positive place invariants in 53 ms returned sat
[2024-05-29 04:17:14] [INFO ] After 612ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 04:17:14] [INFO ] [Nat]Absence check using 358 positive place invariants in 59 ms returned sat
[2024-05-29 04:17:15] [INFO ] After 397ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 04:17:15] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-05-29 04:17:15] [INFO ] After 263ms SMT Verify possible using 117 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 04:17:15] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-29 04:17:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2024-05-29 04:17:15] [INFO ] After 739ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 259 ms.
[2024-05-29 04:17:16] [INFO ] After 1633ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p3) (NOT p2) (NOT p0))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT p0)), (X (X (AND (NOT p3) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) p2 p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p2 (NOT p3))), (F p1), (F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (F (AND p2 (NOT p3) (NOT p1)))]
Knowledge based reduction with 15 factoid took 927 ms. Reduced automaton from 8 states, 13 edges and 4 AP (stutter sensitive) to 8 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 409 ms :[(AND (NOT p0) (NOT p3)), false, (AND (NOT p0) (NOT p3)), false, (AND (NOT p1) p0), (NOT p1), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 354 ms :[(AND (NOT p0) (NOT p3)), false, (AND (NOT p0) (NOT p3)), false, (AND (NOT p1) p0), (NOT p1), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
// Phase 1: matrix 2161 rows 2361 cols
[2024-05-29 04:17:17] [INFO ] Computed 361 invariants in 7 ms
[2024-05-29 04:17:19] [INFO ] [Real]Absence check using 361 positive place invariants in 416 ms returned sat
[2024-05-29 04:17:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 04:17:31] [INFO ] [Real]Absence check using state equation in 12246 ms returned sat
[2024-05-29 04:17:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 04:17:33] [INFO ] [Nat]Absence check using 361 positive place invariants in 568 ms returned sat
[2024-05-29 04:17:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 04:17:46] [INFO ] [Nat]Absence check using state equation in 13225 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p3))
Support contains 6 out of 2361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Applied a total of 0 rules in 109 ms. Remains 2361 /2361 variables (removed 0) and now considering 2161/2161 (removed 0) transitions.
[2024-05-29 04:17:46] [INFO ] Invariant cache hit.
[2024-05-29 04:17:47] [INFO ] Implicit Places using invariants in 830 ms returned []
[2024-05-29 04:17:47] [INFO ] Invariant cache hit.
[2024-05-29 04:17:50] [INFO ] Implicit Places using invariants and state equation in 2427 ms returned []
Implicit Place search using SMT with State Equation took 3259 ms to find 0 implicit places.
[2024-05-29 04:17:50] [INFO ] Invariant cache hit.
[2024-05-29 04:17:51] [INFO ] Dead Transitions using invariants and state equation in 1468 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4843 ms. Remains : 2361/2361 places, 2161/2161 transitions.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Detected a total of 638/2361 stabilizing places and 638/2161 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (AND (NOT p0) (NOT p3))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 272 ms. Reduced automaton from 8 states, 13 edges and 4 AP (stutter sensitive) to 8 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 318 ms :[(AND (NOT p0) (NOT p3)), false, (AND (NOT p0) (NOT p3)), false, (AND (NOT p1) p0), (NOT p1), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-29 04:17:52] [INFO ] Invariant cache hit.
[2024-05-29 04:17:53] [INFO ] [Real]Absence check using 361 positive place invariants in 133 ms returned sat
[2024-05-29 04:17:54] [INFO ] After 1993ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 04:17:55] [INFO ] [Nat]Absence check using 361 positive place invariants in 129 ms returned sat
[2024-05-29 04:17:56] [INFO ] After 1411ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 04:17:57] [INFO ] Deduced a trap composed of 21 places in 635 ms of which 2 ms to minimize.
[2024-05-29 04:17:58] [INFO ] Deduced a trap composed of 18 places in 615 ms of which 2 ms to minimize.
[2024-05-29 04:17:58] [INFO ] Deduced a trap composed of 32 places in 637 ms of which 1 ms to minimize.
[2024-05-29 04:17:59] [INFO ] Deduced a trap composed of 16 places in 635 ms of which 2 ms to minimize.
[2024-05-29 04:18:00] [INFO ] Deduced a trap composed of 20 places in 628 ms of which 2 ms to minimize.
[2024-05-29 04:18:00] [INFO ] Deduced a trap composed of 21 places in 616 ms of which 2 ms to minimize.
[2024-05-29 04:18:01] [INFO ] Deduced a trap composed of 16 places in 580 ms of which 1 ms to minimize.
[2024-05-29 04:18:02] [INFO ] Deduced a trap composed of 16 places in 615 ms of which 2 ms to minimize.
[2024-05-29 04:18:02] [INFO ] Deduced a trap composed of 27 places in 557 ms of which 1 ms to minimize.
[2024-05-29 04:18:03] [INFO ] Deduced a trap composed of 25 places in 586 ms of which 1 ms to minimize.
[2024-05-29 04:18:04] [INFO ] Deduced a trap composed of 15 places in 580 ms of which 2 ms to minimize.
[2024-05-29 04:18:04] [INFO ] Deduced a trap composed of 17 places in 567 ms of which 1 ms to minimize.
[2024-05-29 04:18:05] [INFO ] Deduced a trap composed of 27 places in 572 ms of which 1 ms to minimize.
[2024-05-29 04:18:06] [INFO ] Deduced a trap composed of 29 places in 560 ms of which 1 ms to minimize.
[2024-05-29 04:18:06] [INFO ] Deduced a trap composed of 30 places in 529 ms of which 2 ms to minimize.
[2024-05-29 04:18:07] [INFO ] Deduced a trap composed of 30 places in 511 ms of which 1 ms to minimize.
[2024-05-29 04:18:07] [INFO ] Deduced a trap composed of 26 places in 512 ms of which 2 ms to minimize.
[2024-05-29 04:18:08] [INFO ] Deduced a trap composed of 41 places in 531 ms of which 1 ms to minimize.
[2024-05-29 04:18:09] [INFO ] Deduced a trap composed of 31 places in 556 ms of which 2 ms to minimize.
[2024-05-29 04:18:09] [INFO ] Deduced a trap composed of 19 places in 538 ms of which 1 ms to minimize.
[2024-05-29 04:18:10] [INFO ] Deduced a trap composed of 41 places in 533 ms of which 1 ms to minimize.
[2024-05-29 04:18:10] [INFO ] Deduced a trap composed of 21 places in 517 ms of which 1 ms to minimize.
[2024-05-29 04:18:11] [INFO ] Deduced a trap composed of 29 places in 481 ms of which 1 ms to minimize.
[2024-05-29 04:18:12] [INFO ] Deduced a trap composed of 50 places in 494 ms of which 1 ms to minimize.
[2024-05-29 04:18:12] [INFO ] Deduced a trap composed of 31 places in 462 ms of which 1 ms to minimize.
[2024-05-29 04:18:13] [INFO ] Deduced a trap composed of 32 places in 470 ms of which 1 ms to minimize.
[2024-05-29 04:18:13] [INFO ] Deduced a trap composed of 32 places in 489 ms of which 1 ms to minimize.
[2024-05-29 04:18:14] [INFO ] Deduced a trap composed of 39 places in 499 ms of which 1 ms to minimize.
[2024-05-29 04:18:14] [INFO ] Deduced a trap composed of 38 places in 450 ms of which 1 ms to minimize.
[2024-05-29 04:18:15] [INFO ] Deduced a trap composed of 34 places in 454 ms of which 1 ms to minimize.
[2024-05-29 04:18:15] [INFO ] Deduced a trap composed of 40 places in 446 ms of which 1 ms to minimize.
[2024-05-29 04:18:16] [INFO ] Deduced a trap composed of 22 places in 421 ms of which 1 ms to minimize.
[2024-05-29 04:18:16] [INFO ] Deduced a trap composed of 34 places in 417 ms of which 1 ms to minimize.
[2024-05-29 04:18:17] [INFO ] Deduced a trap composed of 31 places in 470 ms of which 1 ms to minimize.
[2024-05-29 04:18:17] [INFO ] Deduced a trap composed of 21 places in 395 ms of which 1 ms to minimize.
[2024-05-29 04:18:18] [INFO ] Deduced a trap composed of 29 places in 378 ms of which 1 ms to minimize.
[2024-05-29 04:18:18] [INFO ] Deduced a trap composed of 18 places in 374 ms of which 0 ms to minimize.
[2024-05-29 04:18:19] [INFO ] Deduced a trap composed of 38 places in 384 ms of which 0 ms to minimize.
[2024-05-29 04:18:19] [INFO ] Deduced a trap composed of 36 places in 345 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 04:18:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 04:18:19] [INFO ] After 25179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 124 ms.
Support contains 6 out of 2361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Drop transitions removed 477 transitions
Trivial Post-agglo rules discarded 477 transitions
Performed 477 trivial Post agglomeration. Transition count delta: 477
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2361 transition count 1684
Reduce places removed 477 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 479 rules applied. Total rules applied 956 place count 1884 transition count 1682
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 958 place count 1882 transition count 1682
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 319 Pre rules applied. Total rules applied 958 place count 1882 transition count 1363
Deduced a syphon composed of 319 places in 2 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 1596 place count 1563 transition count 1363
Performed 674 Post agglomeration using F-continuation condition.Transition count delta: 674
Deduced a syphon composed of 674 places in 1 ms
Reduce places removed 674 places and 0 transitions.
Iterating global reduction 3 with 1348 rules applied. Total rules applied 2944 place count 889 transition count 689
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2945 place count 889 transition count 688
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2947 place count 888 transition count 687
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3149 place count 787 transition count 753
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 3185 place count 769 transition count 766
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3186 place count 769 transition count 765
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3226 place count 769 transition count 765
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3227 place count 768 transition count 764
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3229 place count 766 transition count 764
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3229 place count 766 transition count 763
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3231 place count 765 transition count 763
Applied a total of 3231 rules in 227 ms. Remains 765 /2361 variables (removed 1596) and now considering 763/2161 (removed 1398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 765/2361 places, 763/2161 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 178058 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 178058 steps, saw 113418 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 763 rows 765 cols
[2024-05-29 04:18:23] [INFO ] Computed 359 invariants in 1 ms
[2024-05-29 04:18:23] [INFO ] [Real]Absence check using 359 positive place invariants in 89 ms returned sat
[2024-05-29 04:18:24] [INFO ] After 709ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 04:18:24] [INFO ] [Nat]Absence check using 359 positive place invariants in 56 ms returned sat
[2024-05-29 04:18:24] [INFO ] After 398ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 04:18:24] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-05-29 04:18:25] [INFO ] After 540ms SMT Verify possible using 122 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 04:18:25] [INFO ] After 1072ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 483 ms.
[2024-05-29 04:18:26] [INFO ] After 2206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 48 ms.
Support contains 6 out of 765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 765/765 places, 763/763 transitions.
Applied a total of 0 rules in 11 ms. Remains 765 /765 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 765/765 places, 763/763 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 765/765 places, 763/763 transitions.
Applied a total of 0 rules in 10 ms. Remains 765 /765 variables (removed 0) and now considering 763/763 (removed 0) transitions.
[2024-05-29 04:18:26] [INFO ] Invariant cache hit.
[2024-05-29 04:18:26] [INFO ] Implicit Places using invariants in 494 ms returned [754]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 508 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 764/765 places, 763/763 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 763 transition count 762
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 763 transition count 762
Applied a total of 2 rules in 19 ms. Remains 763 /764 variables (removed 1) and now considering 762/763 (removed 1) transitions.
// Phase 1: matrix 762 rows 763 cols
[2024-05-29 04:18:26] [INFO ] Computed 358 invariants in 2 ms
[2024-05-29 04:18:27] [INFO ] Implicit Places using invariants in 493 ms returned []
[2024-05-29 04:18:27] [INFO ] Invariant cache hit.
[2024-05-29 04:18:27] [INFO ] State equation strengthened by 121 read => feed constraints.
[2024-05-29 04:18:29] [INFO ] Implicit Places using invariants and state equation in 1844 ms returned []
Implicit Place search using SMT with State Equation took 2360 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 763/765 places, 762/763 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2898 ms. Remains : 763/765 places, 762/763 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 169284 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 169284 steps, saw 109296 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-29 04:18:32] [INFO ] Invariant cache hit.
[2024-05-29 04:18:33] [INFO ] [Real]Absence check using 358 positive place invariants in 54 ms returned sat
[2024-05-29 04:18:33] [INFO ] After 640ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 04:18:33] [INFO ] [Nat]Absence check using 358 positive place invariants in 55 ms returned sat
[2024-05-29 04:18:34] [INFO ] After 383ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 04:18:34] [INFO ] State equation strengthened by 121 read => feed constraints.
[2024-05-29 04:18:36] [INFO ] After 2282ms SMT Verify possible using 121 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 04:18:36] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-29 04:18:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2024-05-29 04:18:37] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-05-29 04:18:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 595 ms
[2024-05-29 04:18:38] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-29 04:18:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2024-05-29 04:18:38] [INFO ] After 4697ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1230 ms.
[2024-05-29 04:18:40] [INFO ] After 6595ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 70 ms.
Support contains 6 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 762/762 transitions.
Applied a total of 0 rules in 12 ms. Remains 763 /763 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 763/763 places, 762/762 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 762/762 transitions.
Applied a total of 0 rules in 10 ms. Remains 763 /763 variables (removed 0) and now considering 762/762 (removed 0) transitions.
[2024-05-29 04:18:40] [INFO ] Invariant cache hit.
[2024-05-29 04:18:40] [INFO ] Implicit Places using invariants in 483 ms returned []
[2024-05-29 04:18:40] [INFO ] Invariant cache hit.
[2024-05-29 04:18:41] [INFO ] State equation strengthened by 121 read => feed constraints.
[2024-05-29 04:18:42] [INFO ] Implicit Places using invariants and state equation in 1780 ms returned []
Implicit Place search using SMT with State Equation took 2287 ms to find 0 implicit places.
[2024-05-29 04:18:42] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-29 04:18:42] [INFO ] Invariant cache hit.
[2024-05-29 04:18:42] [INFO ] Dead Transitions using invariants and state equation in 437 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2768 ms. Remains : 763/763 places, 762/762 transitions.
Partial Free-agglomeration rule applied 119 times.
Drop transitions removed 119 transitions
Iterating global reduction 0 with 119 rules applied. Total rules applied 119 place count 763 transition count 762
Applied a total of 119 rules in 20 ms. Remains 763 /763 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 762 rows 763 cols
[2024-05-29 04:18:42] [INFO ] Computed 358 invariants in 2 ms
[2024-05-29 04:18:43] [INFO ] [Real]Absence check using 358 positive place invariants in 87 ms returned sat
[2024-05-29 04:18:43] [INFO ] After 641ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 04:18:43] [INFO ] [Nat]Absence check using 358 positive place invariants in 53 ms returned sat
[2024-05-29 04:18:44] [INFO ] After 390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 04:18:44] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-05-29 04:18:44] [INFO ] After 273ms SMT Verify possible using 117 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-29 04:18:44] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-29 04:18:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2024-05-29 04:18:44] [INFO ] After 747ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 262 ms.
[2024-05-29 04:18:45] [INFO ] After 1624ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (AND (NOT p0) (NOT p3))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p2 (NOT p3))), (F p1), (F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (F (AND p2 (NOT p3) (NOT p1)))]
Knowledge based reduction with 11 factoid took 684 ms. Reduced automaton from 8 states, 13 edges and 4 AP (stutter sensitive) to 8 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 298 ms :[(AND (NOT p0) (NOT p3)), false, (AND (NOT p0) (NOT p3)), false, (AND (NOT p1) p0), (NOT p1), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p0) (NOT p3)), false, (AND (NOT p0) (NOT p3)), false, (AND (NOT p1) p0), (NOT p1), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
// Phase 1: matrix 2161 rows 2361 cols
[2024-05-29 04:18:46] [INFO ] Computed 361 invariants in 8 ms
[2024-05-29 04:18:48] [INFO ] [Real]Absence check using 361 positive place invariants in 393 ms returned sat
[2024-05-29 04:18:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 04:19:00] [INFO ] [Real]Absence check using state equation in 12507 ms returned sat
[2024-05-29 04:19:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 04:19:02] [INFO ] [Nat]Absence check using 361 positive place invariants in 595 ms returned sat
[2024-05-29 04:19:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 04:19:15] [INFO ] [Nat]Absence check using state equation in 13213 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p3))
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p0) (NOT p3)), false, (AND (NOT p0) (NOT p3)), false, (AND (NOT p1) p0), (NOT p1), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 20047 reset in 880 ms.
Product exploration explored 100000 steps with 19969 reset in 886 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p0) (NOT p3)), false, (AND (NOT p0) (NOT p3)), false, (AND (NOT p1) p0), (NOT p1), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Support contains 6 out of 2361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Performed 479 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2361 transition count 2161
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 160 Pre rules applied. Total rules applied 479 place count 2361 transition count 2281
Deduced a syphon composed of 639 places in 3 ms
Iterating global reduction 1 with 160 rules applied. Total rules applied 639 place count 2361 transition count 2281
Performed 793 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1432 places in 2 ms
Iterating global reduction 1 with 793 rules applied. Total rules applied 1432 place count 2361 transition count 2281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1433 place count 2361 transition count 2280
Renaming transitions due to excessive name length > 1024 char.
Discarding 317 places :
Symmetric choice reduction at 2 with 317 rule applications. Total rules 1750 place count 2044 transition count 1963
Deduced a syphon composed of 1115 places in 1 ms
Iterating global reduction 2 with 317 rules applied. Total rules applied 2067 place count 2044 transition count 1963
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1116 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2068 place count 2044 transition count 1963
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2070 place count 2042 transition count 1961
Deduced a syphon composed of 1114 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2072 place count 2042 transition count 1961
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -526
Deduced a syphon composed of 1215 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2173 place count 2042 transition count 2487
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2274 place count 1941 transition count 2285
Deduced a syphon composed of 1114 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2375 place count 1941 transition count 2285
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -309
Deduced a syphon composed of 1172 places in 2 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 2433 place count 1941 transition count 2594
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 2491 place count 1883 transition count 2478
Deduced a syphon composed of 1114 places in 2 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 2549 place count 1883 transition count 2478
Deduced a syphon composed of 1114 places in 2 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 2558 place count 1883 transition count 2469
Deduced a syphon composed of 1114 places in 2 ms
Applied a total of 2558 rules in 825 ms. Remains 1883 /2361 variables (removed 478) and now considering 2469/2161 (removed -308) transitions.
[2024-05-29 04:19:19] [INFO ] Redundant transitions in 43 ms returned []
// Phase 1: matrix 2469 rows 1883 cols
[2024-05-29 04:19:19] [INFO ] Computed 361 invariants in 9 ms
[2024-05-29 04:19:20] [INFO ] Dead Transitions using invariants and state equation in 1430 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1883/2361 places, 2469/2161 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2318 ms. Remains : 1883/2361 places, 2469/2161 transitions.
Built C files in :
/tmp/ltsmin17695915225492283007
[2024-05-29 04:19:20] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17695915225492283007
Running compilation step : cd /tmp/ltsmin17695915225492283007;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin17695915225492283007;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin17695915225492283007;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 6 out of 2361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Applied a total of 0 rules in 112 ms. Remains 2361 /2361 variables (removed 0) and now considering 2161/2161 (removed 0) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2024-05-29 04:19:23] [INFO ] Computed 361 invariants in 6 ms
[2024-05-29 04:19:24] [INFO ] Implicit Places using invariants in 769 ms returned []
[2024-05-29 04:19:24] [INFO ] Invariant cache hit.
[2024-05-29 04:19:26] [INFO ] Implicit Places using invariants and state equation in 2438 ms returned []
Implicit Place search using SMT with State Equation took 3227 ms to find 0 implicit places.
[2024-05-29 04:19:26] [INFO ] Invariant cache hit.
[2024-05-29 04:19:28] [INFO ] Dead Transitions using invariants and state equation in 1511 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4860 ms. Remains : 2361/2361 places, 2161/2161 transitions.
Built C files in :
/tmp/ltsmin16876158998917874506
[2024-05-29 04:19:28] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16876158998917874506
Running compilation step : cd /tmp/ltsmin16876158998917874506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16876158998917874506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16876158998917874506;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-29 04:19:31] [INFO ] Flatten gal took : 42 ms
[2024-05-29 04:19:31] [INFO ] Flatten gal took : 42 ms
[2024-05-29 04:19:31] [INFO ] Time to serialize gal into /tmp/LTL7158714861392670369.gal : 8 ms
[2024-05-29 04:19:31] [INFO ] Time to serialize properties into /tmp/LTL3658243632856643781.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7158714861392670369.gal' '-t' 'CGAL' '-hoa' '/tmp/aut285255155546509631.hoa' '-atoms' '/tmp/LTL3658243632856643781.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL3658243632856643781.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut285255155546509631.hoa
Detected timeout of ITS tools.
[2024-05-29 04:19:46] [INFO ] Flatten gal took : 41 ms
[2024-05-29 04:19:46] [INFO ] Flatten gal took : 44 ms
[2024-05-29 04:19:46] [INFO ] Time to serialize gal into /tmp/LTL13801476331095515860.gal : 9 ms
[2024-05-29 04:19:46] [INFO ] Time to serialize properties into /tmp/LTL1482370364234544007.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13801476331095515860.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1482370364234544007.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(X((!("(((p960==1)&&(p973==1))&&(p1007==1))"))||(F("(p89==1)")))))U((X("(((p960==1)&&(p973==1))&&(p1007==1))"))||(("(p388==1)")U(...170
Formula 0 simplified : XX("(((p960==1)&&(p973==1))&&(p1007==1))" & G!"(p89==1)") R (X!"(((p960==1)&&(p973==1))&&(p1007==1))" & (!"(p388==1)" R !"(p27==1)")...156
Detected timeout of ITS tools.
[2024-05-29 04:20:01] [INFO ] Flatten gal took : 46 ms
[2024-05-29 04:20:01] [INFO ] Applying decomposition
[2024-05-29 04:20:01] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14248638826458148885.txt' '-o' '/tmp/graph14248638826458148885.bin' '-w' '/tmp/graph14248638826458148885.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14248638826458148885.bin' '-l' '-1' '-v' '-w' '/tmp/graph14248638826458148885.weights' '-q' '0' '-e' '0.001'
[2024-05-29 04:20:02] [INFO ] Decomposing Gal with order
[2024-05-29 04:20:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:20:02] [INFO ] Removed a total of 399 redundant transitions.
[2024-05-29 04:20:02] [INFO ] Flatten gal took : 161 ms
[2024-05-29 04:20:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 22 ms.
[2024-05-29 04:20:02] [INFO ] Time to serialize gal into /tmp/LTL117431933979790640.gal : 48 ms
[2024-05-29 04:20:02] [INFO ] Time to serialize properties into /tmp/LTL2270418505846842638.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL117431933979790640.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2270418505846842638.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !(((X(X((!("(((i14.u303.p960==1)&&(i14.u307.p973==1))&&(i14.u315.p1007==1))"))||(F("(i2.u36.p89==1)")))))U((X("(((i14.u303.p960==1)&&(...247
Formula 0 simplified : XX("(((i14.u303.p960==1)&&(i14.u307.p973==1))&&(i14.u315.p1007==1))" & G!"(i2.u36.p89==1)") R (X!"(((i14.u303.p960==1)&&(i14.u307.p9...233
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7475385048716340371
[2024-05-29 04:20:17] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7475385048716340371
Running compilation step : cd /tmp/ltsmin7475385048716340371;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin7475385048716340371;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin7475385048716340371;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ShieldIIPt-PT-040B-LTLFireability-10 finished in 246005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 2368 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 472 transitions
Trivial Post-agglo rules discarded 472 transitions
Performed 472 trivial Post agglomeration. Transition count delta: 472
Iterating post reduction 0 with 472 rules applied. Total rules applied 472 place count 2367 transition count 1695
Reduce places removed 472 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 473 rules applied. Total rules applied 945 place count 1895 transition count 1694
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 946 place count 1894 transition count 1694
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 319 Pre rules applied. Total rules applied 946 place count 1894 transition count 1375
Deduced a syphon composed of 319 places in 2 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 1584 place count 1575 transition count 1375
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1590 place count 1569 transition count 1369
Iterating global reduction 3 with 6 rules applied. Total rules applied 1596 place count 1569 transition count 1369
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1596 place count 1569 transition count 1363
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1608 place count 1563 transition count 1363
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 1 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 3 with 1358 rules applied. Total rules applied 2966 place count 884 transition count 684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2967 place count 884 transition count 683
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2969 place count 883 transition count 682
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3171 place count 782 transition count 747
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 3203 place count 766 transition count 758
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3205 place count 764 transition count 756
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3207 place count 762 transition count 756
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3207 place count 762 transition count 755
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3209 place count 761 transition count 755
Applied a total of 3209 rules in 301 ms. Remains 761 /2368 variables (removed 1607) and now considering 755/2168 (removed 1413) transitions.
// Phase 1: matrix 755 rows 761 cols
[2024-05-29 04:20:21] [INFO ] Computed 359 invariants in 1 ms
[2024-05-29 04:20:21] [INFO ] Implicit Places using invariants in 472 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 492 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 760/2368 places, 755/2168 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 759 transition count 754
Applied a total of 2 rules in 18 ms. Remains 759 /760 variables (removed 1) and now considering 754/755 (removed 1) transitions.
// Phase 1: matrix 754 rows 759 cols
[2024-05-29 04:20:21] [INFO ] Computed 358 invariants in 2 ms
[2024-05-29 04:20:22] [INFO ] Implicit Places using invariants in 463 ms returned []
[2024-05-29 04:20:22] [INFO ] Invariant cache hit.
[2024-05-29 04:20:22] [INFO ] Implicit Places using invariants and state equation in 870 ms returned []
Implicit Place search using SMT with State Equation took 1367 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 759/2368 places, 754/2168 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2179 ms. Remains : 759/2368 places, 754/2168 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s267 1) (EQ s347 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-11 finished in 2244 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2368 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 475 transitions
Trivial Post-agglo rules discarded 475 transitions
Performed 475 trivial Post agglomeration. Transition count delta: 475
Iterating post reduction 0 with 475 rules applied. Total rules applied 475 place count 2367 transition count 1692
Reduce places removed 475 places and 0 transitions.
Iterating post reduction 1 with 475 rules applied. Total rules applied 950 place count 1892 transition count 1692
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 950 place count 1892 transition count 1373
Deduced a syphon composed of 319 places in 1 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 2 with 638 rules applied. Total rules applied 1588 place count 1573 transition count 1373
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1593 place count 1568 transition count 1368
Iterating global reduction 2 with 5 rules applied. Total rules applied 1598 place count 1568 transition count 1368
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1598 place count 1568 transition count 1363
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1608 place count 1563 transition count 1363
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 0 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 2 with 1360 rules applied. Total rules applied 2968 place count 883 transition count 683
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2969 place count 883 transition count 682
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2971 place count 882 transition count 681
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3173 place count 781 transition count 747
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3209 place count 763 transition count 760
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3211 place count 761 transition count 758
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3213 place count 759 transition count 758
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3213 place count 759 transition count 757
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3215 place count 758 transition count 757
Applied a total of 3215 rules in 323 ms. Remains 758 /2368 variables (removed 1610) and now considering 757/2168 (removed 1411) transitions.
// Phase 1: matrix 757 rows 758 cols
[2024-05-29 04:20:23] [INFO ] Computed 359 invariants in 1 ms
[2024-05-29 04:20:23] [INFO ] Implicit Places using invariants in 471 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 490 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 757/2368 places, 757/2168 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 756 transition count 756
Applied a total of 2 rules in 24 ms. Remains 756 /757 variables (removed 1) and now considering 756/757 (removed 1) transitions.
// Phase 1: matrix 756 rows 756 cols
[2024-05-29 04:20:23] [INFO ] Computed 358 invariants in 1 ms
[2024-05-29 04:20:24] [INFO ] Implicit Places using invariants in 499 ms returned []
[2024-05-29 04:20:24] [INFO ] Invariant cache hit.
[2024-05-29 04:20:25] [INFO ] Implicit Places using invariants and state equation in 849 ms returned []
Implicit Place search using SMT with State Equation took 1376 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 756/2368 places, 756/2168 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2222 ms. Remains : 756/2368 places, 756/2168 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s587 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-12 finished in 2293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(p1))))'
Support contains 2 out of 2368 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 475 transitions
Trivial Post-agglo rules discarded 475 transitions
Performed 475 trivial Post agglomeration. Transition count delta: 475
Iterating post reduction 0 with 475 rules applied. Total rules applied 475 place count 2367 transition count 1692
Reduce places removed 475 places and 0 transitions.
Iterating post reduction 1 with 475 rules applied. Total rules applied 950 place count 1892 transition count 1692
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 950 place count 1892 transition count 1373
Deduced a syphon composed of 319 places in 1 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 2 with 638 rules applied. Total rules applied 1588 place count 1573 transition count 1373
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1594 place count 1567 transition count 1367
Iterating global reduction 2 with 6 rules applied. Total rules applied 1600 place count 1567 transition count 1367
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1600 place count 1567 transition count 1361
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1612 place count 1561 transition count 1361
Performed 676 Post agglomeration using F-continuation condition.Transition count delta: 676
Deduced a syphon composed of 676 places in 1 ms
Reduce places removed 676 places and 0 transitions.
Iterating global reduction 2 with 1352 rules applied. Total rules applied 2964 place count 885 transition count 685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2965 place count 885 transition count 684
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2967 place count 884 transition count 683
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3169 place count 783 transition count 749
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3205 place count 765 transition count 762
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3207 place count 763 transition count 760
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3209 place count 761 transition count 760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3209 place count 761 transition count 759
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3211 place count 760 transition count 759
Applied a total of 3211 rules in 314 ms. Remains 760 /2368 variables (removed 1608) and now considering 759/2168 (removed 1409) transitions.
// Phase 1: matrix 759 rows 760 cols
[2024-05-29 04:20:25] [INFO ] Computed 359 invariants in 3 ms
[2024-05-29 04:20:26] [INFO ] Implicit Places using invariants in 478 ms returned [749]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 493 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 759/2368 places, 759/2168 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 758
Applied a total of 2 rules in 17 ms. Remains 758 /759 variables (removed 1) and now considering 758/759 (removed 1) transitions.
// Phase 1: matrix 758 rows 758 cols
[2024-05-29 04:20:26] [INFO ] Computed 358 invariants in 1 ms
[2024-05-29 04:20:26] [INFO ] Implicit Places using invariants in 561 ms returned []
[2024-05-29 04:20:26] [INFO ] Invariant cache hit.
[2024-05-29 04:20:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 04:20:27] [INFO ] Implicit Places using invariants and state equation in 886 ms returned []
Implicit Place search using SMT with State Equation took 1464 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 758/2368 places, 758/2168 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2290 ms. Remains : 758/2368 places, 758/2168 transitions.
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s688 0) (EQ s523 1)), p1:(EQ s523 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-13 finished in 2369 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((F(p1)||G(p2)))))'
Support contains 3 out of 2368 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2363 transition count 2163
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2363 transition count 2163
Applied a total of 10 rules in 238 ms. Remains 2363 /2368 variables (removed 5) and now considering 2163/2168 (removed 5) transitions.
// Phase 1: matrix 2163 rows 2363 cols
[2024-05-29 04:20:27] [INFO ] Computed 361 invariants in 7 ms
[2024-05-29 04:20:28] [INFO ] Implicit Places using invariants in 799 ms returned []
[2024-05-29 04:20:28] [INFO ] Invariant cache hit.
[2024-05-29 04:20:31] [INFO ] Implicit Places using invariants and state equation in 2242 ms returned []
Implicit Place search using SMT with State Equation took 3057 ms to find 0 implicit places.
[2024-05-29 04:20:31] [INFO ] Invariant cache hit.
[2024-05-29 04:20:32] [INFO ] Dead Transitions using invariants and state equation in 1391 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2363/2368 places, 2163/2168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4689 ms. Remains : 2363/2368 places, 2163/2168 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s1760 1), p1:(EQ s2073 1), p2:(EQ s1724 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 61 reset in 611 ms.
Stack based approach found an accepted trace after 12706 steps with 9 reset with depth 1071 and stack size 1071 in 78 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-14 finished in 5506 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((((!p1&&F(p2)&&X(!p1)) U (G((!p1&&F(p2)&&X(!p1)))||(F(p2)&&X(!p1)&&p3)))||p0))))'
Found a Shortening insensitive property : ShieldIIPt-PT-040B-LTLFireability-06
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Support contains 7 out of 2368 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 475 transitions
Trivial Post-agglo rules discarded 475 transitions
Performed 475 trivial Post agglomeration. Transition count delta: 475
Iterating post reduction 0 with 475 rules applied. Total rules applied 475 place count 2367 transition count 1692
Reduce places removed 475 places and 0 transitions.
Iterating post reduction 1 with 475 rules applied. Total rules applied 950 place count 1892 transition count 1692
Performed 316 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 316 Pre rules applied. Total rules applied 950 place count 1892 transition count 1376
Deduced a syphon composed of 316 places in 2 ms
Reduce places removed 316 places and 0 transitions.
Iterating global reduction 2 with 632 rules applied. Total rules applied 1582 place count 1576 transition count 1376
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1586 place count 1572 transition count 1372
Iterating global reduction 2 with 4 rules applied. Total rules applied 1590 place count 1572 transition count 1372
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1590 place count 1572 transition count 1368
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1598 place count 1568 transition count 1368
Performed 681 Post agglomeration using F-continuation condition.Transition count delta: 681
Deduced a syphon composed of 681 places in 0 ms
Reduce places removed 681 places and 0 transitions.
Iterating global reduction 2 with 1362 rules applied. Total rules applied 2960 place count 887 transition count 687
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2961 place count 887 transition count 686
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2963 place count 886 transition count 685
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3165 place count 785 transition count 750
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3201 place count 767 transition count 763
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3203 place count 765 transition count 761
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3205 place count 763 transition count 761
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3205 place count 763 transition count 760
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3207 place count 762 transition count 760
Applied a total of 3207 rules in 371 ms. Remains 762 /2368 variables (removed 1606) and now considering 760/2168 (removed 1408) transitions.
// Phase 1: matrix 760 rows 762 cols
[2024-05-29 04:20:33] [INFO ] Computed 359 invariants in 2 ms
[2024-05-29 04:20:34] [INFO ] Implicit Places using invariants in 504 ms returned [751]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 522 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 761/2368 places, 760/2168 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 760 transition count 759
Applied a total of 2 rules in 21 ms. Remains 760 /761 variables (removed 1) and now considering 759/760 (removed 1) transitions.
// Phase 1: matrix 759 rows 760 cols
[2024-05-29 04:20:34] [INFO ] Computed 358 invariants in 1 ms
[2024-05-29 04:20:34] [INFO ] Implicit Places using invariants in 469 ms returned []
[2024-05-29 04:20:34] [INFO ] Invariant cache hit.
[2024-05-29 04:20:35] [INFO ] Implicit Places using invariants and state equation in 833 ms returned []
Implicit Place search using SMT with State Equation took 1330 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 760/2368 places, 759/2168 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2245 ms. Remains : 760/2368 places, 759/2168 transitions.
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(OR (AND p3 (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p1))), acceptance={} source=0 dest: 2}, { cond=(OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(OR (AND p3 (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p1))), acceptance={} source=1 dest: 2}, { cond=(OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND p3 (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND p3 (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(AND (NEQ s75 1) (NOT (AND (EQ s145 1) (EQ s150 1) (EQ s157 1)))), p0:(OR (EQ s311 0) (EQ s325 0)), p1:(AND (EQ s145 1) (EQ s150 1) (EQ s157 1)), p2:(N...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 671 ms.
Product exploration explored 100000 steps with 0 reset in 858 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 p0 (NOT p1) p2), (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (NOT (OR (AND p3 (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p1))))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p3 (NOT p0) (NOT p2) p1))), (X (NOT (AND p3 (NOT p0) p1))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT (OR (AND p3 (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p1)))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p3 (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p3 (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 130 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter sensitive) to 4 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 154482 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 154482 steps, saw 95382 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 7 properties.
[2024-05-29 04:20:41] [INFO ] Invariant cache hit.
[2024-05-29 04:20:41] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:5
[2024-05-29 04:20:41] [INFO ] [Nat]Absence check using 358 positive place invariants in 51 ms returned sat
[2024-05-29 04:20:42] [INFO ] After 402ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2024-05-29 04:20:42] [INFO ] After 635ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 215 ms.
[2024-05-29 04:20:42] [INFO ] After 1094ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 52 ms.
Support contains 7 out of 760 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 760/760 places, 759/759 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 760 transition count 758
Applied a total of 1 rules in 13 ms. Remains 760 /760 variables (removed 0) and now considering 758/759 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 760/760 places, 758/759 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 172651 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 172651 steps, saw 110271 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 758 rows 760 cols
[2024-05-29 04:20:46] [INFO ] Computed 358 invariants in 1 ms
[2024-05-29 04:20:46] [INFO ] After 290ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 04:20:46] [INFO ] [Nat]Absence check using 358 positive place invariants in 54 ms returned sat
[2024-05-29 04:20:47] [INFO ] After 404ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 04:20:47] [INFO ] After 640ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 172 ms.
[2024-05-29 04:20:47] [INFO ] After 1060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 104 ms.
Support contains 7 out of 760 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 760/760 places, 758/758 transitions.
Applied a total of 0 rules in 10 ms. Remains 760 /760 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 760/760 places, 758/758 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 760/760 places, 758/758 transitions.
Applied a total of 0 rules in 10 ms. Remains 760 /760 variables (removed 0) and now considering 758/758 (removed 0) transitions.
[2024-05-29 04:20:47] [INFO ] Invariant cache hit.
[2024-05-29 04:20:48] [INFO ] Implicit Places using invariants in 449 ms returned []
[2024-05-29 04:20:48] [INFO ] Invariant cache hit.
[2024-05-29 04:20:48] [INFO ] Implicit Places using invariants and state equation in 816 ms returned []
Implicit Place search using SMT with State Equation took 1300 ms to find 0 implicit places.
[2024-05-29 04:20:49] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 04:20:49] [INFO ] Invariant cache hit.
[2024-05-29 04:20:49] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1767 ms. Remains : 760/760 places, 758/758 transitions.
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 0 with 78 rules applied. Total rules applied 78 place count 760 transition count 758
Applied a total of 78 rules in 19 ms. Remains 760 /760 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 758 rows 760 cols
[2024-05-29 04:20:49] [INFO ] Computed 358 invariants in 2 ms
[2024-05-29 04:20:49] [INFO ] After 258ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 04:20:49] [INFO ] [Nat]Absence check using 358 positive place invariants in 57 ms returned sat
[2024-05-29 04:20:50] [INFO ] After 389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 04:20:50] [INFO ] After 617ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 151 ms.
[2024-05-29 04:20:50] [INFO ] After 1036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p3 p0 (NOT p1) p2), (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (NOT (AND (NOT p3) (NOT p0) p1))), (X (NOT (OR (AND p3 (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p1))))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p3 (NOT p0) (NOT p2) p1))), (X (NOT (AND p3 (NOT p0) p1))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (X (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p3) (NOT p0) p1)))), (X (X (NOT (OR (AND p3 (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p1)))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p3 (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p3 (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) p3 p1))), (G (NOT (AND (NOT p0) p3 p1 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 116 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Support contains 7 out of 760 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 760/760 places, 759/759 transitions.
Applied a total of 0 rules in 7 ms. Remains 760 /760 variables (removed 0) and now considering 759/759 (removed 0) transitions.
// Phase 1: matrix 759 rows 760 cols
[2024-05-29 04:20:51] [INFO ] Computed 358 invariants in 2 ms
[2024-05-29 04:20:51] [INFO ] Implicit Places using invariants in 454 ms returned []
[2024-05-29 04:20:51] [INFO ] Invariant cache hit.
[2024-05-29 04:20:52] [INFO ] Implicit Places using invariants and state equation in 805 ms returned []
Implicit Place search using SMT with State Equation took 1290 ms to find 0 implicit places.
[2024-05-29 04:20:52] [INFO ] Invariant cache hit.
[2024-05-29 04:20:52] [INFO ] Dead Transitions using invariants and state equation in 430 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1746 ms. Remains : 760/760 places, 759/759 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2 p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 90 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 168474 steps, run timeout after 3021 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 168474 steps, saw 104490 distinct states, run finished after 3021 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-29 04:20:56] [INFO ] Invariant cache hit.
[2024-05-29 04:20:56] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 04:20:57] [INFO ] [Nat]Absence check using 358 positive place invariants in 54 ms returned sat
[2024-05-29 04:20:57] [INFO ] After 412ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 04:20:57] [INFO ] After 651ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 150 ms.
[2024-05-29 04:20:57] [INFO ] After 1069ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 166 ms.
Support contains 7 out of 760 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 760/760 places, 759/759 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 760 transition count 758
Applied a total of 1 rules in 15 ms. Remains 760 /760 variables (removed 0) and now considering 758/759 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 760/760 places, 758/759 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 161975 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 161975 steps, saw 103081 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 758 rows 760 cols
[2024-05-29 04:21:01] [INFO ] Computed 358 invariants in 2 ms
[2024-05-29 04:21:01] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 04:21:02] [INFO ] [Nat]Absence check using 358 positive place invariants in 51 ms returned sat
[2024-05-29 04:21:02] [INFO ] After 383ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 04:21:02] [INFO ] After 618ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 141 ms.
[2024-05-29 04:21:02] [INFO ] After 1011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 57 ms.
Support contains 7 out of 760 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 760/760 places, 758/758 transitions.
Applied a total of 0 rules in 10 ms. Remains 760 /760 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 760/760 places, 758/758 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 760/760 places, 758/758 transitions.
Applied a total of 0 rules in 10 ms. Remains 760 /760 variables (removed 0) and now considering 758/758 (removed 0) transitions.
[2024-05-29 04:21:02] [INFO ] Invariant cache hit.
[2024-05-29 04:21:03] [INFO ] Implicit Places using invariants in 463 ms returned []
[2024-05-29 04:21:03] [INFO ] Invariant cache hit.
[2024-05-29 04:21:04] [INFO ] Implicit Places using invariants and state equation in 809 ms returned []
Implicit Place search using SMT with State Equation took 1293 ms to find 0 implicit places.
[2024-05-29 04:21:04] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 04:21:04] [INFO ] Invariant cache hit.
[2024-05-29 04:21:04] [INFO ] Dead Transitions using invariants and state equation in 453 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1792 ms. Remains : 760/760 places, 758/758 transitions.
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 0 with 78 rules applied. Total rules applied 78 place count 760 transition count 758
Applied a total of 78 rules in 28 ms. Remains 760 /760 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 758 rows 760 cols
[2024-05-29 04:21:04] [INFO ] Computed 358 invariants in 1 ms
[2024-05-29 04:21:04] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 04:21:05] [INFO ] [Nat]Absence check using 358 positive place invariants in 51 ms returned sat
[2024-05-29 04:21:05] [INFO ] After 383ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 04:21:05] [INFO ] After 609ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 143 ms.
[2024-05-29 04:21:05] [INFO ] After 1009ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p0 (NOT p1) p2 p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 95 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 140 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 675 ms.
Product exploration explored 100000 steps with 1 reset in 795 ms.
Applying partial POR strategy [false, false, true, false]
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1)]
Support contains 7 out of 760 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 760/760 places, 759/759 transitions.
Applied a total of 0 rules in 16 ms. Remains 760 /760 variables (removed 0) and now considering 759/759 (removed 0) transitions.
[2024-05-29 04:21:08] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 759 rows 760 cols
[2024-05-29 04:21:08] [INFO ] Computed 358 invariants in 2 ms
[2024-05-29 04:21:08] [INFO ] Dead Transitions using invariants and state equation in 447 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 491 ms. Remains : 760/760 places, 759/759 transitions.
Built C files in :
/tmp/ltsmin14145964670975898743
[2024-05-29 04:21:08] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14145964670975898743
Running compilation step : cd /tmp/ltsmin14145964670975898743;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1321 ms.
Running link step : cd /tmp/ltsmin14145964670975898743;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin14145964670975898743;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2037197029074770184.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 760 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 760/760 places, 759/759 transitions.
Applied a total of 0 rules in 16 ms. Remains 760 /760 variables (removed 0) and now considering 759/759 (removed 0) transitions.
[2024-05-29 04:21:23] [INFO ] Invariant cache hit.
[2024-05-29 04:21:24] [INFO ] Implicit Places using invariants in 462 ms returned []
[2024-05-29 04:21:24] [INFO ] Invariant cache hit.
[2024-05-29 04:21:25] [INFO ] Implicit Places using invariants and state equation in 814 ms returned []
Implicit Place search using SMT with State Equation took 1302 ms to find 0 implicit places.
[2024-05-29 04:21:25] [INFO ] Invariant cache hit.
[2024-05-29 04:21:25] [INFO ] Dead Transitions using invariants and state equation in 429 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1748 ms. Remains : 760/760 places, 759/759 transitions.
Built C files in :
/tmp/ltsmin11463916204378886103
[2024-05-29 04:21:25] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11463916204378886103
Running compilation step : cd /tmp/ltsmin11463916204378886103;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1404 ms.
Running link step : cd /tmp/ltsmin11463916204378886103;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11463916204378886103;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11914118032110523943.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 04:21:40] [INFO ] Flatten gal took : 19 ms
[2024-05-29 04:21:40] [INFO ] Flatten gal took : 18 ms
[2024-05-29 04:21:40] [INFO ] Time to serialize gal into /tmp/LTL12190365902137876396.gal : 6 ms
[2024-05-29 04:21:40] [INFO ] Time to serialize properties into /tmp/LTL1518587505819652243.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12190365902137876396.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16030794588986909950.hoa' '-atoms' '/tmp/LTL1518587505819652243.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL1518587505819652243.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16030794588986909950.hoa
Reverse transition relation is NOT exact ! Due to transitions t44.t187, t44.t188, t43.t192, t43.t193, Intersection with reachable at each step enabled. (d...201
Computing Next relation with stutter on 1.60065e+49 deadlock states
Detected timeout of ITS tools.
[2024-05-29 04:21:55] [INFO ] Flatten gal took : 17 ms
[2024-05-29 04:21:55] [INFO ] Flatten gal took : 17 ms
[2024-05-29 04:21:55] [INFO ] Time to serialize gal into /tmp/LTL4753980665877038216.gal : 4 ms
[2024-05-29 04:21:55] [INFO ] Time to serialize properties into /tmp/LTL14227429336706785134.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4753980665877038216.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14227429336706785134.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((p1157==0)||(p1190==0))")||((((!("(((p546==1)&&(p559==1))&&(p593==1))"))&&(F("(p240!=1)")))&&(X(!("(((p546==1)&&(p559==1))&&...418
Formula 0 simplified : FG(!"((p1157==0)||(p1190==0))" & (("(((p546==1)&&(p559==1))&&(p593==1))" | G!"(p240!=1)" | X"(((p546==1)&&(p559==1))&&(p593==1))") M...271
Reverse transition relation is NOT exact ! Due to transitions t44.t187, t44.t188, t43.t192, t43.t193, Intersection with reachable at each step enabled. (d...201
Computing Next relation with stutter on 1.60065e+49 deadlock states
Detected timeout of ITS tools.
[2024-05-29 04:22:10] [INFO ] Flatten gal took : 25 ms
[2024-05-29 04:22:10] [INFO ] Applying decomposition
[2024-05-29 04:22:10] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8041042010639945897.txt' '-o' '/tmp/graph8041042010639945897.bin' '-w' '/tmp/graph8041042010639945897.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8041042010639945897.bin' '-l' '-1' '-v' '-w' '/tmp/graph8041042010639945897.weights' '-q' '0' '-e' '0.001'
[2024-05-29 04:22:11] [INFO ] Decomposing Gal with order
[2024-05-29 04:22:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:22:11] [INFO ] Removed a total of 853 redundant transitions.
[2024-05-29 04:22:11] [INFO ] Flatten gal took : 32 ms
[2024-05-29 04:22:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 344 labels/synchronizations in 10 ms.
[2024-05-29 04:22:11] [INFO ] Time to serialize gal into /tmp/LTL797601221100807901.gal : 6 ms
[2024-05-29 04:22:11] [INFO ] Time to serialize properties into /tmp/LTL15727910717354102291.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL797601221100807901.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15727910717354102291.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i11.u126.p1157==0)||(i11.u132.p1190==0))")||((((!("(((i5.u58.p546==1)&&(i5.u60.p559==1))&&(i5.u61.p593==1))"))&&(F("(i1.u23...590
Formula 0 simplified : FG(!"((i11.u126.p1157==0)||(i11.u132.p1190==0))" & (("(((i5.u58.p546==1)&&(i5.u60.p559==1))&&(i5.u61.p593==1))" | G!"(i1.u23.p240!=1...394
Reverse transition relation is NOT exact ! Due to transitions i1.u23.t44.t187, i1.u23.t44.t188, i2.u29.t43.t192, i2.u29.t43.t193, Intersection with reacha...229
Computing Next relation with stutter on 1.60065e+49 deadlock states
4 unique states visited
3 strongly connected components in search stack
6 transitions explored
4 items max in DFS search stack
147 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.5901,64616,1,0,100041,188,4806,238349,354,739,135682
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property ShieldIIPt-PT-040B-LTLFireability-06 finished in 99741 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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : ShieldIIPt-PT-040B-LTLFireability-07
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 2368 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 474 transitions
Trivial Post-agglo rules discarded 474 transitions
Performed 474 trivial Post agglomeration. Transition count delta: 474
Iterating post reduction 0 with 474 rules applied. Total rules applied 474 place count 2367 transition count 1693
Reduce places removed 474 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 475 rules applied. Total rules applied 949 place count 1893 transition count 1692
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 950 place count 1892 transition count 1692
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 319 Pre rules applied. Total rules applied 950 place count 1892 transition count 1373
Deduced a syphon composed of 319 places in 2 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 1588 place count 1573 transition count 1373
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1594 place count 1567 transition count 1367
Iterating global reduction 3 with 6 rules applied. Total rules applied 1600 place count 1567 transition count 1367
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1600 place count 1567 transition count 1361
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1612 place count 1561 transition count 1361
Performed 677 Post agglomeration using F-continuation condition.Transition count delta: 677
Deduced a syphon composed of 677 places in 1 ms
Reduce places removed 677 places and 0 transitions.
Iterating global reduction 3 with 1354 rules applied. Total rules applied 2966 place count 884 transition count 684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2967 place count 884 transition count 683
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2969 place count 883 transition count 682
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 16 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3171 place count 782 transition count 748
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 3207 place count 764 transition count 761
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3209 place count 762 transition count 759
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3211 place count 760 transition count 759
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3211 place count 760 transition count 758
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3213 place count 759 transition count 758
Applied a total of 3213 rules in 366 ms. Remains 759 /2368 variables (removed 1609) and now considering 758/2168 (removed 1410) transitions.
// Phase 1: matrix 758 rows 759 cols
[2024-05-29 04:22:13] [INFO ] Computed 359 invariants in 1 ms
[2024-05-29 04:22:14] [INFO ] Implicit Places using invariants in 530 ms returned [748]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 531 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 758/2368 places, 758/2168 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 757 transition count 757
Applied a total of 2 rules in 18 ms. Remains 757 /758 variables (removed 1) and now considering 757/758 (removed 1) transitions.
// Phase 1: matrix 757 rows 757 cols
[2024-05-29 04:22:14] [INFO ] Computed 358 invariants in 2 ms
[2024-05-29 04:22:14] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-05-29 04:22:14] [INFO ] Invariant cache hit.
[2024-05-29 04:22:14] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 04:22:15] [INFO ] Implicit Places using invariants and state equation in 880 ms returned []
Implicit Place search using SMT with State Equation took 1389 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 757/2368 places, 757/2168 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2304 ms. Remains : 757/2368 places, 757/2168 transitions.
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s56 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
Treatment of property ShieldIIPt-PT-040B-LTLFireability-07 finished in 2509 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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : ShieldIIPt-PT-040B-LTLFireability-09
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 2368 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 473 transitions
Trivial Post-agglo rules discarded 473 transitions
Performed 473 trivial Post agglomeration. Transition count delta: 473
Iterating post reduction 0 with 473 rules applied. Total rules applied 473 place count 2367 transition count 1694
Reduce places removed 473 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 474 rules applied. Total rules applied 947 place count 1894 transition count 1693
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 948 place count 1893 transition count 1693
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 319 Pre rules applied. Total rules applied 948 place count 1893 transition count 1374
Deduced a syphon composed of 319 places in 2 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 1586 place count 1574 transition count 1374
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1592 place count 1568 transition count 1368
Iterating global reduction 3 with 6 rules applied. Total rules applied 1598 place count 1568 transition count 1368
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1598 place count 1568 transition count 1362
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1610 place count 1562 transition count 1362
Performed 675 Post agglomeration using F-continuation condition.Transition count delta: 675
Deduced a syphon composed of 675 places in 1 ms
Reduce places removed 675 places and 0 transitions.
Iterating global reduction 3 with 1350 rules applied. Total rules applied 2960 place count 887 transition count 687
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2961 place count 887 transition count 686
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2963 place count 886 transition count 685
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3165 place count 785 transition count 751
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 3201 place count 767 transition count 764
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3203 place count 765 transition count 762
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3205 place count 763 transition count 762
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3205 place count 763 transition count 761
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3207 place count 762 transition count 761
Applied a total of 3207 rules in 280 ms. Remains 762 /2368 variables (removed 1606) and now considering 761/2168 (removed 1407) transitions.
// Phase 1: matrix 761 rows 762 cols
[2024-05-29 04:22:15] [INFO ] Computed 359 invariants in 3 ms
[2024-05-29 04:22:16] [INFO ] Implicit Places using invariants in 462 ms returned [751]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 482 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 761/2368 places, 761/2168 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 760 transition count 760
Applied a total of 2 rules in 17 ms. Remains 760 /761 variables (removed 1) and now considering 760/761 (removed 1) transitions.
// Phase 1: matrix 760 rows 760 cols
[2024-05-29 04:22:16] [INFO ] Computed 358 invariants in 4 ms
[2024-05-29 04:22:16] [INFO ] Implicit Places using invariants in 457 ms returned []
[2024-05-29 04:22:16] [INFO ] Invariant cache hit.
[2024-05-29 04:22:17] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 04:22:17] [INFO ] Implicit Places using invariants and state equation in 868 ms returned []
Implicit Place search using SMT with State Equation took 1371 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 760/2368 places, 760/2168 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2154 ms. Remains : 760/2368 places, 760/2168 transitions.
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s31 0) (EQ s58 0) (EQ s511 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 586 ms.
Product exploration explored 100000 steps with 0 reset in 804 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 67 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 278128 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 278128 steps, saw 170480 distinct states, run finished after 3003 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 04:22:22] [INFO ] Invariant cache hit.
[2024-05-29 04:22:22] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:22:22] [INFO ] [Nat]Absence check using 358 positive place invariants in 47 ms returned sat
[2024-05-29 04:22:22] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:22:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 04:22:22] [INFO ] After 27ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 04:22:23] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2024-05-29 04:22:23] [INFO ] After 545ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 760 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 760/760 places, 760/760 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 760 transition count 759
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 760 transition count 759
Applied a total of 3 rules in 40 ms. Remains 760 /760 variables (removed 0) and now considering 759/760 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 760/760 places, 759/760 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 267289 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 267289 steps, saw 170087 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 759 rows 760 cols
[2024-05-29 04:22:26] [INFO ] Computed 358 invariants in 13 ms
[2024-05-29 04:22:26] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:22:26] [INFO ] [Nat]Absence check using 358 positive place invariants in 51 ms returned sat
[2024-05-29 04:22:26] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:22:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 04:22:26] [INFO ] After 26ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 04:22:26] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-29 04:22:27] [INFO ] After 566ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 760 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 760/760 places, 759/759 transitions.
Applied a total of 0 rules in 9 ms. Remains 760 /760 variables (removed 0) and now considering 759/759 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 760/760 places, 759/759 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 760/760 places, 759/759 transitions.
Applied a total of 0 rules in 10 ms. Remains 760 /760 variables (removed 0) and now considering 759/759 (removed 0) transitions.
[2024-05-29 04:22:27] [INFO ] Invariant cache hit.
[2024-05-29 04:22:27] [INFO ] Implicit Places using invariants in 457 ms returned []
[2024-05-29 04:22:27] [INFO ] Invariant cache hit.
[2024-05-29 04:22:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 04:22:28] [INFO ] Implicit Places using invariants and state equation in 819 ms returned []
Implicit Place search using SMT with State Equation took 1303 ms to find 0 implicit places.
[2024-05-29 04:22:28] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 04:22:28] [INFO ] Invariant cache hit.
[2024-05-29 04:22:28] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1767 ms. Remains : 760/760 places, 759/759 transitions.
Partial Free-agglomeration rule applied 86 times.
Drop transitions removed 86 transitions
Iterating global reduction 0 with 86 rules applied. Total rules applied 86 place count 760 transition count 759
Applied a total of 86 rules in 29 ms. Remains 760 /760 variables (removed 0) and now considering 759/759 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 759 rows 760 cols
[2024-05-29 04:22:28] [INFO ] Computed 358 invariants in 1 ms
[2024-05-29 04:22:28] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:22:29] [INFO ] [Nat]Absence check using 358 positive place invariants in 50 ms returned sat
[2024-05-29 04:22:29] [INFO ] After 276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:22:29] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 04:22:29] [INFO ] After 44ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 04:22:29] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-29 04:22:29] [INFO ] After 582ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 77 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 38 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
Support contains 3 out of 760 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 760/760 places, 760/760 transitions.
Applied a total of 0 rules in 12 ms. Remains 760 /760 variables (removed 0) and now considering 760/760 (removed 0) transitions.
// Phase 1: matrix 760 rows 760 cols
[2024-05-29 04:22:29] [INFO ] Computed 358 invariants in 2 ms
[2024-05-29 04:22:30] [INFO ] Implicit Places using invariants in 452 ms returned []
[2024-05-29 04:22:30] [INFO ] Invariant cache hit.
[2024-05-29 04:22:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 04:22:31] [INFO ] Implicit Places using invariants and state equation in 865 ms returned []
Implicit Place search using SMT with State Equation took 1341 ms to find 0 implicit places.
[2024-05-29 04:22:31] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 04:22:31] [INFO ] Invariant cache hit.
[2024-05-29 04:22:31] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1836 ms. Remains : 760/760 places, 760/760 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 77 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 41 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 276371 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 276371 steps, saw 169379 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 04:22:34] [INFO ] Invariant cache hit.
[2024-05-29 04:22:34] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:22:35] [INFO ] [Nat]Absence check using 358 positive place invariants in 49 ms returned sat
[2024-05-29 04:22:35] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:22:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 04:22:35] [INFO ] After 31ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 04:22:35] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-29 04:22:35] [INFO ] After 552ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 3 out of 760 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 760/760 places, 760/760 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 760 transition count 759
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 760 transition count 759
Applied a total of 3 rules in 20 ms. Remains 760 /760 variables (removed 0) and now considering 759/760 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 760/760 places, 759/760 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 268031 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 268031 steps, saw 170576 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 759 rows 760 cols
[2024-05-29 04:22:38] [INFO ] Computed 358 invariants in 3 ms
[2024-05-29 04:22:38] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:22:38] [INFO ] [Nat]Absence check using 358 positive place invariants in 49 ms returned sat
[2024-05-29 04:22:39] [INFO ] After 268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:22:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 04:22:39] [INFO ] After 29ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 04:22:39] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2024-05-29 04:22:39] [INFO ] After 541ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 760 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 760/760 places, 759/759 transitions.
Applied a total of 0 rules in 13 ms. Remains 760 /760 variables (removed 0) and now considering 759/759 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 760/760 places, 759/759 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 760/760 places, 759/759 transitions.
Applied a total of 0 rules in 12 ms. Remains 760 /760 variables (removed 0) and now considering 759/759 (removed 0) transitions.
[2024-05-29 04:22:39] [INFO ] Invariant cache hit.
[2024-05-29 04:22:39] [INFO ] Implicit Places using invariants in 462 ms returned []
[2024-05-29 04:22:39] [INFO ] Invariant cache hit.
[2024-05-29 04:22:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 04:22:40] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1361 ms to find 0 implicit places.
[2024-05-29 04:22:40] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 04:22:40] [INFO ] Invariant cache hit.
[2024-05-29 04:22:41] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1838 ms. Remains : 760/760 places, 759/759 transitions.
Partial Free-agglomeration rule applied 86 times.
Drop transitions removed 86 transitions
Iterating global reduction 0 with 86 rules applied. Total rules applied 86 place count 760 transition count 759
Applied a total of 86 rules in 93 ms. Remains 760 /760 variables (removed 0) and now considering 759/759 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 759 rows 760 cols
[2024-05-29 04:22:41] [INFO ] Computed 358 invariants in 2 ms
[2024-05-29 04:22:41] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 04:22:41] [INFO ] [Nat]Absence check using 358 positive place invariants in 51 ms returned sat
[2024-05-29 04:22:41] [INFO ] After 277ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 04:22:41] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 04:22:41] [INFO ] After 32ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 04:22:41] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-29 04:22:42] [INFO ] After 584ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 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 42 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 592 ms.
Product exploration explored 100000 steps with 0 reset in 788 ms.
Built C files in :
/tmp/ltsmin15915924099473546094
[2024-05-29 04:22:43] [INFO ] Computing symmetric may disable matrix : 760 transitions.
[2024-05-29 04:22:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:22:43] [INFO ] Computing symmetric may enable matrix : 760 transitions.
[2024-05-29 04:22:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:22:43] [INFO ] Computing Do-Not-Accords matrix : 760 transitions.
[2024-05-29 04:22:43] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:22:43] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15915924099473546094
Running compilation step : cd /tmp/ltsmin15915924099473546094;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2010 ms.
Running link step : cd /tmp/ltsmin15915924099473546094;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin15915924099473546094;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13005725513455761126.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 760 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 760/760 places, 760/760 transitions.
Applied a total of 0 rules in 11 ms. Remains 760 /760 variables (removed 0) and now considering 760/760 (removed 0) transitions.
// Phase 1: matrix 760 rows 760 cols
[2024-05-29 04:22:58] [INFO ] Computed 358 invariants in 1 ms
[2024-05-29 04:22:59] [INFO ] Implicit Places using invariants in 399 ms returned []
[2024-05-29 04:22:59] [INFO ] Invariant cache hit.
[2024-05-29 04:22:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 04:22:59] [INFO ] Implicit Places using invariants and state equation in 900 ms returned []
Implicit Place search using SMT with State Equation took 1302 ms to find 0 implicit places.
[2024-05-29 04:22:59] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-29 04:22:59] [INFO ] Invariant cache hit.
[2024-05-29 04:23:00] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1769 ms. Remains : 760/760 places, 760/760 transitions.
Built C files in :
/tmp/ltsmin15605892066120937442
[2024-05-29 04:23:00] [INFO ] Computing symmetric may disable matrix : 760 transitions.
[2024-05-29 04:23:00] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:23:00] [INFO ] Computing symmetric may enable matrix : 760 transitions.
[2024-05-29 04:23:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:23:00] [INFO ] Computing Do-Not-Accords matrix : 760 transitions.
[2024-05-29 04:23:00] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 04:23:00] [INFO ] Built C files in 102ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15605892066120937442
Running compilation step : cd /tmp/ltsmin15605892066120937442;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1963 ms.
Running link step : cd /tmp/ltsmin15605892066120937442;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin15605892066120937442;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17498404534000514914.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 04:23:15] [INFO ] Flatten gal took : 18 ms
[2024-05-29 04:23:15] [INFO ] Flatten gal took : 18 ms
[2024-05-29 04:23:15] [INFO ] Time to serialize gal into /tmp/LTL6833897976966875090.gal : 4 ms
[2024-05-29 04:23:15] [INFO ] Time to serialize properties into /tmp/LTL3723144300381871575.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6833897976966875090.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15770997288580294402.hoa' '-atoms' '/tmp/LTL3723144300381871575.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3723144300381871575.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15770997288580294402.hoa
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...1395
Computing Next relation with stutter on 1.60065e+49 deadlock states
Detected timeout of ITS tools.
[2024-05-29 04:23:30] [INFO ] Flatten gal took : 17 ms
[2024-05-29 04:23:30] [INFO ] Flatten gal took : 17 ms
[2024-05-29 04:23:30] [INFO ] Time to serialize gal into /tmp/LTL3938218667849405743.gal : 4 ms
[2024-05-29 04:23:30] [INFO ] Time to serialize properties into /tmp/LTL15296657236686641428.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3938218667849405743.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15296657236686641428.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G("(((p133==0)||(p231==0))||(p1861==0))"))))
Formula 0 simplified : XF!"(((p133==0)||(p231==0))||(p1861==0))"
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...1395
Computing Next relation with stutter on 1.60065e+49 deadlock states
Detected timeout of ITS tools.
[2024-05-29 04:23:45] [INFO ] Flatten gal took : 18 ms
[2024-05-29 04:23:45] [INFO ] Applying decomposition
[2024-05-29 04:23:45] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15890449508698752288.txt' '-o' '/tmp/graph15890449508698752288.bin' '-w' '/tmp/graph15890449508698752288.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15890449508698752288.bin' '-l' '-1' '-v' '-w' '/tmp/graph15890449508698752288.weights' '-q' '0' '-e' '0.001'
[2024-05-29 04:23:45] [INFO ] Decomposing Gal with order
[2024-05-29 04:23:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:23:45] [INFO ] Removed a total of 868 redundant transitions.
[2024-05-29 04:23:45] [INFO ] Flatten gal took : 40 ms
[2024-05-29 04:23:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 342 labels/synchronizations in 6 ms.
[2024-05-29 04:23:45] [INFO ] Time to serialize gal into /tmp/LTL3641654093102947889.gal : 6 ms
[2024-05-29 04:23:45] [INFO ] Time to serialize properties into /tmp/LTL12530707630617201263.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3641654093102947889.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12530707630617201263.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G("(((i1.u13.p133==0)||(i2.u23.p231==0))||(i17.u214.p1861==0))"))))
Formula 0 simplified : XF!"(((i1.u13.p133==0)||(i2.u23.p231==0))||(i17.u214.p1861==0))"
Reverse transition relation is NOT exact ! Due to transitions i0.t484_t166_t169, i0.t483_t163_t169, i0.t0, i0.u1.t486, i1.t489_t171_t176, i1.t487, i1.t1, i...2122
Computing Next relation with stutter on 1.60065e+49 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16786708140762663269
[2024-05-29 04:24:00] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16786708140762663269
Running compilation step : cd /tmp/ltsmin16786708140762663269;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1311 ms.
Running link step : cd /tmp/ltsmin16786708140762663269;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16786708140762663269;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPt-PT-040B-LTLFireability-09 finished in 120476 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((!p0||F(p1)))) U (X(p0)||(p2 U p3))))'
[2024-05-29 04:24:16] [INFO ] Flatten gal took : 43 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6189028957753524066
[2024-05-29 04:24:16] [INFO ] Too many transitions (2168) to apply POR reductions. Disabling POR matrices.
[2024-05-29 04:24:16] [INFO ] Applying decomposition
[2024-05-29 04:24:16] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6189028957753524066
Running compilation step : cd /tmp/ltsmin6189028957753524066;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 04:24:16] [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.202304061127/bin/convert-linux64' '-i' '/tmp/graph15131373681980806348.txt' '-o' '/tmp/graph15131373681980806348.bin' '-w' '/tmp/graph15131373681980806348.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15131373681980806348.bin' '-l' '-1' '-v' '-w' '/tmp/graph15131373681980806348.weights' '-q' '0' '-e' '0.001'
[2024-05-29 04:24:16] [INFO ] Decomposing Gal with order
[2024-05-29 04:24:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:24:16] [INFO ] Removed a total of 390 redundant transitions.
[2024-05-29 04:24:16] [INFO ] Flatten gal took : 80 ms
[2024-05-29 04:24:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 22 ms.
[2024-05-29 04:24:16] [INFO ] Time to serialize gal into /tmp/LTLFireability4930609330374855767.gal : 18 ms
[2024-05-29 04:24:16] [INFO ] Time to serialize properties into /tmp/LTLFireability8659015543774787478.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4930609330374855767.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8659015543774787478.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 4 LTL properties
Checking formula 0 : !((G(F(("((i18.u367.p1157==0)||(i18.u377.p1190==0))")||((((!("(((i9.u178.p546==1)&&(i9.u180.p559==1))&&(i9.u190.p593==1))"))&&(F("(i4....609
Formula 0 simplified : FG(!"((i18.u367.p1157==0)||(i18.u377.p1190==0))" & (("(((i9.u178.p546==1)&&(i9.u180.p559==1))&&(i9.u190.p593==1))" | G!"(i4.u82.p240...407
Compilation finished in 4331 ms.
Running link step : cd /tmp/ltsmin6189028957753524066;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin6189028957753524066;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((((!(LTLAPp1==true)&&<>((LTLAPp2==true))&&X(!(LTLAPp1==true))) U ([]((!(LTLAPp1==true)&&<>((LTLAPp2==true))&&X(!(LTLAPp1==true))))||(<>((LTLAPp2==true))&&X(!(LTLAPp1==true))&&(LTLAPp3==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.025: LTL layer: formula: [](<>((((!(LTLAPp1==true)&&<>((LTLAPp2==true))&&X(!(LTLAPp1==true))) U ([]((!(LTLAPp1==true)&&<>((LTLAPp2==true))&&X(!(LTLAPp1==true))))||(<>((LTLAPp2==true))&&X(!(LTLAPp1==true))&&(LTLAPp3==true))))||(LTLAPp0==true))))
pins2lts-mc-linux64( 2/ 8), 0.026: "[](<>((((!(LTLAPp1==true)&&<>((LTLAPp2==true))&&X(!(LTLAPp1==true))) U ([]((!(LTLAPp1==true)&&<>((LTLAPp2==true))&&X(!(LTLAPp1==true))))||(<>((LTLAPp2==true))&&X(!(LTLAPp1==true))&&(LTLAPp3==true))))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.027: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.059: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.063: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.073: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.073: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.073: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 3.091: There are 2179 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 3.091: State length is 2369, there are 2187 groups
pins2lts-mc-linux64( 0/ 8), 3.091: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 3.091: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 3.091: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 3.091: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 3.962: [Blue] ~120 levels ~960 states ~11552 transitions
pins2lts-mc-linux64( 1/ 8), 5.010: [Blue] ~240 levels ~1920 states ~26048 transitions
pins2lts-mc-linux64( 4/ 8), 6.441: [Blue] ~480 levels ~3840 states ~73968 transitions
pins2lts-mc-linux64( 7/ 8), 10.294: [Blue] ~960 levels ~7680 states ~161472 transitions
pins2lts-mc-linux64( 2/ 8), 14.688: [Blue] ~1900 levels ~15360 states ~224128 transitions
pins2lts-mc-linux64( 2/ 8), 22.855: [Blue] ~3778 levels ~30720 states ~288600 transitions
pins2lts-mc-linux64( 2/ 8), 34.268: [Blue] ~7488 levels ~61440 states ~426096 transitions
pins2lts-mc-linux64( 2/ 8), 46.189: [Blue] ~15047 levels ~122880 states ~737968 transitions
pins2lts-mc-linux64( 2/ 8), 66.216: [Blue] ~30077 levels ~245760 states ~1364752 transitions
pins2lts-mc-linux64( 2/ 8), 106.995: [Blue] ~60155 levels ~491520 states ~2659632 transitions
pins2lts-mc-linux64( 2/ 8), 192.202: [Blue] ~120530 levels ~983040 states ~5360976 transitions
pins2lts-mc-linux64( 2/ 8), 351.486: [Blue] ~241209 levels ~1966080 states ~10880584 transitions
pins2lts-mc-linux64( 1/ 8), 642.732: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 642.939:
pins2lts-mc-linux64( 0/ 8), 642.939: Explored 3380751 states 21436687 transitions, fanout: 6.341
pins2lts-mc-linux64( 0/ 8), 642.939: Total exploration time 639.800 sec (639.640 sec minimum, 639.710 sec on average)
pins2lts-mc-linux64( 0/ 8), 642.939: States per second: 5284, Transitions per second: 33505
pins2lts-mc-linux64( 0/ 8), 642.939:
pins2lts-mc-linux64( 0/ 8), 642.939: State space has 13449332 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 642.939: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 642.939: blue states: 3380751 (25.14%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 642.939: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 642.939: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 642.939:
pins2lts-mc-linux64( 0/ 8), 642.939: Total memory used for local state coloring: 51.0MB
pins2lts-mc-linux64( 0/ 8), 642.939:
pins2lts-mc-linux64( 0/ 8), 642.939: Queue width: 8B, total height: 3340320, memory: 25.48MB
pins2lts-mc-linux64( 0/ 8), 642.939: Tree memory: 358.6MB, 28.0 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 642.939: Tree fill ratio (roots/leafs): 10.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 642.939: Stored 2260 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 642.940: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 642.940: Est. total memory use: 384.1MB (~1049.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6189028957753524066;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((((!(LTLAPp1==true)&&<>((LTLAPp2==true))&&X(!(LTLAPp1==true))) U ([]((!(LTLAPp1==true)&&<>((LTLAPp2==true))&&X(!(LTLAPp1==true))))||(<>((LTLAPp2==true))&&X(!(LTLAPp1==true))&&(LTLAPp3==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6189028957753524066;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((((!(LTLAPp1==true)&&<>((LTLAPp2==true))&&X(!(LTLAPp1==true))) U ([]((!(LTLAPp1==true)&&<>((LTLAPp2==true))&&X(!(LTLAPp1==true))))||(<>((LTLAPp2==true))&&X(!(LTLAPp1==true))&&(LTLAPp3==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-29 04:50:06] [INFO ] Applying decomposition
[2024-05-29 04:50:07] [INFO ] Flatten gal took : 958 ms
[2024-05-29 04:50:08] [INFO ] Decomposing Gal with order
[2024-05-29 04:50:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 04:50:09] [INFO ] Removed a total of 115 redundant transitions.
[2024-05-29 04:50:09] [INFO ] Flatten gal took : 696 ms
[2024-05-29 04:50:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 64 ms.
[2024-05-29 04:50:12] [INFO ] Time to serialize gal into /tmp/LTLFireability17832932301433882889.gal : 90 ms
[2024-05-29 04:50:12] [INFO ] Time to serialize properties into /tmp/LTLFireability13431362341639560727.ltl : 8 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17832932301433882889.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13431362341639560727.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 4 LTL properties
Checking formula 0 : !((G(F(("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.u320.p1157==0)||(i0.i0.i0.i0.i0.i...3085
Formula 0 simplified : FG(!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.u320.p1157==0)||(i0.i0.i0.i0.i0.i0....2148
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 160232 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16256188 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-040B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is ShieldIIPt-PT-040B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r373-tall-171683788700198"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-040B.tgz
mv ShieldIIPt-PT-040B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;