About the Execution of ITS-Tools for ShieldIIPt-PT-040B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11514.991 | 3600000.00 | 10160736.00 | 20885.80 | FFFFFFFFFF?TFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r216-tall-162098205100477.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r216-tall-162098205100477
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 9.1K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 110K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 12:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 12:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 18:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 18:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 686K May 5 16:52 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-00
FORMULA_NAME ShieldIIPt-PT-040B-01
FORMULA_NAME ShieldIIPt-PT-040B-02
FORMULA_NAME ShieldIIPt-PT-040B-03
FORMULA_NAME ShieldIIPt-PT-040B-04
FORMULA_NAME ShieldIIPt-PT-040B-05
FORMULA_NAME ShieldIIPt-PT-040B-06
FORMULA_NAME ShieldIIPt-PT-040B-07
FORMULA_NAME ShieldIIPt-PT-040B-08
FORMULA_NAME ShieldIIPt-PT-040B-09
FORMULA_NAME ShieldIIPt-PT-040B-10
FORMULA_NAME ShieldIIPt-PT-040B-11
FORMULA_NAME ShieldIIPt-PT-040B-12
FORMULA_NAME ShieldIIPt-PT-040B-13
FORMULA_NAME ShieldIIPt-PT-040B-14
FORMULA_NAME ShieldIIPt-PT-040B-15
=== Now, execution of the tool begins
BK_START 1621110217121
Running Version 0
[2021-05-15 20:23:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-15 20:23:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 20:23:38] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2021-05-15 20:23:39] [INFO ] Transformed 2803 places.
[2021-05-15 20:23:39] [INFO ] Transformed 2603 transitions.
[2021-05-15 20:23:39] [INFO ] Found NUPN structural information;
[2021-05-15 20:23:39] [INFO ] Parsed PT model containing 2803 places and 2603 transitions in 272 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-15 20:23:39] [INFO ] Initial state test concluded for 1 properties.
Support contains 37 out of 2803 places. Attempting structural reductions.
Starting structural reductions, 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 1071 ms. Remains 2368 /2803 variables (removed 435) and now considering 2168/2603 (removed 435) transitions.
// Phase 1: matrix 2168 rows 2368 cols
[2021-05-15 20:23:40] [INFO ] Computed 361 place invariants in 39 ms
[2021-05-15 20:23:41] [INFO ] Implicit Places using invariants in 839 ms returned []
// Phase 1: matrix 2168 rows 2368 cols
[2021-05-15 20:23:41] [INFO ] Computed 361 place invariants in 9 ms
[2021-05-15 20:23:43] [INFO ] Implicit Places using invariants and state equation in 2075 ms returned []
Implicit Place search using SMT with State Equation took 2939 ms to find 0 implicit places.
// Phase 1: matrix 2168 rows 2368 cols
[2021-05-15 20:23:43] [INFO ] Computed 361 place invariants in 12 ms
[2021-05-15 20:23:44] [INFO ] Dead Transitions using invariants and state equation in 1322 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2368/2803 places, 2168/2603 transitions.
[2021-05-15 20:23:44] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-15 20:23:44] [INFO ] Flatten gal took : 198 ms
FORMULA ShieldIIPt-PT-040B-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040B-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 20:23:45] [INFO ] Flatten gal took : 111 ms
[2021-05-15 20:23:45] [INFO ] Input system was already deterministic with 2168 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1063 ms. (steps per millisecond=94 ) properties (out of 25) seen :8
Running SMT prover for 17 properties.
// Phase 1: matrix 2168 rows 2368 cols
[2021-05-15 20:23:46] [INFO ] Computed 361 place invariants in 7 ms
[2021-05-15 20:23:46] [INFO ] [Real]Absence check using 361 positive place invariants in 123 ms returned sat
[2021-05-15 20:23:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:23:47] [INFO ] [Real]Absence check using state equation in 936 ms returned sat
[2021-05-15 20:23:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 20:23:48] [INFO ] [Nat]Absence check using 361 positive place invariants in 112 ms returned sat
[2021-05-15 20:23:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 20:23:49] [INFO ] [Nat]Absence check using state equation in 923 ms returned sat
[2021-05-15 20:23:49] [INFO ] Deduced a trap composed of 17 places in 560 ms of which 4 ms to minimize.
[2021-05-15 20:23:50] [INFO ] Deduced a trap composed of 21 places in 575 ms of which 2 ms to minimize.
[2021-05-15 20:23:50] [INFO ] Deduced a trap composed of 30 places in 515 ms of which 2 ms to minimize.
[2021-05-15 20:23:51] [INFO ] Deduced a trap composed of 24 places in 536 ms of which 3 ms to minimize.
[2021-05-15 20:23:52] [INFO ] Deduced a trap composed of 17 places in 522 ms of which 2 ms to minimize.
[2021-05-15 20:23:52] [INFO ] Deduced a trap composed of 20 places in 522 ms of which 2 ms to minimize.
[2021-05-15 20:23:53] [INFO ] Deduced a trap composed of 18 places in 507 ms of which 1 ms to minimize.
[2021-05-15 20:23:53] [INFO ] Deduced a trap composed of 21 places in 466 ms of which 1 ms to minimize.
[2021-05-15 20:23:54] [INFO ] Deduced a trap composed of 26 places in 461 ms of which 1 ms to minimize.
[2021-05-15 20:23:54] [INFO ] Deduced a trap composed of 27 places in 453 ms of which 1 ms to minimize.
[2021-05-15 20:23:55] [INFO ] Deduced a trap composed of 26 places in 480 ms of which 1 ms to minimize.
[2021-05-15 20:23:56] [INFO ] Deduced a trap composed of 16 places in 460 ms of which 1 ms to minimize.
[2021-05-15 20:23:56] [INFO ] Deduced a trap composed of 31 places in 452 ms of which 1 ms to minimize.
[2021-05-15 20:23:57] [INFO ] Deduced a trap composed of 26 places in 440 ms of which 1 ms to minimize.
[2021-05-15 20:23:57] [INFO ] Deduced a trap composed of 23 places in 464 ms of which 1 ms to minimize.
[2021-05-15 20:23:58] [INFO ] Deduced a trap composed of 22 places in 440 ms of which 1 ms to minimize.
[2021-05-15 20:23:58] [INFO ] Deduced a trap composed of 20 places in 434 ms of which 1 ms to minimize.
[2021-05-15 20:23:59] [INFO ] Deduced a trap composed of 36 places in 432 ms of which 1 ms to minimize.
[2021-05-15 20:23:59] [INFO ] Deduced a trap composed of 36 places in 422 ms of which 1 ms to minimize.
[2021-05-15 20:24:00] [INFO ] Deduced a trap composed of 30 places in 435 ms of which 1 ms to minimize.
[2021-05-15 20:24:00] [INFO ] Deduced a trap composed of 35 places in 415 ms of which 1 ms to minimize.
[2021-05-15 20:24:01] [INFO ] Deduced a trap composed of 29 places in 426 ms of which 1 ms to minimize.
[2021-05-15 20:24:01] [INFO ] Deduced a trap composed of 37 places in 401 ms of which 1 ms to minimize.
[2021-05-15 20:24:02] [INFO ] Deduced a trap composed of 27 places in 397 ms of which 1 ms to minimize.
[2021-05-15 20:24:02] [INFO ] Deduced a trap composed of 39 places in 407 ms of which 1 ms to minimize.
[2021-05-15 20:24:03] [INFO ] Deduced a trap composed of 42 places in 396 ms of which 1 ms to minimize.
[2021-05-15 20:24:03] [INFO ] Deduced a trap composed of 40 places in 394 ms of which 1 ms to minimize.
[2021-05-15 20:24:04] [INFO ] Deduced a trap composed of 40 places in 393 ms of which 1 ms to minimize.
[2021-05-15 20:24:04] [INFO ] Deduced a trap composed of 29 places in 385 ms of which 1 ms to minimize.
[2021-05-15 20:24:04] [INFO ] Deduced a trap composed of 39 places in 379 ms of which 1 ms to minimize.
[2021-05-15 20:24:05] [INFO ] Deduced a trap composed of 27 places in 377 ms of which 1 ms to minimize.
[2021-05-15 20:24:05] [INFO ] Deduced a trap composed of 27 places in 374 ms of which 1 ms to minimize.
[2021-05-15 20:24:06] [INFO ] Deduced a trap composed of 30 places in 375 ms of which 1 ms to minimize.
[2021-05-15 20:24:06] [INFO ] Deduced a trap composed of 33 places in 366 ms of which 6 ms to minimize.
[2021-05-15 20:24:07] [INFO ] Deduced a trap composed of 26 places in 360 ms of which 1 ms to minimize.
[2021-05-15 20:24:07] [INFO ] Deduced a trap composed of 36 places in 348 ms of which 1 ms to minimize.
[2021-05-15 20:24:08] [INFO ] Deduced a trap composed of 36 places in 345 ms of which 1 ms to minimize.
[2021-05-15 20:24:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-15 20:24:08] [INFO ] [Real]Absence check using 361 positive place invariants in 123 ms returned sat
[2021-05-15 20:24:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:24:09] [INFO ] [Real]Absence check using state equation in 851 ms returned sat
[2021-05-15 20:24:09] [INFO ] Deduced a trap composed of 22 places in 465 ms of which 1 ms to minimize.
[2021-05-15 20:24:10] [INFO ] Deduced a trap composed of 13 places in 458 ms of which 2 ms to minimize.
[2021-05-15 20:24:10] [INFO ] Deduced a trap composed of 16 places in 471 ms of which 1 ms to minimize.
[2021-05-15 20:24:11] [INFO ] Deduced a trap composed of 21 places in 463 ms of which 1 ms to minimize.
[2021-05-15 20:24:11] [INFO ] Deduced a trap composed of 16 places in 465 ms of which 1 ms to minimize.
[2021-05-15 20:24:12] [INFO ] Deduced a trap composed of 18 places in 459 ms of which 1 ms to minimize.
[2021-05-15 20:24:13] [INFO ] Deduced a trap composed of 17 places in 467 ms of which 2 ms to minimize.
[2021-05-15 20:24:13] [INFO ] Deduced a trap composed of 20 places in 437 ms of which 1 ms to minimize.
[2021-05-15 20:24:14] [INFO ] Deduced a trap composed of 18 places in 430 ms of which 1 ms to minimize.
[2021-05-15 20:24:14] [INFO ] Deduced a trap composed of 21 places in 424 ms of which 1 ms to minimize.
[2021-05-15 20:24:15] [INFO ] Deduced a trap composed of 22 places in 424 ms of which 1 ms to minimize.
[2021-05-15 20:24:15] [INFO ] Deduced a trap composed of 26 places in 430 ms of which 1 ms to minimize.
[2021-05-15 20:24:16] [INFO ] Deduced a trap composed of 24 places in 417 ms of which 2 ms to minimize.
[2021-05-15 20:24:16] [INFO ] Deduced a trap composed of 34 places in 399 ms of which 1 ms to minimize.
[2021-05-15 20:24:17] [INFO ] Deduced a trap composed of 29 places in 398 ms of which 1 ms to minimize.
[2021-05-15 20:24:17] [INFO ] Deduced a trap composed of 22 places in 422 ms of which 1 ms to minimize.
[2021-05-15 20:24:17] [INFO ] Deduced a trap composed of 40 places in 378 ms of which 1 ms to minimize.
[2021-05-15 20:24:18] [INFO ] Deduced a trap composed of 23 places in 384 ms of which 1 ms to minimize.
[2021-05-15 20:24:18] [INFO ] Deduced a trap composed of 32 places in 376 ms of which 1 ms to minimize.
[2021-05-15 20:24:19] [INFO ] Deduced a trap composed of 23 places in 373 ms of which 1 ms to minimize.
[2021-05-15 20:24:19] [INFO ] Deduced a trap composed of 29 places in 369 ms of which 1 ms to minimize.
[2021-05-15 20:24:20] [INFO ] Deduced a trap composed of 38 places in 375 ms of which 1 ms to minimize.
[2021-05-15 20:24:20] [INFO ] Deduced a trap composed of 20 places in 352 ms of which 1 ms to minimize.
[2021-05-15 20:24:21] [INFO ] Deduced a trap composed of 27 places in 341 ms of which 1 ms to minimize.
[2021-05-15 20:24:21] [INFO ] Deduced a trap composed of 36 places in 345 ms of which 0 ms to minimize.
[2021-05-15 20:24:21] [INFO ] Deduced a trap composed of 41 places in 338 ms of which 1 ms to minimize.
[2021-05-15 20:24:22] [INFO ] Deduced a trap composed of 27 places in 341 ms of which 1 ms to minimize.
[2021-05-15 20:24:22] [INFO ] Deduced a trap composed of 30 places in 320 ms of which 1 ms to minimize.
[2021-05-15 20:24:23] [INFO ] Deduced a trap composed of 29 places in 317 ms of which 2 ms to minimize.
[2021-05-15 20:24:23] [INFO ] Deduced a trap composed of 36 places in 308 ms of which 1 ms to minimize.
[2021-05-15 20:24:23] [INFO ] Deduced a trap composed of 34 places in 301 ms of which 0 ms to minimize.
[2021-05-15 20:24:24] [INFO ] Deduced a trap composed of 28 places in 300 ms of which 1 ms to minimize.
[2021-05-15 20:24:24] [INFO ] Deduced a trap composed of 36 places in 299 ms of which 1 ms to minimize.
[2021-05-15 20:24:25] [INFO ] Deduced a trap composed of 37 places in 280 ms of which 1 ms to minimize.
[2021-05-15 20:24:25] [INFO ] Deduced a trap composed of 49 places in 271 ms of which 1 ms to minimize.
[2021-05-15 20:24:25] [INFO ] Deduced a trap composed of 42 places in 267 ms of which 1 ms to minimize.
[2021-05-15 20:24:26] [INFO ] Deduced a trap composed of 42 places in 261 ms of which 1 ms to minimize.
[2021-05-15 20:24:26] [INFO ] Deduced a trap composed of 40 places in 260 ms of which 1 ms to minimize.
[2021-05-15 20:24:26] [INFO ] Deduced a trap composed of 44 places in 260 ms of which 1 ms to minimize.
[2021-05-15 20:24:27] [INFO ] Deduced a trap composed of 42 places in 254 ms of which 1 ms to minimize.
[2021-05-15 20:24:27] [INFO ] Deduced a trap composed of 38 places in 250 ms of which 1 ms to minimize.
[2021-05-15 20:24:27] [INFO ] Deduced a trap composed of 47 places in 259 ms of which 1 ms to minimize.
[2021-05-15 20:24:28] [INFO ] Deduced a trap composed of 50 places in 236 ms of which 0 ms to minimize.
[2021-05-15 20:24:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-15 20:24:28] [INFO ] [Real]Absence check using 361 positive place invariants in 119 ms returned sat
[2021-05-15 20:24:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:24:29] [INFO ] [Real]Absence check using state equation in 855 ms returned sat
[2021-05-15 20:24:29] [INFO ] Deduced a trap composed of 26 places in 398 ms of which 1 ms to minimize.
[2021-05-15 20:24:30] [INFO ] Deduced a trap composed of 21 places in 386 ms of which 1 ms to minimize.
[2021-05-15 20:24:30] [INFO ] Deduced a trap composed of 15 places in 387 ms of which 1 ms to minimize.
[2021-05-15 20:24:31] [INFO ] Deduced a trap composed of 16 places in 381 ms of which 1 ms to minimize.
[2021-05-15 20:24:31] [INFO ] Deduced a trap composed of 18 places in 376 ms of which 1 ms to minimize.
[2021-05-15 20:24:32] [INFO ] Deduced a trap composed of 16 places in 377 ms of which 1 ms to minimize.
[2021-05-15 20:24:32] [INFO ] Deduced a trap composed of 30 places in 365 ms of which 1 ms to minimize.
[2021-05-15 20:24:32] [INFO ] Deduced a trap composed of 19 places in 360 ms of which 1 ms to minimize.
[2021-05-15 20:24:33] [INFO ] Deduced a trap composed of 23 places in 360 ms of which 1 ms to minimize.
[2021-05-15 20:24:33] [INFO ] Deduced a trap composed of 23 places in 353 ms of which 1 ms to minimize.
[2021-05-15 20:24:34] [INFO ] Deduced a trap composed of 28 places in 350 ms of which 1 ms to minimize.
[2021-05-15 20:24:34] [INFO ] Deduced a trap composed of 32 places in 352 ms of which 1 ms to minimize.
[2021-05-15 20:24:35] [INFO ] Deduced a trap composed of 34 places in 342 ms of which 1 ms to minimize.
[2021-05-15 20:24:35] [INFO ] Deduced a trap composed of 36 places in 338 ms of which 1 ms to minimize.
[2021-05-15 20:24:35] [INFO ] Deduced a trap composed of 20 places in 343 ms of which 1 ms to minimize.
[2021-05-15 20:24:36] [INFO ] Deduced a trap composed of 21 places in 333 ms of which 1 ms to minimize.
[2021-05-15 20:24:36] [INFO ] Deduced a trap composed of 31 places in 328 ms of which 1 ms to minimize.
[2021-05-15 20:24:37] [INFO ] Deduced a trap composed of 41 places in 312 ms of which 1 ms to minimize.
[2021-05-15 20:24:37] [INFO ] Deduced a trap composed of 41 places in 313 ms of which 1 ms to minimize.
[2021-05-15 20:24:37] [INFO ] Deduced a trap composed of 39 places in 302 ms of which 1 ms to minimize.
[2021-05-15 20:24:38] [INFO ] Deduced a trap composed of 38 places in 306 ms of which 1 ms to minimize.
[2021-05-15 20:24:38] [INFO ] Deduced a trap composed of 29 places in 291 ms of which 0 ms to minimize.
[2021-05-15 20:24:39] [INFO ] Deduced a trap composed of 22 places in 281 ms of which 1 ms to minimize.
[2021-05-15 20:24:39] [INFO ] Deduced a trap composed of 31 places in 274 ms of which 0 ms to minimize.
[2021-05-15 20:24:39] [INFO ] Deduced a trap composed of 18 places in 272 ms of which 1 ms to minimize.
[2021-05-15 20:24:40] [INFO ] Deduced a trap composed of 31 places in 268 ms of which 1 ms to minimize.
[2021-05-15 20:24:40] [INFO ] Deduced a trap composed of 39 places in 258 ms of which 1 ms to minimize.
[2021-05-15 20:24:40] [INFO ] Deduced a trap composed of 42 places in 253 ms of which 1 ms to minimize.
[2021-05-15 20:24:41] [INFO ] Deduced a trap composed of 33 places in 246 ms of which 1 ms to minimize.
[2021-05-15 20:24:41] [INFO ] Deduced a trap composed of 37 places in 258 ms of which 1 ms to minimize.
[2021-05-15 20:24:41] [INFO ] Deduced a trap composed of 39 places in 244 ms of which 0 ms to minimize.
[2021-05-15 20:24:42] [INFO ] Deduced a trap composed of 36 places in 231 ms of which 1 ms to minimize.
[2021-05-15 20:24:42] [INFO ] Deduced a trap composed of 41 places in 231 ms of which 0 ms to minimize.
[2021-05-15 20:24:42] [INFO ] Deduced a trap composed of 30 places in 228 ms of which 1 ms to minimize.
[2021-05-15 20:24:42] [INFO ] Deduced a trap composed of 37 places in 221 ms of which 1 ms to minimize.
[2021-05-15 20:24:43] [INFO ] Deduced a trap composed of 51 places in 215 ms of which 1 ms to minimize.
[2021-05-15 20:24:43] [INFO ] Deduced a trap composed of 27 places in 212 ms of which 1 ms to minimize.
[2021-05-15 20:24:43] [INFO ] Deduced a trap composed of 37 places in 203 ms of which 1 ms to minimize.
[2021-05-15 20:24:44] [INFO ] Deduced a trap composed of 35 places in 197 ms of which 0 ms to minimize.
[2021-05-15 20:24:44] [INFO ] Deduced a trap composed of 36 places in 195 ms of which 1 ms to minimize.
[2021-05-15 20:24:44] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 1 ms to minimize.
[2021-05-15 20:24:44] [INFO ] Deduced a trap composed of 49 places in 189 ms of which 1 ms to minimize.
[2021-05-15 20:24:45] [INFO ] Deduced a trap composed of 46 places in 186 ms of which 0 ms to minimize.
[2021-05-15 20:24:45] [INFO ] Deduced a trap composed of 50 places in 187 ms of which 1 ms to minimize.
[2021-05-15 20:24:45] [INFO ] Deduced a trap composed of 42 places in 180 ms of which 1 ms to minimize.
[2021-05-15 20:24:45] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 1 ms to minimize.
[2021-05-15 20:24:46] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 1 ms to minimize.
[2021-05-15 20:24:46] [INFO ] Deduced a trap composed of 49 places in 172 ms of which 0 ms to minimize.
[2021-05-15 20:24:46] [INFO ] Deduced a trap composed of 48 places in 170 ms of which 1 ms to minimize.
[2021-05-15 20:24:46] [INFO ] Deduced a trap composed of 48 places in 163 ms of which 0 ms to minimize.
[2021-05-15 20:24:47] [INFO ] Deduced a trap composed of 54 places in 162 ms of which 1 ms to minimize.
[2021-05-15 20:24:47] [INFO ] Deduced a trap composed of 53 places in 159 ms of which 1 ms to minimize.
[2021-05-15 20:24:47] [INFO ] Deduced a trap composed of 55 places in 150 ms of which 0 ms to minimize.
[2021-05-15 20:24:47] [INFO ] Deduced a trap composed of 49 places in 152 ms of which 0 ms to minimize.
[2021-05-15 20:24:48] [INFO ] Deduced a trap composed of 52 places in 146 ms of which 0 ms to minimize.
[2021-05-15 20:24:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-05-15 20:24:48] [INFO ] [Real]Absence check using 361 positive place invariants in 113 ms returned sat
[2021-05-15 20:24:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:24:49] [INFO ] [Real]Absence check using state equation in 921 ms returned sat
[2021-05-15 20:24:49] [INFO ] Deduced a trap composed of 17 places in 504 ms of which 1 ms to minimize.
[2021-05-15 20:24:50] [INFO ] Deduced a trap composed of 18 places in 495 ms of which 1 ms to minimize.
[2021-05-15 20:24:51] [INFO ] Deduced a trap composed of 18 places in 489 ms of which 1 ms to minimize.
[2021-05-15 20:24:51] [INFO ] Deduced a trap composed of 16 places in 491 ms of which 1 ms to minimize.
[2021-05-15 20:24:52] [INFO ] Deduced a trap composed of 21 places in 489 ms of which 1 ms to minimize.
[2021-05-15 20:24:52] [INFO ] Deduced a trap composed of 21 places in 489 ms of which 1 ms to minimize.
[2021-05-15 20:24:53] [INFO ] Deduced a trap composed of 21 places in 471 ms of which 2 ms to minimize.
[2021-05-15 20:24:53] [INFO ] Deduced a trap composed of 28 places in 460 ms of which 1 ms to minimize.
[2021-05-15 20:24:54] [INFO ] Deduced a trap composed of 22 places in 459 ms of which 1 ms to minimize.
[2021-05-15 20:24:54] [INFO ] Deduced a trap composed of 25 places in 458 ms of which 1 ms to minimize.
[2021-05-15 20:24:55] [INFO ] Deduced a trap composed of 19 places in 453 ms of which 1 ms to minimize.
[2021-05-15 20:24:55] [INFO ] Deduced a trap composed of 20 places in 445 ms of which 2 ms to minimize.
[2021-05-15 20:24:56] [INFO ] Deduced a trap composed of 29 places in 433 ms of which 1 ms to minimize.
[2021-05-15 20:24:56] [INFO ] Deduced a trap composed of 29 places in 422 ms of which 1 ms to minimize.
[2021-05-15 20:24:57] [INFO ] Deduced a trap composed of 16 places in 429 ms of which 1 ms to minimize.
[2021-05-15 20:24:58] [INFO ] Deduced a trap composed of 27 places in 433 ms of which 1 ms to minimize.
[2021-05-15 20:24:58] [INFO ] Deduced a trap composed of 28 places in 405 ms of which 1 ms to minimize.
[2021-05-15 20:24:58] [INFO ] Deduced a trap composed of 27 places in 404 ms of which 1 ms to minimize.
[2021-05-15 20:24:59] [INFO ] Deduced a trap composed of 28 places in 404 ms of which 1 ms to minimize.
[2021-05-15 20:24:59] [INFO ] Deduced a trap composed of 39 places in 386 ms of which 1 ms to minimize.
[2021-05-15 20:25:00] [INFO ] Deduced a trap composed of 29 places in 384 ms of which 1 ms to minimize.
[2021-05-15 20:25:00] [INFO ] Deduced a trap composed of 35 places in 379 ms of which 1 ms to minimize.
[2021-05-15 20:25:01] [INFO ] Deduced a trap composed of 33 places in 390 ms of which 1 ms to minimize.
[2021-05-15 20:25:01] [INFO ] Deduced a trap composed of 31 places in 375 ms of which 1 ms to minimize.
[2021-05-15 20:25:02] [INFO ] Deduced a trap composed of 32 places in 372 ms of which 1 ms to minimize.
[2021-05-15 20:25:02] [INFO ] Deduced a trap composed of 40 places in 348 ms of which 1 ms to minimize.
[2021-05-15 20:25:03] [INFO ] Deduced a trap composed of 38 places in 354 ms of which 1 ms to minimize.
[2021-05-15 20:25:03] [INFO ] Deduced a trap composed of 36 places in 346 ms of which 1 ms to minimize.
[2021-05-15 20:25:03] [INFO ] Deduced a trap composed of 30 places in 338 ms of which 1 ms to minimize.
[2021-05-15 20:25:04] [INFO ] Deduced a trap composed of 33 places in 336 ms of which 1 ms to minimize.
[2021-05-15 20:25:04] [INFO ] Deduced a trap composed of 38 places in 329 ms of which 1 ms to minimize.
[2021-05-15 20:25:05] [INFO ] Deduced a trap composed of 40 places in 322 ms of which 1 ms to minimize.
[2021-05-15 20:25:05] [INFO ] Deduced a trap composed of 40 places in 318 ms of which 1 ms to minimize.
[2021-05-15 20:25:05] [INFO ] Deduced a trap composed of 39 places in 311 ms of which 1 ms to minimize.
[2021-05-15 20:25:06] [INFO ] Deduced a trap composed of 32 places in 306 ms of which 0 ms to minimize.
[2021-05-15 20:25:06] [INFO ] Deduced a trap composed of 40 places in 295 ms of which 1 ms to minimize.
[2021-05-15 20:25:07] [INFO ] Deduced a trap composed of 30 places in 294 ms of which 1 ms to minimize.
[2021-05-15 20:25:07] [INFO ] Deduced a trap composed of 36 places in 288 ms of which 1 ms to minimize.
[2021-05-15 20:25:07] [INFO ] Deduced a trap composed of 38 places in 279 ms of which 0 ms to minimize.
[2021-05-15 20:25:08] [INFO ] Deduced a trap composed of 37 places in 279 ms of which 1 ms to minimize.
[2021-05-15 20:25:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2021-05-15 20:25:08] [INFO ] [Real]Absence check using 361 positive place invariants in 114 ms returned sat
[2021-05-15 20:25:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:25:09] [INFO ] [Real]Absence check using state equation in 909 ms returned sat
[2021-05-15 20:25:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 20:25:09] [INFO ] [Nat]Absence check using 361 positive place invariants in 113 ms returned sat
[2021-05-15 20:25:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 20:25:10] [INFO ] [Nat]Absence check using state equation in 924 ms returned sat
[2021-05-15 20:25:11] [INFO ] Deduced a trap composed of 16 places in 479 ms of which 1 ms to minimize.
[2021-05-15 20:25:11] [INFO ] Deduced a trap composed of 23 places in 453 ms of which 1 ms to minimize.
[2021-05-15 20:25:12] [INFO ] Deduced a trap composed of 15 places in 448 ms of which 1 ms to minimize.
[2021-05-15 20:25:12] [INFO ] Deduced a trap composed of 20 places in 448 ms of which 1 ms to minimize.
[2021-05-15 20:25:13] [INFO ] Deduced a trap composed of 15 places in 441 ms of which 1 ms to minimize.
[2021-05-15 20:25:13] [INFO ] Deduced a trap composed of 34 places in 436 ms of which 1 ms to minimize.
[2021-05-15 20:25:14] [INFO ] Deduced a trap composed of 19 places in 434 ms of which 1 ms to minimize.
[2021-05-15 20:25:14] [INFO ] Deduced a trap composed of 25 places in 425 ms of which 1 ms to minimize.
[2021-05-15 20:25:15] [INFO ] Deduced a trap composed of 27 places in 410 ms of which 1 ms to minimize.
[2021-05-15 20:25:15] [INFO ] Deduced a trap composed of 22 places in 413 ms of which 1 ms to minimize.
[2021-05-15 20:25:16] [INFO ] Deduced a trap composed of 19 places in 404 ms of which 1 ms to minimize.
[2021-05-15 20:25:16] [INFO ] Deduced a trap composed of 39 places in 397 ms of which 1 ms to minimize.
[2021-05-15 20:25:17] [INFO ] Deduced a trap composed of 26 places in 392 ms of which 1 ms to minimize.
[2021-05-15 20:25:17] [INFO ] Deduced a trap composed of 28 places in 390 ms of which 1 ms to minimize.
[2021-05-15 20:25:18] [INFO ] Deduced a trap composed of 36 places in 388 ms of which 1 ms to minimize.
[2021-05-15 20:25:18] [INFO ] Deduced a trap composed of 23 places in 392 ms of which 1 ms to minimize.
[2021-05-15 20:25:19] [INFO ] Deduced a trap composed of 31 places in 385 ms of which 1 ms to minimize.
[2021-05-15 20:25:19] [INFO ] Deduced a trap composed of 25 places in 370 ms of which 0 ms to minimize.
[2021-05-15 20:25:19] [INFO ] Deduced a trap composed of 22 places in 366 ms of which 1 ms to minimize.
[2021-05-15 20:25:20] [INFO ] Deduced a trap composed of 46 places in 358 ms of which 1 ms to minimize.
[2021-05-15 20:25:20] [INFO ] Deduced a trap composed of 32 places in 359 ms of which 1 ms to minimize.
[2021-05-15 20:25:21] [INFO ] Deduced a trap composed of 39 places in 361 ms of which 1 ms to minimize.
[2021-05-15 20:25:21] [INFO ] Deduced a trap composed of 41 places in 356 ms of which 1 ms to minimize.
[2021-05-15 20:25:22] [INFO ] Deduced a trap composed of 26 places in 353 ms of which 1 ms to minimize.
[2021-05-15 20:25:22] [INFO ] Deduced a trap composed of 43 places in 357 ms of which 1 ms to minimize.
[2021-05-15 20:25:22] [INFO ] Deduced a trap composed of 38 places in 338 ms of which 1 ms to minimize.
[2021-05-15 20:25:23] [INFO ] Deduced a trap composed of 29 places in 342 ms of which 1 ms to minimize.
[2021-05-15 20:25:23] [INFO ] Deduced a trap composed of 31 places in 329 ms of which 1 ms to minimize.
[2021-05-15 20:25:24] [INFO ] Deduced a trap composed of 30 places in 327 ms of which 1 ms to minimize.
[2021-05-15 20:25:24] [INFO ] Deduced a trap composed of 38 places in 330 ms of which 1 ms to minimize.
[2021-05-15 20:25:24] [INFO ] Deduced a trap composed of 41 places in 327 ms of which 1 ms to minimize.
[2021-05-15 20:25:25] [INFO ] Deduced a trap composed of 41 places in 312 ms of which 1 ms to minimize.
[2021-05-15 20:25:25] [INFO ] Deduced a trap composed of 37 places in 309 ms of which 1 ms to minimize.
[2021-05-15 20:25:26] [INFO ] Deduced a trap composed of 34 places in 317 ms of which 1 ms to minimize.
[2021-05-15 20:25:26] [INFO ] Deduced a trap composed of 39 places in 305 ms of which 1 ms to minimize.
[2021-05-15 20:25:26] [INFO ] Deduced a trap composed of 31 places in 319 ms of which 1 ms to minimize.
[2021-05-15 20:25:27] [INFO ] Deduced a trap composed of 22 places in 291 ms of which 1 ms to minimize.
[2021-05-15 20:25:27] [INFO ] Deduced a trap composed of 39 places in 286 ms of which 1 ms to minimize.
[2021-05-15 20:25:27] [INFO ] Deduced a trap composed of 31 places in 284 ms of which 0 ms to minimize.
[2021-05-15 20:25:28] [INFO ] Deduced a trap composed of 33 places in 279 ms of which 1 ms to minimize.
[2021-05-15 20:25:28] [INFO ] Deduced a trap composed of 30 places in 276 ms of which 1 ms to minimize.
[2021-05-15 20:25:28] [INFO ] Deduced a trap composed of 30 places in 281 ms of which 1 ms to minimize.
[2021-05-15 20:25:29] [INFO ] Deduced a trap composed of 51 places in 258 ms of which 1 ms to minimize.
[2021-05-15 20:25:29] [INFO ] Deduced a trap composed of 51 places in 255 ms of which 1 ms to minimize.
[2021-05-15 20:25:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2021-05-15 20:25:29] [INFO ] [Real]Absence check using 361 positive place invariants in 112 ms returned sat
[2021-05-15 20:25:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:25:30] [INFO ] [Real]Absence check using state equation in 864 ms returned sat
[2021-05-15 20:25:31] [INFO ] Deduced a trap composed of 26 places in 476 ms of which 2 ms to minimize.
[2021-05-15 20:25:31] [INFO ] Deduced a trap composed of 25 places in 476 ms of which 2 ms to minimize.
[2021-05-15 20:25:32] [INFO ] Deduced a trap composed of 25 places in 482 ms of which 1 ms to minimize.
[2021-05-15 20:25:33] [INFO ] Deduced a trap composed of 21 places in 464 ms of which 2 ms to minimize.
[2021-05-15 20:25:33] [INFO ] Deduced a trap composed of 28 places in 461 ms of which 1 ms to minimize.
[2021-05-15 20:25:34] [INFO ] Deduced a trap composed of 20 places in 442 ms of which 1 ms to minimize.
[2021-05-15 20:25:34] [INFO ] Deduced a trap composed of 24 places in 449 ms of which 1 ms to minimize.
[2021-05-15 20:25:35] [INFO ] Deduced a trap composed of 21 places in 425 ms of which 1 ms to minimize.
[2021-05-15 20:25:35] [INFO ] Deduced a trap composed of 29 places in 435 ms of which 1 ms to minimize.
[2021-05-15 20:25:36] [INFO ] Deduced a trap composed of 26 places in 420 ms of which 1 ms to minimize.
[2021-05-15 20:25:36] [INFO ] Deduced a trap composed of 17 places in 415 ms of which 2 ms to minimize.
[2021-05-15 20:25:37] [INFO ] Deduced a trap composed of 27 places in 408 ms of which 1 ms to minimize.
[2021-05-15 20:25:37] [INFO ] Deduced a trap composed of 31 places in 399 ms of which 2 ms to minimize.
[2021-05-15 20:25:38] [INFO ] Deduced a trap composed of 28 places in 396 ms of which 1 ms to minimize.
[2021-05-15 20:25:38] [INFO ] Deduced a trap composed of 29 places in 395 ms of which 1 ms to minimize.
[2021-05-15 20:25:38] [INFO ] Deduced a trap composed of 29 places in 383 ms of which 1 ms to minimize.
[2021-05-15 20:25:39] [INFO ] Deduced a trap composed of 36 places in 380 ms of which 1 ms to minimize.
[2021-05-15 20:25:39] [INFO ] Deduced a trap composed of 38 places in 352 ms of which 1 ms to minimize.
[2021-05-15 20:25:40] [INFO ] Deduced a trap composed of 19 places in 357 ms of which 1 ms to minimize.
[2021-05-15 20:25:40] [INFO ] Deduced a trap composed of 15 places in 344 ms of which 1 ms to minimize.
[2021-05-15 20:25:41] [INFO ] Deduced a trap composed of 37 places in 343 ms of which 1 ms to minimize.
[2021-05-15 20:25:41] [INFO ] Deduced a trap composed of 36 places in 337 ms of which 1 ms to minimize.
[2021-05-15 20:25:41] [INFO ] Deduced a trap composed of 36 places in 339 ms of which 1 ms to minimize.
[2021-05-15 20:25:42] [INFO ] Deduced a trap composed of 38 places in 327 ms of which 1 ms to minimize.
[2021-05-15 20:25:42] [INFO ] Deduced a trap composed of 30 places in 325 ms of which 1 ms to minimize.
[2021-05-15 20:25:43] [INFO ] Deduced a trap composed of 32 places in 335 ms of which 1 ms to minimize.
[2021-05-15 20:25:43] [INFO ] Deduced a trap composed of 41 places in 309 ms of which 1 ms to minimize.
[2021-05-15 20:25:43] [INFO ] Deduced a trap composed of 39 places in 306 ms of which 1 ms to minimize.
[2021-05-15 20:25:44] [INFO ] Deduced a trap composed of 38 places in 308 ms of which 1 ms to minimize.
[2021-05-15 20:25:44] [INFO ] Deduced a trap composed of 40 places in 294 ms of which 1 ms to minimize.
[2021-05-15 20:25:45] [INFO ] Deduced a trap composed of 39 places in 284 ms of which 1 ms to minimize.
[2021-05-15 20:25:45] [INFO ] Deduced a trap composed of 38 places in 282 ms of which 1 ms to minimize.
[2021-05-15 20:25:45] [INFO ] Deduced a trap composed of 34 places in 273 ms of which 1 ms to minimize.
[2021-05-15 20:25:46] [INFO ] Deduced a trap composed of 42 places in 261 ms of which 1 ms to minimize.
[2021-05-15 20:25:46] [INFO ] Deduced a trap composed of 51 places in 263 ms of which 1 ms to minimize.
[2021-05-15 20:25:46] [INFO ] Deduced a trap composed of 31 places in 250 ms of which 1 ms to minimize.
[2021-05-15 20:25:47] [INFO ] Deduced a trap composed of 33 places in 246 ms of which 1 ms to minimize.
[2021-05-15 20:25:47] [INFO ] Deduced a trap composed of 44 places in 247 ms of which 0 ms to minimize.
[2021-05-15 20:25:47] [INFO ] Deduced a trap composed of 53 places in 238 ms of which 1 ms to minimize.
[2021-05-15 20:25:48] [INFO ] Deduced a trap composed of 41 places in 235 ms of which 1 ms to minimize.
[2021-05-15 20:25:48] [INFO ] Deduced a trap composed of 52 places in 235 ms of which 0 ms to minimize.
[2021-05-15 20:25:48] [INFO ] Deduced a trap composed of 42 places in 229 ms of which 1 ms to minimize.
[2021-05-15 20:25:48] [INFO ] Deduced a trap composed of 47 places in 236 ms of which 0 ms to minimize.
[2021-05-15 20:25:49] [INFO ] Deduced a trap composed of 52 places in 224 ms of which 1 ms to minimize.
[2021-05-15 20:25:49] [INFO ] Deduced a trap composed of 54 places in 216 ms of which 1 ms to minimize.
[2021-05-15 20:25:49] [INFO ] Deduced a trap composed of 48 places in 209 ms of which 1 ms to minimize.
[2021-05-15 20:25:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2021-05-15 20:25:50] [INFO ] [Real]Absence check using 361 positive place invariants in 112 ms returned sat
[2021-05-15 20:25:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:25:50] [INFO ] [Real]Absence check using state equation in 840 ms returned sat
[2021-05-15 20:25:51] [INFO ] Deduced a trap composed of 19 places in 450 ms of which 1 ms to minimize.
[2021-05-15 20:25:52] [INFO ] Deduced a trap composed of 33 places in 444 ms of which 1 ms to minimize.
[2021-05-15 20:25:52] [INFO ] Deduced a trap composed of 25 places in 446 ms of which 1 ms to minimize.
[2021-05-15 20:25:53] [INFO ] Deduced a trap composed of 30 places in 436 ms of which 1 ms to minimize.
[2021-05-15 20:25:53] [INFO ] Deduced a trap composed of 13 places in 436 ms of which 1 ms to minimize.
[2021-05-15 20:25:54] [INFO ] Deduced a trap composed of 20 places in 432 ms of which 1 ms to minimize.
[2021-05-15 20:25:54] [INFO ] Deduced a trap composed of 19 places in 426 ms of which 1 ms to minimize.
[2021-05-15 20:25:55] [INFO ] Deduced a trap composed of 28 places in 426 ms of which 1 ms to minimize.
[2021-05-15 20:25:55] [INFO ] Deduced a trap composed of 22 places in 423 ms of which 1 ms to minimize.
[2021-05-15 20:25:56] [INFO ] Deduced a trap composed of 20 places in 414 ms of which 1 ms to minimize.
[2021-05-15 20:25:56] [INFO ] Deduced a trap composed of 23 places in 401 ms of which 1 ms to minimize.
[2021-05-15 20:25:57] [INFO ] Deduced a trap composed of 17 places in 396 ms of which 1 ms to minimize.
[2021-05-15 20:25:57] [INFO ] Deduced a trap composed of 29 places in 386 ms of which 1 ms to minimize.
[2021-05-15 20:25:57] [INFO ] Deduced a trap composed of 37 places in 386 ms of which 1 ms to minimize.
[2021-05-15 20:25:58] [INFO ] Deduced a trap composed of 26 places in 387 ms of which 1 ms to minimize.
[2021-05-15 20:25:58] [INFO ] Deduced a trap composed of 32 places in 385 ms of which 1 ms to minimize.
[2021-05-15 20:25:59] [INFO ] Deduced a trap composed of 31 places in 368 ms of which 1 ms to minimize.
[2021-05-15 20:25:59] [INFO ] Deduced a trap composed of 25 places in 359 ms of which 1 ms to minimize.
[2021-05-15 20:26:00] [INFO ] Deduced a trap composed of 26 places in 354 ms of which 1 ms to minimize.
[2021-05-15 20:26:00] [INFO ] Deduced a trap composed of 42 places in 347 ms of which 1 ms to minimize.
[2021-05-15 20:26:01] [INFO ] Deduced a trap composed of 21 places in 345 ms of which 1 ms to minimize.
[2021-05-15 20:26:01] [INFO ] Deduced a trap composed of 27 places in 332 ms of which 1 ms to minimize.
[2021-05-15 20:26:01] [INFO ] Deduced a trap composed of 27 places in 326 ms of which 1 ms to minimize.
[2021-05-15 20:26:02] [INFO ] Deduced a trap composed of 31 places in 331 ms of which 1 ms to minimize.
[2021-05-15 20:26:02] [INFO ] Deduced a trap composed of 25 places in 323 ms of which 1 ms to minimize.
[2021-05-15 20:26:03] [INFO ] Deduced a trap composed of 31 places in 308 ms of which 0 ms to minimize.
[2021-05-15 20:26:03] [INFO ] Deduced a trap composed of 38 places in 311 ms of which 1 ms to minimize.
[2021-05-15 20:26:03] [INFO ] Deduced a trap composed of 37 places in 301 ms of which 1 ms to minimize.
[2021-05-15 20:26:04] [INFO ] Deduced a trap composed of 38 places in 314 ms of which 1 ms to minimize.
[2021-05-15 20:26:04] [INFO ] Deduced a trap composed of 41 places in 290 ms of which 1 ms to minimize.
[2021-05-15 20:26:04] [INFO ] Deduced a trap composed of 35 places in 286 ms of which 1 ms to minimize.
[2021-05-15 20:26:05] [INFO ] Deduced a trap composed of 33 places in 281 ms of which 0 ms to minimize.
[2021-05-15 20:26:05] [INFO ] Deduced a trap composed of 49 places in 281 ms of which 1 ms to minimize.
[2021-05-15 20:26:05] [INFO ] Deduced a trap composed of 52 places in 273 ms of which 0 ms to minimize.
[2021-05-15 20:26:06] [INFO ] Deduced a trap composed of 31 places in 271 ms of which 0 ms to minimize.
[2021-05-15 20:26:06] [INFO ] Deduced a trap composed of 33 places in 266 ms of which 1 ms to minimize.
[2021-05-15 20:26:07] [INFO ] Deduced a trap composed of 37 places in 264 ms of which 1 ms to minimize.
[2021-05-15 20:26:07] [INFO ] Deduced a trap composed of 29 places in 255 ms of which 1 ms to minimize.
[2021-05-15 20:26:07] [INFO ] Deduced a trap composed of 37 places in 249 ms of which 1 ms to minimize.
[2021-05-15 20:26:08] [INFO ] Deduced a trap composed of 49 places in 246 ms of which 1 ms to minimize.
[2021-05-15 20:26:08] [INFO ] Deduced a trap composed of 38 places in 243 ms of which 0 ms to minimize.
[2021-05-15 20:26:08] [INFO ] Deduced a trap composed of 43 places in 236 ms of which 1 ms to minimize.
[2021-05-15 20:26:08] [INFO ] Deduced a trap composed of 40 places in 230 ms of which 1 ms to minimize.
[2021-05-15 20:26:09] [INFO ] Deduced a trap composed of 36 places in 227 ms of which 1 ms to minimize.
[2021-05-15 20:26:09] [INFO ] Deduced a trap composed of 42 places in 219 ms of which 1 ms to minimize.
[2021-05-15 20:26:09] [INFO ] Deduced a trap composed of 44 places in 226 ms of which 1 ms to minimize.
[2021-05-15 20:26:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2021-05-15 20:26:10] [INFO ] [Real]Absence check using 361 positive place invariants in 111 ms returned sat
[2021-05-15 20:26:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:26:11] [INFO ] [Real]Absence check using state equation in 839 ms returned sat
[2021-05-15 20:26:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 20:26:11] [INFO ] [Nat]Absence check using 361 positive place invariants in 117 ms returned sat
[2021-05-15 20:26:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 20:26:12] [INFO ] [Nat]Absence check using state equation in 930 ms returned sat
[2021-05-15 20:26:13] [INFO ] Deduced a trap composed of 25 places in 588 ms of which 2 ms to minimize.
[2021-05-15 20:26:13] [INFO ] Deduced a trap composed of 20 places in 489 ms of which 1 ms to minimize.
[2021-05-15 20:26:14] [INFO ] Deduced a trap composed of 21 places in 484 ms of which 1 ms to minimize.
[2021-05-15 20:26:14] [INFO ] Deduced a trap composed of 25 places in 468 ms of which 1 ms to minimize.
[2021-05-15 20:26:15] [INFO ] Deduced a trap composed of 17 places in 455 ms of which 1 ms to minimize.
[2021-05-15 20:26:15] [INFO ] Deduced a trap composed of 26 places in 440 ms of which 2 ms to minimize.
[2021-05-15 20:26:16] [INFO ] Deduced a trap composed of 31 places in 436 ms of which 1 ms to minimize.
[2021-05-15 20:26:16] [INFO ] Deduced a trap composed of 31 places in 423 ms of which 1 ms to minimize.
[2021-05-15 20:26:17] [INFO ] Deduced a trap composed of 24 places in 410 ms of which 1 ms to minimize.
[2021-05-15 20:26:17] [INFO ] Deduced a trap composed of 38 places in 421 ms of which 1 ms to minimize.
[2021-05-15 20:26:18] [INFO ] Deduced a trap composed of 30 places in 415 ms of which 1 ms to minimize.
[2021-05-15 20:26:18] [INFO ] Deduced a trap composed of 21 places in 407 ms of which 1 ms to minimize.
[2021-05-15 20:26:19] [INFO ] Deduced a trap composed of 22 places in 399 ms of which 1 ms to minimize.
[2021-05-15 20:26:19] [INFO ] Deduced a trap composed of 38 places in 391 ms of which 1 ms to minimize.
[2021-05-15 20:26:20] [INFO ] Deduced a trap composed of 37 places in 384 ms of which 1 ms to minimize.
[2021-05-15 20:26:20] [INFO ] Deduced a trap composed of 15 places in 381 ms of which 1 ms to minimize.
[2021-05-15 20:26:21] [INFO ] Deduced a trap composed of 28 places in 376 ms of which 1 ms to minimize.
[2021-05-15 20:26:21] [INFO ] Deduced a trap composed of 21 places in 384 ms of which 1 ms to minimize.
[2021-05-15 20:26:21] [INFO ] Deduced a trap composed of 29 places in 371 ms of which 1 ms to minimize.
[2021-05-15 20:26:22] [INFO ] Deduced a trap composed of 27 places in 365 ms of which 1 ms to minimize.
[2021-05-15 20:26:22] [INFO ] Deduced a trap composed of 44 places in 355 ms of which 1 ms to minimize.
[2021-05-15 20:26:23] [INFO ] Deduced a trap composed of 36 places in 350 ms of which 1 ms to minimize.
[2021-05-15 20:26:23] [INFO ] Deduced a trap composed of 39 places in 346 ms of which 1 ms to minimize.
[2021-05-15 20:26:24] [INFO ] Deduced a trap composed of 41 places in 337 ms of which 1 ms to minimize.
[2021-05-15 20:26:24] [INFO ] Deduced a trap composed of 30 places in 332 ms of which 1 ms to minimize.
[2021-05-15 20:26:24] [INFO ] Deduced a trap composed of 36 places in 328 ms of which 1 ms to minimize.
[2021-05-15 20:26:25] [INFO ] Deduced a trap composed of 41 places in 313 ms of which 1 ms to minimize.
[2021-05-15 20:26:25] [INFO ] Deduced a trap composed of 38 places in 313 ms of which 1 ms to minimize.
[2021-05-15 20:26:25] [INFO ] Deduced a trap composed of 38 places in 302 ms of which 0 ms to minimize.
[2021-05-15 20:26:26] [INFO ] Deduced a trap composed of 16 places in 295 ms of which 1 ms to minimize.
[2021-05-15 20:26:26] [INFO ] Deduced a trap composed of 40 places in 285 ms of which 1 ms to minimize.
[2021-05-15 20:26:27] [INFO ] Deduced a trap composed of 49 places in 281 ms of which 1 ms to minimize.
[2021-05-15 20:26:27] [INFO ] Deduced a trap composed of 50 places in 276 ms of which 1 ms to minimize.
[2021-05-15 20:26:27] [INFO ] Deduced a trap composed of 39 places in 272 ms of which 1 ms to minimize.
[2021-05-15 20:26:28] [INFO ] Deduced a trap composed of 28 places in 267 ms of which 1 ms to minimize.
[2021-05-15 20:26:28] [INFO ] Deduced a trap composed of 44 places in 257 ms of which 1 ms to minimize.
[2021-05-15 20:26:28] [INFO ] Deduced a trap composed of 41 places in 248 ms of which 1 ms to minimize.
[2021-05-15 20:26:29] [INFO ] Deduced a trap composed of 55 places in 238 ms of which 1 ms to minimize.
[2021-05-15 20:26:29] [INFO ] Deduced a trap composed of 47 places in 238 ms of which 1 ms to minimize.
[2021-05-15 20:26:29] [INFO ] Deduced a trap composed of 50 places in 238 ms of which 1 ms to minimize.
[2021-05-15 20:26:29] [INFO ] Deduced a trap composed of 46 places in 237 ms of which 1 ms to minimize.
[2021-05-15 20:26:30] [INFO ] Deduced a trap composed of 50 places in 234 ms of which 1 ms to minimize.
[2021-05-15 20:26:30] [INFO ] Deduced a trap composed of 42 places in 235 ms of which 1 ms to minimize.
[2021-05-15 20:26:30] [INFO ] Deduced a trap composed of 54 places in 230 ms of which 0 ms to minimize.
[2021-05-15 20:26:31] [INFO ] Deduced a trap composed of 56 places in 223 ms of which 2 ms to minimize.
[2021-05-15 20:26:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
[2021-05-15 20:26:31] [INFO ] [Real]Absence check using 361 positive place invariants in 114 ms returned sat
[2021-05-15 20:26:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:26:32] [INFO ] [Real]Absence check using state equation in 865 ms returned sat
[2021-05-15 20:26:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 20:26:32] [INFO ] [Nat]Absence check using 361 positive place invariants in 112 ms returned sat
[2021-05-15 20:26:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 20:26:33] [INFO ] [Nat]Absence check using state equation in 980 ms returned sat
[2021-05-15 20:26:34] [INFO ] Deduced a trap composed of 16 places in 516 ms of which 1 ms to minimize.
[2021-05-15 20:26:34] [INFO ] Deduced a trap composed of 24 places in 484 ms of which 1 ms to minimize.
[2021-05-15 20:26:35] [INFO ] Deduced a trap composed of 25 places in 476 ms of which 1 ms to minimize.
[2021-05-15 20:26:35] [INFO ] Deduced a trap composed of 16 places in 466 ms of which 1 ms to minimize.
[2021-05-15 20:26:36] [INFO ] Deduced a trap composed of 25 places in 461 ms of which 2 ms to minimize.
[2021-05-15 20:26:36] [INFO ] Deduced a trap composed of 18 places in 459 ms of which 1 ms to minimize.
[2021-05-15 20:26:37] [INFO ] Deduced a trap composed of 17 places in 449 ms of which 1 ms to minimize.
[2021-05-15 20:26:38] [INFO ] Deduced a trap composed of 21 places in 445 ms of which 1 ms to minimize.
[2021-05-15 20:26:38] [INFO ] Deduced a trap composed of 30 places in 440 ms of which 1 ms to minimize.
[2021-05-15 20:26:39] [INFO ] Deduced a trap composed of 21 places in 439 ms of which 1 ms to minimize.
[2021-05-15 20:26:39] [INFO ] Deduced a trap composed of 28 places in 429 ms of which 1 ms to minimize.
[2021-05-15 20:26:40] [INFO ] Deduced a trap composed of 28 places in 425 ms of which 1 ms to minimize.
[2021-05-15 20:26:40] [INFO ] Deduced a trap composed of 20 places in 416 ms of which 1 ms to minimize.
[2021-05-15 20:26:41] [INFO ] Deduced a trap composed of 30 places in 398 ms of which 1 ms to minimize.
[2021-05-15 20:26:41] [INFO ] Deduced a trap composed of 33 places in 391 ms of which 1 ms to minimize.
[2021-05-15 20:26:41] [INFO ] Deduced a trap composed of 36 places in 382 ms of which 1 ms to minimize.
[2021-05-15 20:26:42] [INFO ] Deduced a trap composed of 40 places in 374 ms of which 1 ms to minimize.
[2021-05-15 20:26:42] [INFO ] Deduced a trap composed of 37 places in 384 ms of which 1 ms to minimize.
[2021-05-15 20:26:43] [INFO ] Deduced a trap composed of 33 places in 380 ms of which 1 ms to minimize.
[2021-05-15 20:26:43] [INFO ] Deduced a trap composed of 25 places in 366 ms of which 1 ms to minimize.
[2021-05-15 20:26:44] [INFO ] Deduced a trap composed of 28 places in 363 ms of which 1 ms to minimize.
[2021-05-15 20:26:44] [INFO ] Deduced a trap composed of 39 places in 358 ms of which 1 ms to minimize.
[2021-05-15 20:26:45] [INFO ] Deduced a trap composed of 32 places in 360 ms of which 1 ms to minimize.
[2021-05-15 20:26:45] [INFO ] Deduced a trap composed of 32 places in 353 ms of which 1 ms to minimize.
[2021-05-15 20:26:45] [INFO ] Deduced a trap composed of 32 places in 336 ms of which 1 ms to minimize.
[2021-05-15 20:26:46] [INFO ] Deduced a trap composed of 29 places in 337 ms of which 1 ms to minimize.
[2021-05-15 20:26:46] [INFO ] Deduced a trap composed of 34 places in 329 ms of which 0 ms to minimize.
[2021-05-15 20:26:47] [INFO ] Deduced a trap composed of 32 places in 330 ms of which 1 ms to minimize.
[2021-05-15 20:26:47] [INFO ] Deduced a trap composed of 30 places in 321 ms of which 1 ms to minimize.
[2021-05-15 20:26:47] [INFO ] Deduced a trap composed of 31 places in 316 ms of which 1 ms to minimize.
[2021-05-15 20:26:48] [INFO ] Deduced a trap composed of 22 places in 304 ms of which 1 ms to minimize.
[2021-05-15 20:26:48] [INFO ] Deduced a trap composed of 31 places in 297 ms of which 1 ms to minimize.
[2021-05-15 20:26:48] [INFO ] Deduced a trap composed of 28 places in 289 ms of which 1 ms to minimize.
[2021-05-15 20:26:49] [INFO ] Deduced a trap composed of 36 places in 284 ms of which 0 ms to minimize.
[2021-05-15 20:26:49] [INFO ] Deduced a trap composed of 38 places in 273 ms of which 1 ms to minimize.
[2021-05-15 20:26:49] [INFO ] Deduced a trap composed of 46 places in 273 ms of which 1 ms to minimize.
[2021-05-15 20:26:50] [INFO ] Deduced a trap composed of 36 places in 272 ms of which 1 ms to minimize.
[2021-05-15 20:26:50] [INFO ] Deduced a trap composed of 33 places in 269 ms of which 1 ms to minimize.
[2021-05-15 20:26:50] [INFO ] Deduced a trap composed of 34 places in 273 ms of which 1 ms to minimize.
[2021-05-15 20:26:51] [INFO ] Deduced a trap composed of 35 places in 269 ms of which 1 ms to minimize.
[2021-05-15 20:26:51] [INFO ] Deduced a trap composed of 42 places in 259 ms of which 1 ms to minimize.
[2021-05-15 20:26:51] [INFO ] Deduced a trap composed of 44 places in 253 ms of which 1 ms to minimize.
[2021-05-15 20:26:52] [INFO ] Deduced a trap composed of 42 places in 251 ms of which 1 ms to minimize.
[2021-05-15 20:26:52] [INFO ] Deduced a trap composed of 43 places in 249 ms of which 1 ms to minimize.
[2021-05-15 20:26:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
[2021-05-15 20:26:52] [INFO ] [Real]Absence check using 361 positive place invariants in 111 ms returned sat
[2021-05-15 20:26:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:26:53] [INFO ] [Real]Absence check using state equation in 840 ms returned sat
[2021-05-15 20:26:54] [INFO ] Deduced a trap composed of 30 places in 464 ms of which 1 ms to minimize.
[2021-05-15 20:26:54] [INFO ] Deduced a trap composed of 20 places in 460 ms of which 1 ms to minimize.
[2021-05-15 20:26:55] [INFO ] Deduced a trap composed of 22 places in 456 ms of which 1 ms to minimize.
[2021-05-15 20:26:55] [INFO ] Deduced a trap composed of 18 places in 440 ms of which 1 ms to minimize.
[2021-05-15 20:26:56] [INFO ] Deduced a trap composed of 28 places in 448 ms of which 1 ms to minimize.
[2021-05-15 20:26:56] [INFO ] Deduced a trap composed of 16 places in 436 ms of which 1 ms to minimize.
[2021-05-15 20:26:57] [INFO ] Deduced a trap composed of 23 places in 428 ms of which 1 ms to minimize.
[2021-05-15 20:26:57] [INFO ] Deduced a trap composed of 13 places in 420 ms of which 1 ms to minimize.
[2021-05-15 20:26:58] [INFO ] Deduced a trap composed of 31 places in 422 ms of which 1 ms to minimize.
[2021-05-15 20:26:58] [INFO ] Deduced a trap composed of 25 places in 422 ms of which 1 ms to minimize.
[2021-05-15 20:26:59] [INFO ] Deduced a trap composed of 25 places in 403 ms of which 1 ms to minimize.
[2021-05-15 20:26:59] [INFO ] Deduced a trap composed of 21 places in 409 ms of which 1 ms to minimize.
[2021-05-15 20:27:00] [INFO ] Deduced a trap composed of 28 places in 396 ms of which 1 ms to minimize.
[2021-05-15 20:27:00] [INFO ] Deduced a trap composed of 37 places in 388 ms of which 1 ms to minimize.
[2021-05-15 20:27:01] [INFO ] Deduced a trap composed of 25 places in 385 ms of which 1 ms to minimize.
[2021-05-15 20:27:01] [INFO ] Deduced a trap composed of 29 places in 381 ms of which 1 ms to minimize.
[2021-05-15 20:27:02] [INFO ] Deduced a trap composed of 27 places in 370 ms of which 1 ms to minimize.
[2021-05-15 20:27:02] [INFO ] Deduced a trap composed of 31 places in 363 ms of which 1 ms to minimize.
[2021-05-15 20:27:03] [INFO ] Deduced a trap composed of 27 places in 352 ms of which 1 ms to minimize.
[2021-05-15 20:27:03] [INFO ] Deduced a trap composed of 39 places in 340 ms of which 1 ms to minimize.
[2021-05-15 20:27:03] [INFO ] Deduced a trap composed of 38 places in 344 ms of which 1 ms to minimize.
[2021-05-15 20:27:04] [INFO ] Deduced a trap composed of 29 places in 319 ms of which 1 ms to minimize.
[2021-05-15 20:27:04] [INFO ] Deduced a trap composed of 38 places in 311 ms of which 0 ms to minimize.
[2021-05-15 20:27:05] [INFO ] Deduced a trap composed of 31 places in 305 ms of which 1 ms to minimize.
[2021-05-15 20:27:05] [INFO ] Deduced a trap composed of 31 places in 301 ms of which 1 ms to minimize.
[2021-05-15 20:27:05] [INFO ] Deduced a trap composed of 38 places in 300 ms of which 1 ms to minimize.
[2021-05-15 20:27:06] [INFO ] Deduced a trap composed of 38 places in 303 ms of which 1 ms to minimize.
[2021-05-15 20:27:06] [INFO ] Deduced a trap composed of 40 places in 288 ms of which 1 ms to minimize.
[2021-05-15 20:27:06] [INFO ] Deduced a trap composed of 40 places in 292 ms of which 0 ms to minimize.
[2021-05-15 20:27:07] [INFO ] Deduced a trap composed of 41 places in 287 ms of which 1 ms to minimize.
[2021-05-15 20:27:07] [INFO ] Deduced a trap composed of 39 places in 287 ms of which 1 ms to minimize.
[2021-05-15 20:27:08] [INFO ] Deduced a trap composed of 39 places in 272 ms of which 1 ms to minimize.
[2021-05-15 20:27:08] [INFO ] Deduced a trap composed of 38 places in 278 ms of which 0 ms to minimize.
[2021-05-15 20:27:08] [INFO ] Deduced a trap composed of 39 places in 269 ms of which 0 ms to minimize.
[2021-05-15 20:27:09] [INFO ] Deduced a trap composed of 43 places in 264 ms of which 0 ms to minimize.
[2021-05-15 20:27:09] [INFO ] Deduced a trap composed of 24 places in 261 ms of which 1 ms to minimize.
[2021-05-15 20:27:09] [INFO ] Deduced a trap composed of 21 places in 256 ms of which 1 ms to minimize.
[2021-05-15 20:27:10] [INFO ] Deduced a trap composed of 53 places in 260 ms of which 1 ms to minimize.
[2021-05-15 20:27:10] [INFO ] Deduced a trap composed of 38 places in 250 ms of which 1 ms to minimize.
[2021-05-15 20:27:10] [INFO ] Deduced a trap composed of 36 places in 240 ms of which 0 ms to minimize.
[2021-05-15 20:27:11] [INFO ] Deduced a trap composed of 36 places in 239 ms of which 1 ms to minimize.
[2021-05-15 20:27:11] [INFO ] Deduced a trap composed of 42 places in 238 ms of which 1 ms to minimize.
[2021-05-15 20:27:11] [INFO ] Deduced a trap composed of 46 places in 232 ms of which 1 ms to minimize.
[2021-05-15 20:27:11] [INFO ] Deduced a trap composed of 47 places in 232 ms of which 1 ms to minimize.
[2021-05-15 20:27:12] [INFO ] Deduced a trap composed of 48 places in 222 ms of which 1 ms to minimize.
[2021-05-15 20:27:12] [INFO ] Deduced a trap composed of 54 places in 219 ms of which 1 ms to minimize.
[2021-05-15 20:27:12] [INFO ] Deduced a trap composed of 52 places in 212 ms of which 1 ms to minimize.
[2021-05-15 20:27:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
[2021-05-15 20:27:13] [INFO ] [Real]Absence check using 361 positive place invariants in 114 ms returned sat
[2021-05-15 20:27:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:27:14] [INFO ] [Real]Absence check using state equation in 847 ms returned sat
[2021-05-15 20:27:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 20:27:14] [INFO ] [Nat]Absence check using 361 positive place invariants in 114 ms returned sat
[2021-05-15 20:27:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 20:27:15] [INFO ] [Nat]Absence check using state equation in 877 ms returned sat
[2021-05-15 20:27:15] [INFO ] Deduced a trap composed of 21 places in 501 ms of which 1 ms to minimize.
[2021-05-15 20:27:16] [INFO ] Deduced a trap composed of 22 places in 498 ms of which 1 ms to minimize.
[2021-05-15 20:27:16] [INFO ] Deduced a trap composed of 19 places in 492 ms of which 1 ms to minimize.
[2021-05-15 20:27:17] [INFO ] Deduced a trap composed of 27 places in 484 ms of which 1 ms to minimize.
[2021-05-15 20:27:18] [INFO ] Deduced a trap composed of 21 places in 472 ms of which 1 ms to minimize.
[2021-05-15 20:27:18] [INFO ] Deduced a trap composed of 23 places in 473 ms of which 2 ms to minimize.
[2021-05-15 20:27:19] [INFO ] Deduced a trap composed of 16 places in 461 ms of which 1 ms to minimize.
[2021-05-15 20:27:19] [INFO ] Deduced a trap composed of 18 places in 457 ms of which 1 ms to minimize.
[2021-05-15 20:27:20] [INFO ] Deduced a trap composed of 23 places in 442 ms of which 1 ms to minimize.
[2021-05-15 20:27:20] [INFO ] Deduced a trap composed of 31 places in 435 ms of which 1 ms to minimize.
[2021-05-15 20:27:21] [INFO ] Deduced a trap composed of 25 places in 429 ms of which 1 ms to minimize.
[2021-05-15 20:27:21] [INFO ] Deduced a trap composed of 31 places in 420 ms of which 1 ms to minimize.
[2021-05-15 20:27:22] [INFO ] Deduced a trap composed of 31 places in 424 ms of which 1 ms to minimize.
[2021-05-15 20:27:22] [INFO ] Deduced a trap composed of 46 places in 424 ms of which 1 ms to minimize.
[2021-05-15 20:27:23] [INFO ] Deduced a trap composed of 37 places in 416 ms of which 1 ms to minimize.
[2021-05-15 20:27:23] [INFO ] Deduced a trap composed of 42 places in 412 ms of which 1 ms to minimize.
[2021-05-15 20:27:24] [INFO ] Deduced a trap composed of 33 places in 399 ms of which 1 ms to minimize.
[2021-05-15 20:27:24] [INFO ] Deduced a trap composed of 15 places in 399 ms of which 1 ms to minimize.
[2021-05-15 20:27:25] [INFO ] Deduced a trap composed of 34 places in 400 ms of which 1 ms to minimize.
[2021-05-15 20:27:25] [INFO ] Deduced a trap composed of 41 places in 409 ms of which 1 ms to minimize.
[2021-05-15 20:27:25] [INFO ] Deduced a trap composed of 38 places in 398 ms of which 2 ms to minimize.
[2021-05-15 20:27:26] [INFO ] Deduced a trap composed of 20 places in 393 ms of which 1 ms to minimize.
[2021-05-15 20:27:26] [INFO ] Deduced a trap composed of 28 places in 385 ms of which 1 ms to minimize.
[2021-05-15 20:27:27] [INFO ] Deduced a trap composed of 25 places in 377 ms of which 1 ms to minimize.
[2021-05-15 20:27:27] [INFO ] Deduced a trap composed of 30 places in 365 ms of which 1 ms to minimize.
[2021-05-15 20:27:28] [INFO ] Deduced a trap composed of 29 places in 366 ms of which 1 ms to minimize.
[2021-05-15 20:27:28] [INFO ] Deduced a trap composed of 32 places in 353 ms of which 1 ms to minimize.
[2021-05-15 20:27:29] [INFO ] Deduced a trap composed of 34 places in 347 ms of which 1 ms to minimize.
[2021-05-15 20:27:29] [INFO ] Deduced a trap composed of 38 places in 338 ms of which 1 ms to minimize.
[2021-05-15 20:27:29] [INFO ] Deduced a trap composed of 38 places in 334 ms of which 0 ms to minimize.
[2021-05-15 20:27:30] [INFO ] Deduced a trap composed of 39 places in 333 ms of which 1 ms to minimize.
[2021-05-15 20:27:30] [INFO ] Deduced a trap composed of 31 places in 331 ms of which 1 ms to minimize.
[2021-05-15 20:27:31] [INFO ] Deduced a trap composed of 35 places in 315 ms of which 1 ms to minimize.
[2021-05-15 20:27:31] [INFO ] Deduced a trap composed of 37 places in 314 ms of which 1 ms to minimize.
[2021-05-15 20:27:31] [INFO ] Deduced a trap composed of 41 places in 310 ms of which 1 ms to minimize.
[2021-05-15 20:27:32] [INFO ] Deduced a trap composed of 26 places in 300 ms of which 1 ms to minimize.
[2021-05-15 20:27:32] [INFO ] Deduced a trap composed of 19 places in 300 ms of which 1 ms to minimize.
[2021-05-15 20:27:32] [INFO ] Deduced a trap composed of 19 places in 284 ms of which 1 ms to minimize.
[2021-05-15 20:27:33] [INFO ] Deduced a trap composed of 36 places in 283 ms of which 1 ms to minimize.
[2021-05-15 20:27:33] [INFO ] Deduced a trap composed of 20 places in 273 ms of which 1 ms to minimize.
[2021-05-15 20:27:33] [INFO ] Deduced a trap composed of 43 places in 263 ms of which 0 ms to minimize.
[2021-05-15 20:27:34] [INFO ] Deduced a trap composed of 40 places in 262 ms of which 1 ms to minimize.
[2021-05-15 20:27:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
[2021-05-15 20:27:34] [INFO ] [Real]Absence check using 361 positive place invariants in 112 ms returned sat
[2021-05-15 20:27:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:27:35] [INFO ] [Real]Absence check using state equation in 843 ms returned sat
[2021-05-15 20:27:36] [INFO ] Deduced a trap composed of 20 places in 460 ms of which 1 ms to minimize.
[2021-05-15 20:27:36] [INFO ] Deduced a trap composed of 16 places in 448 ms of which 1 ms to minimize.
[2021-05-15 20:27:37] [INFO ] Deduced a trap composed of 16 places in 459 ms of which 1 ms to minimize.
[2021-05-15 20:27:37] [INFO ] Deduced a trap composed of 22 places in 457 ms of which 1 ms to minimize.
[2021-05-15 20:27:38] [INFO ] Deduced a trap composed of 20 places in 457 ms of which 1 ms to minimize.
[2021-05-15 20:27:38] [INFO ] Deduced a trap composed of 28 places in 438 ms of which 1 ms to minimize.
[2021-05-15 20:27:39] [INFO ] Deduced a trap composed of 25 places in 432 ms of which 1 ms to minimize.
[2021-05-15 20:27:39] [INFO ] Deduced a trap composed of 35 places in 419 ms of which 1 ms to minimize.
[2021-05-15 20:27:40] [INFO ] Deduced a trap composed of 33 places in 418 ms of which 1 ms to minimize.
[2021-05-15 20:27:40] [INFO ] Deduced a trap composed of 28 places in 426 ms of which 1 ms to minimize.
[2021-05-15 20:27:41] [INFO ] Deduced a trap composed of 25 places in 419 ms of which 1 ms to minimize.
[2021-05-15 20:27:41] [INFO ] Deduced a trap composed of 30 places in 406 ms of which 1 ms to minimize.
[2021-05-15 20:27:42] [INFO ] Deduced a trap composed of 42 places in 400 ms of which 1 ms to minimize.
[2021-05-15 20:27:42] [INFO ] Deduced a trap composed of 30 places in 402 ms of which 1 ms to minimize.
[2021-05-15 20:27:43] [INFO ] Deduced a trap composed of 44 places in 400 ms of which 1 ms to minimize.
[2021-05-15 20:27:43] [INFO ] Deduced a trap composed of 31 places in 390 ms of which 1 ms to minimize.
[2021-05-15 20:27:44] [INFO ] Deduced a trap composed of 17 places in 389 ms of which 1 ms to minimize.
[2021-05-15 20:27:44] [INFO ] Deduced a trap composed of 28 places in 381 ms of which 1 ms to minimize.
[2021-05-15 20:27:44] [INFO ] Deduced a trap composed of 27 places in 369 ms of which 1 ms to minimize.
[2021-05-15 20:27:45] [INFO ] Deduced a trap composed of 31 places in 365 ms of which 1 ms to minimize.
[2021-05-15 20:27:45] [INFO ] Deduced a trap composed of 27 places in 359 ms of which 1 ms to minimize.
[2021-05-15 20:27:46] [INFO ] Deduced a trap composed of 29 places in 353 ms of which 1 ms to minimize.
[2021-05-15 20:27:46] [INFO ] Deduced a trap composed of 32 places in 352 ms of which 1 ms to minimize.
[2021-05-15 20:27:47] [INFO ] Deduced a trap composed of 36 places in 347 ms of which 1 ms to minimize.
[2021-05-15 20:27:47] [INFO ] Deduced a trap composed of 35 places in 339 ms of which 1 ms to minimize.
[2021-05-15 20:27:47] [INFO ] Deduced a trap composed of 34 places in 339 ms of which 1 ms to minimize.
[2021-05-15 20:27:48] [INFO ] Deduced a trap composed of 24 places in 326 ms of which 1 ms to minimize.
[2021-05-15 20:27:48] [INFO ] Deduced a trap composed of 19 places in 314 ms of which 1 ms to minimize.
[2021-05-15 20:27:49] [INFO ] Deduced a trap composed of 41 places in 305 ms of which 1 ms to minimize.
[2021-05-15 20:27:49] [INFO ] Deduced a trap composed of 33 places in 309 ms of which 1 ms to minimize.
[2021-05-15 20:27:49] [INFO ] Deduced a trap composed of 37 places in 290 ms of which 1 ms to minimize.
[2021-05-15 20:27:50] [INFO ] Deduced a trap composed of 40 places in 294 ms of which 1 ms to minimize.
[2021-05-15 20:27:50] [INFO ] Deduced a trap composed of 38 places in 281 ms of which 1 ms to minimize.
[2021-05-15 20:27:50] [INFO ] Deduced a trap composed of 38 places in 275 ms of which 1 ms to minimize.
[2021-05-15 20:27:51] [INFO ] Deduced a trap composed of 39 places in 277 ms of which 1 ms to minimize.
[2021-05-15 20:27:51] [INFO ] Deduced a trap composed of 41 places in 276 ms of which 1 ms to minimize.
[2021-05-15 20:27:51] [INFO ] Deduced a trap composed of 37 places in 269 ms of which 1 ms to minimize.
[2021-05-15 20:27:52] [INFO ] Deduced a trap composed of 38 places in 269 ms of which 0 ms to minimize.
[2021-05-15 20:27:52] [INFO ] Deduced a trap composed of 46 places in 253 ms of which 1 ms to minimize.
[2021-05-15 20:27:52] [INFO ] Deduced a trap composed of 48 places in 248 ms of which 1 ms to minimize.
[2021-05-15 20:27:53] [INFO ] Deduced a trap composed of 41 places in 247 ms of which 0 ms to minimize.
[2021-05-15 20:27:53] [INFO ] Deduced a trap composed of 49 places in 240 ms of which 1 ms to minimize.
[2021-05-15 20:27:53] [INFO ] Deduced a trap composed of 41 places in 236 ms of which 1 ms to minimize.
[2021-05-15 20:27:54] [INFO ] Deduced a trap composed of 49 places in 238 ms of which 1 ms to minimize.
[2021-05-15 20:27:54] [INFO ] Deduced a trap composed of 41 places in 239 ms of which 0 ms to minimize.
[2021-05-15 20:27:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 11
[2021-05-15 20:27:54] [INFO ] [Real]Absence check using 361 positive place invariants in 113 ms returned sat
[2021-05-15 20:27:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:27:55] [INFO ] [Real]Absence check using state equation in 868 ms returned sat
[2021-05-15 20:27:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 20:27:56] [INFO ] [Nat]Absence check using 361 positive place invariants in 115 ms returned sat
[2021-05-15 20:27:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 20:27:57] [INFO ] [Nat]Absence check using state equation in 904 ms returned sat
[2021-05-15 20:27:57] [INFO ] Deduced a trap composed of 13 places in 473 ms of which 1 ms to minimize.
[2021-05-15 20:27:58] [INFO ] Deduced a trap composed of 22 places in 475 ms of which 1 ms to minimize.
[2021-05-15 20:27:58] [INFO ] Deduced a trap composed of 15 places in 467 ms of which 1 ms to minimize.
[2021-05-15 20:27:59] [INFO ] Deduced a trap composed of 20 places in 477 ms of which 1 ms to minimize.
[2021-05-15 20:27:59] [INFO ] Deduced a trap composed of 18 places in 460 ms of which 1 ms to minimize.
[2021-05-15 20:28:00] [INFO ] Deduced a trap composed of 21 places in 458 ms of which 2 ms to minimize.
[2021-05-15 20:28:00] [INFO ] Deduced a trap composed of 34 places in 449 ms of which 2 ms to minimize.
[2021-05-15 20:28:01] [INFO ] Deduced a trap composed of 21 places in 446 ms of which 1 ms to minimize.
[2021-05-15 20:28:01] [INFO ] Deduced a trap composed of 20 places in 438 ms of which 1 ms to minimize.
[2021-05-15 20:28:02] [INFO ] Deduced a trap composed of 18 places in 438 ms of which 1 ms to minimize.
[2021-05-15 20:28:02] [INFO ] Deduced a trap composed of 24 places in 420 ms of which 1 ms to minimize.
[2021-05-15 20:28:03] [INFO ] Deduced a trap composed of 21 places in 415 ms of which 1 ms to minimize.
[2021-05-15 20:28:03] [INFO ] Deduced a trap composed of 25 places in 409 ms of which 1 ms to minimize.
[2021-05-15 20:28:04] [INFO ] Deduced a trap composed of 31 places in 413 ms of which 1 ms to minimize.
[2021-05-15 20:28:04] [INFO ] Deduced a trap composed of 19 places in 412 ms of which 1 ms to minimize.
[2021-05-15 20:28:05] [INFO ] Deduced a trap composed of 24 places in 401 ms of which 2 ms to minimize.
[2021-05-15 20:28:05] [INFO ] Deduced a trap composed of 28 places in 392 ms of which 1 ms to minimize.
[2021-05-15 20:28:06] [INFO ] Deduced a trap composed of 28 places in 384 ms of which 1 ms to minimize.
[2021-05-15 20:28:06] [INFO ] Deduced a trap composed of 27 places in 384 ms of which 1 ms to minimize.
[2021-05-15 20:28:07] [INFO ] Deduced a trap composed of 28 places in 381 ms of which 1 ms to minimize.
[2021-05-15 20:28:07] [INFO ] Deduced a trap composed of 27 places in 384 ms of which 5 ms to minimize.
[2021-05-15 20:28:07] [INFO ] Deduced a trap composed of 20 places in 368 ms of which 1 ms to minimize.
[2021-05-15 20:28:08] [INFO ] Deduced a trap composed of 35 places in 367 ms of which 1 ms to minimize.
[2021-05-15 20:28:08] [INFO ] Deduced a trap composed of 32 places in 362 ms of which 1 ms to minimize.
[2021-05-15 20:28:09] [INFO ] Deduced a trap composed of 22 places in 366 ms of which 1 ms to minimize.
[2021-05-15 20:28:09] [INFO ] Deduced a trap composed of 36 places in 355 ms of which 1 ms to minimize.
[2021-05-15 20:28:10] [INFO ] Deduced a trap composed of 39 places in 356 ms of which 1 ms to minimize.
[2021-05-15 20:28:10] [INFO ] Deduced a trap composed of 37 places in 349 ms of which 1 ms to minimize.
[2021-05-15 20:28:10] [INFO ] Deduced a trap composed of 30 places in 347 ms of which 1 ms to minimize.
[2021-05-15 20:28:11] [INFO ] Deduced a trap composed of 42 places in 347 ms of which 1 ms to minimize.
[2021-05-15 20:28:11] [INFO ] Deduced a trap composed of 38 places in 336 ms of which 1 ms to minimize.
[2021-05-15 20:28:12] [INFO ] Deduced a trap composed of 38 places in 337 ms of which 0 ms to minimize.
[2021-05-15 20:28:12] [INFO ] Deduced a trap composed of 32 places in 331 ms of which 1 ms to minimize.
[2021-05-15 20:28:13] [INFO ] Deduced a trap composed of 40 places in 334 ms of which 1 ms to minimize.
[2021-05-15 20:28:13] [INFO ] Deduced a trap composed of 41 places in 334 ms of which 1 ms to minimize.
[2021-05-15 20:28:13] [INFO ] Deduced a trap composed of 38 places in 322 ms of which 0 ms to minimize.
[2021-05-15 20:28:14] [INFO ] Deduced a trap composed of 39 places in 322 ms of which 1 ms to minimize.
[2021-05-15 20:28:14] [INFO ] Deduced a trap composed of 47 places in 309 ms of which 1 ms to minimize.
[2021-05-15 20:28:14] [INFO ] Deduced a trap composed of 41 places in 306 ms of which 0 ms to minimize.
[2021-05-15 20:28:15] [INFO ] Deduced a trap composed of 37 places in 304 ms of which 1 ms to minimize.
[2021-05-15 20:28:15] [INFO ] Deduced a trap composed of 42 places in 304 ms of which 0 ms to minimize.
[2021-05-15 20:28:16] [INFO ] Deduced a trap composed of 39 places in 299 ms of which 1 ms to minimize.
[2021-05-15 20:28:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 12
[2021-05-15 20:28:16] [INFO ] [Real]Absence check using 361 positive place invariants in 117 ms returned sat
[2021-05-15 20:28:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:28:17] [INFO ] [Real]Absence check using state equation in 849 ms returned sat
[2021-05-15 20:28:17] [INFO ] Deduced a trap composed of 17 places in 463 ms of which 1 ms to minimize.
[2021-05-15 20:28:18] [INFO ] Deduced a trap composed of 25 places in 461 ms of which 1 ms to minimize.
[2021-05-15 20:28:18] [INFO ] Deduced a trap composed of 20 places in 452 ms of which 1 ms to minimize.
[2021-05-15 20:28:19] [INFO ] Deduced a trap composed of 18 places in 451 ms of which 1 ms to minimize.
[2021-05-15 20:28:19] [INFO ] Deduced a trap composed of 21 places in 438 ms of which 1 ms to minimize.
[2021-05-15 20:28:20] [INFO ] Deduced a trap composed of 13 places in 439 ms of which 6 ms to minimize.
[2021-05-15 20:28:20] [INFO ] Deduced a trap composed of 22 places in 442 ms of which 1 ms to minimize.
[2021-05-15 20:28:21] [INFO ] Deduced a trap composed of 20 places in 433 ms of which 1 ms to minimize.
[2021-05-15 20:28:21] [INFO ] Deduced a trap composed of 23 places in 425 ms of which 1 ms to minimize.
[2021-05-15 20:28:22] [INFO ] Deduced a trap composed of 21 places in 422 ms of which 2 ms to minimize.
[2021-05-15 20:28:22] [INFO ] Deduced a trap composed of 21 places in 416 ms of which 1 ms to minimize.
[2021-05-15 20:28:23] [INFO ] Deduced a trap composed of 28 places in 409 ms of which 1 ms to minimize.
[2021-05-15 20:28:23] [INFO ] Deduced a trap composed of 31 places in 401 ms of which 1 ms to minimize.
[2021-05-15 20:28:24] [INFO ] Deduced a trap composed of 33 places in 401 ms of which 1 ms to minimize.
[2021-05-15 20:28:24] [INFO ] Deduced a trap composed of 19 places in 402 ms of which 2 ms to minimize.
[2021-05-15 20:28:25] [INFO ] Deduced a trap composed of 41 places in 388 ms of which 1 ms to minimize.
[2021-05-15 20:28:25] [INFO ] Deduced a trap composed of 27 places in 378 ms of which 1 ms to minimize.
[2021-05-15 20:28:26] [INFO ] Deduced a trap composed of 36 places in 376 ms of which 1 ms to minimize.
[2021-05-15 20:28:26] [INFO ] Deduced a trap composed of 34 places in 375 ms of which 1 ms to minimize.
[2021-05-15 20:28:27] [INFO ] Deduced a trap composed of 32 places in 378 ms of which 1 ms to minimize.
[2021-05-15 20:28:27] [INFO ] Deduced a trap composed of 37 places in 366 ms of which 1 ms to minimize.
[2021-05-15 20:28:28] [INFO ] Deduced a trap composed of 35 places in 362 ms of which 1 ms to minimize.
[2021-05-15 20:28:28] [INFO ] Deduced a trap composed of 31 places in 358 ms of which 1 ms to minimize.
[2021-05-15 20:28:28] [INFO ] Deduced a trap composed of 28 places in 346 ms of which 1 ms to minimize.
[2021-05-15 20:28:29] [INFO ] Deduced a trap composed of 26 places in 349 ms of which 1 ms to minimize.
[2021-05-15 20:28:29] [INFO ] Deduced a trap composed of 24 places in 351 ms of which 1 ms to minimize.
[2021-05-15 20:28:30] [INFO ] Deduced a trap composed of 31 places in 328 ms of which 1 ms to minimize.
[2021-05-15 20:28:30] [INFO ] Deduced a trap composed of 38 places in 331 ms of which 1 ms to minimize.
[2021-05-15 20:28:30] [INFO ] Deduced a trap composed of 43 places in 327 ms of which 1 ms to minimize.
[2021-05-15 20:28:31] [INFO ] Deduced a trap composed of 47 places in 324 ms of which 0 ms to minimize.
[2021-05-15 20:28:31] [INFO ] Deduced a trap composed of 25 places in 315 ms of which 1 ms to minimize.
[2021-05-15 20:28:32] [INFO ] Deduced a trap composed of 30 places in 322 ms of which 1 ms to minimize.
[2021-05-15 20:28:32] [INFO ] Deduced a trap composed of 31 places in 305 ms of which 1 ms to minimize.
[2021-05-15 20:28:32] [INFO ] Deduced a trap composed of 42 places in 297 ms of which 1 ms to minimize.
[2021-05-15 20:28:33] [INFO ] Deduced a trap composed of 38 places in 292 ms of which 0 ms to minimize.
[2021-05-15 20:28:33] [INFO ] Deduced a trap composed of 42 places in 285 ms of which 1 ms to minimize.
[2021-05-15 20:28:33] [INFO ] Deduced a trap composed of 54 places in 280 ms of which 1 ms to minimize.
[2021-05-15 20:28:34] [INFO ] Deduced a trap composed of 33 places in 281 ms of which 1 ms to minimize.
[2021-05-15 20:28:34] [INFO ] Deduced a trap composed of 50 places in 271 ms of which 1 ms to minimize.
[2021-05-15 20:28:35] [INFO ] Deduced a trap composed of 27 places in 270 ms of which 1 ms to minimize.
[2021-05-15 20:28:35] [INFO ] Deduced a trap composed of 33 places in 267 ms of which 1 ms to minimize.
[2021-05-15 20:28:35] [INFO ] Deduced a trap composed of 39 places in 258 ms of which 1 ms to minimize.
[2021-05-15 20:28:36] [INFO ] Deduced a trap composed of 31 places in 247 ms of which 0 ms to minimize.
[2021-05-15 20:28:37] [INFO ] Deduced a trap composed of 14 places in 1108 ms of which 3 ms to minimize.
[2021-05-15 20:28:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 13
[2021-05-15 20:28:37] [INFO ] [Real]Absence check using 361 positive place invariants in 112 ms returned sat
[2021-05-15 20:28:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:28:38] [INFO ] [Real]Absence check using state equation in 851 ms returned sat
[2021-05-15 20:28:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 20:28:38] [INFO ] [Nat]Absence check using 361 positive place invariants in 111 ms returned sat
[2021-05-15 20:28:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 20:28:39] [INFO ] [Nat]Absence check using state equation in 828 ms returned sat
[2021-05-15 20:28:40] [INFO ] Deduced a trap composed of 19 places in 485 ms of which 1 ms to minimize.
[2021-05-15 20:28:40] [INFO ] Deduced a trap composed of 17 places in 477 ms of which 1 ms to minimize.
[2021-05-15 20:28:41] [INFO ] Deduced a trap composed of 22 places in 471 ms of which 1 ms to minimize.
[2021-05-15 20:28:41] [INFO ] Deduced a trap composed of 17 places in 467 ms of which 1 ms to minimize.
[2021-05-15 20:28:42] [INFO ] Deduced a trap composed of 16 places in 464 ms of which 1 ms to minimize.
[2021-05-15 20:28:42] [INFO ] Deduced a trap composed of 15 places in 454 ms of which 1 ms to minimize.
[2021-05-15 20:28:43] [INFO ] Deduced a trap composed of 20 places in 456 ms of which 1 ms to minimize.
[2021-05-15 20:28:43] [INFO ] Deduced a trap composed of 19 places in 447 ms of which 1 ms to minimize.
[2021-05-15 20:28:44] [INFO ] Deduced a trap composed of 26 places in 432 ms of which 1 ms to minimize.
[2021-05-15 20:28:44] [INFO ] Deduced a trap composed of 26 places in 425 ms of which 2 ms to minimize.
[2021-05-15 20:28:45] [INFO ] Deduced a trap composed of 13 places in 430 ms of which 1 ms to minimize.
[2021-05-15 20:28:45] [INFO ] Deduced a trap composed of 36 places in 424 ms of which 1 ms to minimize.
[2021-05-15 20:28:46] [INFO ] Deduced a trap composed of 27 places in 419 ms of which 1 ms to minimize.
[2021-05-15 20:28:46] [INFO ] Deduced a trap composed of 25 places in 419 ms of which 2 ms to minimize.
[2021-05-15 20:28:47] [INFO ] Deduced a trap composed of 36 places in 412 ms of which 1 ms to minimize.
[2021-05-15 20:28:47] [INFO ] Deduced a trap composed of 29 places in 415 ms of which 1 ms to minimize.
[2021-05-15 20:28:48] [INFO ] Deduced a trap composed of 21 places in 410 ms of which 1 ms to minimize.
[2021-05-15 20:28:48] [INFO ] Deduced a trap composed of 27 places in 403 ms of which 1 ms to minimize.
[2021-05-15 20:28:49] [INFO ] Deduced a trap composed of 33 places in 389 ms of which 1 ms to minimize.
[2021-05-15 20:28:49] [INFO ] Deduced a trap composed of 38 places in 383 ms of which 1 ms to minimize.
[2021-05-15 20:28:50] [INFO ] Deduced a trap composed of 36 places in 398 ms of which 1 ms to minimize.
[2021-05-15 20:28:50] [INFO ] Deduced a trap composed of 32 places in 373 ms of which 1 ms to minimize.
[2021-05-15 20:28:50] [INFO ] Deduced a trap composed of 28 places in 371 ms of which 1 ms to minimize.
[2021-05-15 20:28:51] [INFO ] Deduced a trap composed of 27 places in 369 ms of which 1 ms to minimize.
[2021-05-15 20:28:51] [INFO ] Deduced a trap composed of 54 places in 357 ms of which 1 ms to minimize.
[2021-05-15 20:28:52] [INFO ] Deduced a trap composed of 29 places in 344 ms of which 1 ms to minimize.
[2021-05-15 20:28:52] [INFO ] Deduced a trap composed of 32 places in 332 ms of which 1 ms to minimize.
[2021-05-15 20:28:53] [INFO ] Deduced a trap composed of 31 places in 325 ms of which 1 ms to minimize.
[2021-05-15 20:28:53] [INFO ] Deduced a trap composed of 38 places in 320 ms of which 1 ms to minimize.
[2021-05-15 20:28:53] [INFO ] Deduced a trap composed of 31 places in 316 ms of which 1 ms to minimize.
[2021-05-15 20:28:54] [INFO ] Deduced a trap composed of 28 places in 311 ms of which 1 ms to minimize.
[2021-05-15 20:28:54] [INFO ] Deduced a trap composed of 31 places in 306 ms of which 0 ms to minimize.
[2021-05-15 20:28:54] [INFO ] Deduced a trap composed of 33 places in 299 ms of which 1 ms to minimize.
[2021-05-15 20:28:55] [INFO ] Deduced a trap composed of 41 places in 299 ms of which 1 ms to minimize.
[2021-05-15 20:28:55] [INFO ] Deduced a trap composed of 43 places in 288 ms of which 1 ms to minimize.
[2021-05-15 20:28:56] [INFO ] Deduced a trap composed of 41 places in 284 ms of which 1 ms to minimize.
[2021-05-15 20:28:56] [INFO ] Deduced a trap composed of 37 places in 281 ms of which 1 ms to minimize.
[2021-05-15 20:28:56] [INFO ] Deduced a trap composed of 42 places in 275 ms of which 1 ms to minimize.
[2021-05-15 20:28:57] [INFO ] Deduced a trap composed of 39 places in 266 ms of which 1 ms to minimize.
[2021-05-15 20:28:57] [INFO ] Deduced a trap composed of 38 places in 270 ms of which 0 ms to minimize.
[2021-05-15 20:28:57] [INFO ] Deduced a trap composed of 36 places in 269 ms of which 1 ms to minimize.
[2021-05-15 20:28:58] [INFO ] Deduced a trap composed of 39 places in 261 ms of which 1 ms to minimize.
[2021-05-15 20:28:58] [INFO ] Deduced a trap composed of 39 places in 252 ms of which 1 ms to minimize.
[2021-05-15 20:28:59] [INFO ] Deduced a trap composed of 14 places in 1106 ms of which 2 ms to minimize.
[2021-05-15 20:28:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 14
[2021-05-15 20:28:59] [INFO ] [Real]Absence check using 361 positive place invariants in 111 ms returned sat
[2021-05-15 20:28:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:29:00] [INFO ] [Real]Absence check using state equation in 863 ms returned sat
[2021-05-15 20:29:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 20:29:01] [INFO ] [Nat]Absence check using 361 positive place invariants in 124 ms returned sat
[2021-05-15 20:29:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 20:29:02] [INFO ] [Nat]Absence check using state equation in 921 ms returned sat
[2021-05-15 20:29:02] [INFO ] Deduced a trap composed of 19 places in 507 ms of which 1 ms to minimize.
[2021-05-15 20:29:03] [INFO ] Deduced a trap composed of 18 places in 521 ms of which 1 ms to minimize.
[2021-05-15 20:29:03] [INFO ] Deduced a trap composed of 20 places in 509 ms of which 1 ms to minimize.
[2021-05-15 20:29:04] [INFO ] Deduced a trap composed of 26 places in 495 ms of which 1 ms to minimize.
[2021-05-15 20:29:04] [INFO ] Deduced a trap composed of 16 places in 482 ms of which 2 ms to minimize.
[2021-05-15 20:29:05] [INFO ] Deduced a trap composed of 24 places in 504 ms of which 2 ms to minimize.
[2021-05-15 20:29:06] [INFO ] Deduced a trap composed of 16 places in 474 ms of which 1 ms to minimize.
[2021-05-15 20:29:06] [INFO ] Deduced a trap composed of 30 places in 470 ms of which 1 ms to minimize.
[2021-05-15 20:29:07] [INFO ] Deduced a trap composed of 29 places in 468 ms of which 1 ms to minimize.
[2021-05-15 20:29:07] [INFO ] Deduced a trap composed of 21 places in 471 ms of which 1 ms to minimize.
[2021-05-15 20:29:08] [INFO ] Deduced a trap composed of 31 places in 479 ms of which 1 ms to minimize.
[2021-05-15 20:29:08] [INFO ] Deduced a trap composed of 23 places in 458 ms of which 1 ms to minimize.
[2021-05-15 20:29:09] [INFO ] Deduced a trap composed of 27 places in 455 ms of which 1 ms to minimize.
[2021-05-15 20:29:09] [INFO ] Deduced a trap composed of 23 places in 451 ms of which 1 ms to minimize.
[2021-05-15 20:29:10] [INFO ] Deduced a trap composed of 16 places in 438 ms of which 1 ms to minimize.
[2021-05-15 20:29:10] [INFO ] Deduced a trap composed of 24 places in 434 ms of which 1 ms to minimize.
[2021-05-15 20:29:11] [INFO ] Deduced a trap composed of 21 places in 419 ms of which 1 ms to minimize.
[2021-05-15 20:29:11] [INFO ] Deduced a trap composed of 27 places in 405 ms of which 1 ms to minimize.
[2021-05-15 20:29:12] [INFO ] Deduced a trap composed of 34 places in 401 ms of which 1 ms to minimize.
[2021-05-15 20:29:12] [INFO ] Deduced a trap composed of 28 places in 395 ms of which 1 ms to minimize.
[2021-05-15 20:29:13] [INFO ] Deduced a trap composed of 36 places in 418 ms of which 1 ms to minimize.
[2021-05-15 20:29:13] [INFO ] Deduced a trap composed of 25 places in 389 ms of which 1 ms to minimize.
[2021-05-15 20:29:14] [INFO ] Deduced a trap composed of 30 places in 378 ms of which 1 ms to minimize.
[2021-05-15 20:29:14] [INFO ] Deduced a trap composed of 17 places in 375 ms of which 1 ms to minimize.
[2021-05-15 20:29:15] [INFO ] Deduced a trap composed of 29 places in 361 ms of which 1 ms to minimize.
[2021-05-15 20:29:15] [INFO ] Deduced a trap composed of 29 places in 387 ms of which 1 ms to minimize.
[2021-05-15 20:29:15] [INFO ] Deduced a trap composed of 28 places in 351 ms of which 1 ms to minimize.
[2021-05-15 20:29:16] [INFO ] Deduced a trap composed of 36 places in 343 ms of which 1 ms to minimize.
[2021-05-15 20:29:16] [INFO ] Deduced a trap composed of 29 places in 343 ms of which 1 ms to minimize.
[2021-05-15 20:29:17] [INFO ] Deduced a trap composed of 28 places in 337 ms of which 1 ms to minimize.
[2021-05-15 20:29:17] [INFO ] Deduced a trap composed of 33 places in 338 ms of which 1 ms to minimize.
[2021-05-15 20:29:17] [INFO ] Deduced a trap composed of 37 places in 337 ms of which 1 ms to minimize.
[2021-05-15 20:29:18] [INFO ] Deduced a trap composed of 22 places in 333 ms of which 0 ms to minimize.
[2021-05-15 20:29:18] [INFO ] Deduced a trap composed of 45 places in 325 ms of which 1 ms to minimize.
[2021-05-15 20:29:19] [INFO ] Deduced a trap composed of 28 places in 325 ms of which 1 ms to minimize.
[2021-05-15 20:29:19] [INFO ] Deduced a trap composed of 39 places in 314 ms of which 1 ms to minimize.
[2021-05-15 20:29:19] [INFO ] Deduced a trap composed of 37 places in 311 ms of which 1 ms to minimize.
[2021-05-15 20:29:20] [INFO ] Deduced a trap composed of 39 places in 308 ms of which 1 ms to minimize.
[2021-05-15 20:29:20] [INFO ] Deduced a trap composed of 40 places in 302 ms of which 1 ms to minimize.
[2021-05-15 20:29:21] [INFO ] Deduced a trap composed of 39 places in 319 ms of which 1 ms to minimize.
[2021-05-15 20:29:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 15
[2021-05-15 20:29:21] [INFO ] [Real]Absence check using 361 positive place invariants in 113 ms returned sat
[2021-05-15 20:29:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 20:29:22] [INFO ] [Real]Absence check using state equation in 857 ms returned sat
[2021-05-15 20:29:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 20:29:22] [INFO ] [Nat]Absence check using 361 positive place invariants in 87 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)&&X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 2368 places. Attempting structural reductions.
Starting structural reductions, 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 310 ms. Remains 2361 /2368 variables (removed 7) and now considering 2161/2168 (removed 7) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2021-05-15 20:29:23] [INFO ] Computed 361 place invariants in 8 ms
[2021-05-15 20:29:23] [INFO ] Implicit Places using invariants in 662 ms returned []
// Phase 1: matrix 2161 rows 2361 cols
[2021-05-15 20:29:23] [INFO ] Computed 361 place invariants in 7 ms
[2021-05-15 20:29:25] [INFO ] Implicit Places using invariants and state equation in 1970 ms returned []
Implicit Place search using SMT with State Equation took 2634 ms to find 0 implicit places.
// Phase 1: matrix 2161 rows 2361 cols
[2021-05-15 20:29:25] [INFO ] Computed 361 place invariants in 9 ms
[2021-05-15 20:29:26] [INFO ] Dead Transitions using invariants and state equation in 1307 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2361/2368 places, 2161/2168 transitions.
Stuttering acceptance computed with spot in 268 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldIIPt-PT-040B-00 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (EQ s1004 0) (EQ s864 0)), p1:(AND (EQ s1489 1) (EQ s864 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 904 ms.
Stack based approach found an accepted trace after 1025 steps with 0 reset with depth 1026 and stack size 1026 in 10 ms.
FORMULA ShieldIIPt-PT-040B-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-00 finished in 5494 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||X((p1 U p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 2368 places. Attempting structural reductions.
Starting structural reductions, 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 258 ms. Remains 2361 /2368 variables (removed 7) and now considering 2161/2168 (removed 7) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2021-05-15 20:29:28] [INFO ] Computed 361 place invariants in 6 ms
[2021-05-15 20:29:29] [INFO ] Implicit Places using invariants in 658 ms returned []
// Phase 1: matrix 2161 rows 2361 cols
[2021-05-15 20:29:29] [INFO ] Computed 361 place invariants in 6 ms
[2021-05-15 20:29:31] [INFO ] Implicit Places using invariants and state equation in 1970 ms returned []
Implicit Place search using SMT with State Equation took 2629 ms to find 0 implicit places.
// Phase 1: matrix 2161 rows 2361 cols
[2021-05-15 20:29:31] [INFO ] Computed 361 place invariants in 6 ms
[2021-05-15 20:29:32] [INFO ] Dead Transitions using invariants and state equation in 1276 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2361/2368 places, 2161/2168 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-040B-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1735 1) (EQ s1764 1) (EQ s788 1)), p2:(AND (OR (EQ s79 1) (EQ s1059 1)) (EQ s1735 1) (EQ s1764 1) (EQ s788 1)), p1:(OR (EQ s79 1) (EQ s1059 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 719 ms.
Stack based approach found an accepted trace after 2780 steps with 0 reset with depth 2781 and stack size 2781 in 24 ms.
FORMULA ShieldIIPt-PT-040B-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-01 finished in 5013 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 2368 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 476 transitions
Trivial Post-agglo rules discarded 476 transitions
Performed 476 trivial Post agglomeration. Transition count delta: 476
Iterating post reduction 0 with 476 rules applied. Total rules applied 476 place count 2367 transition count 1691
Reduce places removed 476 places and 0 transitions.
Iterating post reduction 1 with 476 rules applied. Total rules applied 952 place count 1891 transition count 1691
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 952 place count 1891 transition count 1372
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 1590 place count 1572 transition count 1372
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1596 place count 1566 transition count 1366
Iterating global reduction 2 with 6 rules applied. Total rules applied 1602 place count 1566 transition count 1366
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1602 place count 1566 transition count 1361
Deduced a syphon composed of 5 places in 7 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 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 2 ms
Reduce places removed 677 places and 0 transitions.
Iterating global reduction 2 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 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 3 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: -66
Deduced a syphon composed of 101 places in 2 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 748
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3207 place count 764 transition count 761
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 3208 place count 764 transition count 761
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3209 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 3211 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 3211 place count 761 transition count 759
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 3213 place count 760 transition count 759
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3214 place count 759 transition count 758
Applied a total of 3214 rules in 731 ms. Remains 759 /2368 variables (removed 1609) and now considering 758/2168 (removed 1410) transitions.
// Phase 1: matrix 758 rows 759 cols
[2021-05-15 20:29:33] [INFO ] Computed 359 place invariants in 2 ms
[2021-05-15 20:29:34] [INFO ] Implicit Places using invariants in 386 ms returned [748]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 387 ms to find 1 implicit places.
[2021-05-15 20:29:34] [INFO ] Redundant transitions in 42 ms returned []
// Phase 1: matrix 758 rows 758 cols
[2021-05-15 20:29:34] [INFO ] Computed 358 place invariants in 2 ms
[2021-05-15 20:29:34] [INFO ] Dead Transitions using invariants and state equation in 375 ms returned []
Starting structural reductions, 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 30 ms. Remains 757 /758 variables (removed 1) and now considering 757/758 (removed 1) transitions.
// Phase 1: matrix 757 rows 757 cols
[2021-05-15 20:29:34] [INFO ] Computed 358 place invariants in 1 ms
[2021-05-15 20:29:35] [INFO ] Implicit Places using invariants in 385 ms returned []
// Phase 1: matrix 757 rows 757 cols
[2021-05-15 20:29:35] [INFO ] Computed 358 place invariants in 1 ms
[2021-05-15 20:29:35] [INFO ] Implicit Places using invariants and state equation in 688 ms returned []
Implicit Place search using SMT with State Equation took 1074 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 757/2368 places, 757/2168 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-03 automaton TGBA [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:(NEQ s112 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]]
Product exploration explored 100000 steps with 0 reset in 742 ms.
Product exploration explored 100000 steps with 0 reset in 946 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 709 ms.
Product exploration explored 100000 steps with 0 reset in 962 ms.
[2021-05-15 20:29:39] [INFO ] Flatten gal took : 41 ms
[2021-05-15 20:29:39] [INFO ] Flatten gal took : 47 ms
[2021-05-15 20:29:39] [INFO ] Time to serialize gal into /tmp/LTL10918334350294163808.gal : 30 ms
[2021-05-15 20:29:39] [INFO ] Time to serialize properties into /tmp/LTL14434007623748222250.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10918334350294163808.gal, -t, CGAL, -LTL, /tmp/LTL14434007623748222250.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10918334350294163808.gal -t CGAL -LTL /tmp/LTL14434007623748222250.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(p428!=1)"))))
Formula 0 simplified : !GF"(p428!=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1.60065e+49 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
425 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,4.33558,126772,1,0,9,738485,24,5,20960,215510,22
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-040B-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldIIPt-PT-040B-03 finished in 11111 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0 U (p1&&F(p2)))&&G(p3))))], workingDir=/home/mcc/execution]
Support contains 4 out of 2368 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2364 transition count 2164
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2364 transition count 2164
Applied a total of 8 rules in 228 ms. Remains 2364 /2368 variables (removed 4) and now considering 2164/2168 (removed 4) transitions.
// Phase 1: matrix 2164 rows 2364 cols
[2021-05-15 20:29:44] [INFO ] Computed 361 place invariants in 6 ms
[2021-05-15 20:29:45] [INFO ] Implicit Places using invariants in 738 ms returned []
// Phase 1: matrix 2164 rows 2364 cols
[2021-05-15 20:29:45] [INFO ] Computed 361 place invariants in 8 ms
[2021-05-15 20:29:47] [INFO ] Implicit Places using invariants and state equation in 1931 ms returned []
Implicit Place search using SMT with State Equation took 2669 ms to find 0 implicit places.
// Phase 1: matrix 2164 rows 2364 cols
[2021-05-15 20:29:47] [INFO ] Computed 361 place invariants in 5 ms
[2021-05-15 20:29:48] [INFO ] Dead Transitions using invariants and state equation in 1261 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2364/2368 places, 2164/2168 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p3), (OR (NOT p1) (NOT p2) (NOT p3)), true, (OR (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-040B-04 automaton TGBA [mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 p3), acceptance={0} source=3 dest: 0}, { cond=(NOT p3), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p2 p3), acceptance={0} source=4 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (NOT p3)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p2) p3), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0 p3), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p3:(AND (EQ s493 1) (EQ s334 1)), p2:(NEQ s676 0), p1:(EQ s184 0), p0:(EQ s184 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 1 ms.
FORMULA ShieldIIPt-PT-040B-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-04 finished in 4318 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p0))&&G((X(G(p1)) U (p2 U (p3||G(p2))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 2368 places. Attempting structural reductions.
Starting structural reductions, 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 233 ms. Remains 2362 /2368 variables (removed 6) and now considering 2162/2168 (removed 6) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2021-05-15 20:29:48] [INFO ] Computed 361 place invariants in 6 ms
[2021-05-15 20:29:49] [INFO ] Implicit Places using invariants in 669 ms returned []
// Phase 1: matrix 2162 rows 2362 cols
[2021-05-15 20:29:49] [INFO ] Computed 361 place invariants in 5 ms
[2021-05-15 20:29:51] [INFO ] Implicit Places using invariants and state equation in 1870 ms returned []
Implicit Place search using SMT with State Equation took 2541 ms to find 0 implicit places.
// Phase 1: matrix 2162 rows 2362 cols
[2021-05-15 20:29:51] [INFO ] Computed 361 place invariants in 5 ms
[2021-05-15 20:29:52] [INFO ] Dead Transitions using invariants and state equation in 1297 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2362/2368 places, 2162/2168 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), true, (AND (NOT p3) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-040B-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p3) p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(NEQ s380 1), p3:(AND (NEQ s247 1) (NEQ s1945 1)), p2:(NEQ s1945 1), p1:(EQ s1122 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14633 steps with 1 reset in 107 ms.
FORMULA ShieldIIPt-PT-040B-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-05 finished in 4423 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 2368 places. Attempting structural reductions.
Starting structural reductions, 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 320 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 320 Pre rules applied. Total rules applied 950 place count 1892 transition count 1372
Deduced a syphon composed of 320 places in 2 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 3 with 640 rules applied. Total rules applied 1590 place count 1572 transition count 1372
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1596 place count 1566 transition count 1366
Iterating global reduction 3 with 6 rules applied. Total rules applied 1602 place count 1566 transition count 1366
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1602 place count 1566 transition count 1361
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 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 0 ms
Reduce places removed 676 places and 0 transitions.
Iterating global reduction 3 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 3 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 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: -67
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 3169 place count 783 transition count 750
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 3203 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 3204 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 3206 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 3206 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 3208 place count 762 transition count 759
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3209 place count 761 transition count 758
Applied a total of 3209 rules in 522 ms. Remains 761 /2368 variables (removed 1607) and now considering 758/2168 (removed 1410) transitions.
// Phase 1: matrix 758 rows 761 cols
[2021-05-15 20:29:53] [INFO ] Computed 359 place invariants in 2 ms
[2021-05-15 20:29:54] [INFO ] Implicit Places using invariants in 476 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 478 ms to find 1 implicit places.
[2021-05-15 20:29:54] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 758 rows 760 cols
[2021-05-15 20:29:54] [INFO ] Computed 358 place invariants in 1 ms
[2021-05-15 20:29:54] [INFO ] Dead Transitions using invariants and state equation in 411 ms returned []
Starting structural reductions, iteration 1 : 760/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 759 transition count 757
Applied a total of 2 rules in 25 ms. Remains 759 /760 variables (removed 1) and now considering 757/758 (removed 1) transitions.
// Phase 1: matrix 757 rows 759 cols
[2021-05-15 20:29:54] [INFO ] Computed 358 place invariants in 1 ms
[2021-05-15 20:29:54] [INFO ] Implicit Places using invariants in 440 ms returned []
// Phase 1: matrix 757 rows 759 cols
[2021-05-15 20:29:54] [INFO ] Computed 358 place invariants in 2 ms
[2021-05-15 20:29:55] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-15 20:29:55] [INFO ] Implicit Places using invariants and state equation in 805 ms returned []
Implicit Place search using SMT with State Equation took 1245 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 759/2368 places, 757/2168 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s115 1) (NEQ s518 0))], 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-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-07 finished in 2734 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(G(p0))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 2368 places. Attempting structural reductions.
Starting structural reductions, 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 241 ms. Remains 2362 /2368 variables (removed 6) and now considering 2162/2168 (removed 6) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2021-05-15 20:29:55] [INFO ] Computed 361 place invariants in 6 ms
[2021-05-15 20:29:56] [INFO ] Implicit Places using invariants in 655 ms returned []
// Phase 1: matrix 2162 rows 2362 cols
[2021-05-15 20:29:56] [INFO ] Computed 361 place invariants in 5 ms
[2021-05-15 20:29:58] [INFO ] Implicit Places using invariants and state equation in 1917 ms returned []
Implicit Place search using SMT with State Equation took 2574 ms to find 0 implicit places.
// Phase 1: matrix 2162 rows 2362 cols
[2021-05-15 20:29:58] [INFO ] Computed 361 place invariants in 5 ms
[2021-05-15 20:29:59] [INFO ] Dead Transitions using invariants and state equation in 1267 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2362/2368 places, 2162/2168 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(NEQ s2238 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-040B-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-08 finished in 4225 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 2368 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2368/2368 places, 2168/2168 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 2367 transition count 1690
Reduce places removed 477 places and 0 transitions.
Iterating post reduction 1 with 477 rules applied. Total rules applied 954 place count 1890 transition count 1690
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 954 place count 1890 transition count 1371
Deduced a syphon composed of 319 places in 4 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 2 with 638 rules applied. Total rules applied 1592 place count 1571 transition count 1371
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1597 place count 1566 transition count 1366
Iterating global reduction 2 with 5 rules applied. Total rules applied 1602 place count 1566 transition count 1366
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1602 place count 1566 transition count 1362
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 1610 place count 1562 transition count 1362
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 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: -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 3173 place count 781 transition count 746
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 759
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3210 place count 762 transition count 758
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3212 place count 760 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 3212 place count 760 transition count 757
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 3214 place count 759 transition count 757
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3215 place count 758 transition count 756
Applied a total of 3215 rules in 423 ms. Remains 758 /2368 variables (removed 1610) and now considering 756/2168 (removed 1412) transitions.
// Phase 1: matrix 756 rows 758 cols
[2021-05-15 20:30:00] [INFO ] Computed 359 place invariants in 1 ms
[2021-05-15 20:30:00] [INFO ] Implicit Places using invariants in 439 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 441 ms to find 1 implicit places.
[2021-05-15 20:30:00] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 756 rows 757 cols
[2021-05-15 20:30:00] [INFO ] Computed 358 place invariants in 1 ms
[2021-05-15 20:30:01] [INFO ] Dead Transitions using invariants and state equation in 360 ms returned []
Starting structural reductions, iteration 1 : 757/2368 places, 756/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 755
Applied a total of 2 rules in 22 ms. Remains 756 /757 variables (removed 1) and now considering 755/756 (removed 1) transitions.
// Phase 1: matrix 755 rows 756 cols
[2021-05-15 20:30:01] [INFO ] Computed 358 place invariants in 1 ms
[2021-05-15 20:30:01] [INFO ] Implicit Places using invariants in 459 ms returned []
// Phase 1: matrix 755 rows 756 cols
[2021-05-15 20:30:01] [INFO ] Computed 358 place invariants in 1 ms
[2021-05-15 20:30:02] [INFO ] Implicit Places using invariants and state equation in 717 ms returned []
Implicit Place search using SMT with State Equation took 1176 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 756/2368 places, 755/2168 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-040B-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-09 finished in 2467 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 2368 places. Attempting structural reductions.
Starting structural reductions, 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 1 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 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1600 place count 1567 transition count 1362
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1610 place count 1562 transition count 1362
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 2964 place count 885 transition count 685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 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: -67
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 3169 place count 783 transition count 750
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 3203 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 3204 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 3206 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 3206 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 3208 place count 762 transition count 759
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3209 place count 761 transition count 758
Applied a total of 3209 rules in 340 ms. Remains 761 /2368 variables (removed 1607) and now considering 758/2168 (removed 1410) transitions.
// Phase 1: matrix 758 rows 761 cols
[2021-05-15 20:30:02] [INFO ] Computed 359 place invariants in 1 ms
[2021-05-15 20:30:03] [INFO ] Implicit Places using invariants in 453 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 455 ms to find 1 implicit places.
[2021-05-15 20:30:03] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 758 rows 760 cols
[2021-05-15 20:30:03] [INFO ] Computed 358 place invariants in 1 ms
[2021-05-15 20:30:03] [INFO ] Dead Transitions using invariants and state equation in 372 ms returned []
Starting structural reductions, iteration 1 : 760/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 759 transition count 757
Applied a total of 2 rules in 20 ms. Remains 759 /760 variables (removed 1) and now considering 757/758 (removed 1) transitions.
// Phase 1: matrix 757 rows 759 cols
[2021-05-15 20:30:03] [INFO ] Computed 358 place invariants in 1 ms
[2021-05-15 20:30:04] [INFO ] Implicit Places using invariants in 444 ms returned []
// Phase 1: matrix 757 rows 759 cols
[2021-05-15 20:30:04] [INFO ] Computed 358 place invariants in 2 ms
[2021-05-15 20:30:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-15 20:30:04] [INFO ] Implicit Places using invariants and state equation in 728 ms returned []
Implicit Place search using SMT with State Equation took 1172 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 759/2368 places, 757/2168 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-040B-10 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s37 1), p1:(NEQ s265 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 769 ms.
Product exploration explored 100000 steps with 0 reset in 1002 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 739 ms.
Product exploration explored 100000 steps with 0 reset in 945 ms.
[2021-05-15 20:30:08] [INFO ] Flatten gal took : 30 ms
[2021-05-15 20:30:08] [INFO ] Flatten gal took : 28 ms
[2021-05-15 20:30:08] [INFO ] Time to serialize gal into /tmp/LTL4071988880745887027.gal : 7 ms
[2021-05-15 20:30:08] [INFO ] Time to serialize properties into /tmp/LTL10400137559621554063.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4071988880745887027.gal, -t, CGAL, -LTL, /tmp/LTL10400137559621554063.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4071988880745887027.gal -t CGAL -LTL /tmp/LTL10400137559621554063.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("(p157!=1)"))||(G("(p970!=1)")))))
Formula 0 simplified : !F(G"(p157!=1)" | G"(p970!=1)")
Reverse transition relation is NOT exact ! Due to transitions t1, t42, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/755/2/757
Computing Next relation with stutter on 1.60065e+49 deadlock states
Detected timeout of ITS tools.
[2021-05-15 20:30:23] [INFO ] Flatten gal took : 28 ms
[2021-05-15 20:30:23] [INFO ] Applying decomposition
[2021-05-15 20:30:23] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph329914263091631127.txt, -o, /tmp/graph329914263091631127.bin, -w, /tmp/graph329914263091631127.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph329914263091631127.bin, -l, -1, -v, -w, /tmp/graph329914263091631127.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 20:30:23] [INFO ] Decomposing Gal with order
[2021-05-15 20:30:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 20:30:23] [INFO ] Removed a total of 851 redundant transitions.
[2021-05-15 20:30:23] [INFO ] Flatten gal took : 100 ms
[2021-05-15 20:30:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 350 labels/synchronizations in 20 ms.
[2021-05-15 20:30:24] [INFO ] Time to serialize gal into /tmp/LTL6925913183524120443.gal : 11 ms
[2021-05-15 20:30:24] [INFO ] Time to serialize properties into /tmp/LTL15284769694825665102.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6925913183524120443.gal, -t, CGAL, -LTL, /tmp/LTL15284769694825665102.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6925913183524120443.gal -t CGAL -LTL /tmp/LTL15284769694825665102.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G("(i1.u15.p157!=1)"))||(G("(i8.u110.p970!=1)")))))
Formula 0 simplified : !F(G"(i1.u15.p157!=1)" | G"(i8.u110.p970!=1)")
Reverse transition relation is NOT exact ! Due to transitions i1.t1, i1.u15.t42, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/443/2/445
Computing Next relation with stutter on 1.60065e+49 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13826550281225430632
[2021-05-15 20:30:39] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13826550281225430632
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13826550281225430632]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13826550281225430632] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13826550281225430632] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property ShieldIIPt-PT-040B-10 finished in 37629 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(F(p1))&&p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 2368 places. Attempting structural reductions.
Starting structural reductions, 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 258 ms. Remains 2361 /2368 variables (removed 7) and now considering 2161/2168 (removed 7) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2021-05-15 20:30:40] [INFO ] Computed 361 place invariants in 6 ms
[2021-05-15 20:30:40] [INFO ] Implicit Places using invariants in 637 ms returned []
// Phase 1: matrix 2161 rows 2361 cols
[2021-05-15 20:30:40] [INFO ] Computed 361 place invariants in 5 ms
[2021-05-15 20:30:42] [INFO ] Implicit Places using invariants and state equation in 1930 ms returned []
Implicit Place search using SMT with State Equation took 2587 ms to find 0 implicit places.
// Phase 1: matrix 2161 rows 2361 cols
[2021-05-15 20:30:42] [INFO ] Computed 361 place invariants in 5 ms
[2021-05-15 20:30:44] [INFO ] Dead Transitions using invariants and state equation in 1266 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2361/2368 places, 2161/2168 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : ShieldIIPt-PT-040B-12 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (EQ s2279 0) (EQ s1932 0)), p0:(AND (NEQ s472 0) (NEQ s497 0) (NEQ s506 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][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-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-12 finished in 4212 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 2368 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 476 transitions
Trivial Post-agglo rules discarded 476 transitions
Performed 476 trivial Post agglomeration. Transition count delta: 476
Iterating post reduction 0 with 476 rules applied. Total rules applied 476 place count 2367 transition count 1691
Reduce places removed 476 places and 0 transitions.
Iterating post reduction 1 with 476 rules applied. Total rules applied 952 place count 1891 transition count 1691
Performed 318 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 318 Pre rules applied. Total rules applied 952 place count 1891 transition count 1373
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 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 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1600 place count 1567 transition count 1362
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1610 place count 1562 transition count 1362
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 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 1 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 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3207 place count 764 transition count 758
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3208 place count 763 transition count 757
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3210 place count 761 transition count 757
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3210 place count 761 transition count 756
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 3212 place count 760 transition count 756
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3213 place count 759 transition count 755
Applied a total of 3213 rules in 330 ms. Remains 759 /2368 variables (removed 1609) and now considering 755/2168 (removed 1413) transitions.
// Phase 1: matrix 755 rows 759 cols
[2021-05-15 20:30:44] [INFO ] Computed 359 place invariants in 1 ms
[2021-05-15 20:30:44] [INFO ] Implicit Places using invariants in 383 ms returned [748]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 384 ms to find 1 implicit places.
[2021-05-15 20:30:44] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 755 rows 758 cols
[2021-05-15 20:30:45] [INFO ] Computed 358 place invariants in 1 ms
[2021-05-15 20:30:45] [INFO ] Dead Transitions using invariants and state equation in 362 ms returned []
Starting structural reductions, iteration 1 : 758/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 757 transition count 754
Applied a total of 2 rules in 21 ms. Remains 757 /758 variables (removed 1) and now considering 754/755 (removed 1) transitions.
// Phase 1: matrix 754 rows 757 cols
[2021-05-15 20:30:45] [INFO ] Computed 358 place invariants in 1 ms
[2021-05-15 20:30:45] [INFO ] Implicit Places using invariants in 381 ms returned []
// Phase 1: matrix 754 rows 757 cols
[2021-05-15 20:30:45] [INFO ] Computed 358 place invariants in 1 ms
[2021-05-15 20:30:46] [INFO ] Implicit Places using invariants and state equation in 693 ms returned []
Implicit Place search using SMT with State Equation took 1075 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 757/2368 places, 754/2168 transitions.
Stuttering acceptance computed with spot in 30 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(NEQ s630 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 173 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-040B-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-13 finished in 2225 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 2368 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2368/2368 places, 2168/2168 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 476 transitions
Trivial Post-agglo rules discarded 476 transitions
Performed 476 trivial Post agglomeration. Transition count delta: 476
Iterating post reduction 0 with 476 rules applied. Total rules applied 476 place count 2367 transition count 1691
Reduce places removed 476 places and 0 transitions.
Iterating post reduction 1 with 476 rules applied. Total rules applied 952 place count 1891 transition count 1691
Performed 318 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 318 Pre rules applied. Total rules applied 952 place count 1891 transition count 1373
Deduced a syphon composed of 318 places in 1 ms
Reduce places removed 318 places and 0 transitions.
Iterating global reduction 2 with 636 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 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1600 place count 1567 transition count 1362
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 1610 place count 1562 transition count 1362
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 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 0 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 1 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 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3207 place count 764 transition count 758
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3208 place count 763 transition count 757
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3210 place count 761 transition count 757
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3210 place count 761 transition count 756
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 3212 place count 760 transition count 756
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3213 place count 759 transition count 755
Applied a total of 3213 rules in 334 ms. Remains 759 /2368 variables (removed 1609) and now considering 755/2168 (removed 1413) transitions.
// Phase 1: matrix 755 rows 759 cols
[2021-05-15 20:30:46] [INFO ] Computed 359 place invariants in 1 ms
[2021-05-15 20:30:47] [INFO ] Implicit Places using invariants in 379 ms returned [748]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 380 ms to find 1 implicit places.
[2021-05-15 20:30:47] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 755 rows 758 cols
[2021-05-15 20:30:47] [INFO ] Computed 358 place invariants in 1 ms
[2021-05-15 20:30:47] [INFO ] Dead Transitions using invariants and state equation in 358 ms returned []
Starting structural reductions, iteration 1 : 758/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 757 transition count 754
Applied a total of 2 rules in 21 ms. Remains 757 /758 variables (removed 1) and now considering 754/755 (removed 1) transitions.
// Phase 1: matrix 754 rows 757 cols
[2021-05-15 20:30:47] [INFO ] Computed 358 place invariants in 1 ms
[2021-05-15 20:30:47] [INFO ] Implicit Places using invariants in 385 ms returned []
// Phase 1: matrix 754 rows 757 cols
[2021-05-15 20:30:47] [INFO ] Computed 358 place invariants in 1 ms
[2021-05-15 20:30:48] [INFO ] Implicit Places using invariants and state equation in 690 ms returned []
Implicit Place search using SMT with State Equation took 1077 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 757/2368 places, 754/2168 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s459 0)], 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 6881 steps with 0 reset in 45 ms.
FORMULA ShieldIIPt-PT-040B-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-14 finished in 2260 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 2368 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2368/2368 places, 2168/2168 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 2367 transition count 1690
Reduce places removed 477 places and 0 transitions.
Iterating post reduction 1 with 477 rules applied. Total rules applied 954 place count 1890 transition count 1690
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 954 place count 1890 transition count 1371
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 1592 place count 1571 transition count 1371
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1598 place count 1565 transition count 1365
Iterating global reduction 2 with 6 rules applied. Total rules applied 1604 place count 1565 transition count 1365
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1604 place count 1565 transition count 1360
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 1614 place count 1560 transition count 1360
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 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: -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 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 3 with 36 rules applied. Total rules applied 3207 place count 764 transition count 761
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3208 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 3210 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 3210 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 3212 place count 760 transition count 759
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3213 place count 759 transition count 758
Applied a total of 3213 rules in 317 ms. Remains 759 /2368 variables (removed 1609) and now considering 758/2168 (removed 1410) transitions.
// Phase 1: matrix 758 rows 759 cols
[2021-05-15 20:30:49] [INFO ] Computed 359 place invariants in 1 ms
[2021-05-15 20:30:49] [INFO ] Implicit Places using invariants in 386 ms returned [748]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 396 ms to find 1 implicit places.
[2021-05-15 20:30:49] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 758 rows 758 cols
[2021-05-15 20:30:49] [INFO ] Computed 358 place invariants in 1 ms
[2021-05-15 20:30:49] [INFO ] Dead Transitions using invariants and state equation in 356 ms returned []
Starting structural reductions, 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 22 ms. Remains 757 /758 variables (removed 1) and now considering 757/758 (removed 1) transitions.
// Phase 1: matrix 757 rows 757 cols
[2021-05-15 20:30:49] [INFO ] Computed 358 place invariants in 1 ms
[2021-05-15 20:30:50] [INFO ] Implicit Places using invariants in 390 ms returned []
// Phase 1: matrix 757 rows 757 cols
[2021-05-15 20:30:50] [INFO ] Computed 358 place invariants in 1 ms
[2021-05-15 20:30:50] [INFO ] State equation strengthened by 135 read => feed constraints.
[2021-05-15 20:30:51] [INFO ] Implicit Places using invariants and state equation in 1642 ms returned []
Implicit Place search using SMT with State Equation took 2032 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 757/2368 places, 757/2168 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-15 automaton TGBA [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 s1 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-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-15 finished in 3189 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13914986406651914268
[2021-05-15 20:30:51] [INFO ] Too many transitions (2168) to apply POR reductions. Disabling POR matrices.
[2021-05-15 20:30:52] [INFO ] Applying decomposition
[2021-05-15 20:30:52] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13914986406651914268
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13914986406651914268]
[2021-05-15 20:30:52] [INFO ] Flatten gal took : 133 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph2243145202612860151.txt, -o, /tmp/graph2243145202612860151.bin, -w, /tmp/graph2243145202612860151.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph2243145202612860151.bin, -l, -1, -v, -w, /tmp/graph2243145202612860151.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 20:30:52] [INFO ] Decomposing Gal with order
[2021-05-15 20:30:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 20:30:52] [INFO ] Removed a total of 394 redundant transitions.
[2021-05-15 20:30:52] [INFO ] Flatten gal took : 126 ms
[2021-05-15 20:30:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 21 ms.
[2021-05-15 20:30:52] [INFO ] Time to serialize gal into /tmp/LTLFireability1075287253483692086.gal : 23 ms
[2021-05-15 20:30:52] [INFO ] Time to serialize properties into /tmp/LTLFireability822576384211931178.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability1075287253483692086.gal, -t, CGAL, -LTL, /tmp/LTLFireability822576384211931178.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability1075287253483692086.gal -t CGAL -LTL /tmp/LTLFireability822576384211931178.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G("(i1.i5.u55.p157!=1)"))||(G("(i13.i3.u307.p970!=1)")))))
Formula 0 simplified : !F(G"(i1.i5.u55.p157!=1)" | G"(i13.i3.u307.p970!=1)")
Compilation finished in 22177 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13914986406651914268]
Link finished in 56 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(([]((LTLAPp0==true))||[]((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin13914986406651914268]
WARNING : LTSmin timed out (>276 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(([]((LTLAPp0==true))||[]((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin13914986406651914268]
Retrying LTSmin with larger timeout 2208 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(([]((LTLAPp0==true))||[]((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin13914986406651914268]
Detected timeout of ITS tools.
[2021-05-15 20:53:17] [INFO ] Applying decomposition
[2021-05-15 20:53:17] [INFO ] Flatten gal took : 179 ms
[2021-05-15 20:53:17] [INFO ] Decomposing Gal with order
[2021-05-15 20:53:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 20:53:18] [INFO ] Removed a total of 116 redundant transitions.
[2021-05-15 20:53:18] [INFO ] Flatten gal took : 251 ms
[2021-05-15 20:53:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 44 ms.
[2021-05-15 20:53:19] [INFO ] Time to serialize gal into /tmp/LTLFireability13582820534918422738.gal : 44 ms
[2021-05-15 20:53:19] [INFO ] Time to serialize properties into /tmp/LTLFireability13417160742366859348.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability13582820534918422738.gal, -t, CGAL, -LTL, /tmp/LTLFireability13417160742366859348.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability13582820534918422738.gal -t CGAL -LTL /tmp/LTLFireability13417160742366859348.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F((G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.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.u72.p157!=1)"))||(G("(i0.i0.i0.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.u275.p970!=1)")))))
Formula 0 simplified : !F(G"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.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.u72.p157!=1)" | G"(i0.i0.i0.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.u275.p970!=1)")
WARNING : LTSmin timed out (>2208 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(([]((LTLAPp0==true))||[]((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin13914986406651914268]
Detected timeout of ITS tools.
[2021-05-15 21:15:46] [INFO ] Flatten gal took : 52 ms
[2021-05-15 21:15:46] [INFO ] Input system was already deterministic with 2168 transitions.
[2021-05-15 21:15:46] [INFO ] Transformed 2368 places.
[2021-05-15 21:15:46] [INFO ] Transformed 2168 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-15 21:15:46] [INFO ] Time to serialize gal into /tmp/LTLFireability8734786112740205363.gal : 7 ms
[2021-05-15 21:15:46] [INFO ] Time to serialize properties into /tmp/LTLFireability8031559046979091803.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability8734786112740205363.gal, -t, CGAL, -LTL, /tmp/LTLFireability8031559046979091803.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability8734786112740205363.gal -t CGAL -LTL /tmp/LTLFireability8031559046979091803.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G("(p157!=1)"))||(G("(p970!=1)")))))
Formula 0 simplified : !F(G"(p157!=1)" | G"(p970!=1)")
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
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 r216-tall-162098205100477"
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 ;