About the Execution of GreatSPN+red for ShieldPPPs-PT-005B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12801.628 | 3600000.00 | 7255608.00 | 7934.50 | ?TTFFF?FFTTTF?T? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r355-tall-171683758700428.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ShieldPPPs-PT-005B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758700428
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 13 11:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 13 11:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 13 11:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 13 11:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 86K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-005B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716964463199
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-005B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 06:34:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 06:34:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 06:34:24] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-05-29 06:34:24] [INFO ] Transformed 343 places.
[2024-05-29 06:34:24] [INFO ] Transformed 318 transitions.
[2024-05-29 06:34:24] [INFO ] Found NUPN structural information;
[2024-05-29 06:34:24] [INFO ] Parsed PT model containing 343 places and 318 transitions and 876 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA ShieldPPPs-PT-005B-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-005B-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 318/318 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 317 transition count 292
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 317 transition count 292
Applied a total of 52 rules in 66 ms. Remains 317 /343 variables (removed 26) and now considering 292/318 (removed 26) transitions.
// Phase 1: matrix 292 rows 317 cols
[2024-05-29 06:34:24] [INFO ] Computed 56 invariants in 16 ms
[2024-05-29 06:34:25] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-29 06:34:25] [INFO ] Invariant cache hit.
[2024-05-29 06:34:25] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
Running 291 sub problems to find dead transitions.
[2024-05-29 06:34:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/317 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-29 06:34:28] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 11 ms to minimize.
[2024-05-29 06:34:28] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 2 ms to minimize.
[2024-05-29 06:34:29] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 06:34:29] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:34:29] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 1 ms to minimize.
[2024-05-29 06:34:29] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 1 ms to minimize.
[2024-05-29 06:34:29] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 2 ms to minimize.
[2024-05-29 06:34:29] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-29 06:34:29] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:34:29] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-05-29 06:34:29] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:34:29] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-29 06:34:29] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 06:34:29] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:34:29] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-05-29 06:34:29] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-05-29 06:34:29] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:34:29] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:34:29] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 0 ms to minimize.
[2024-05-29 06:34:29] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-29 06:34:30] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 3 ms to minimize.
[2024-05-29 06:34:30] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 2 ms to minimize.
[2024-05-29 06:34:30] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-05-29 06:34:30] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-05-29 06:34:31] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-05-29 06:34:31] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-29 06:34:31] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:34:31] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:34:31] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-29 06:34:31] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-29 06:34:31] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 06:34:31] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-29 06:34:31] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2024-05-29 06:34:31] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-29 06:34:31] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 2 ms to minimize.
[2024-05-29 06:34:31] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 06:34:31] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-29 06:34:31] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-29 06:34:31] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:34:31] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-29 06:34:33] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:34:33] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 06:34:33] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-29 06:34:34] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-29 06:34:34] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-29 06:34:34] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-29 06:34:34] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-29 06:34:34] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-29 06:34:34] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:34:34] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-05-29 06:34:34] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 2 ms to minimize.
[2024-05-29 06:34:34] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:34:34] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:34:34] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:34:34] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:34:34] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:34:35] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 2 ms to minimize.
[2024-05-29 06:34:35] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:34:35] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-05-29 06:34:35] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-29 06:34:36] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-05-29 06:34:36] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:34:36] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-29 06:34:36] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-29 06:34:37] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-29 06:34:38] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:34:38] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 06:34:38] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-29 06:34:38] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:34:38] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
[2024-05-29 06:34:38] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-29 06:34:38] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 8/128 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-29 06:34:41] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-29 06:34:41] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-29 06:34:41] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 06:34:41] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-29 06:34:41] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-29 06:34:41] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-29 06:34:41] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-29 06:34:42] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-29 06:34:43] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2024-05-29 06:34:44] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-29 06:34:44] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-29 06:34:45] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 2 ms to minimize.
[2024-05-29 06:34:46] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-29 06:34:48] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 0 ms to minimize.
[2024-05-29 06:34:48] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:34:48] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-29 06:34:49] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-29 06:34:49] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-29 06:34:49] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-29 06:34:49] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2024-05-29 06:34:49] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 2 ms to minimize.
[2024-05-29 06:34:49] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-29 06:34:49] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2024-05-29 06:34:49] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:34:49] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-29 06:34:50] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-29 06:34:50] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 1 ms to minimize.
[2024-05-29 06:34:50] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:34:51] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:34:51] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-29 06:34:51] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-29 06:34:51] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-29 06:34:51] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-05-29 06:34:51] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-29 06:34:51] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-05-29 06:34:52] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-05-29 06:34:52] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:34:52] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 13/166 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-29 06:34:53] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-05-29 06:34:54] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 2 ms to minimize.
[2024-05-29 06:34:54] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 317/609 variables, and 169 constraints, problems are : Problem set: 0 solved, 291 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 0/317 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 113/113 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/316 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/317 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 113/169 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-29 06:34:57] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 06:34:57] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-29 06:34:57] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-29 06:34:58] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 1 ms to minimize.
[2024-05-29 06:34:58] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-29 06:34:58] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 6/175 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-29 06:34:59] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-29 06:35:01] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:35:01] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:35:01] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 3/179 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-29 06:35:03] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:35:03] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-29 06:35:03] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-29 06:35:03] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-29 06:35:03] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 06:35:04] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-05-29 06:35:04] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 3 ms to minimize.
[2024-05-29 06:35:04] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-29 06:35:04] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 2 ms to minimize.
[2024-05-29 06:35:04] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-05-29 06:35:04] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-29 06:35:04] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 2 ms to minimize.
[2024-05-29 06:35:04] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-29 06:35:04] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-29 06:35:04] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-29 06:35:04] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-29 06:35:04] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-29 06:35:05] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-29 06:35:05] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 3 ms to minimize.
[2024-05-29 06:35:05] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-29 06:35:07] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-29 06:35:07] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-29 06:35:07] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:35:07] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:35:07] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-29 06:35:07] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-29 06:35:08] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-29 06:35:08] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:35:08] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 06:35:08] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-05-29 06:35:08] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 0 ms to minimize.
[2024-05-29 06:35:08] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 12/211 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-29 06:35:11] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:35:12] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2024-05-29 06:35:12] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-29 06:35:13] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:35:13] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:35:13] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 6/217 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-29 06:35:18] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
[2024-05-29 06:35:18] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-29 06:35:19] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-29 06:35:19] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:35:19] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 5/222 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-29 06:35:25] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:35:25] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/609 variables, and 224 constraints, problems are : Problem set: 0 solved, 291 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 0/317 constraints, PredecessorRefiner: 0/291 constraints, Known Traps: 168/168 constraints]
After SMT, in 60119ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Starting structural reductions in LTL mode, iteration 1 : 317/343 places, 292/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60767 ms. Remains : 317/343 places, 292/318 transitions.
Support contains 31 out of 317 places after structural reductions.
[2024-05-29 06:35:25] [INFO ] Flatten gal took : 47 ms
[2024-05-29 06:35:25] [INFO ] Flatten gal took : 20 ms
[2024-05-29 06:35:25] [INFO ] Input system was already deterministic with 292 transitions.
Support contains 30 out of 317 places (down from 31) after GAL structural reductions.
RANDOM walk for 40000 steps (44 resets) in 1013 ms. (39 steps per ms) remains 2/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 1/2 properties
[2024-05-29 06:35:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp7 is UNSAT
After SMT solving in domain Real declared 15/609 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 1/56 constraints, State Equation: 0/317 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 25ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA ShieldPPPs-PT-005B-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 66 stabilizing places and 66 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 316 transition count 255
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 280 transition count 255
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 72 place count 280 transition count 230
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 122 place count 255 transition count 230
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 130 place count 247 transition count 222
Iterating global reduction 2 with 8 rules applied. Total rules applied 138 place count 247 transition count 222
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 138 place count 247 transition count 217
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 148 place count 242 transition count 217
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 314 place count 159 transition count 134
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 316 place count 157 transition count 132
Applied a total of 316 rules in 55 ms. Remains 157 /317 variables (removed 160) and now considering 132/292 (removed 160) transitions.
// Phase 1: matrix 132 rows 157 cols
[2024-05-29 06:35:26] [INFO ] Computed 56 invariants in 1 ms
[2024-05-29 06:35:26] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-29 06:35:26] [INFO ] Invariant cache hit.
[2024-05-29 06:35:26] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2024-05-29 06:35:26] [INFO ] Redundant transitions in 3 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-29 06:35:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:35:27] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-05-29 06:35:27] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:35:28] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-29 06:35:28] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-29 06:35:28] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-05-29 06:35:28] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:35:28] [INFO ] Deduced a trap composed of 58 places in 34 ms of which 0 ms to minimize.
[2024-05-29 06:35:28] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 132/289 variables, 157/221 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:35:30] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/289 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 222 constraints, problems are : Problem set: 0 solved, 129 unsolved in 5202 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:35:32] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-29 06:35:32] [INFO ] Deduced a trap composed of 70 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 132/289 variables, 157/224 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 129/353 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:35:34] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/289 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 354 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 12/12 constraints]
After SMT, in 35231ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 35233ms
Starting structural reductions in SI_LTL mode, iteration 1 : 157/317 places, 132/292 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35509 ms. Remains : 157/317 places, 132/292 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLFireability-00
Product exploration explored 100000 steps with 22248 reset in 345 ms.
Product exploration explored 100000 steps with 22191 reset in 227 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/157 stabilizing places and 2/132 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 175 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 20 steps (0 resets) in 8 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 151 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-05-29 06:36:03] [INFO ] Invariant cache hit.
[2024-05-29 06:36:03] [INFO ] [Real]Absence check using 56 positive place invariants in 12 ms returned sat
[2024-05-29 06:36:03] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-29 06:36:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 06:36:03] [INFO ] [Nat]Absence check using 56 positive place invariants in 9 ms returned sat
[2024-05-29 06:36:03] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-29 06:36:03] [INFO ] Computed and/alt/rep : 129/248/129 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-29 06:36:03] [INFO ] Added : 104 causal constraints over 21 iterations in 377 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 132/132 transitions.
Applied a total of 0 rules in 6 ms. Remains 157 /157 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-05-29 06:36:03] [INFO ] Invariant cache hit.
[2024-05-29 06:36:03] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-29 06:36:03] [INFO ] Invariant cache hit.
[2024-05-29 06:36:04] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2024-05-29 06:36:04] [INFO ] Redundant transitions in 2 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-29 06:36:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:36:04] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-29 06:36:04] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:36:05] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-29 06:36:05] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-29 06:36:05] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2024-05-29 06:36:05] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 0 ms to minimize.
[2024-05-29 06:36:06] [INFO ] Deduced a trap composed of 58 places in 37 ms of which 0 ms to minimize.
[2024-05-29 06:36:06] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 132/289 variables, 157/221 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:36:07] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/289 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 222 constraints, problems are : Problem set: 0 solved, 129 unsolved in 5215 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:36:10] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 0 ms to minimize.
[2024-05-29 06:36:10] [INFO ] Deduced a trap composed of 70 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 132/289 variables, 157/224 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 129/353 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:36:11] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/289 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 354 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 12/12 constraints]
After SMT, in 35243ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 35245ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35449 ms. Remains : 157/157 places, 132/132 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/157 stabilizing places and 2/132 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 200 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 201 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2024-05-29 06:36:39] [INFO ] Invariant cache hit.
[2024-05-29 06:36:39] [INFO ] [Real]Absence check using 56 positive place invariants in 8 ms returned sat
[2024-05-29 06:36:39] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-29 06:36:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 06:36:40] [INFO ] [Nat]Absence check using 56 positive place invariants in 9 ms returned sat
[2024-05-29 06:36:40] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-29 06:36:40] [INFO ] Computed and/alt/rep : 129/248/129 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-29 06:36:40] [INFO ] Added : 104 causal constraints over 21 iterations in 402 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22119 reset in 161 ms.
Product exploration explored 100000 steps with 22333 reset in 174 ms.
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 132/132 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-05-29 06:36:40] [INFO ] Invariant cache hit.
[2024-05-29 06:36:40] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-29 06:36:40] [INFO ] Invariant cache hit.
[2024-05-29 06:36:41] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2024-05-29 06:36:41] [INFO ] Redundant transitions in 3 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-29 06:36:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:36:41] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-29 06:36:41] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:36:42] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-29 06:36:42] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 06:36:42] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-29 06:36:43] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:36:43] [INFO ] Deduced a trap composed of 58 places in 46 ms of which 1 ms to minimize.
[2024-05-29 06:36:43] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 132/289 variables, 157/221 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:36:44] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/289 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 222 constraints, problems are : Problem set: 0 solved, 129 unsolved in 5339 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:36:47] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:36:47] [INFO ] Deduced a trap composed of 70 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 132/289 variables, 157/224 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 129/353 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:36:49] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/289 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 354 constraints, problems are : Problem set: 0 solved, 129 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 12/12 constraints]
After SMT, in 35367ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 35368ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35583 ms. Remains : 157/157 places, 132/132 transitions.
Treatment of property ShieldPPPs-PT-005B-LTLFireability-00 finished in 110117 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 308 transition count 283
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 308 transition count 283
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 307 transition count 282
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 307 transition count 282
Applied a total of 20 rules in 18 ms. Remains 307 /317 variables (removed 10) and now considering 282/292 (removed 10) transitions.
// Phase 1: matrix 282 rows 307 cols
[2024-05-29 06:37:16] [INFO ] Computed 56 invariants in 2 ms
[2024-05-29 06:37:16] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-29 06:37:16] [INFO ] Invariant cache hit.
[2024-05-29 06:37:16] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2024-05-29 06:37:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/307 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:37:20] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 06:37:20] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-29 06:37:20] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-29 06:37:20] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-29 06:37:20] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-29 06:37:20] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-29 06:37:20] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2024-05-29 06:37:20] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
[2024-05-29 06:37:20] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 06:37:20] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:37:20] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:37:20] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:37:20] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-29 06:37:20] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-05-29 06:37:21] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-29 06:37:21] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 06:37:21] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:37:21] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:37:21] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 06:37:21] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:37:21] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-29 06:37:22] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-05-29 06:37:22] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:37:22] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:37:22] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-29 06:37:22] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:37:22] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 06:37:22] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-05-29 06:37:22] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-29 06:37:22] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-29 06:37:22] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-29 06:37:22] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 06:37:22] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-29 06:37:22] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-29 06:37:22] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 06:37:22] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-29 06:37:23] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 06:37:23] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-29 06:37:23] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:37:23] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:37:25] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-29 06:37:25] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-29 06:37:25] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-29 06:37:25] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-29 06:37:25] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 2 ms to minimize.
[2024-05-29 06:37:25] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-05-29 06:37:25] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-29 06:37:26] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-29 06:37:26] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-29 06:37:26] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2024-05-29 06:37:26] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 2 ms to minimize.
[2024-05-29 06:37:26] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 4 ms to minimize.
[2024-05-29 06:37:26] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 1 ms to minimize.
[2024-05-29 06:37:26] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-29 06:37:26] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 15/111 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:37:27] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-29 06:37:28] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:37:28] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:37:28] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:37:29] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-05-29 06:37:29] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
[2024-05-29 06:37:29] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
[2024-05-29 06:37:29] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 2 ms to minimize.
[2024-05-29 06:37:30] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-29 06:37:30] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-05-29 06:37:30] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 2 ms to minimize.
[2024-05-29 06:37:30] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-29 06:37:30] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-05-29 06:37:30] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:37:30] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2024-05-29 06:37:30] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 12/127 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (OVERLAPS) 282/589 variables, 307/434 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:37:34] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2024-05-29 06:37:35] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-29 06:37:36] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 3/437 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:37:39] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-29 06:37:39] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 0 ms to minimize.
[2024-05-29 06:37:39] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:37:40] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 06:37:40] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-05-29 06:37:41] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 6/443 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:37:42] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:37:42] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-29 06:37:43] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2024-05-29 06:37:43] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 4/447 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:37:44] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:37:45] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-29 06:37:45] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-29 06:37:46] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2024-05-29 06:37:46] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:37:46] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 589/589 variables, and 453 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 90/90 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/307 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 90/146 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:37:49] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-29 06:37:49] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 06:37:49] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 0 ms to minimize.
[2024-05-29 06:37:49] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:37:49] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:37:49] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:37:49] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-29 06:37:49] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-29 06:37:49] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-29 06:37:49] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-29 06:37:49] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 06:37:50] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 12/158 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:37:51] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:37:51] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 06:37:51] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:37:51] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 0 ms to minimize.
[2024-05-29 06:37:51] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-29 06:37:51] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-29 06:37:52] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 06:37:52] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 8/166 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:37:53] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
[2024-05-29 06:37:53] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-29 06:37:53] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-29 06:37:53] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:37:53] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-29 06:37:53] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:37:53] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-05-29 06:37:53] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:37:54] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
[2024-05-29 06:37:54] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 10/176 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 282/589 variables, 307/483 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/589 variables, 281/764 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:37:59] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-29 06:38:00] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:38:00] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2024-05-29 06:38:00] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 2 ms to minimize.
[2024-05-29 06:38:00] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-05-29 06:38:00] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
[2024-05-29 06:38:01] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-29 06:38:01] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:38:01] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-29 06:38:02] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-29 06:38:02] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-29 06:38:02] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-29 06:38:02] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-29 06:38:02] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 0 ms to minimize.
[2024-05-29 06:38:04] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-29 06:38:04] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-29 06:38:04] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-29 06:38:04] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
[2024-05-29 06:38:05] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 2 ms to minimize.
[2024-05-29 06:38:05] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 20/784 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:38:13] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 06:38:14] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:38:14] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-29 06:38:14] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:38:16] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-05-29 06:38:16] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 589/589 variables, and 790 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 146/146 constraints]
After SMT, in 60052ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 60056ms
Starting structural reductions in LTL mode, iteration 1 : 307/317 places, 282/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60363 ms. Remains : 307/317 places, 282/292 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 177 ms.
Product exploration explored 100000 steps with 50000 reset in 195 ms.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Detected a total of 59/307 stabilizing places and 59/282 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 17 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-005B-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-005B-LTLFireability-01 finished in 60910 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 316 transition count 255
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 280 transition count 255
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 72 place count 280 transition count 230
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 122 place count 255 transition count 230
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 130 place count 247 transition count 222
Iterating global reduction 2 with 8 rules applied. Total rules applied 138 place count 247 transition count 222
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 138 place count 247 transition count 217
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 148 place count 242 transition count 217
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 310 place count 161 transition count 136
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 312 place count 159 transition count 134
Applied a total of 312 rules in 52 ms. Remains 159 /317 variables (removed 158) and now considering 134/292 (removed 158) transitions.
// Phase 1: matrix 134 rows 159 cols
[2024-05-29 06:38:17] [INFO ] Computed 56 invariants in 1 ms
[2024-05-29 06:38:17] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-29 06:38:17] [INFO ] Invariant cache hit.
[2024-05-29 06:38:17] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-05-29 06:38:17] [INFO ] Redundant transitions in 3 ms returned []
Running 130 sub problems to find dead transitions.
[2024-05-29 06:38:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 2/159 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 06:38:18] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 06:38:18] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-29 06:38:18] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-29 06:38:18] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 06:38:18] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-05-29 06:38:18] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-29 06:38:18] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-05-29 06:38:19] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 0 ms to minimize.
[2024-05-29 06:38:19] [INFO ] Deduced a trap composed of 56 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:38:19] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 10/66 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 134/293 variables, 159/225 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 225 constraints, problems are : Problem set: 0 solved, 130 unsolved in 3427 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 2/159 variables, 9/64 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 06:38:21] [INFO ] Deduced a trap composed of 43 places in 28 ms of which 1 ms to minimize.
[2024-05-29 06:38:22] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 134/293 variables, 159/227 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 130/357 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 06:38:28] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-29 06:38:28] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-29 06:38:30] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 06:38:40] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2024-05-29 06:38:44] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:38:45] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 3/363 constraints. Problems are: Problem set: 0 solved, 130 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 293/293 variables, and 363 constraints, problems are : Problem set: 0 solved, 130 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 18/18 constraints]
After SMT, in 33458ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 33460ms
Starting structural reductions in SI_LTL mode, iteration 1 : 159/317 places, 134/292 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33721 ms. Remains : 159/317 places, 134/292 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLFireability-03
Stuttering criterion allowed to conclude after 397 steps with 0 reset in 3 ms.
FORMULA ShieldPPPs-PT-005B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005B-LTLFireability-03 finished in 33910 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(p1&&F(G(p1))))))'
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 310 transition count 285
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 310 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 309 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 309 transition count 284
Applied a total of 16 rules in 17 ms. Remains 309 /317 variables (removed 8) and now considering 284/292 (removed 8) transitions.
// Phase 1: matrix 284 rows 309 cols
[2024-05-29 06:38:51] [INFO ] Computed 56 invariants in 4 ms
[2024-05-29 06:38:51] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-29 06:38:51] [INFO ] Invariant cache hit.
[2024-05-29 06:38:51] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-05-29 06:38:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/309 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:38:54] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 06:38:54] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-29 06:38:54] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:38:54] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:38:55] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-05-29 06:38:55] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-29 06:38:55] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 06:38:55] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-29 06:38:55] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:38:55] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 06:38:55] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-29 06:38:55] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 06:38:55] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-29 06:38:55] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-29 06:38:55] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 2 ms to minimize.
[2024-05-29 06:38:55] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 06:38:55] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:38:55] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:38:55] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-29 06:38:55] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:38:56] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:38:56] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:38:56] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-29 06:38:56] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 06:38:56] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-29 06:38:56] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-29 06:38:56] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:38:57] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-05-29 06:38:57] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-29 06:38:57] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-29 06:38:57] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-29 06:38:57] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:38:57] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-29 06:38:57] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:38:57] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-29 06:38:57] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-29 06:38:57] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:38:57] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-29 06:38:57] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-29 06:38:57] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:38:59] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-29 06:38:59] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-29 06:39:00] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:39:00] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-05-29 06:39:00] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:39:00] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-29 06:39:00] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 06:39:00] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-29 06:39:00] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-29 06:39:00] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-29 06:39:00] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-29 06:39:00] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-29 06:39:00] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-29 06:39:00] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 06:39:00] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-29 06:39:01] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:39:01] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 17/113 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:39:02] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-29 06:39:02] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:39:02] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-29 06:39:02] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-29 06:39:02] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-29 06:39:02] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:39:04] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 284/593 variables, 309/429 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:39:08] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 0 ms to minimize.
[2024-05-29 06:39:08] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2024-05-29 06:39:09] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-29 06:39:10] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-29 06:39:10] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2024-05-29 06:39:10] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-29 06:39:10] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-05-29 06:39:10] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:39:10] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/593 variables, 9/438 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:39:13] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-29 06:39:13] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-29 06:39:13] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:39:14] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-29 06:39:14] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/593 variables, 5/443 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:39:15] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-29 06:39:15] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-29 06:39:16] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-05-29 06:39:16] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-29 06:39:16] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-29 06:39:16] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-29 06:39:16] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:39:16] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-29 06:39:16] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:39:17] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 2 ms to minimize.
[2024-05-29 06:39:17] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-05-29 06:39:17] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2024-05-29 06:39:17] [INFO ] Deduced a trap composed of 37 places in 69 ms of which 1 ms to minimize.
[2024-05-29 06:39:17] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-05-29 06:39:17] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-05-29 06:39:18] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-29 06:39:18] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:39:18] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:39:18] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 0 ms to minimize.
[2024-05-29 06:39:18] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/593 variables, 20/463 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:39:19] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-29 06:39:19] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-29 06:39:19] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 2 ms to minimize.
[2024-05-29 06:39:19] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 2 ms to minimize.
[2024-05-29 06:39:19] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 2 ms to minimize.
[2024-05-29 06:39:20] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-29 06:39:20] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 1 ms to minimize.
[2024-05-29 06:39:20] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-05-29 06:39:20] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2024-05-29 06:39:20] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 12 (INCLUDED_ONLY) 0/593 variables, 10/473 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/593 variables, and 473 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 108/108 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/309 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 108/164 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:39:23] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:39:23] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 1 ms to minimize.
[2024-05-29 06:39:23] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-05-29 06:39:24] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-05-29 06:39:24] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-29 06:39:24] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 6/170 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:39:25] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-29 06:39:25] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-05-29 06:39:25] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-29 06:39:25] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-29 06:39:26] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-29 06:39:26] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-29 06:39:26] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-29 06:39:26] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-29 06:39:26] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 9/179 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:39:27] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-29 06:39:27] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-29 06:39:27] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-29 06:39:28] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 4/183 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 284/593 variables, 309/492 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/593 variables, 283/775 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:39:35] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-29 06:39:35] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:39:35] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-05-29 06:39:35] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-29 06:39:36] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-29 06:39:36] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2024-05-29 06:39:37] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-29 06:39:37] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-05-29 06:39:37] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
[2024-05-29 06:39:37] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-05-29 06:39:38] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-29 06:39:38] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-05-29 06:39:38] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-29 06:39:39] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/593 variables, 14/789 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:39:47] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-05-29 06:39:47] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-05-29 06:39:47] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-05-29 06:39:48] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-05-29 06:39:49] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-29 06:39:49] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-29 06:39:49] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:39:50] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 2 ms to minimize.
[2024-05-29 06:39:50] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-29 06:39:50] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-29 06:39:51] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/593 variables, and 800 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 152/152 constraints]
After SMT, in 60057ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 60060ms
Starting structural reductions in LTL mode, iteration 1 : 309/317 places, 284/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60388 ms. Remains : 309/317 places, 284/292 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLFireability-04
Product exploration explored 100000 steps with 113 reset in 272 ms.
Product exploration explored 100000 steps with 114 reset in 333 ms.
Computed a total of 60 stabilizing places and 60 stable transitions
Computed a total of 60 stabilizing places and 60 stable transitions
Detected a total of 60/309 stabilizing places and 60/284 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
RANDOM walk for 1187 steps (0 resets) in 10 ms. (107 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 4 factoid took 162 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 2 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 284/284 transitions.
Applied a total of 0 rules in 3 ms. Remains 309 /309 variables (removed 0) and now considering 284/284 (removed 0) transitions.
[2024-05-29 06:39:53] [INFO ] Invariant cache hit.
[2024-05-29 06:39:53] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-29 06:39:53] [INFO ] Invariant cache hit.
[2024-05-29 06:39:53] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-05-29 06:39:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/309 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:39:56] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 06:39:56] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-29 06:39:56] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 06:39:56] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:39:57] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 2 ms to minimize.
[2024-05-29 06:39:57] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2024-05-29 06:39:57] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-29 06:39:57] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 06:39:57] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:39:57] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 06:39:57] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-29 06:39:57] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-29 06:39:57] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-29 06:39:57] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-29 06:39:57] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-29 06:39:57] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:39:57] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-29 06:39:57] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 06:39:57] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-29 06:39:57] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:39:58] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 06:39:58] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:39:58] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-29 06:39:58] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-29 06:39:58] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-29 06:39:58] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-05-29 06:39:58] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-29 06:39:59] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-05-29 06:39:59] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-29 06:39:59] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 1 ms to minimize.
[2024-05-29 06:39:59] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-29 06:39:59] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-29 06:39:59] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-05-29 06:39:59] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 06:39:59] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-29 06:39:59] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-29 06:39:59] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-29 06:39:59] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-29 06:39:59] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-29 06:39:59] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:40:01] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-29 06:40:01] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-29 06:40:02] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-29 06:40:02] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:40:02] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:40:02] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-29 06:40:02] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-29 06:40:02] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:40:02] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2024-05-29 06:40:02] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:40:02] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-29 06:40:02] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-29 06:40:02] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-29 06:40:02] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-29 06:40:02] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:40:03] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-29 06:40:03] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 17/113 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:40:04] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-29 06:40:04] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:40:04] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-29 06:40:04] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 06:40:04] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:40:05] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:40:06] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 284/593 variables, 309/429 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:40:10] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-05-29 06:40:10] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:40:11] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2024-05-29 06:40:12] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-05-29 06:40:12] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2024-05-29 06:40:12] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-29 06:40:12] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-05-29 06:40:12] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-29 06:40:12] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/593 variables, 9/438 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:40:16] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-29 06:40:16] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-29 06:40:16] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2024-05-29 06:40:16] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2024-05-29 06:40:16] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/593 variables, 5/443 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:40:17] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-29 06:40:17] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:40:18] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-29 06:40:18] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-29 06:40:18] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-05-29 06:40:18] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-29 06:40:18] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-29 06:40:18] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-29 06:40:19] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:40:19] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-05-29 06:40:19] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-29 06:40:19] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2024-05-29 06:40:19] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 2 ms to minimize.
[2024-05-29 06:40:19] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
[2024-05-29 06:40:19] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-29 06:40:20] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2024-05-29 06:40:20] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 0 ms to minimize.
[2024-05-29 06:40:20] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:40:20] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:40:20] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/593 variables, 20/463 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:40:21] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-29 06:40:21] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:40:21] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-05-29 06:40:22] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-29 06:40:22] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2024-05-29 06:40:22] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:40:22] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 1 ms to minimize.
[2024-05-29 06:40:22] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2024-05-29 06:40:22] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-05-29 06:40:22] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/593 variables, 10/473 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/593 variables, and 473 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 108/108 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/309 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 108/164 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:40:26] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-29 06:40:26] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 0 ms to minimize.
[2024-05-29 06:40:26] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:40:26] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
[2024-05-29 06:40:26] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:40:26] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 6/170 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:40:27] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 06:40:27] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-29 06:40:27] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-29 06:40:28] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-29 06:40:28] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:40:28] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-29 06:40:28] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-29 06:40:28] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-29 06:40:28] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 9/179 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:40:29] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 06:40:29] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-29 06:40:29] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-29 06:40:30] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 4/183 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 284/593 variables, 309/492 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/593 variables, 283/775 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:40:37] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-29 06:40:37] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-05-29 06:40:37] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2024-05-29 06:40:37] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-29 06:40:38] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-29 06:40:39] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
[2024-05-29 06:40:40] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-05-29 06:40:40] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-29 06:40:40] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-29 06:40:40] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 2 ms to minimize.
[2024-05-29 06:40:41] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-29 06:40:41] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-05-29 06:40:41] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
[2024-05-29 06:40:41] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/593 variables, 14/789 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:40:50] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2024-05-29 06:40:50] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-29 06:40:50] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-05-29 06:40:51] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2024-05-29 06:40:52] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:40:52] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:40:52] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-29 06:40:53] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-29 06:40:53] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-29 06:40:53] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/593 variables, and 799 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 151/151 constraints]
After SMT, in 60072ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 60075ms
Finished structural reductions in LTL mode , in 1 iterations and 60379 ms. Remains : 309/309 places, 284/284 transitions.
Computed a total of 60 stabilizing places and 60 stable transitions
Computed a total of 60 stabilizing places and 60 stable transitions
Detected a total of 60/309 stabilizing places and 60/284 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
RANDOM walk for 4632 steps (3 resets) in 36 ms. (125 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Product exploration explored 100000 steps with 113 reset in 235 ms.
Product exploration explored 100000 steps with 116 reset in 283 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 2 out of 309 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 309/309 places, 284/284 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 309 transition count 284
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 35 place count 309 transition count 286
Deduced a syphon composed of 47 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 47 place count 309 transition count 286
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 150 places in 0 ms
Iterating global reduction 1 with 103 rules applied. Total rules applied 150 place count 309 transition count 286
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 185 place count 274 transition count 251
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 220 place count 274 transition count 251
Deduced a syphon composed of 115 places in 0 ms
Applied a total of 220 rules in 41 ms. Remains 274 /309 variables (removed 35) and now considering 251/284 (removed 33) transitions.
[2024-05-29 06:40:55] [INFO ] Redundant transitions in 2 ms returned []
Running 250 sub problems to find dead transitions.
// Phase 1: matrix 251 rows 274 cols
[2024-05-29 06:40:55] [INFO ] Computed 56 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (OVERLAPS) 1/274 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-29 06:40:58] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-29 06:40:58] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-29 06:40:58] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-29 06:40:58] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-29 06:40:58] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-29 06:40:58] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-29 06:40:58] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-29 06:40:58] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-29 06:40:58] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-29 06:40:58] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-29 06:40:58] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-29 06:40:58] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-29 06:40:58] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-05-29 06:40:58] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-05-29 06:40:58] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
[2024-05-29 06:40:58] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
[2024-05-29 06:40:58] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-29 06:40:58] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
[2024-05-29 06:40:58] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
[2024-05-29 06:40:58] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 20/76 constraints. Problems are: Problem set: 75 solved, 175 unsolved
[2024-05-29 06:40:59] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
[2024-05-29 06:40:59] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
[2024-05-29 06:40:59] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:40:59] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
[2024-05-29 06:40:59] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-29 06:40:59] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
[2024-05-29 06:40:59] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-05-29 06:40:59] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
[2024-05-29 06:40:59] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
[2024-05-29 06:40:59] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-05-29 06:40:59] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
[2024-05-29 06:40:59] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
[2024-05-29 06:40:59] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
[2024-05-29 06:40:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-05-29 06:40:59] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
[2024-05-29 06:40:59] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-05-29 06:40:59] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
[2024-05-29 06:40:59] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
[2024-05-29 06:41:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD138 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
[2024-05-29 06:41:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 20/96 constraints. Problems are: Problem set: 114 solved, 136 unsolved
[2024-05-29 06:41:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD184 is UNSAT
[2024-05-29 06:41:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD206 is UNSAT
[2024-05-29 06:41:01] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD228 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 3/99 constraints. Problems are: Problem set: 117 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/99 constraints. Problems are: Problem set: 117 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 251/525 variables, 274/373 constraints. Problems are: Problem set: 117 solved, 133 unsolved
[2024-05-29 06:41:03] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-29 06:41:03] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 2/375 constraints. Problems are: Problem set: 117 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 0/375 constraints. Problems are: Problem set: 117 solved, 133 unsolved
[2024-05-29 06:41:05] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-29 06:41:05] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:41:05] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-29 06:41:05] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-29 06:41:05] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 2 ms to minimize.
[2024-05-29 06:41:05] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/525 variables, 6/381 constraints. Problems are: Problem set: 117 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/525 variables, 0/381 constraints. Problems are: Problem set: 117 solved, 133 unsolved
[2024-05-29 06:41:08] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:41:08] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-29 06:41:08] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/525 variables, 3/384 constraints. Problems are: Problem set: 117 solved, 133 unsolved
[2024-05-29 06:41:09] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-29 06:41:10] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/525 variables, 2/386 constraints. Problems are: Problem set: 117 solved, 133 unsolved
[2024-05-29 06:41:11] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/525 variables, 1/387 constraints. Problems are: Problem set: 117 solved, 133 unsolved
[2024-05-29 06:41:11] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/525 variables, 1/388 constraints. Problems are: Problem set: 117 solved, 133 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/525 variables, 0/388 constraints. Problems are: Problem set: 117 solved, 133 unsolved
[2024-05-29 06:41:14] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/525 variables, 1/389 constraints. Problems are: Problem set: 117 solved, 133 unsolved
[2024-05-29 06:41:16] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/525 variables, 1/390 constraints. Problems are: Problem set: 117 solved, 133 unsolved
[2024-05-29 06:41:17] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-29 06:41:17] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/525 variables, 2/392 constraints. Problems are: Problem set: 117 solved, 133 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/525 variables, 0/392 constraints. Problems are: Problem set: 117 solved, 133 unsolved
At refinement iteration 20 (OVERLAPS) 0/525 variables, 0/392 constraints. Problems are: Problem set: 117 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 392 constraints, problems are : Problem set: 117 solved, 133 unsolved in 24620 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 117 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 117 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 116/274 variables, 56/56 constraints. Problems are: Problem set: 117 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 62/118 constraints. Problems are: Problem set: 117 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/118 constraints. Problems are: Problem set: 117 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 251/525 variables, 274/392 constraints. Problems are: Problem set: 117 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 133/525 constraints. Problems are: Problem set: 117 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 0/525 constraints. Problems are: Problem set: 117 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 0/525 variables, 0/525 constraints. Problems are: Problem set: 117 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 525/525 variables, and 525 constraints, problems are : Problem set: 117 solved, 133 unsolved in 11380 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 133/250 constraints, Known Traps: 62/62 constraints]
After SMT, in 36044ms problems are : Problem set: 117 solved, 133 unsolved
Search for dead transitions found 117 dead transitions in 36047ms
Found 117 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 117 transitions
Dead transitions reduction (with SMT) removed 117 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 274/309 places, 134/284 transitions.
Graph (complete) has 416 edges and 274 vertex of which 159 are kept as prefixes of interest. Removing 115 places using SCC suffix rule.2 ms
Discarding 115 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 159 /274 variables (removed 115) and now considering 134/134 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 159/309 places, 134/284 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 36136 ms. Remains : 159/309 places, 134/284 transitions.
Support contains 2 out of 309 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 309/309 places, 284/284 transitions.
Applied a total of 0 rules in 7 ms. Remains 309 /309 variables (removed 0) and now considering 284/284 (removed 0) transitions.
// Phase 1: matrix 284 rows 309 cols
[2024-05-29 06:41:31] [INFO ] Computed 56 invariants in 4 ms
[2024-05-29 06:41:32] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-29 06:41:32] [INFO ] Invariant cache hit.
[2024-05-29 06:41:32] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-05-29 06:41:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/309 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:41:35] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 06:41:35] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-29 06:41:35] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-29 06:41:35] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-29 06:41:35] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 2 ms to minimize.
[2024-05-29 06:41:35] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-29 06:41:35] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:41:35] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:41:35] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:41:35] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-29 06:41:35] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-29 06:41:36] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-29 06:41:36] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
[2024-05-29 06:41:36] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-29 06:41:36] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-05-29 06:41:36] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:41:36] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:41:36] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:41:36] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-29 06:41:36] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:41:37] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-29 06:41:37] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-29 06:41:37] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-29 06:41:37] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 06:41:37] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-29 06:41:37] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-29 06:41:37] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-29 06:41:37] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-05-29 06:41:37] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-29 06:41:37] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-05-29 06:41:38] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-29 06:41:38] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-29 06:41:38] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 06:41:38] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-29 06:41:38] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-29 06:41:38] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-29 06:41:38] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-29 06:41:38] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-29 06:41:38] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-29 06:41:38] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:41:40] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-29 06:41:40] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-29 06:41:40] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-29 06:41:40] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:41:41] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-29 06:41:41] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-29 06:41:41] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-29 06:41:41] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-29 06:41:41] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-29 06:41:41] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-29 06:41:41] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-29 06:41:41] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:41:41] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-29 06:41:41] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-29 06:41:41] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-05-29 06:41:41] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:41:41] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 17/113 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:41:42] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-29 06:41:42] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-29 06:41:43] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-29 06:41:43] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-29 06:41:43] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 0 ms to minimize.
[2024-05-29 06:41:43] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:41:45] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 284/593 variables, 309/429 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:41:49] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 0 ms to minimize.
[2024-05-29 06:41:49] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-29 06:41:50] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-05-29 06:41:51] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 0 ms to minimize.
[2024-05-29 06:41:51] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-05-29 06:41:51] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-05-29 06:41:51] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 0 ms to minimize.
[2024-05-29 06:41:51] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-29 06:41:51] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/593 variables, 9/438 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:41:54] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-29 06:41:54] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-29 06:41:54] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-29 06:41:54] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-29 06:41:54] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/593 variables, 5/443 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:41:56] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-29 06:41:56] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:41:56] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-05-29 06:41:56] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-29 06:41:56] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-29 06:41:57] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-29 06:41:57] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-29 06:41:57] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-29 06:41:57] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:41:57] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-05-29 06:41:57] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 2 ms to minimize.
[2024-05-29 06:41:57] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 2 ms to minimize.
[2024-05-29 06:41:57] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 3 ms to minimize.
[2024-05-29 06:41:57] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 2 ms to minimize.
[2024-05-29 06:41:58] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 2 ms to minimize.
[2024-05-29 06:41:58] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:41:58] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-29 06:41:58] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-29 06:41:58] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-05-29 06:41:58] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/593 variables, 20/463 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:42:00] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:42:00] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:42:00] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-05-29 06:42:00] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
[2024-05-29 06:42:00] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 2 ms to minimize.
[2024-05-29 06:42:00] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-05-29 06:42:00] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-05-29 06:42:00] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:42:00] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 2 ms to minimize.
[2024-05-29 06:42:01] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/593 variables, 10/473 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 593/593 variables, and 473 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 108/108 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/309 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 108/164 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:42:04] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-29 06:42:04] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:42:04] [INFO ] Deduced a trap composed of 33 places in 26 ms of which 0 ms to minimize.
[2024-05-29 06:42:04] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
[2024-05-29 06:42:04] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2024-05-29 06:42:04] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 6/170 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:42:06] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:42:06] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-05-29 06:42:06] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-29 06:42:06] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-29 06:42:06] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-29 06:42:07] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-29 06:42:07] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:42:07] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-29 06:42:07] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 9/179 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:42:08] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-29 06:42:08] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-29 06:42:08] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-29 06:42:09] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 4/183 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 284/593 variables, 309/492 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/593 variables, 283/775 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:42:16] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:42:16] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-29 06:42:16] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2024-05-29 06:42:16] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:42:17] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
[2024-05-29 06:42:18] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-05-29 06:42:18] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-05-29 06:42:18] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-05-29 06:42:19] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-05-29 06:42:19] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-29 06:42:19] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
[2024-05-29 06:42:19] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 2 ms to minimize.
[2024-05-29 06:42:20] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-29 06:42:20] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/593 variables, 14/789 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-29 06:42:29] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
[2024-05-29 06:42:29] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-05-29 06:42:29] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-05-29 06:42:30] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 2 ms to minimize.
[2024-05-29 06:42:31] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-29 06:42:31] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-29 06:42:31] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-29 06:42:32] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 593/593 variables, and 797 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 149/149 constraints]
After SMT, in 60065ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Finished structural reductions in LTL mode , in 1 iterations and 60400 ms. Remains : 309/309 places, 284/284 transitions.
Treatment of property ShieldPPPs-PT-005B-LTLFireability-04 finished in 221010 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 317 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 316 transition count 254
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 279 transition count 254
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 74 place count 279 transition count 229
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 124 place count 254 transition count 229
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 132 place count 246 transition count 221
Iterating global reduction 2 with 8 rules applied. Total rules applied 140 place count 246 transition count 221
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 140 place count 246 transition count 215
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 152 place count 240 transition count 215
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 316 place count 158 transition count 133
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 318 place count 156 transition count 131
Applied a total of 318 rules in 44 ms. Remains 156 /317 variables (removed 161) and now considering 131/292 (removed 161) transitions.
// Phase 1: matrix 131 rows 156 cols
[2024-05-29 06:42:32] [INFO ] Computed 56 invariants in 1 ms
[2024-05-29 06:42:32] [INFO ] Implicit Places using invariants in 339 ms returned []
[2024-05-29 06:42:32] [INFO ] Invariant cache hit.
[2024-05-29 06:42:32] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2024-05-29 06:42:32] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-29 06:42:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:42:33] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-29 06:42:33] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-05-29 06:42:33] [INFO ] Deduced a trap composed of 58 places in 34 ms of which 0 ms to minimize.
[2024-05-29 06:42:33] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 131/287 variables, 156/216 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:42:34] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:42:35] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:42:35] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:42:37] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/287 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 220 constraints, problems are : Problem set: 0 solved, 129 unsolved in 6026 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 131/287 variables, 156/220 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 129/349 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 0/287 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 349 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8766 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 8/8 constraints]
After SMT, in 14805ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 14806ms
Starting structural reductions in SI_LTL mode, iteration 1 : 156/317 places, 131/292 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15310 ms. Remains : 156/317 places, 131/292 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLFireability-06
Product exploration explored 100000 steps with 269 reset in 252 ms.
Product exploration explored 100000 steps with 274 reset in 281 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
RANDOM walk for 2182 steps (3 resets) in 15 ms. (136 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 131/131 transitions.
Applied a total of 0 rules in 6 ms. Remains 156 /156 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2024-05-29 06:42:48] [INFO ] Invariant cache hit.
[2024-05-29 06:42:48] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-29 06:42:48] [INFO ] Invariant cache hit.
[2024-05-29 06:42:48] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-05-29 06:42:48] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-29 06:42:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:42:49] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-29 06:42:49] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 0 ms to minimize.
[2024-05-29 06:42:49] [INFO ] Deduced a trap composed of 58 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:42:49] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 131/287 variables, 156/216 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:42:50] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-29 06:42:51] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:42:51] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:42:53] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/287 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 220 constraints, problems are : Problem set: 0 solved, 129 unsolved in 6085 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 131/287 variables, 156/220 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 129/349 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 0/287 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 349 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8594 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 8/8 constraints]
After SMT, in 14692ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 14693ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14903 ms. Remains : 156/156 places, 131/131 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
RANDOM walk for 2980 steps (6 resets) in 20 ms. (141 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 274 reset in 260 ms.
Product exploration explored 100000 steps with 271 reset in 284 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 131/131 transitions.
Applied a total of 0 rules in 4 ms. Remains 156 /156 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2024-05-29 06:43:04] [INFO ] Invariant cache hit.
[2024-05-29 06:43:04] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-29 06:43:04] [INFO ] Invariant cache hit.
[2024-05-29 06:43:04] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-29 06:43:04] [INFO ] Redundant transitions in 0 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-29 06:43:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:43:05] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:43:05] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-05-29 06:43:05] [INFO ] Deduced a trap composed of 58 places in 38 ms of which 0 ms to minimize.
[2024-05-29 06:43:05] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 131/287 variables, 156/216 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:43:06] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-29 06:43:07] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:43:07] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:43:08] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/287 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 220 constraints, problems are : Problem set: 0 solved, 129 unsolved in 6147 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 131/287 variables, 156/220 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 129/349 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 0/287 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 349 constraints, problems are : Problem set: 0 solved, 129 unsolved in 8677 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 8/8 constraints]
After SMT, in 14841ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 14843ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15057 ms. Remains : 156/156 places, 131/131 transitions.
Treatment of property ShieldPPPs-PT-005B-LTLFireability-06 finished in 47187 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0||G(F(p1)))) U X(G(p2)))))'
Support contains 4 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 308 transition count 283
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 308 transition count 283
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 307 transition count 282
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 307 transition count 282
Applied a total of 20 rules in 13 ms. Remains 307 /317 variables (removed 10) and now considering 282/292 (removed 10) transitions.
// Phase 1: matrix 282 rows 307 cols
[2024-05-29 06:43:19] [INFO ] Computed 56 invariants in 4 ms
[2024-05-29 06:43:19] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-29 06:43:19] [INFO ] Invariant cache hit.
[2024-05-29 06:43:19] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2024-05-29 06:43:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/307 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:43:22] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:43:22] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-29 06:43:23] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-05-29 06:43:23] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:43:23] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-29 06:43:23] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-29 06:43:23] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
[2024-05-29 06:43:23] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
[2024-05-29 06:43:23] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 4 ms to minimize.
[2024-05-29 06:43:23] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:43:23] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:43:23] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:43:23] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-29 06:43:23] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-05-29 06:43:23] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-29 06:43:24] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-29 06:43:24] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-29 06:43:24] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 06:43:24] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-29 06:43:24] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:43:24] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-29 06:43:25] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 2 ms to minimize.
[2024-05-29 06:43:25] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 06:43:25] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-29 06:43:25] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-29 06:43:25] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:43:25] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 06:43:25] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-05-29 06:43:25] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
[2024-05-29 06:43:25] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-29 06:43:25] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-29 06:43:25] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:43:25] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:43:25] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-29 06:43:25] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-29 06:43:25] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:43:26] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2024-05-29 06:43:26] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2024-05-29 06:43:26] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-29 06:43:26] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:43:28] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 06:43:28] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
[2024-05-29 06:43:28] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 06:43:28] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-29 06:43:28] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:43:28] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-29 06:43:28] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-29 06:43:28] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-29 06:43:29] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-29 06:43:29] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
[2024-05-29 06:43:29] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2024-05-29 06:43:29] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-29 06:43:29] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 1 ms to minimize.
[2024-05-29 06:43:29] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-29 06:43:29] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 15/111 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:43:30] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-29 06:43:31] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-29 06:43:31] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-29 06:43:31] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:43:32] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-29 06:43:32] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-05-29 06:43:32] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
[2024-05-29 06:43:32] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 2 ms to minimize.
[2024-05-29 06:43:33] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-29 06:43:33] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:43:33] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 2 ms to minimize.
[2024-05-29 06:43:33] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-29 06:43:33] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:43:33] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:43:33] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:43:33] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 12/127 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (OVERLAPS) 282/589 variables, 307/434 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:43:37] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:43:39] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-05-29 06:43:39] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 3/437 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:43:42] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-29 06:43:42] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 0 ms to minimize.
[2024-05-29 06:43:43] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:43:43] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-29 06:43:43] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-29 06:43:44] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 6/443 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:43:45] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:43:45] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-29 06:43:46] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:43:47] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 4/447 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:43:47] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:43:48] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-29 06:43:49] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-29 06:43:49] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-29 06:43:49] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
[2024-05-29 06:43:49] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
SMT process timed out in 30079ms, After SMT, problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 30082ms
Starting structural reductions in LTL mode, iteration 1 : 307/317 places, 282/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30391 ms. Remains : 307/317 places, 282/292 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLFireability-08
Stuttering criterion allowed to conclude after 4339 steps with 13 reset in 10 ms.
FORMULA ShieldPPPs-PT-005B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005B-LTLFireability-08 finished in 30637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(p1))))'
Support contains 5 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 309 transition count 284
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 309 transition count 284
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 308 transition count 283
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 308 transition count 283
Applied a total of 18 rules in 10 ms. Remains 308 /317 variables (removed 9) and now considering 283/292 (removed 9) transitions.
// Phase 1: matrix 283 rows 308 cols
[2024-05-29 06:43:50] [INFO ] Computed 56 invariants in 2 ms
[2024-05-29 06:43:50] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-29 06:43:50] [INFO ] Invariant cache hit.
[2024-05-29 06:43:50] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2024-05-29 06:43:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:43:53] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-29 06:43:53] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 0 ms to minimize.
[2024-05-29 06:43:53] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2024-05-29 06:43:53] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:43:54] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-29 06:43:54] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 2 ms to minimize.
[2024-05-29 06:43:54] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-29 06:43:54] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-29 06:43:54] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:43:54] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:43:54] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-29 06:43:54] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2024-05-29 06:43:54] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-05-29 06:43:54] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2024-05-29 06:43:54] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-29 06:43:55] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-29 06:43:55] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-05-29 06:43:55] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-29 06:43:55] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-29 06:43:55] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:43:55] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 06:43:55] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 2 ms to minimize.
[2024-05-29 06:43:56] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
[2024-05-29 06:43:56] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-29 06:43:56] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
[2024-05-29 06:43:56] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2024-05-29 06:43:56] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:43:56] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-29 06:43:56] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 0 ms to minimize.
[2024-05-29 06:43:56] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-29 06:43:56] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-29 06:43:57] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-29 06:43:57] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-29 06:43:57] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-29 06:43:57] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-29 06:43:57] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-29 06:43:57] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2024-05-29 06:43:57] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:43:57] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-29 06:43:57] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:43:59] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 06:43:59] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 06:43:59] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-29 06:43:59] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:43:59] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-29 06:44:00] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2024-05-29 06:44:00] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
[2024-05-29 06:44:00] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 7 ms to minimize.
[2024-05-29 06:44:00] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 2 ms to minimize.
[2024-05-29 06:44:00] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-29 06:44:00] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2024-05-29 06:44:00] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-29 06:44:00] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 2 ms to minimize.
[2024-05-29 06:44:00] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-29 06:44:00] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 1 ms to minimize.
[2024-05-29 06:44:00] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-29 06:44:01] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-29 06:44:01] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2024-05-29 06:44:01] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 1 ms to minimize.
[2024-05-29 06:44:01] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:44:02] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 06:44:02] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-29 06:44:02] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-29 06:44:02] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-29 06:44:02] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-29 06:44:02] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-29 06:44:02] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:44:03] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-29 06:44:03] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 9/125 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:44:04] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-29 06:44:04] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-05-29 06:44:04] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2024-05-29 06:44:04] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 1 ms to minimize.
[2024-05-29 06:44:04] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-29 06:44:04] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-05-29 06:44:04] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-29 06:44:05] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2024-05-29 06:44:05] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-29 06:44:05] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
[2024-05-29 06:44:05] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-05-29 06:44:05] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 1 ms to minimize.
[2024-05-29 06:44:05] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 1 ms to minimize.
[2024-05-29 06:44:05] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-05-29 06:44:05] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 1 ms to minimize.
[2024-05-29 06:44:05] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 2 ms to minimize.
[2024-05-29 06:44:05] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 0 ms to minimize.
[2024-05-29 06:44:05] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 18/143 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:44:08] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:44:08] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:44:08] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 0 ms to minimize.
[2024-05-29 06:44:08] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:44:10] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:44:12] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:44:15] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-05-29 06:44:15] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 12 (OVERLAPS) 283/591 variables, 308/459 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 591/591 variables, and 459 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 95/95 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 95/151 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:44:22] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2024-05-29 06:44:22] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 2 ms to minimize.
[2024-05-29 06:44:22] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
[2024-05-29 06:44:22] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-29 06:44:22] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-05-29 06:44:22] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 06:44:22] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-29 06:44:23] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-29 06:44:23] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-29 06:44:23] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-29 06:44:23] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-29 06:44:23] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
[2024-05-29 06:44:23] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2024-05-29 06:44:23] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-29 06:44:23] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-29 06:44:23] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-29 06:44:23] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-05-29 06:44:23] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-05-29 06:44:23] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 0 ms to minimize.
[2024-05-29 06:44:24] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:44:24] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:44:24] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-05-29 06:44:24] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2024-05-29 06:44:25] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 0 ms to minimize.
[2024-05-29 06:44:25] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-29 06:44:25] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-29 06:44:25] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-05-29 06:44:25] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-05-29 06:44:25] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 1 ms to minimize.
[2024-05-29 06:44:25] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-29 06:44:25] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-29 06:44:25] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-29 06:44:25] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 13/184 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:44:27] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-29 06:44:27] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:44:27] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2024-05-29 06:44:27] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 06:44:27] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-05-29 06:44:27] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-05-29 06:44:27] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 1 ms to minimize.
[2024-05-29 06:44:27] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-05-29 06:44:28] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 0 ms to minimize.
[2024-05-29 06:44:28] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 10/194 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:44:29] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-29 06:44:29] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2024-05-29 06:44:29] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-29 06:44:29] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2024-05-29 06:44:30] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-05-29 06:44:30] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 6/200 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:44:31] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-29 06:44:31] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:44:31] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-29 06:44:31] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:44:32] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 5/205 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:44:33] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:44:35] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2024-05-29 06:44:35] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-29 06:44:35] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:44:36] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2024-05-29 06:44:37] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-29 06:44:37] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:44:37] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 0 ms to minimize.
[2024-05-29 06:44:37] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-29 06:44:37] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-29 06:44:37] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-29 06:44:37] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-29 06:44:37] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-05-29 06:44:37] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-29 06:44:37] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 06:44:37] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 2 ms to minimize.
[2024-05-29 06:44:38] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-29 06:44:38] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 14/223 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:44:39] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-29 06:44:39] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 1 ms to minimize.
[2024-05-29 06:44:39] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 1 ms to minimize.
[2024-05-29 06:44:39] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 1 ms to minimize.
[2024-05-29 06:44:39] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 2 ms to minimize.
[2024-05-29 06:44:40] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 6/229 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:44:42] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-29 06:44:42] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2024-05-29 06:44:42] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-05-29 06:44:42] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-05-29 06:44:42] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-05-29 06:44:42] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:44:42] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-05-29 06:44:42] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 1 ms to minimize.
[2024-05-29 06:44:42] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 1 ms to minimize.
[2024-05-29 06:44:42] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/308 variables, 10/239 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/308 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 14 (OVERLAPS) 283/591 variables, 308/547 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/591 variables, 282/829 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 591/591 variables, and 829 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 183/183 constraints]
After SMT, in 60046ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 60049ms
Starting structural reductions in LTL mode, iteration 1 : 308/317 places, 283/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60357 ms. Remains : 308/317 places, 283/292 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLFireability-12
Product exploration explored 100000 steps with 1644 reset in 233 ms.
Stuttering criterion allowed to conclude after 86622 steps with 1384 reset in 326 ms.
FORMULA ShieldPPPs-PT-005B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-005B-LTLFireability-12 finished in 61079 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(!((X(p0) U p1) U p2))))'
Support contains 5 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 309 transition count 284
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 309 transition count 284
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 308 transition count 283
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 308 transition count 283
Applied a total of 18 rules in 8 ms. Remains 308 /317 variables (removed 9) and now considering 283/292 (removed 9) transitions.
// Phase 1: matrix 283 rows 308 cols
[2024-05-29 06:44:51] [INFO ] Computed 56 invariants in 1 ms
[2024-05-29 06:44:51] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-29 06:44:51] [INFO ] Invariant cache hit.
[2024-05-29 06:44:51] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2024-05-29 06:44:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:44:54] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-29 06:44:54] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-29 06:44:54] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-29 06:44:54] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-29 06:44:54] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 06:44:54] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-29 06:44:54] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-29 06:44:55] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 06:44:55] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-05-29 06:44:55] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-29 06:44:55] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-29 06:44:55] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 2 ms to minimize.
[2024-05-29 06:44:55] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 2 ms to minimize.
[2024-05-29 06:44:55] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-29 06:44:55] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-29 06:44:55] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 06:44:55] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-29 06:44:55] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-29 06:44:56] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2024-05-29 06:44:56] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:44:56] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:44:56] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-29 06:44:56] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-29 06:44:56] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:44:57] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-29 06:44:57] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:44:57] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2024-05-29 06:44:57] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:44:57] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 06:44:57] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 0 ms to minimize.
[2024-05-29 06:44:57] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-29 06:44:57] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-29 06:44:57] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
[2024-05-29 06:44:57] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-29 06:44:57] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-29 06:44:57] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
[2024-05-29 06:44:57] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-29 06:44:58] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:44:58] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-29 06:44:58] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:45:00] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-29 06:45:00] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-29 06:45:00] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-29 06:45:00] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-29 06:45:00] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 0 ms to minimize.
[2024-05-29 06:45:00] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-29 06:45:00] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-29 06:45:00] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-29 06:45:00] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-29 06:45:01] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-29 06:45:01] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-29 06:45:01] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 0 ms to minimize.
[2024-05-29 06:45:01] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-29 06:45:01] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:45:02] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:45:04] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 06:45:04] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:45:06] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (OVERLAPS) 283/591 variables, 308/422 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:45:12] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-29 06:45:12] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-29 06:45:12] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:45:12] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-29 06:45:13] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:45:13] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-29 06:45:13] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-29 06:45:13] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:45:13] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:45:13] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 0 ms to minimize.
[2024-05-29 06:45:13] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-29 06:45:13] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 0 ms to minimize.
[2024-05-29 06:45:13] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-05-29 06:45:14] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:45:14] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:45:14] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 0 ms to minimize.
[2024-05-29 06:45:14] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:45:14] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2024-05-29 06:45:14] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2024-05-29 06:45:14] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/591 variables, 20/442 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:45:15] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-29 06:45:15] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 3 ms to minimize.
[2024-05-29 06:45:15] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 2 ms to minimize.
[2024-05-29 06:45:15] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 1 ms to minimize.
[2024-05-29 06:45:15] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 1 ms to minimize.
[2024-05-29 06:45:16] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 2 ms to minimize.
[2024-05-29 06:45:16] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 2 ms to minimize.
[2024-05-29 06:45:16] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 1 ms to minimize.
[2024-05-29 06:45:16] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-29 06:45:16] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-29 06:45:16] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-29 06:45:16] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-29 06:45:17] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:45:17] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 0 ms to minimize.
[2024-05-29 06:45:17] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-29 06:45:17] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
[2024-05-29 06:45:17] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:45:18] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/591 variables, 18/460 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:45:19] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2024-05-29 06:45:19] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/591 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 591/591 variables, and 462 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 98/98 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 98/154 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:45:24] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 06:45:24] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:45:24] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:45:26] [INFO ] Deduced a trap composed of 46 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:45:27] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-29 06:45:27] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:45:27] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:45:27] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-29 06:45:27] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2024-05-29 06:45:28] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 6/164 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:45:29] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 2 ms to minimize.
[2024-05-29 06:45:29] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-29 06:45:29] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2024-05-29 06:45:29] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 0 ms to minimize.
[2024-05-29 06:45:30] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:45:30] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 6/170 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:45:31] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-29 06:45:31] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-29 06:45:31] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:45:31] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-29 06:45:31] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-29 06:45:31] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-29 06:45:32] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-29 06:45:32] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:45:32] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 9/179 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:45:33] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-29 06:45:34] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 06:45:34] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:45:35] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-29 06:45:35] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 11 (OVERLAPS) 283/591 variables, 308/492 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/591 variables, 282/774 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:45:42] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-29 06:45:43] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-29 06:45:43] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2024-05-29 06:45:43] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:45:43] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 2 ms to minimize.
[2024-05-29 06:45:46] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-29 06:45:47] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-29 06:45:47] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 591/591 variables, and 782 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 136/136 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 60073ms
Starting structural reductions in LTL mode, iteration 1 : 308/317 places, 283/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60493 ms. Remains : 308/317 places, 283/292 transitions.
Stuttering acceptance computed with spot in 236 ms :[true, p2, (AND p2 p1 p0), (AND p1 p0), p2, p2]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLFireability-13
Product exploration explored 100000 steps with 25000 reset in 112 ms.
Product exploration explored 100000 steps with 25000 reset in 118 ms.
Computed a total of 60 stabilizing places and 60 stable transitions
Computed a total of 60 stabilizing places and 60 stable transitions
Detected a total of 60/308 stabilizing places and 60/283 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 169 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[true, p2, (AND p2 p1 p0), (AND p1 p0), p2, p2]
Reduction of identical properties reduced properties to check from 11 to 9
RANDOM walk for 40000 steps (44 resets) in 400 ms. (99 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 384 ms. (103 steps per ms) remains 2/3 properties
[2024-05-29 06:45:53] [INFO ] Invariant cache hit.
Problem apf1 is UNSAT
Problem apf2 is UNSAT
After SMT solving in domain Real declared 5/591 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 13 ms.
Refiners :[Positive P Invariants (semi-flows): 0/56 constraints, State Equation: 0/308 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 19ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p2 (NOT p1))), (G (OR (NOT p0) p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F p2), (F p0), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR (NOT p0) p1))), (F p1)]
Knowledge based reduction with 8 factoid took 633 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[true, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 177 ms :[true, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 3 out of 308 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 283/283 transitions.
Applied a total of 0 rules in 7 ms. Remains 308 /308 variables (removed 0) and now considering 283/283 (removed 0) transitions.
[2024-05-29 06:45:54] [INFO ] Invariant cache hit.
[2024-05-29 06:45:54] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-29 06:45:54] [INFO ] Invariant cache hit.
[2024-05-29 06:45:54] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2024-05-29 06:45:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:45:57] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 06:45:57] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:45:57] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-29 06:45:57] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-29 06:45:57] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-29 06:45:57] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-29 06:45:57] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-29 06:45:57] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-29 06:45:57] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:45:57] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-29 06:45:57] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-29 06:45:58] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
[2024-05-29 06:45:58] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-05-29 06:45:58] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 06:45:58] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 06:45:58] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-29 06:45:58] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 06:45:58] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:45:58] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-05-29 06:45:58] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:45:59] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 06:45:59] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-29 06:45:59] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-29 06:45:59] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-29 06:45:59] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-29 06:45:59] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-29 06:45:59] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:45:59] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-29 06:45:59] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-29 06:45:59] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-29 06:45:59] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-29 06:45:59] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:46:00] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-05-29 06:46:00] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-29 06:46:00] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-29 06:46:00] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-29 06:46:00] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:46:00] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 06:46:00] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-29 06:46:00] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:46:02] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:46:02] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2024-05-29 06:46:02] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-29 06:46:02] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-29 06:46:02] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-29 06:46:02] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-29 06:46:03] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-29 06:46:03] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-29 06:46:03] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-29 06:46:03] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:46:03] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-29 06:46:03] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:46:03] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-29 06:46:03] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:46:04] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:46:06] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:46:06] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:46:09] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (OVERLAPS) 283/591 variables, 308/422 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:46:14] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:46:15] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-05-29 06:46:15] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:46:15] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:46:15] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-29 06:46:15] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-29 06:46:15] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-29 06:46:15] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 06:46:16] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:46:16] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:46:16] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-29 06:46:16] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-29 06:46:16] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:46:16] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
[2024-05-29 06:46:16] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-05-29 06:46:16] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:46:16] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-29 06:46:16] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-29 06:46:16] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2024-05-29 06:46:16] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/591 variables, 20/442 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:46:17] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-29 06:46:17] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-05-29 06:46:17] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
[2024-05-29 06:46:18] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 1 ms to minimize.
[2024-05-29 06:46:18] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 2 ms to minimize.
[2024-05-29 06:46:18] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-05-29 06:46:18] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 1 ms to minimize.
[2024-05-29 06:46:18] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 2 ms to minimize.
[2024-05-29 06:46:18] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-29 06:46:18] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-29 06:46:18] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-29 06:46:19] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 06:46:19] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-29 06:46:19] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-29 06:46:19] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:46:19] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:46:19] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:46:20] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/591 variables, 18/460 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:46:21] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 2 ms to minimize.
[2024-05-29 06:46:22] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/591 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 591/591 variables, and 462 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 98/98 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 98/154 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:46:26] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:46:26] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-05-29 06:46:27] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:46:29] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:46:30] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:46:30] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 06:46:30] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-29 06:46:30] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-29 06:46:30] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-05-29 06:46:31] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 6/164 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:46:32] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 2 ms to minimize.
[2024-05-29 06:46:32] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2024-05-29 06:46:32] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-29 06:46:32] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-29 06:46:33] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-05-29 06:46:33] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 6/170 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:46:34] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 0 ms to minimize.
[2024-05-29 06:46:34] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:46:34] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:46:34] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-29 06:46:34] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-29 06:46:34] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-29 06:46:35] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-29 06:46:35] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-29 06:46:35] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 9/179 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:46:36] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-29 06:46:37] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:46:37] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:46:38] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-29 06:46:38] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 11 (OVERLAPS) 283/591 variables, 308/492 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/591 variables, 282/774 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:46:46] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:46:46] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-29 06:46:46] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-05-29 06:46:46] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-29 06:46:46] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2024-05-29 06:46:49] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2024-05-29 06:46:50] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-29 06:46:51] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 591/591 variables, and 782 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 136/136 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Finished structural reductions in LTL mode , in 1 iterations and 60389 ms. Remains : 308/308 places, 283/283 transitions.
Computed a total of 60 stabilizing places and 60 stable transitions
Computed a total of 60 stabilizing places and 60 stable transitions
Detected a total of 60/308 stabilizing places and 60/283 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[true, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
RANDOM walk for 40000 steps (43 resets) in 515 ms. (77 steps per ms) remains 2/4 properties
BEST_FIRST walk for 6162 steps (0 resets) in 15 ms. (385 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 223 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[true, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 189 ms :[true, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 253 ms :[true, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 25000 reset in 89 ms.
Product exploration explored 100000 steps with 25000 reset in 104 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 164 ms :[true, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 308/308 places, 283/283 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 308 transition count 283
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 35 place count 308 transition count 285
Deduced a syphon composed of 46 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 46 place count 308 transition count 285
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 146 place count 308 transition count 285
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 181 place count 273 transition count 250
Deduced a syphon composed of 111 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 216 place count 273 transition count 250
Deduced a syphon composed of 111 places in 0 ms
Applied a total of 216 rules in 39 ms. Remains 273 /308 variables (removed 35) and now considering 250/283 (removed 33) transitions.
[2024-05-29 06:46:56] [INFO ] Redundant transitions in 1 ms returned []
Running 249 sub problems to find dead transitions.
// Phase 1: matrix 250 rows 273 cols
[2024-05-29 06:46:56] [INFO ] Computed 56 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/273 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-05-29 06:46:58] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-29 06:46:58] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-29 06:46:58] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-29 06:46:58] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-29 06:46:58] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-29 06:46:58] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-29 06:46:58] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-29 06:46:58] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-29 06:46:58] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-29 06:46:58] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-29 06:46:59] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-29 06:46:59] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-29 06:46:59] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD44 is UNSAT
[2024-05-29 06:46:59] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
[2024-05-29 06:46:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-05-29 06:46:59] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
[2024-05-29 06:46:59] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-29 06:46:59] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
[2024-05-29 06:46:59] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 06:46:59] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD246 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 20/76 constraints. Problems are: Problem set: 69 solved, 180 unsolved
[2024-05-29 06:46:59] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
[2024-05-29 06:46:59] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-29 06:46:59] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
[2024-05-29 06:46:59] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
[2024-05-29 06:46:59] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
[2024-05-29 06:46:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-05-29 06:46:59] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
[2024-05-29 06:46:59] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
[2024-05-29 06:46:59] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-05-29 06:46:59] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
[2024-05-29 06:46:59] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
[2024-05-29 06:47:00] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
[2024-05-29 06:47:00] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-05-29 06:47:00] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
[2024-05-29 06:47:00] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD86 is UNSAT
[2024-05-29 06:47:00] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
[2024-05-29 06:47:00] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-29 06:47:00] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2024-05-29 06:47:00] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
[2024-05-29 06:47:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 20/96 constraints. Problems are: Problem set: 108 solved, 141 unsolved
[2024-05-29 06:47:01] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
Problem TDEAD155 is UNSAT
[2024-05-29 06:47:01] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD161 is UNSAT
[2024-05-29 06:47:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD184 is UNSAT
[2024-05-29 06:47:01] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD205 is UNSAT
[2024-05-29 06:47:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD227 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 5/101 constraints. Problems are: Problem set: 113 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/101 constraints. Problems are: Problem set: 113 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 250/523 variables, 273/374 constraints. Problems are: Problem set: 113 solved, 136 unsolved
[2024-05-29 06:47:04] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:47:04] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 2/376 constraints. Problems are: Problem set: 113 solved, 136 unsolved
[2024-05-29 06:47:04] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-29 06:47:05] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-29 06:47:05] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-29 06:47:05] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-05-29 06:47:05] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:47:05] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 06:47:05] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-29 06:47:05] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/523 variables, 8/384 constraints. Problems are: Problem set: 113 solved, 136 unsolved
[2024-05-29 06:47:06] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/523 variables, 1/385 constraints. Problems are: Problem set: 113 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/523 variables, 0/385 constraints. Problems are: Problem set: 113 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/523 variables, 0/385 constraints. Problems are: Problem set: 113 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 523/523 variables, and 385 constraints, problems are : Problem set: 113 solved, 136 unsolved in 14037 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 113 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 113 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 112/273 variables, 56/56 constraints. Problems are: Problem set: 113 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 56/112 constraints. Problems are: Problem set: 113 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/112 constraints. Problems are: Problem set: 113 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 250/523 variables, 273/385 constraints. Problems are: Problem set: 113 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/523 variables, 136/521 constraints. Problems are: Problem set: 113 solved, 136 unsolved
[2024-05-29 06:47:14] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2024-05-29 06:47:14] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:47:16] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-05-29 06:47:16] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 4/525 constraints. Problems are: Problem set: 113 solved, 136 unsolved
[2024-05-29 06:47:23] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 1/526 constraints. Problems are: Problem set: 113 solved, 136 unsolved
[2024-05-29 06:47:33] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 523/523 variables, and 527 constraints, problems are : Problem set: 113 solved, 136 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 136/249 constraints, Known Traps: 62/62 constraints]
After SMT, in 44084ms problems are : Problem set: 113 solved, 136 unsolved
Search for dead transitions found 113 dead transitions in 44088ms
Found 113 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 113 transitions
Dead transitions reduction (with SMT) removed 113 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 273/308 places, 137/283 transitions.
Graph (complete) has 420 edges and 273 vertex of which 162 are kept as prefixes of interest. Removing 111 places using SCC suffix rule.2 ms
Discarding 111 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 162 /273 variables (removed 111) and now considering 137/137 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 162/308 places, 137/283 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 44144 ms. Remains : 162/308 places, 137/283 transitions.
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 283/283 transitions.
Applied a total of 0 rules in 3 ms. Remains 308 /308 variables (removed 0) and now considering 283/283 (removed 0) transitions.
// Phase 1: matrix 283 rows 308 cols
[2024-05-29 06:47:40] [INFO ] Computed 56 invariants in 3 ms
[2024-05-29 06:47:40] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-29 06:47:40] [INFO ] Invariant cache hit.
[2024-05-29 06:47:40] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2024-05-29 06:47:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:47:43] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:47:44] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-29 06:47:44] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-29 06:47:44] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-05-29 06:47:44] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:47:44] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-29 06:47:44] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2024-05-29 06:47:44] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:47:44] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-29 06:47:44] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:47:44] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:47:44] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 2 ms to minimize.
[2024-05-29 06:47:44] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 1 ms to minimize.
[2024-05-29 06:47:44] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:47:44] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-29 06:47:45] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2024-05-29 06:47:45] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-29 06:47:45] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-29 06:47:45] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-05-29 06:47:45] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:47:45] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-29 06:47:46] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-29 06:47:46] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-29 06:47:46] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:47:46] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-29 06:47:46] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-29 06:47:46] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:47:46] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-29 06:47:46] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-29 06:47:46] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-29 06:47:46] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:47:46] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 0 ms to minimize.
[2024-05-29 06:47:47] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 2 ms to minimize.
[2024-05-29 06:47:47] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-29 06:47:47] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-29 06:47:47] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-29 06:47:47] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-29 06:47:47] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:47:47] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-29 06:47:47] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:47:49] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-29 06:47:49] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-29 06:47:49] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-29 06:47:49] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-29 06:47:50] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-29 06:47:50] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-29 06:47:50] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:47:50] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-29 06:47:50] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-29 06:47:50] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-29 06:47:50] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-29 06:47:50] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2024-05-29 06:47:50] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-29 06:47:50] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:47:51] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:47:53] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-29 06:47:54] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:47:56] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 9 (OVERLAPS) 283/591 variables, 308/422 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:48:02] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:48:02] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:48:02] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-29 06:48:02] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-29 06:48:02] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 06:48:03] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-29 06:48:03] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2024-05-29 06:48:03] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-29 06:48:03] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-29 06:48:03] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-29 06:48:03] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 06:48:04] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 0 ms to minimize.
[2024-05-29 06:48:04] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 1 ms to minimize.
[2024-05-29 06:48:04] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-05-29 06:48:04] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-05-29 06:48:04] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-05-29 06:48:04] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-29 06:48:04] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-29 06:48:04] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-29 06:48:04] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/591 variables, 20/442 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:48:05] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-29 06:48:05] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-05-29 06:48:06] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 1 ms to minimize.
[2024-05-29 06:48:06] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 1 ms to minimize.
[2024-05-29 06:48:06] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
[2024-05-29 06:48:06] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 2 ms to minimize.
[2024-05-29 06:48:06] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 2 ms to minimize.
[2024-05-29 06:48:06] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 2 ms to minimize.
[2024-05-29 06:48:06] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-29 06:48:06] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:48:07] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-29 06:48:07] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:48:07] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-29 06:48:07] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 0 ms to minimize.
[2024-05-29 06:48:07] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-29 06:48:08] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-05-29 06:48:08] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-29 06:48:08] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/591 variables, 18/460 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:48:10] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
[2024-05-29 06:48:10] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 (/ 1.0 2.0))
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 (/ 1.0 2.0))
(s158 (/ 1.0 2.0))
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 (/ 1.0 2.0))
(s174 0.0)
(s175 0.0)
(s176 (/ 1.0 2.0))
(s177 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 591/591 variables, and 462 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 98/98 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 98/154 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:48:13] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2024-05-29 06:48:13] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-29 06:48:13] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:48:15] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:48:16] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-29 06:48:16] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-29 06:48:16] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:48:16] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-29 06:48:17] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-05-29 06:48:17] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 6/164 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:48:19] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 1 ms to minimize.
[2024-05-29 06:48:19] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-29 06:48:19] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2024-05-29 06:48:19] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-05-29 06:48:19] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-29 06:48:19] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 6/170 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:48:20] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 0 ms to minimize.
[2024-05-29 06:48:20] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-29 06:48:20] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-29 06:48:20] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:48:20] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-29 06:48:20] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-29 06:48:21] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-29 06:48:21] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 0 ms to minimize.
[2024-05-29 06:48:21] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 9/179 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:48:23] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-29 06:48:23] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 5 ms to minimize.
[2024-05-29 06:48:23] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:48:24] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-05-29 06:48:25] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 11 (OVERLAPS) 283/591 variables, 308/492 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/591 variables, 282/774 constraints. Problems are: Problem set: 0 solved, 282 unsolved
[2024-05-29 06:48:32] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-29 06:48:32] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-29 06:48:32] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-05-29 06:48:33] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
[2024-05-29 06:48:33] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 2 ms to minimize.
[2024-05-29 06:48:36] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-29 06:48:37] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-29 06:48:37] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 591/591 variables, and 782 constraints, problems are : Problem set: 0 solved, 282 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 136/136 constraints]
After SMT, in 60075ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 60079ms
Finished structural reductions in LTL mode , in 1 iterations and 60475 ms. Remains : 308/308 places, 283/283 transitions.
Treatment of property ShieldPPPs-PT-005B-LTLFireability-13 finished in 229677 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 308 transition count 283
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 308 transition count 283
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 307 transition count 282
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 307 transition count 282
Applied a total of 20 rules in 8 ms. Remains 307 /317 variables (removed 10) and now considering 282/292 (removed 10) transitions.
// Phase 1: matrix 282 rows 307 cols
[2024-05-29 06:48:40] [INFO ] Computed 56 invariants in 1 ms
[2024-05-29 06:48:41] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-29 06:48:41] [INFO ] Invariant cache hit.
[2024-05-29 06:48:41] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2024-05-29 06:48:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/307 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:48:44] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-29 06:48:44] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2024-05-29 06:48:44] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-29 06:48:44] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:48:44] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2024-05-29 06:48:44] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-29 06:48:44] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2024-05-29 06:48:45] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
[2024-05-29 06:48:45] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-29 06:48:45] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-29 06:48:45] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-29 06:48:45] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-29 06:48:45] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-29 06:48:45] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-05-29 06:48:45] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 1 ms to minimize.
[2024-05-29 06:48:45] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-29 06:48:45] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-29 06:48:45] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-29 06:48:45] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-29 06:48:45] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:48:46] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-29 06:48:46] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-05-29 06:48:46] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-29 06:48:46] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 0 ms to minimize.
[2024-05-29 06:48:47] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:48:47] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-29 06:48:47] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-29 06:48:47] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 2 ms to minimize.
[2024-05-29 06:48:47] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-29 06:48:47] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-05-29 06:48:47] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-29 06:48:47] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 06:48:47] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-29 06:48:47] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-29 06:48:47] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 06:48:47] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-29 06:48:47] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 06:48:48] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-05-29 06:48:48] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-29 06:48:48] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:48:49] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 06:48:49] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-29 06:48:50] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 06:48:50] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-29 06:48:50] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-29 06:48:50] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-05-29 06:48:50] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-05-29 06:48:50] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-29 06:48:50] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-29 06:48:51] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-29 06:48:51] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 1 ms to minimize.
[2024-05-29 06:48:51] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-29 06:48:51] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 1 ms to minimize.
[2024-05-29 06:48:51] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-29 06:48:51] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 15/111 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:48:52] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:48:53] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-29 06:48:53] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-29 06:48:53] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:48:54] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
[2024-05-29 06:48:54] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-05-29 06:48:54] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 1 ms to minimize.
[2024-05-29 06:48:54] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
[2024-05-29 06:48:55] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-05-29 06:48:55] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2024-05-29 06:48:55] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 2 ms to minimize.
[2024-05-29 06:48:55] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-29 06:48:55] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 0 ms to minimize.
[2024-05-29 06:48:55] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-29 06:48:55] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-29 06:48:55] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 12/127 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (OVERLAPS) 282/589 variables, 307/434 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:48:59] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-29 06:49:00] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-05-29 06:49:01] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 3/437 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:49:04] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-05-29 06:49:04] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 0 ms to minimize.
[2024-05-29 06:49:04] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-29 06:49:05] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-29 06:49:05] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-29 06:49:06] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 6/443 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:49:07] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:49:07] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-29 06:49:08] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 0 ms to minimize.
[2024-05-29 06:49:08] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 4/447 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:49:09] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-29 06:49:10] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-29 06:49:10] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-29 06:49:11] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 0 ms to minimize.
[2024-05-29 06:49:11] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 589/589 variables, and 452 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 89/89 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/307 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 89/145 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:49:13] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:49:13] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-29 06:49:13] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-29 06:49:14] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:49:14] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-29 06:49:14] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-05-29 06:49:14] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 7/152 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:49:15] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-29 06:49:15] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-29 06:49:15] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 1 ms to minimize.
[2024-05-29 06:49:16] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 4/156 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:49:17] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-29 06:49:17] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-29 06:49:17] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:49:19] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:49:20] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
[2024-05-29 06:49:20] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-29 06:49:20] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-29 06:49:21] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 4/164 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:49:22] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 10 (OVERLAPS) 282/589 variables, 307/472 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 281/753 constraints. Problems are: Problem set: 0 solved, 281 unsolved
[2024-05-29 06:49:29] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 2 ms to minimize.
[2024-05-29 06:49:29] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 2 ms to minimize.
[2024-05-29 06:49:29] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-29 06:49:30] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-29 06:49:31] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-29 06:49:31] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
[2024-05-29 06:49:31] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2024-05-29 06:49:31] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-29 06:49:31] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-05-29 06:49:32] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-05-29 06:49:32] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-29 06:49:32] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-29 06:49:33] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-29 06:49:33] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-29 06:49:33] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-05-29 06:49:33] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-29 06:49:35] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 06:49:36] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 18/771 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 589/589 variables, and 771 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 127/127 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 60059ms
Starting structural reductions in LTL mode, iteration 1 : 307/317 places, 282/292 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60486 ms. Remains : 307/317 places, 282/292 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-005B-LTLFireability-15
Product exploration explored 100000 steps with 1797 reset in 159 ms.
Product exploration explored 100000 steps with 1785 reset in 171 ms.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 210 steps (0 resets) in 4 ms. (42 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
[2024-05-29 06:49:42] [INFO ] Invariant cache hit.
[2024-05-29 06:49:42] [INFO ] [Real]Absence check using 56 positive place invariants in 14 ms returned sat
[2024-05-29 06:49:42] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2024-05-29 06:49:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 06:49:42] [INFO ] [Nat]Absence check using 56 positive place invariants in 15 ms returned sat
[2024-05-29 06:49:43] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2024-05-29 06:49:43] [INFO ] Computed and/alt/rep : 281/497/281 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-29 06:49:44] [INFO ] Added : 236 causal constraints over 48 iterations in 1794 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 307 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 307/307 places, 282/282 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 306 transition count 245
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 270 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 269 transition count 244
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 74 place count 269 transition count 219
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 124 place count 244 transition count 219
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 294 place count 159 transition count 134
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 296 place count 157 transition count 132
Applied a total of 296 rules in 18 ms. Remains 157 /307 variables (removed 150) and now considering 132/282 (removed 150) transitions.
// Phase 1: matrix 132 rows 157 cols
[2024-05-29 06:49:44] [INFO ] Computed 56 invariants in 1 ms
[2024-05-29 06:49:45] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-29 06:49:45] [INFO ] Invariant cache hit.
[2024-05-29 06:49:45] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2024-05-29 06:49:45] [INFO ] Redundant transitions in 0 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-29 06:49:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:49:45] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:49:45] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:49:46] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-29 06:49:46] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-29 06:49:46] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-29 06:49:47] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-29 06:49:47] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 1 ms to minimize.
[2024-05-29 06:49:47] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 132/289 variables, 157/221 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:49:48] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:49:49] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/289 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 11 (OVERLAPS) 0/289 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 223 constraints, problems are : Problem set: 0 solved, 129 unsolved in 6405 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 132/289 variables, 157/223 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 129/352 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:49:53] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/289 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 353 constraints, problems are : Problem set: 0 solved, 129 unsolved in 14782 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 11/11 constraints]
After SMT, in 21201ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 21204ms
Starting structural reductions in SI_LTL mode, iteration 1 : 157/307 places, 132/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21478 ms. Remains : 157/307 places, 132/282 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 214 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 15 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
[2024-05-29 06:50:06] [INFO ] Invariant cache hit.
[2024-05-29 06:50:07] [INFO ] [Real]Absence check using 56 positive place invariants in 10 ms returned sat
[2024-05-29 06:50:07] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-29 06:50:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 06:50:07] [INFO ] [Nat]Absence check using 56 positive place invariants in 9 ms returned sat
[2024-05-29 06:50:07] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-29 06:50:07] [INFO ] Computed and/alt/rep : 129/256/129 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-29 06:50:07] [INFO ] Added : 124 causal constraints over 25 iterations in 376 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22568 reset in 155 ms.
Product exploration explored 100000 steps with 22485 reset in 181 ms.
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 132/132 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-05-29 06:50:08] [INFO ] Invariant cache hit.
[2024-05-29 06:50:08] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-29 06:50:08] [INFO ] Invariant cache hit.
[2024-05-29 06:50:08] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-29 06:50:08] [INFO ] Redundant transitions in 0 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-29 06:50:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:50:09] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-29 06:50:09] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:50:10] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-29 06:50:10] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 06:50:10] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2024-05-29 06:50:10] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:50:10] [INFO ] Deduced a trap composed of 58 places in 44 ms of which 1 ms to minimize.
[2024-05-29 06:50:10] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 132/289 variables, 157/221 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:50:11] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:50:13] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/289 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 11 (OVERLAPS) 0/289 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 223 constraints, problems are : Problem set: 0 solved, 129 unsolved in 6451 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 132/289 variables, 157/223 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 129/352 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:50:16] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/289 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 353 constraints, problems are : Problem set: 0 solved, 129 unsolved in 14367 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 11/11 constraints]
After SMT, in 20834ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 20835ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21182 ms. Remains : 157/157 places, 132/132 transitions.
Treatment of property ShieldPPPs-PT-005B-LTLFireability-15 finished in 108304 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(p1&&F(G(p1))))))'
Found a Lengthening insensitive property : ShieldPPPs-PT-005B-LTLFireability-04
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 2 out of 317 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 316 transition count 255
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 280 transition count 255
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 72 place count 280 transition count 230
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 122 place count 255 transition count 230
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 129 place count 248 transition count 223
Iterating global reduction 2 with 7 rules applied. Total rules applied 136 place count 248 transition count 223
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 136 place count 248 transition count 218
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 146 place count 243 transition count 218
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 312 place count 160 transition count 135
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 314 place count 158 transition count 133
Applied a total of 314 rules in 28 ms. Remains 158 /317 variables (removed 159) and now considering 133/292 (removed 159) transitions.
// Phase 1: matrix 133 rows 158 cols
[2024-05-29 06:50:29] [INFO ] Computed 56 invariants in 0 ms
[2024-05-29 06:50:30] [INFO ] Implicit Places using invariants in 594 ms returned []
[2024-05-29 06:50:30] [INFO ] Invariant cache hit.
[2024-05-29 06:50:30] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-05-29 06:50:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 06:50:31] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-29 06:50:31] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 1/158 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 06:50:32] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-29 06:50:32] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-29 06:50:32] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 133/291 variables, 158/219 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 06:50:33] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 220 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5344 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 1/158 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 133/291 variables, 158/220 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 130/350 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-29 06:50:40] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/291 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 0/291 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 351 constraints, problems are : Problem set: 0 solved, 130 unsolved in 18124 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 7/7 constraints]
After SMT, in 23485ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 23486ms
Starting structural reductions in LI_LTL mode, iteration 1 : 158/317 places, 133/292 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 24280 ms. Remains : 158/317 places, 133/292 transitions.
Running random walk in product with property : ShieldPPPs-PT-005B-LTLFireability-04
Entered a terminal (fully accepting) state of product in 700 steps with 2 reset in 2 ms.
Treatment of property ShieldPPPs-PT-005B-LTLFireability-04 finished in 24546 ms.
FORMULA ShieldPPPs-PT-005B-LTLFireability-04 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(!((X(p0) U p1) U p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : ShieldPPPs-PT-005B-LTLFireability-15
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 317 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 317/317 places, 292/292 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 316 transition count 255
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 280 transition count 254
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 279 transition count 254
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 74 place count 279 transition count 229
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 124 place count 254 transition count 229
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 133 place count 245 transition count 220
Iterating global reduction 3 with 9 rules applied. Total rules applied 142 place count 245 transition count 220
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 142 place count 245 transition count 214
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 154 place count 239 transition count 214
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 314 place count 159 transition count 134
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 316 place count 157 transition count 132
Applied a total of 316 rules in 29 ms. Remains 157 /317 variables (removed 160) and now considering 132/292 (removed 160) transitions.
// Phase 1: matrix 132 rows 157 cols
[2024-05-29 06:50:54] [INFO ] Computed 56 invariants in 1 ms
[2024-05-29 06:50:54] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-29 06:50:54] [INFO ] Invariant cache hit.
[2024-05-29 06:50:54] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2024-05-29 06:50:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:50:55] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-29 06:50:55] [INFO ] Deduced a trap composed of 28 places in 22 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:50:56] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-29 06:50:56] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-29 06:50:56] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 1 ms to minimize.
[2024-05-29 06:50:56] [INFO ] Deduced a trap composed of 42 places in 27 ms of which 1 ms to minimize.
[2024-05-29 06:50:56] [INFO ] Deduced a trap composed of 58 places in 42 ms of which 1 ms to minimize.
[2024-05-29 06:50:56] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:50:56] [INFO ] Deduced a trap composed of 42 places in 29 ms of which 0 ms to minimize.
[2024-05-29 06:50:56] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 0 ms to minimize.
[2024-05-29 06:50:56] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-05-29 06:50:57] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2024-05-29 06:50:57] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 132/289 variables, 157/226 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:50:57] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-29 06:50:58] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-29 06:50:58] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:50:59] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-05-29 06:50:59] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-05-29 06:50:59] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:51:00] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/289 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 13 (OVERLAPS) 0/289 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 233 constraints, problems are : Problem set: 0 solved, 129 unsolved in 7994 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 18/66 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 8/74 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 132/289 variables, 157/233 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 129/362 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/289 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 362 constraints, problems are : Problem set: 0 solved, 129 unsolved in 14721 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 20/20 constraints]
After SMT, in 22748ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 22749ms
Starting structural reductions in LI_LTL mode, iteration 1 : 157/317 places, 132/292 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 22999 ms. Remains : 157/317 places, 132/292 transitions.
Running random walk in product with property : ShieldPPPs-PT-005B-LTLFireability-15
Product exploration explored 100000 steps with 22667 reset in 145 ms.
Product exploration explored 100000 steps with 22500 reset in 185 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 1 factoid took 183 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
[2024-05-29 06:51:18] [INFO ] Invariant cache hit.
[2024-05-29 06:51:18] [INFO ] [Real]Absence check using 56 positive place invariants in 9 ms returned sat
[2024-05-29 06:51:18] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-29 06:51:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 06:51:18] [INFO ] [Nat]Absence check using 56 positive place invariants in 9 ms returned sat
[2024-05-29 06:51:18] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-05-29 06:51:18] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-29 06:51:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 06:51:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 94 ms
[2024-05-29 06:51:18] [INFO ] Computed and/alt/rep : 129/256/129 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-29 06:51:18] [INFO ] Added : 100 causal constraints over 20 iterations in 331 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 132/132 transitions.
Applied a total of 0 rules in 4 ms. Remains 157 /157 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-05-29 06:51:18] [INFO ] Invariant cache hit.
[2024-05-29 06:51:19] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-29 06:51:19] [INFO ] Invariant cache hit.
[2024-05-29 06:51:19] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-29 06:51:19] [INFO ] Redundant transitions in 0 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-29 06:51:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:51:19] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-29 06:51:19] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:51:20] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-29 06:51:20] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-29 06:51:20] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 0 ms to minimize.
[2024-05-29 06:51:21] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 0 ms to minimize.
[2024-05-29 06:51:21] [INFO ] Deduced a trap composed of 58 places in 44 ms of which 0 ms to minimize.
[2024-05-29 06:51:21] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:51:21] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 0 ms to minimize.
[2024-05-29 06:51:21] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-29 06:51:21] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 0 ms to minimize.
[2024-05-29 06:51:21] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-05-29 06:51:21] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 132/289 variables, 157/226 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:51:22] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-29 06:51:22] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-05-29 06:51:22] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:51:23] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-29 06:51:23] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-29 06:51:23] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:51:25] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/289 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 13 (OVERLAPS) 0/289 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 233 constraints, problems are : Problem set: 0 solved, 129 unsolved in 7871 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 18/66 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 8/74 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 132/289 variables, 157/233 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 129/362 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/289 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 362 constraints, problems are : Problem set: 0 solved, 129 unsolved in 14579 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 20/20 constraints]
After SMT, in 22464ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 22465ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 22692 ms. Remains : 157/157 places, 132/132 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 153 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 6 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
[2024-05-29 06:51:42] [INFO ] Invariant cache hit.
[2024-05-29 06:51:42] [INFO ] [Real]Absence check using 56 positive place invariants in 9 ms returned sat
[2024-05-29 06:51:42] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2024-05-29 06:51:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 06:51:42] [INFO ] [Nat]Absence check using 56 positive place invariants in 9 ms returned sat
[2024-05-29 06:51:42] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-29 06:51:42] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-05-29 06:51:42] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 06:51:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 77 ms
[2024-05-29 06:51:42] [INFO ] Computed and/alt/rep : 129/256/129 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-29 06:51:42] [INFO ] Added : 100 causal constraints over 20 iterations in 360 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22529 reset in 205 ms.
Product exploration explored 100000 steps with 22580 reset in 175 ms.
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 132/132 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-05-29 06:51:43] [INFO ] Invariant cache hit.
[2024-05-29 06:51:43] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-29 06:51:43] [INFO ] Invariant cache hit.
[2024-05-29 06:51:43] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-05-29 06:51:43] [INFO ] Redundant transitions in 1 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-29 06:51:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:51:44] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-29 06:51:44] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:51:45] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-29 06:51:45] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 06:51:45] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-29 06:51:45] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-05-29 06:51:45] [INFO ] Deduced a trap composed of 58 places in 41 ms of which 0 ms to minimize.
[2024-05-29 06:51:45] [INFO ] Deduced a trap composed of 71 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:51:46] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-05-29 06:51:46] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 1 ms to minimize.
[2024-05-29 06:51:46] [INFO ] Deduced a trap composed of 44 places in 30 ms of which 0 ms to minimize.
[2024-05-29 06:51:46] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-29 06:51:46] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 132/289 variables, 157/226 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:51:47] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-29 06:51:47] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 06:51:47] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:51:48] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-05-29 06:51:48] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-05-29 06:51:48] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-29 06:51:49] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/289 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 13 (OVERLAPS) 0/289 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 233 constraints, problems are : Problem set: 0 solved, 129 unsolved in 7755 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 18/66 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/157 variables, 8/74 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 132/289 variables, 157/233 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 129/362 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/289 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 362 constraints, problems are : Problem set: 0 solved, 129 unsolved in 14557 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 20/20 constraints]
After SMT, in 22339ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 22340ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 22560 ms. Remains : 157/157 places, 132/132 transitions.
Treatment of property ShieldPPPs-PT-005B-LTLFireability-15 finished in 71943 ms.
[2024-05-29 06:52:06] [INFO ] Flatten gal took : 18 ms
[2024-05-29 06:52:06] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 16 ms.
[2024-05-29 06:52:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 317 places, 292 transitions and 824 arcs took 5 ms.
Total runtime 1061796 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running ShieldPPPs-PT-005B
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 317
TRANSITIONS: 292
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.002s]
SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 7554
MODEL NAME: /home/mcc/execution/410/model
317 places, 292 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-005B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldPPPs-PT-005B, 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 r355-tall-171683758700428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-005B.tgz
mv ShieldPPPs-PT-005B 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 ;