About the Execution of Marcie+red for EisenbergMcGuire-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6220.163 | 3600000.00 | 3656409.00 | 9141.40 | 1 ? 1 ? 1 1 1 1 1 1 1 1 ? 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r522-tall-167987247100277.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is EisenbergMcGuire-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247100277
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 15K Mar 23 15:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Mar 23 15:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 3.1M Mar 31 16:48 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-00
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-01
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-02
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-03
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-04
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-05
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-06
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-07
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-08
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-09
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-10
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-11
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-12
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-13
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-14
FORMULA_NAME EisenbergMcGuire-PT-10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1680838097818
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-10
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 03:28:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-04-07 03:28:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 03:28:19] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2023-04-07 03:28:19] [INFO ] Transformed 1090 places.
[2023-04-07 03:28:19] [INFO ] Transformed 5200 transitions.
[2023-04-07 03:28:19] [INFO ] Found NUPN structural information;
[2023-04-07 03:28:19] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 305 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Normalized transition count is 2330 out of 5200 initially.
// Phase 1: matrix 2330 rows 1090 cols
[2023-04-07 03:28:19] [INFO ] Computed 31 invariants in 53 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 16) seen :9
FORMULA EisenbergMcGuire-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
[2023-04-07 03:28:20] [INFO ] Flow matrix only has 2330 transitions (discarded 2870 similar events)
// Phase 1: matrix 2330 rows 1090 cols
[2023-04-07 03:28:20] [INFO ] Computed 31 invariants in 20 ms
[2023-04-07 03:28:20] [INFO ] [Real]Absence check using 21 positive place invariants in 29 ms returned sat
[2023-04-07 03:28:20] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-07 03:28:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:28:20] [INFO ] [Real]Absence check using state equation in 482 ms returned sat
[2023-04-07 03:28:20] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:28:21] [INFO ] [Nat]Absence check using 21 positive place invariants in 22 ms returned sat
[2023-04-07 03:28:21] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-07 03:28:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:28:21] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2023-04-07 03:28:21] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-07 03:28:21] [INFO ] [Nat]Added 1246 Read/Feed constraints in 158 ms returned sat
[2023-04-07 03:28:22] [INFO ] Deduced a trap composed of 3 places in 506 ms of which 5 ms to minimize.
[2023-04-07 03:28:23] [INFO ] Deduced a trap composed of 39 places in 593 ms of which 1 ms to minimize.
[2023-04-07 03:28:23] [INFO ] Deduced a trap composed of 80 places in 485 ms of which 2 ms to minimize.
[2023-04-07 03:28:24] [INFO ] Deduced a trap composed of 3 places in 427 ms of which 1 ms to minimize.
[2023-04-07 03:28:24] [INFO ] Deduced a trap composed of 3 places in 358 ms of which 1 ms to minimize.
[2023-04-07 03:28:24] [INFO ] Deduced a trap composed of 6 places in 298 ms of which 1 ms to minimize.
[2023-04-07 03:28:25] [INFO ] Deduced a trap composed of 70 places in 311 ms of which 1 ms to minimize.
[2023-04-07 03:28:25] [INFO ] Deduced a trap composed of 3 places in 298 ms of which 1 ms to minimize.
[2023-04-07 03:28:26] [INFO ] Deduced a trap composed of 3 places in 266 ms of which 2 ms to minimize.
[2023-04-07 03:28:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-07 03:28:26] [INFO ] [Real]Absence check using 21 positive place invariants in 20 ms returned sat
[2023-04-07 03:28:26] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-07 03:28:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:28:26] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2023-04-07 03:28:26] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:28:26] [INFO ] [Nat]Absence check using 21 positive place invariants in 22 ms returned sat
[2023-04-07 03:28:26] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-07 03:28:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:28:27] [INFO ] [Nat]Absence check using state equation in 452 ms returned sat
[2023-04-07 03:28:27] [INFO ] [Nat]Added 1246 Read/Feed constraints in 174 ms returned sat
[2023-04-07 03:28:28] [INFO ] Deduced a trap composed of 3 places in 483 ms of which 0 ms to minimize.
[2023-04-07 03:28:28] [INFO ] Deduced a trap composed of 324 places in 479 ms of which 0 ms to minimize.
[2023-04-07 03:28:29] [INFO ] Deduced a trap composed of 88 places in 487 ms of which 1 ms to minimize.
[2023-04-07 03:28:29] [INFO ] Deduced a trap composed of 29 places in 424 ms of which 0 ms to minimize.
[2023-04-07 03:28:30] [INFO ] Deduced a trap composed of 6 places in 417 ms of which 1 ms to minimize.
[2023-04-07 03:28:30] [INFO ] Deduced a trap composed of 35 places in 414 ms of which 1 ms to minimize.
[2023-04-07 03:28:31] [INFO ] Deduced a trap composed of 57 places in 429 ms of which 1 ms to minimize.
[2023-04-07 03:28:31] [INFO ] Deduced a trap composed of 3 places in 427 ms of which 1 ms to minimize.
[2023-04-07 03:28:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-07 03:28:32] [INFO ] [Real]Absence check using 21 positive place invariants in 21 ms returned sat
[2023-04-07 03:28:32] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-07 03:28:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:28:32] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2023-04-07 03:28:32] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:28:32] [INFO ] [Nat]Absence check using 21 positive place invariants in 23 ms returned sat
[2023-04-07 03:28:32] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-07 03:28:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:28:33] [INFO ] [Nat]Absence check using state equation in 909 ms returned sat
[2023-04-07 03:28:33] [INFO ] [Nat]Added 1246 Read/Feed constraints in 244 ms returned sat
[2023-04-07 03:28:34] [INFO ] Deduced a trap composed of 3 places in 373 ms of which 1 ms to minimize.
[2023-04-07 03:28:34] [INFO ] Deduced a trap composed of 50 places in 371 ms of which 0 ms to minimize.
[2023-04-07 03:28:35] [INFO ] Deduced a trap composed of 35 places in 397 ms of which 1 ms to minimize.
[2023-04-07 03:28:35] [INFO ] Deduced a trap composed of 3 places in 376 ms of which 0 ms to minimize.
[2023-04-07 03:28:36] [INFO ] Deduced a trap composed of 3 places in 366 ms of which 1 ms to minimize.
[2023-04-07 03:28:36] [INFO ] Deduced a trap composed of 41 places in 351 ms of which 1 ms to minimize.
[2023-04-07 03:28:36] [INFO ] Deduced a trap composed of 54 places in 277 ms of which 0 ms to minimize.
[2023-04-07 03:28:37] [INFO ] Deduced a trap composed of 44 places in 233 ms of which 0 ms to minimize.
[2023-04-07 03:28:37] [INFO ] Deduced a trap composed of 3 places in 221 ms of which 1 ms to minimize.
[2023-04-07 03:28:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-07 03:28:37] [INFO ] [Real]Absence check using 21 positive place invariants in 21 ms returned sat
[2023-04-07 03:28:37] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-07 03:28:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:28:38] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2023-04-07 03:28:38] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:28:38] [INFO ] [Nat]Absence check using 21 positive place invariants in 21 ms returned sat
[2023-04-07 03:28:38] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-07 03:28:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:28:38] [INFO ] [Nat]Absence check using state equation in 497 ms returned sat
[2023-04-07 03:28:39] [INFO ] [Nat]Added 1246 Read/Feed constraints in 169 ms returned sat
[2023-04-07 03:28:39] [INFO ] Deduced a trap composed of 3 places in 411 ms of which 9 ms to minimize.
[2023-04-07 03:28:40] [INFO ] Deduced a trap composed of 3 places in 409 ms of which 1 ms to minimize.
[2023-04-07 03:28:40] [INFO ] Deduced a trap composed of 3 places in 461 ms of which 0 ms to minimize.
[2023-04-07 03:28:41] [INFO ] Deduced a trap composed of 65 places in 459 ms of which 1 ms to minimize.
[2023-04-07 03:28:41] [INFO ] Deduced a trap composed of 38 places in 417 ms of which 1 ms to minimize.
[2023-04-07 03:28:42] [INFO ] Deduced a trap composed of 3 places in 413 ms of which 2 ms to minimize.
[2023-04-07 03:28:42] [INFO ] Deduced a trap composed of 51 places in 397 ms of which 1 ms to minimize.
[2023-04-07 03:28:43] [INFO ] Deduced a trap composed of 3 places in 350 ms of which 1 ms to minimize.
[2023-04-07 03:28:43] [INFO ] Deduced a trap composed of 35 places in 315 ms of which 4 ms to minimize.
[2023-04-07 03:28:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-07 03:28:43] [INFO ] [Real]Absence check using 21 positive place invariants in 19 ms returned sat
[2023-04-07 03:28:43] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-07 03:28:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:28:44] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2023-04-07 03:28:44] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:28:44] [INFO ] [Nat]Absence check using 21 positive place invariants in 21 ms returned sat
[2023-04-07 03:28:44] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-07 03:28:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:28:44] [INFO ] [Nat]Absence check using state equation in 453 ms returned sat
[2023-04-07 03:28:44] [INFO ] [Nat]Added 1246 Read/Feed constraints in 172 ms returned sat
[2023-04-07 03:28:45] [INFO ] Deduced a trap composed of 3 places in 399 ms of which 1 ms to minimize.
[2023-04-07 03:28:45] [INFO ] Deduced a trap composed of 64 places in 407 ms of which 1 ms to minimize.
[2023-04-07 03:28:46] [INFO ] Deduced a trap composed of 4 places in 429 ms of which 1 ms to minimize.
[2023-04-07 03:28:46] [INFO ] Deduced a trap composed of 3 places in 403 ms of which 1 ms to minimize.
[2023-04-07 03:28:47] [INFO ] Deduced a trap composed of 50 places in 356 ms of which 0 ms to minimize.
[2023-04-07 03:28:47] [INFO ] Deduced a trap composed of 3 places in 344 ms of which 0 ms to minimize.
[2023-04-07 03:28:48] [INFO ] Deduced a trap composed of 41 places in 361 ms of which 0 ms to minimize.
[2023-04-07 03:28:48] [INFO ] Deduced a trap composed of 46 places in 345 ms of which 1 ms to minimize.
[2023-04-07 03:28:48] [INFO ] Deduced a trap composed of 3 places in 305 ms of which 1 ms to minimize.
[2023-04-07 03:28:49] [INFO ] Deduced a trap composed of 85 places in 310 ms of which 0 ms to minimize.
[2023-04-07 03:28:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-07 03:28:49] [INFO ] [Real]Absence check using 21 positive place invariants in 21 ms returned sat
[2023-04-07 03:28:49] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-07 03:28:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:28:49] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2023-04-07 03:28:50] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:28:50] [INFO ] [Nat]Absence check using 21 positive place invariants in 22 ms returned sat
[2023-04-07 03:28:50] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-07 03:28:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:28:50] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2023-04-07 03:28:50] [INFO ] [Nat]Added 1246 Read/Feed constraints in 167 ms returned sat
[2023-04-07 03:28:51] [INFO ] Deduced a trap composed of 3 places in 401 ms of which 0 ms to minimize.
[2023-04-07 03:28:51] [INFO ] Deduced a trap composed of 3 places in 404 ms of which 1 ms to minimize.
[2023-04-07 03:28:52] [INFO ] Deduced a trap composed of 45 places in 408 ms of which 1 ms to minimize.
[2023-04-07 03:28:52] [INFO ] Deduced a trap composed of 47 places in 404 ms of which 0 ms to minimize.
[2023-04-07 03:28:53] [INFO ] Deduced a trap composed of 3 places in 425 ms of which 1 ms to minimize.
[2023-04-07 03:28:53] [INFO ] Deduced a trap composed of 3 places in 408 ms of which 1 ms to minimize.
[2023-04-07 03:28:54] [INFO ] Deduced a trap composed of 3 places in 403 ms of which 1 ms to minimize.
[2023-04-07 03:28:54] [INFO ] Deduced a trap composed of 35 places in 363 ms of which 1 ms to minimize.
[2023-04-07 03:28:54] [INFO ] Deduced a trap composed of 94 places in 307 ms of which 1 ms to minimize.
[2023-04-07 03:28:55] [INFO ] Deduced a trap composed of 3 places in 577 ms of which 1 ms to minimize.
[2023-04-07 03:28:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-07 03:28:55] [INFO ] [Real]Absence check using 21 positive place invariants in 21 ms returned sat
[2023-04-07 03:28:55] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-07 03:28:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:28:56] [INFO ] [Real]Absence check using state equation in 500 ms returned sat
[2023-04-07 03:28:56] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:28:56] [INFO ] [Nat]Absence check using 21 positive place invariants in 23 ms returned sat
[2023-04-07 03:28:56] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 17 ms returned sat
[2023-04-07 03:28:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:28:57] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2023-04-07 03:28:57] [INFO ] [Nat]Added 1246 Read/Feed constraints in 182 ms returned sat
[2023-04-07 03:28:57] [INFO ] Deduced a trap composed of 3 places in 407 ms of which 1 ms to minimize.
[2023-04-07 03:28:58] [INFO ] Deduced a trap composed of 3 places in 408 ms of which 2 ms to minimize.
[2023-04-07 03:28:58] [INFO ] Deduced a trap composed of 51 places in 414 ms of which 0 ms to minimize.
[2023-04-07 03:28:59] [INFO ] Deduced a trap composed of 45 places in 407 ms of which 1 ms to minimize.
[2023-04-07 03:28:59] [INFO ] Deduced a trap composed of 3 places in 406 ms of which 1 ms to minimize.
[2023-04-07 03:29:00] [INFO ] Deduced a trap composed of 82 places in 356 ms of which 1 ms to minimize.
[2023-04-07 03:29:00] [INFO ] Deduced a trap composed of 41 places in 304 ms of which 1 ms to minimize.
[2023-04-07 03:29:00] [INFO ] Deduced a trap composed of 44 places in 302 ms of which 0 ms to minimize.
[2023-04-07 03:29:01] [INFO ] Deduced a trap composed of 50 places in 303 ms of which 1 ms to minimize.
[2023-04-07 03:29:01] [INFO ] Deduced a trap composed of 3 places in 231 ms of which 2 ms to minimize.
[2023-04-07 03:29:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1090 transition count 5190
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 1080 transition count 5190
Performed 308 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 308 Pre rules applied. Total rules applied 20 place count 1080 transition count 4882
Deduced a syphon composed of 308 places in 5 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 2 with 616 rules applied. Total rules applied 636 place count 772 transition count 4882
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 726 place count 682 transition count 3982
Iterating global reduction 2 with 90 rules applied. Total rules applied 816 place count 682 transition count 3982
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 9 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 992 place count 594 transition count 3894
Applied a total of 992 rules in 529 ms. Remains 594 /1090 variables (removed 496) and now considering 3894/5200 (removed 1306) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 530 ms. Remains : 594/1090 places, 3894/5200 transitions.
Normalized transition count is 1024 out of 3894 initially.
// Phase 1: matrix 1024 rows 594 cols
[2023-04-07 03:29:02] [INFO ] Computed 31 invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2472 ms. (steps per millisecond=404 ) properties (out of 7) seen :2
FORMULA EisenbergMcGuire-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 531 ms. (steps per millisecond=1883 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 529 ms. (steps per millisecond=1890 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 538 ms. (steps per millisecond=1858 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 532 ms. (steps per millisecond=1879 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 537 ms. (steps per millisecond=1862 ) properties (out of 5) seen :0
[2023-04-07 03:29:07] [INFO ] Flow matrix only has 1024 transitions (discarded 2870 similar events)
// Phase 1: matrix 1024 rows 594 cols
[2023-04-07 03:29:07] [INFO ] Computed 31 invariants in 9 ms
[2023-04-07 03:29:07] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-07 03:29:07] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-07 03:29:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:29:07] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2023-04-07 03:29:07] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:29:07] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-07 03:29:07] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 12 ms returned sat
[2023-04-07 03:29:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:29:07] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2023-04-07 03:29:07] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 03:29:07] [INFO ] [Nat]Added 436 Read/Feed constraints in 53 ms returned sat
[2023-04-07 03:29:08] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2023-04-07 03:29:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2023-04-07 03:29:08] [INFO ] Computed and/alt/rep : 874/1974/604 causal constraints (skipped 410 transitions) in 147 ms.
[2023-04-07 03:29:08] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
[2023-04-07 03:29:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2023-04-07 03:29:09] [INFO ] Added : 64 causal constraints over 14 iterations in 1119 ms. Result :sat
Minimization took 105 ms.
[2023-04-07 03:29:09] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-07 03:29:09] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-07 03:29:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:29:09] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2023-04-07 03:29:09] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:29:09] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-07 03:29:09] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-07 03:29:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:29:09] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2023-04-07 03:29:09] [INFO ] [Nat]Added 436 Read/Feed constraints in 52 ms returned sat
[2023-04-07 03:29:10] [INFO ] Computed and/alt/rep : 874/1974/604 causal constraints (skipped 410 transitions) in 87 ms.
[2023-04-07 03:29:10] [INFO ] Added : 62 causal constraints over 13 iterations in 759 ms. Result :sat
Minimization took 112 ms.
[2023-04-07 03:29:10] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned sat
[2023-04-07 03:29:10] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-07 03:29:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:29:11] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2023-04-07 03:29:11] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:29:11] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-04-07 03:29:11] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-07 03:29:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:29:11] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2023-04-07 03:29:11] [INFO ] [Nat]Added 436 Read/Feed constraints in 54 ms returned sat
[2023-04-07 03:29:11] [INFO ] Computed and/alt/rep : 874/1974/604 causal constraints (skipped 410 transitions) in 96 ms.
[2023-04-07 03:29:12] [INFO ] Added : 71 causal constraints over 15 iterations in 858 ms. Result :sat
Minimization took 119 ms.
[2023-04-07 03:29:12] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-07 03:29:12] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-07 03:29:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:29:12] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2023-04-07 03:29:12] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:29:12] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-07 03:29:12] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-07 03:29:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:29:13] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2023-04-07 03:29:13] [INFO ] [Nat]Added 436 Read/Feed constraints in 75 ms returned sat
[2023-04-07 03:29:13] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-04-07 03:29:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-04-07 03:29:13] [INFO ] Computed and/alt/rep : 874/1974/604 causal constraints (skipped 410 transitions) in 84 ms.
[2023-04-07 03:29:13] [INFO ] Added : 46 causal constraints over 10 iterations in 615 ms. Result :sat
Minimization took 102 ms.
[2023-04-07 03:29:14] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-07 03:29:14] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-07 03:29:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:29:14] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2023-04-07 03:29:14] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:29:14] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-07 03:29:14] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-07 03:29:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:29:14] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2023-04-07 03:29:14] [INFO ] [Nat]Added 436 Read/Feed constraints in 52 ms returned sat
[2023-04-07 03:29:14] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2023-04-07 03:29:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-04-07 03:29:14] [INFO ] Computed and/alt/rep : 874/1974/604 causal constraints (skipped 410 transitions) in 82 ms.
[2023-04-07 03:29:15] [INFO ] Added : 24 causal constraints over 5 iterations in 389 ms. Result :sat
Minimization took 109 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA EisenbergMcGuire-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 594 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 594/594 places, 3894/3894 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 592 transition count 3892
Applied a total of 4 rules in 181 ms. Remains 592 /594 variables (removed 2) and now considering 3892/3894 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 592/594 places, 3892/3894 transitions.
Normalized transition count is 1022 out of 3892 initially.
// Phase 1: matrix 1022 rows 592 cols
[2023-04-07 03:29:16] [INFO ] Computed 31 invariants in 13 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2340 ms. (steps per millisecond=427 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 538 ms. (steps per millisecond=1858 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 537 ms. (steps per millisecond=1862 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 575 ms. (steps per millisecond=1739 ) properties (out of 3) seen :0
[2023-04-07 03:29:20] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
// Phase 1: matrix 1022 rows 592 cols
[2023-04-07 03:29:20] [INFO ] Computed 31 invariants in 12 ms
[2023-04-07 03:29:20] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-07 03:29:20] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-07 03:29:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:29:20] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2023-04-07 03:29:20] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:29:20] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-07 03:29:20] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-07 03:29:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:29:21] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2023-04-07 03:29:21] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 03:29:21] [INFO ] [Nat]Added 436 Read/Feed constraints in 67 ms returned sat
[2023-04-07 03:29:21] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 1 ms to minimize.
[2023-04-07 03:29:21] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 0 ms to minimize.
[2023-04-07 03:29:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 289 ms
[2023-04-07 03:29:21] [INFO ] Computed and/alt/rep : 872/1972/602 causal constraints (skipped 410 transitions) in 80 ms.
[2023-04-07 03:29:21] [INFO ] Added : 42 causal constraints over 9 iterations in 552 ms. Result :sat
Minimization took 111 ms.
[2023-04-07 03:29:22] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-07 03:29:22] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 9 ms returned sat
[2023-04-07 03:29:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:29:22] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2023-04-07 03:29:22] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:29:22] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-07 03:29:22] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-07 03:29:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:29:22] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2023-04-07 03:29:22] [INFO ] [Nat]Added 436 Read/Feed constraints in 49 ms returned sat
[2023-04-07 03:29:22] [INFO ] Computed and/alt/rep : 872/1972/602 causal constraints (skipped 410 transitions) in 81 ms.
[2023-04-07 03:29:23] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-07 03:29:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2023-04-07 03:29:23] [INFO ] Added : 42 causal constraints over 9 iterations in 706 ms. Result :sat
Minimization took 116 ms.
[2023-04-07 03:29:23] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned sat
[2023-04-07 03:29:23] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 3 ms returned sat
[2023-04-07 03:29:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:29:23] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2023-04-07 03:29:23] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:29:23] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-07 03:29:23] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-07 03:29:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:29:24] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2023-04-07 03:29:24] [INFO ] [Nat]Added 436 Read/Feed constraints in 50 ms returned sat
[2023-04-07 03:29:24] [INFO ] Computed and/alt/rep : 872/1972/602 causal constraints (skipped 410 transitions) in 80 ms.
[2023-04-07 03:29:24] [INFO ] Added : 23 causal constraints over 5 iterations in 379 ms. Result :sat
Minimization took 113 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 3892/3892 transitions.
Applied a total of 0 rules in 135 ms. Remains 592 /592 variables (removed 0) and now considering 3892/3892 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 592/592 places, 3892/3892 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 3892/3892 transitions.
Applied a total of 0 rules in 134 ms. Remains 592 /592 variables (removed 0) and now considering 3892/3892 (removed 0) transitions.
[2023-04-07 03:29:25] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
[2023-04-07 03:29:25] [INFO ] Invariant cache hit.
[2023-04-07 03:29:26] [INFO ] Implicit Places using invariants in 635 ms returned []
[2023-04-07 03:29:26] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
[2023-04-07 03:29:26] [INFO ] Invariant cache hit.
[2023-04-07 03:29:26] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 03:29:30] [INFO ] Implicit Places using invariants and state equation in 3876 ms returned []
Implicit Place search using SMT with State Equation took 4515 ms to find 0 implicit places.
[2023-04-07 03:29:30] [INFO ] Redundant transitions in 246 ms returned []
[2023-04-07 03:29:30] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
[2023-04-07 03:29:30] [INFO ] Invariant cache hit.
[2023-04-07 03:29:31] [INFO ] Dead Transitions using invariants and state equation in 1192 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6102 ms. Remains : 592/592 places, 3892/3892 transitions.
Starting property specific reduction for EisenbergMcGuire-PT-10-UpperBounds-01
Normalized transition count is 1022 out of 3892 initially.
// Phase 1: matrix 1022 rows 592 cols
[2023-04-07 03:29:31] [INFO ] Computed 31 invariants in 12 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-04-07 03:29:31] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
// Phase 1: matrix 1022 rows 592 cols
[2023-04-07 03:29:31] [INFO ] Computed 31 invariants in 10 ms
[2023-04-07 03:29:31] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-07 03:29:31] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 3 ms returned sat
[2023-04-07 03:29:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:29:31] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2023-04-07 03:29:31] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:29:31] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-07 03:29:31] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 10 ms returned sat
[2023-04-07 03:29:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:29:32] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2023-04-07 03:29:32] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 03:29:32] [INFO ] [Nat]Added 436 Read/Feed constraints in 54 ms returned sat
[2023-04-07 03:29:32] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 1 ms to minimize.
[2023-04-07 03:29:32] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2023-04-07 03:29:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 285 ms
[2023-04-07 03:29:32] [INFO ] Computed and/alt/rep : 872/1972/602 causal constraints (skipped 410 transitions) in 94 ms.
[2023-04-07 03:29:33] [INFO ] Added : 42 causal constraints over 9 iterations in 562 ms. Result :sat
Minimization took 115 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 3892/3892 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 592 transition count 3890
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 590 transition count 3890
Applied a total of 4 rules in 143 ms. Remains 590 /592 variables (removed 2) and now considering 3890/3892 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 590/592 places, 3890/3892 transitions.
Normalized transition count is 1020 out of 3890 initially.
// Phase 1: matrix 1020 rows 590 cols
[2023-04-07 03:29:33] [INFO ] Computed 31 invariants in 13 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2238 ms. (steps per millisecond=446 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 529 ms. (steps per millisecond=1890 ) properties (out of 1) seen :0
[2023-04-07 03:29:36] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-07 03:29:36] [INFO ] Computed 31 invariants in 9 ms
[2023-04-07 03:29:36] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-07 03:29:36] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-07 03:29:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:29:36] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2023-04-07 03:29:36] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:29:36] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-07 03:29:36] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-07 03:29:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:29:36] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2023-04-07 03:29:36] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 03:29:37] [INFO ] [Nat]Added 436 Read/Feed constraints in 56 ms returned sat
[2023-04-07 03:29:37] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-04-07 03:29:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-04-07 03:29:37] [INFO ] Computed and/alt/rep : 870/1970/600 causal constraints (skipped 410 transitions) in 82 ms.
[2023-04-07 03:29:37] [INFO ] Added : 56 causal constraints over 12 iterations in 695 ms. Result :sat
Minimization took 113 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 132 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 131 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-07 03:29:38] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-07 03:29:38] [INFO ] Invariant cache hit.
[2023-04-07 03:29:38] [INFO ] Implicit Places using invariants in 573 ms returned []
[2023-04-07 03:29:38] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-07 03:29:38] [INFO ] Invariant cache hit.
[2023-04-07 03:29:39] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 03:29:42] [INFO ] Implicit Places using invariants and state equation in 3489 ms returned []
Implicit Place search using SMT with State Equation took 4064 ms to find 0 implicit places.
[2023-04-07 03:29:42] [INFO ] Redundant transitions in 245 ms returned []
[2023-04-07 03:29:42] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-07 03:29:42] [INFO ] Invariant cache hit.
[2023-04-07 03:29:43] [INFO ] Dead Transitions using invariants and state equation in 1215 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5662 ms. Remains : 590/590 places, 3890/3890 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-10-UpperBounds-01 in 12437 ms.
Starting property specific reduction for EisenbergMcGuire-PT-10-UpperBounds-03
Normalized transition count is 1022 out of 3892 initially.
// Phase 1: matrix 1022 rows 592 cols
[2023-04-07 03:29:43] [INFO ] Computed 31 invariants in 8 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-04-07 03:29:44] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
// Phase 1: matrix 1022 rows 592 cols
[2023-04-07 03:29:44] [INFO ] Computed 31 invariants in 8 ms
[2023-04-07 03:29:44] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned sat
[2023-04-07 03:29:44] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 3 ms returned sat
[2023-04-07 03:29:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:29:44] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2023-04-07 03:29:44] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:29:44] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-07 03:29:44] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 3 ms returned sat
[2023-04-07 03:29:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:29:44] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2023-04-07 03:29:44] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 03:29:44] [INFO ] [Nat]Added 436 Read/Feed constraints in 55 ms returned sat
[2023-04-07 03:29:44] [INFO ] Computed and/alt/rep : 872/1972/602 causal constraints (skipped 410 transitions) in 80 ms.
[2023-04-07 03:29:45] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2023-04-07 03:29:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2023-04-07 03:29:45] [INFO ] Added : 42 causal constraints over 9 iterations in 711 ms. Result :sat
Minimization took 110 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 3892/3892 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 592 transition count 3891
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 591 transition count 3891
Applied a total of 2 rules in 140 ms. Remains 591 /592 variables (removed 1) and now considering 3891/3892 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 591/592 places, 3891/3892 transitions.
Normalized transition count is 1021 out of 3891 initially.
// Phase 1: matrix 1021 rows 591 cols
[2023-04-07 03:29:45] [INFO ] Computed 31 invariants in 11 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2234 ms. (steps per millisecond=447 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 530 ms. (steps per millisecond=1886 ) properties (out of 1) seen :0
[2023-04-07 03:29:48] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
// Phase 1: matrix 1021 rows 591 cols
[2023-04-07 03:29:48] [INFO ] Computed 31 invariants in 8 ms
[2023-04-07 03:29:48] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned sat
[2023-04-07 03:29:48] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 3 ms returned sat
[2023-04-07 03:29:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:29:48] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2023-04-07 03:29:48] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:29:49] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-07 03:29:49] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 11 ms returned sat
[2023-04-07 03:29:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:29:49] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2023-04-07 03:29:49] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 03:29:49] [INFO ] [Nat]Added 436 Read/Feed constraints in 57 ms returned sat
[2023-04-07 03:29:49] [INFO ] Computed and/alt/rep : 871/1971/601 causal constraints (skipped 410 transitions) in 81 ms.
[2023-04-07 03:29:50] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 0 ms to minimize.
[2023-04-07 03:29:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-04-07 03:29:50] [INFO ] Added : 70 causal constraints over 14 iterations in 992 ms. Result :sat
Minimization took 119 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 140 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 591/591 places, 3891/3891 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 129 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
[2023-04-07 03:29:50] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 03:29:50] [INFO ] Invariant cache hit.
[2023-04-07 03:29:51] [INFO ] Implicit Places using invariants in 567 ms returned []
[2023-04-07 03:29:51] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 03:29:51] [INFO ] Invariant cache hit.
[2023-04-07 03:29:51] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 03:29:55] [INFO ] Implicit Places using invariants and state equation in 3587 ms returned []
Implicit Place search using SMT with State Equation took 4156 ms to find 0 implicit places.
[2023-04-07 03:29:55] [INFO ] Redundant transitions in 137 ms returned []
[2023-04-07 03:29:55] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 03:29:55] [INFO ] Invariant cache hit.
[2023-04-07 03:29:56] [INFO ] Dead Transitions using invariants and state equation in 1080 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5517 ms. Remains : 591/591 places, 3891/3891 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-10-UpperBounds-03 in 12351 ms.
Starting property specific reduction for EisenbergMcGuire-PT-10-UpperBounds-12
Normalized transition count is 1022 out of 3892 initially.
// Phase 1: matrix 1022 rows 592 cols
[2023-04-07 03:29:56] [INFO ] Computed 31 invariants in 6 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-04-07 03:29:56] [INFO ] Flow matrix only has 1022 transitions (discarded 2870 similar events)
// Phase 1: matrix 1022 rows 592 cols
[2023-04-07 03:29:56] [INFO ] Computed 31 invariants in 4 ms
[2023-04-07 03:29:56] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-07 03:29:56] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 3 ms returned sat
[2023-04-07 03:29:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:29:56] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2023-04-07 03:29:56] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:29:56] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-07 03:29:56] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-07 03:29:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:29:56] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2023-04-07 03:29:56] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 03:29:56] [INFO ] [Nat]Added 436 Read/Feed constraints in 53 ms returned sat
[2023-04-07 03:29:57] [INFO ] Computed and/alt/rep : 872/1972/602 causal constraints (skipped 410 transitions) in 81 ms.
[2023-04-07 03:29:57] [INFO ] Added : 23 causal constraints over 5 iterations in 376 ms. Result :sat
Minimization took 114 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 3892/3892 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 592 transition count 3891
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 591 transition count 3891
Applied a total of 2 rules in 138 ms. Remains 591 /592 variables (removed 1) and now considering 3891/3892 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 591/592 places, 3891/3892 transitions.
Normalized transition count is 1021 out of 3891 initially.
// Phase 1: matrix 1021 rows 591 cols
[2023-04-07 03:29:57] [INFO ] Computed 31 invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2229 ms. (steps per millisecond=448 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 529 ms. (steps per millisecond=1890 ) properties (out of 1) seen :0
[2023-04-07 03:30:00] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
// Phase 1: matrix 1021 rows 591 cols
[2023-04-07 03:30:00] [INFO ] Computed 31 invariants in 6 ms
[2023-04-07 03:30:00] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-07 03:30:00] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-07 03:30:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:30:00] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2023-04-07 03:30:00] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:30:00] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-07 03:30:00] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 3 ms returned sat
[2023-04-07 03:30:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:30:01] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2023-04-07 03:30:01] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 03:30:01] [INFO ] [Nat]Added 436 Read/Feed constraints in 53 ms returned sat
[2023-04-07 03:30:01] [INFO ] Computed and/alt/rep : 871/1971/601 causal constraints (skipped 410 transitions) in 81 ms.
[2023-04-07 03:30:02] [INFO ] Added : 70 causal constraints over 14 iterations in 792 ms. Result :sat
Minimization took 115 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 591 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 127 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 591/591 places, 3891/3891 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 591/591 places, 3891/3891 transitions.
Applied a total of 0 rules in 141 ms. Remains 591 /591 variables (removed 0) and now considering 3891/3891 (removed 0) transitions.
[2023-04-07 03:30:02] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 03:30:02] [INFO ] Invariant cache hit.
[2023-04-07 03:30:03] [INFO ] Implicit Places using invariants in 569 ms returned []
[2023-04-07 03:30:03] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 03:30:03] [INFO ] Invariant cache hit.
[2023-04-07 03:30:03] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-07 03:30:06] [INFO ] Implicit Places using invariants and state equation in 3634 ms returned []
Implicit Place search using SMT with State Equation took 4204 ms to find 0 implicit places.
[2023-04-07 03:30:07] [INFO ] Redundant transitions in 137 ms returned []
[2023-04-07 03:30:07] [INFO ] Flow matrix only has 1021 transitions (discarded 2870 similar events)
[2023-04-07 03:30:07] [INFO ] Invariant cache hit.
[2023-04-07 03:30:08] [INFO ] Dead Transitions using invariants and state equation in 1096 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5586 ms. Remains : 591/591 places, 3891/3891 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-10-UpperBounds-12 in 11870 ms.
[2023-04-07 03:30:08] [INFO ] Flatten gal took : 289 ms
[2023-04-07 03:30:08] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-04-07 03:30:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 592 places, 3892 transitions and 20984 arcs took 21 ms.
Total runtime 109338 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: EisenbergMcGuire_PT_10
(NrP: 592 NrTr: 3892 NrArc: 20984)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.381sec
net check time: 0m 0.003sec
init dd package: 0m 2.965sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9929376 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16102924 kB
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.038sec
38972 53402 85458 145120 161204 178940 186896 158131 293675 308586 298182 317450 346006 355125 825175 926883 936726 938303 1100891 1173879 1131555 1139793 1223387 1205512 1213691 1219384 1208119 1190392 1198123 1205974 1281710
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="EisenbergMcGuire-PT-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is EisenbergMcGuire-PT-10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r522-tall-167987247100277"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-10.tgz
mv EisenbergMcGuire-PT-10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;