About the Execution of ITS-Tools for RERS2020-PT-pb107
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8323.075 | 2459002.00 | 2690642.00 | 10675.90 | 0 0 1 1 0 0 0 0 1 0 1 1 0 0 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/mcc2022-input.r312-tall-165472282600677.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is RERS2020-PT-pb107, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282600677
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 58M
-rw-r--r-- 1 mcc users 5.6K Jun 7 17:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Jun 7 17:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 7 17:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 7 17:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 6 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 6 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 14K Jun 7 17:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Jun 7 17:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Jun 7 17:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 7 17:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 58M Jun 6 12:11 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 RERS2020-PT-pb107-UpperBounds-00
FORMULA_NAME RERS2020-PT-pb107-UpperBounds-01
FORMULA_NAME RERS2020-PT-pb107-UpperBounds-02
FORMULA_NAME RERS2020-PT-pb107-UpperBounds-03
FORMULA_NAME RERS2020-PT-pb107-UpperBounds-04
FORMULA_NAME RERS2020-PT-pb107-UpperBounds-05
FORMULA_NAME RERS2020-PT-pb107-UpperBounds-06
FORMULA_NAME RERS2020-PT-pb107-UpperBounds-07
FORMULA_NAME RERS2020-PT-pb107-UpperBounds-08
FORMULA_NAME RERS2020-PT-pb107-UpperBounds-09
FORMULA_NAME RERS2020-PT-pb107-UpperBounds-10
FORMULA_NAME RERS2020-PT-pb107-UpperBounds-11
FORMULA_NAME RERS2020-PT-pb107-UpperBounds-12
FORMULA_NAME RERS2020-PT-pb107-UpperBounds-13
FORMULA_NAME RERS2020-PT-pb107-UpperBounds-14
FORMULA_NAME RERS2020-PT-pb107-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1654919459007
Running Version 202205111006
[2022-06-11 03:51:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-11 03:51:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 03:51:02] [INFO ] Load time of PNML (sax parser for PT used): 2030 ms
[2022-06-11 03:51:02] [INFO ] Transformed 1382 places.
[2022-06-11 03:51:02] [INFO ] Transformed 104643 transitions.
[2022-06-11 03:51:02] [INFO ] Found NUPN structural information;
[2022-06-11 03:51:02] [INFO ] Parsed PT model containing 1382 places and 104643 transitions in 2537 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 11427 transitions
Reduce redundant transitions removed 11427 transitions.
Normalized transition count is 62870 out of 93216 initially.
// Phase 1: matrix 62870 rows 1382 cols
[2022-06-11 03:51:04] [INFO ] Computed 25 place invariants in 446 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 985 ms. (steps per millisecond=10 ) properties (out of 16) seen :5
FORMULA RERS2020-PT-pb107-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb107-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb107-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb107-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS2020-PT-pb107-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :1
FORMULA RERS2020-PT-pb107-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
[2022-06-11 03:51:06] [INFO ] Flow matrix only has 62870 transitions (discarded 30346 similar events)
// Phase 1: matrix 62870 rows 1382 cols
[2022-06-11 03:51:06] [INFO ] Computed 25 place invariants in 287 ms
[2022-06-11 03:51:06] [INFO ] [Real]Absence check using 13 positive place invariants in 32 ms returned sat
[2022-06-11 03:51:06] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 3 ms returned sat
[2022-06-11 03:51:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 03:51:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-06-11 03:51:11] [INFO ] [Real]Absence check using 13 positive place invariants in 27 ms returned sat
[2022-06-11 03:51:11] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 1 ms returned sat
[2022-06-11 03:51:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 03:51:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-06-11 03:51:16] [INFO ] [Real]Absence check using 13 positive place invariants in 27 ms returned sat
[2022-06-11 03:51:16] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 3 ms returned sat
[2022-06-11 03:51:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 03:51:21] [INFO ] [Real]Absence check using state equation in 4787 ms returned unknown
[2022-06-11 03:51:21] [INFO ] [Real]Absence check using 13 positive place invariants in 25 ms returned sat
[2022-06-11 03:51:21] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 3 ms returned sat
[2022-06-11 03:51:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 03:51: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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-06-11 03:51:26] [INFO ] [Real]Absence check using 13 positive place invariants in 30 ms returned sat
[2022-06-11 03:51:26] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 10 ms returned sat
[2022-06-11 03:51:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 03:51: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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-06-11 03:51:31] [INFO ] [Real]Absence check using 13 positive place invariants in 22 ms returned sat
[2022-06-11 03:51:31] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 14 ms returned sat
[2022-06-11 03:51:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 03:51:36] [INFO ] [Real]Absence check using state equation in 4783 ms returned unknown
[2022-06-11 03:51:36] [INFO ] [Real]Absence check using 13 positive place invariants in 22 ms returned sat
[2022-06-11 03:51:36] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2022-06-11 03:51:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 03:51:41] [INFO ] [Real]Absence check using state equation in 4802 ms returned unknown
[2022-06-11 03:51:41] [INFO ] [Real]Absence check using 13 positive place invariants in 25 ms returned sat
[2022-06-11 03:51:41] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 4 ms returned sat
[2022-06-11 03:51:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 03:51:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-06-11 03:51:46] [INFO ] [Real]Absence check using 13 positive place invariants in 25 ms returned sat
[2022-06-11 03:51:46] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2022-06-11 03:51:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 03:51:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-06-11 03:51:51] [INFO ] [Real]Absence check using 13 positive place invariants in 26 ms returned sat
[2022-06-11 03:51:51] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 7 ms returned sat
[2022-06-11 03:51:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 03:51:56] [INFO ] [Real]Absence check using state equation in 4764 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 10 out of 1382 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1382/1382 places, 93216/93216 transitions.
Graph (complete) has 84016 edges and 1382 vertex of which 1381 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.106 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 12 places
Drop transitions removed 2811 transitions
Reduce isomorphic transitions removed 2811 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2824 rules applied. Total rules applied 2825 place count 1369 transition count 90404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2826 place count 1368 transition count 90404
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2826 place count 1368 transition count 90402
Deduced a syphon composed of 2 places in 64 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 2830 place count 1366 transition count 90402
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2832 place count 1366 transition count 90400
Performed 17 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 17 places in 57 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 2866 place count 1349 transition count 90380
Drop transitions removed 6 transitions
Ensure Unique test removed 439 transitions
Reduce isomorphic transitions removed 445 transitions.
Iterating post reduction 3 with 445 rules applied. Total rules applied 3311 place count 1349 transition count 89935
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 61 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 3319 place count 1345 transition count 89931
Drop transitions removed 4 transitions
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 4 with 96 rules applied. Total rules applied 3415 place count 1345 transition count 89835
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 57 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3417 place count 1344 transition count 89836
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 3420 place count 1344 transition count 89833
Free-agglomeration rule applied 32 times.
Iterating global reduction 6 with 32 rules applied. Total rules applied 3452 place count 1344 transition count 89801
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 44 transitions
Ensure Unique test removed 555 transitions
Reduce isomorphic transitions removed 599 transitions.
Iterating post reduction 6 with 631 rules applied. Total rules applied 4083 place count 1312 transition count 89202
Free-agglomeration rule (complex) applied 15 times with reduction of 16 identical transitions.
Iterating global reduction 7 with 15 rules applied. Total rules applied 4098 place count 1312 transition count 89935
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 7 with 41 rules applied. Total rules applied 4139 place count 1297 transition count 89909
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 4140 place count 1296 transition count 89908
Applied a total of 4140 rules in 5978 ms. Remains 1296 /1382 variables (removed 86) and now considering 89908/93216 (removed 3308) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1382 places, 89908/93216 transitions.
Normalized transition count is 62424 out of 89908 initially.
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-11 03:52:02] [INFO ] Computed 12 place invariants in 287 ms
Interrupted random walk after 571568 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=19 ) properties seen 0
Interrupted Best-First random walk after 789648 steps, including 4 resets, run timeout after 5001 ms. (steps per millisecond=157 ) properties seen 0
Interrupted Best-First random walk after 821536 steps, including 4 resets, run timeout after 5001 ms. (steps per millisecond=164 ) properties seen 0
Interrupted Best-First random walk after 829365 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=165 ) properties seen 0
Interrupted Best-First random walk after 800773 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=160 ) properties seen 0
Interrupted Best-First random walk after 777327 steps, including 4 resets, run timeout after 5001 ms. (steps per millisecond=155 ) properties seen 0
Interrupted Best-First random walk after 811837 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=162 ) properties seen 0
Interrupted Best-First random walk after 827423 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=165 ) properties seen 0
Interrupted Best-First random walk after 834691 steps, including 3 resets, run timeout after 5001 ms. (steps per millisecond=166 ) properties seen 0
Interrupted Best-First random walk after 815603 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=163 ) properties seen 0
Interrupted Best-First random walk after 837313 steps, including 3 resets, run timeout after 5001 ms. (steps per millisecond=167 ) properties seen 0
[2022-06-11 03:53:22] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-11 03:53:23] [INFO ] Computed 12 place invariants in 194 ms
[2022-06-11 03:53:23] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned sat
[2022-06-11 03:53:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 03:53:35] [INFO ] [Real]Absence check using state equation in 11864 ms returned sat
[2022-06-11 03:53:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 03:53:36] [INFO ] [Nat]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-11 03:53:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 03:53:49] [INFO ] [Nat]Absence check using state equation in 12724 ms returned sat
[2022-06-11 03:53:49] [INFO ] State equation strengthened by 3688 read => feed constraints.
[2022-06-11 03:53:55] [INFO ] [Nat]Added 3688 Read/Feed constraints in 5977 ms returned sat
[2022-06-11 03:54:03] [INFO ] Deduced a trap composed of 19 places in 7086 ms of which 12 ms to minimize.
[2022-06-11 03:54:12] [INFO ] Deduced a trap composed of 58 places in 8179 ms of which 3 ms to minimize.
[2022-06-11 03:54:21] [INFO ] Deduced a trap composed of 47 places in 8010 ms of which 2 ms to minimize.
[2022-06-11 03:54:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-06-11 03:54:21] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2022-06-11 03:54:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 03:54:34] [INFO ] [Real]Absence check using state equation in 12763 ms returned sat
[2022-06-11 03:54:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 03:54:35] [INFO ] [Nat]Absence check using 12 positive place invariants in 22 ms returned sat
[2022-06-11 03:54:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 03:54:48] [INFO ] [Nat]Absence check using state equation in 12688 ms returned sat
[2022-06-11 03:54:54] [INFO ] [Nat]Added 3688 Read/Feed constraints in 5822 ms returned sat
[2022-06-11 03:55:02] [INFO ] Deduced a trap composed of 166 places in 6907 ms of which 5 ms to minimize.
[2022-06-11 03:55:08] [INFO ] Deduced a trap composed of 27 places in 5877 ms of which 1 ms to minimize.
[2022-06-11 03:55:15] [INFO ] Deduced a trap composed of 20 places in 5624 ms of which 2 ms to minimize.
[2022-06-11 03:55:21] [INFO ] Deduced a trap composed of 69 places in 5659 ms of which 1 ms to minimize.
[2022-06-11 03:55:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-06-11 03:55:21] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2022-06-11 03:55:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 03:55:34] [INFO ] [Real]Absence check using state equation in 12711 ms returned sat
[2022-06-11 03:55:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 03:55:35] [INFO ] [Nat]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-11 03:55:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 03:55:48] [INFO ] [Nat]Absence check using state equation in 12762 ms returned sat
[2022-06-11 03:55:54] [INFO ] [Nat]Added 3688 Read/Feed constraints in 5757 ms returned sat
[2022-06-11 03:56:01] [INFO ] Deduced a trap composed of 19 places in 6730 ms of which 5 ms to minimize.
[2022-06-11 03:56:09] [INFO ] Deduced a trap composed of 69 places in 6711 ms of which 2 ms to minimize.
[2022-06-11 03:56:17] [INFO ] Deduced a trap composed of 109 places in 6805 ms of which 2 ms to minimize.
[2022-06-11 03:56:24] [INFO ] Deduced a trap composed of 64 places in 7099 ms of which 1 ms to minimize.
[2022-06-11 03:56:24] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-06-11 03:56:25] [INFO ] [Real]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-11 03:56:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 03:56:38] [INFO ] [Real]Absence check using state equation in 13069 ms returned sat
[2022-06-11 03:56:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 03:56:39] [INFO ] [Nat]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-11 03:56:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 03:56:52] [INFO ] [Nat]Absence check using state equation in 12784 ms returned sat
[2022-06-11 03:56:57] [INFO ] [Nat]Added 3688 Read/Feed constraints in 5492 ms returned sat
[2022-06-11 03:57:05] [INFO ] Deduced a trap composed of 19 places in 6638 ms of which 2 ms to minimize.
[2022-06-11 03:57:12] [INFO ] Deduced a trap composed of 69 places in 6689 ms of which 1 ms to minimize.
[2022-06-11 03:57:19] [INFO ] Deduced a trap composed of 50 places in 6031 ms of which 2 ms to minimize.
[2022-06-11 03:57:26] [INFO ] Deduced a trap composed of 165 places in 6476 ms of which 1 ms to minimize.
[2022-06-11 03:57: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 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-06-11 03:57:27] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned sat
[2022-06-11 03:57:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 03:57:39] [INFO ] [Real]Absence check using state equation in 12345 ms returned sat
[2022-06-11 03:57:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 03:57:40] [INFO ] [Nat]Absence check using 12 positive place invariants in 20 ms returned sat
[2022-06-11 03:57:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 03:57:52] [INFO ] [Nat]Absence check using state equation in 12392 ms returned sat
[2022-06-11 03:57:58] [INFO ] [Nat]Added 3688 Read/Feed constraints in 5363 ms returned sat
[2022-06-11 03:58:05] [INFO ] Deduced a trap composed of 49 places in 6713 ms of which 1 ms to minimize.
[2022-06-11 03:58:13] [INFO ] Deduced a trap composed of 19 places in 6711 ms of which 2 ms to minimize.
[2022-06-11 03:58:21] [INFO ] Deduced a trap composed of 69 places in 6758 ms of which 2 ms to minimize.
[2022-06-11 03:58:28] [INFO ] Deduced a trap composed of 208 places in 6189 ms of which 1 ms to minimize.
[2022-06-11 03:58:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-06-11 03:58:28] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2022-06-11 03:58:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 03:58:41] [INFO ] [Real]Absence check using state equation in 12813 ms returned sat
[2022-06-11 03:58:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 03:58:42] [INFO ] [Nat]Absence check using 12 positive place invariants in 24 ms returned sat
[2022-06-11 03:58:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 03:58:55] [INFO ] [Nat]Absence check using state equation in 13051 ms returned sat
[2022-06-11 03:59:01] [INFO ] [Nat]Added 3688 Read/Feed constraints in 6168 ms returned sat
[2022-06-11 03:59:09] [INFO ] Deduced a trap composed of 68 places in 7448 ms of which 2 ms to minimize.
[2022-06-11 03:59:16] [INFO ] Deduced a trap composed of 19 places in 5512 ms of which 2 ms to minimize.
[2022-06-11 03:59:23] [INFO ] Deduced a trap composed of 107 places in 5848 ms of which 2 ms to minimize.
[2022-06-11 03:59:29] [INFO ] Deduced a trap composed of 41 places in 6003 ms of which 1 ms to minimize.
[2022-06-11 03:59:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-06-11 03:59:30] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned sat
[2022-06-11 03:59:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 03:59:43] [INFO ] [Real]Absence check using state equation in 13058 ms returned sat
[2022-06-11 03:59:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 03:59:44] [INFO ] [Nat]Absence check using 12 positive place invariants in 22 ms returned sat
[2022-06-11 03:59:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 03:59:57] [INFO ] [Nat]Absence check using state equation in 12747 ms returned sat
[2022-06-11 04:00:03] [INFO ] [Nat]Added 3688 Read/Feed constraints in 6247 ms returned sat
[2022-06-11 04:00:10] [INFO ] Deduced a trap composed of 49 places in 6698 ms of which 2 ms to minimize.
[2022-06-11 04:00:18] [INFO ] Deduced a trap composed of 19 places in 6280 ms of which 1 ms to minimize.
[2022-06-11 04:00:25] [INFO ] Deduced a trap composed of 220 places in 6624 ms of which 2 ms to minimize.
[2022-06-11 04:00:30] [INFO ] Deduced a trap composed of 41 places in 4359 ms of which 1 ms to minimize.
[2022-06-11 04:00:30] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-06-11 04:00:31] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned sat
[2022-06-11 04:00:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 04:00:44] [INFO ] [Real]Absence check using state equation in 13358 ms returned sat
[2022-06-11 04:00:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 04:00:45] [INFO ] [Nat]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-11 04:00:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 04:00:58] [INFO ] [Nat]Absence check using state equation in 12609 ms returned sat
[2022-06-11 04:01:04] [INFO ] [Nat]Added 3688 Read/Feed constraints in 6025 ms returned sat
[2022-06-11 04:01:10] [INFO ] Deduced a trap composed of 26 places in 5141 ms of which 2 ms to minimize.
[2022-06-11 04:01:16] [INFO ] Deduced a trap composed of 19 places in 4881 ms of which 1 ms to minimize.
[2022-06-11 04:01:22] [INFO ] Deduced a trap composed of 68 places in 5567 ms of which 1 ms to minimize.
[2022-06-11 04:01:28] [INFO ] Deduced a trap composed of 97 places in 5274 ms of which 2 ms to minimize.
[2022-06-11 04:01:34] [INFO ] Deduced a trap composed of 52 places in 4930 ms of which 1 ms to minimize.
[2022-06-11 04:01:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-06-11 04:01:34] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned sat
[2022-06-11 04:01:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 04:01:47] [INFO ] [Real]Absence check using state equation in 13085 ms returned sat
[2022-06-11 04:01:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 04:01:48] [INFO ] [Nat]Absence check using 12 positive place invariants in 22 ms returned sat
[2022-06-11 04:01:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 04:02:01] [INFO ] [Nat]Absence check using state equation in 12760 ms returned sat
[2022-06-11 04:02:07] [INFO ] [Nat]Added 3688 Read/Feed constraints in 5884 ms returned sat
[2022-06-11 04:02:15] [INFO ] Deduced a trap composed of 26 places in 6653 ms of which 2 ms to minimize.
[2022-06-11 04:02:21] [INFO ] Deduced a trap composed of 19 places in 5425 ms of which 1 ms to minimize.
[2022-06-11 04:02:28] [INFO ] Deduced a trap composed of 49 places in 5890 ms of which 4 ms to minimize.
[2022-06-11 04:02:35] [INFO ] Deduced a trap composed of 52 places in 6062 ms of which 1 ms to minimize.
[2022-06-11 04:02:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-06-11 04:02:35] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned sat
[2022-06-11 04:02:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 04:02:47] [INFO ] [Real]Absence check using state equation in 12753 ms returned sat
[2022-06-11 04:02:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 04:02:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 22 ms returned sat
[2022-06-11 04:02:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 04:03:01] [INFO ] [Nat]Absence check using state equation in 12114 ms returned sat
[2022-06-11 04:03:06] [INFO ] [Nat]Added 3688 Read/Feed constraints in 5516 ms returned sat
[2022-06-11 04:03:14] [INFO ] Deduced a trap composed of 49 places in 6683 ms of which 2 ms to minimize.
[2022-06-11 04:03:21] [INFO ] Deduced a trap composed of 19 places in 6612 ms of which 1 ms to minimize.
[2022-06-11 04:03:29] [INFO ] Deduced a trap composed of 69 places in 6864 ms of which 1 ms to minimize.
[2022-06-11 04:03:36] [INFO ] Deduced a trap composed of 166 places in 6158 ms of which 1 ms to minimize.
[2022-06-11 04:03:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 10 out of 1296 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 588 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89908/89908 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1296/1296 places, 89908/89908 transitions.
Applied a total of 0 rules in 556 ms. Remains 1296 /1296 variables (removed 0) and now considering 89908/89908 (removed 0) transitions.
[2022-06-11 04:03:37] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-11 04:03:37] [INFO ] Computed 12 place invariants in 222 ms
[2022-06-11 04:03:41] [INFO ] Implicit Places using invariants in 4247 ms returned []
Implicit Place search using SMT only with invariants took 4248 ms to find 0 implicit places.
[2022-06-11 04:03:41] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-11 04:03:41] [INFO ] Computed 12 place invariants in 225 ms
[2022-06-11 04:04:12] [INFO ] Performed 83479/89908 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-11 04:04:14] [INFO ] Dead Transitions using invariants and state equation in 32652 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89908/89908 transitions.
Starting property specific reduction for RERS2020-PT-pb107-UpperBounds-00
Normalized transition count is 62424 out of 89908 initially.
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-11 04:04:14] [INFO ] Computed 12 place invariants in 236 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 542 ms. (steps per millisecond=18 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
[2022-06-11 04:04:15] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-11 04:04:15] [INFO ] Computed 12 place invariants in 222 ms
[2022-06-11 04:04:15] [INFO ] [Real]Absence check using 12 positive place invariants in 23 ms returned sat
[2022-06-11 04:04:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 04:04:20] [INFO ] [Real]Absence check using state equation in 4797 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Drop transitions removed 205 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 1296/1296 places, 89703/89703 transitions.
Applied a total of 0 rules in 458 ms. Remains 1296 /1296 variables (removed 0) and now considering 89703/89703 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89703/89703 transitions.
Normalized transition count is 62237 out of 89703 initially.
// Phase 1: matrix 62237 rows 1296 cols
[2022-06-11 04:04:21] [INFO ] Computed 12 place invariants in 238 ms
Interrupted random walk after 608480 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=20 ) properties seen 0
Interrupted Best-First random walk after 791675 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=158 ) properties seen 0
[2022-06-11 04:04:56] [INFO ] Flow matrix only has 62237 transitions (discarded 27466 similar events)
// Phase 1: matrix 62237 rows 1296 cols
[2022-06-11 04:04:56] [INFO ] Computed 12 place invariants in 232 ms
[2022-06-11 04:04:56] [INFO ] [Real]Absence check using 12 positive place invariants in 22 ms returned sat
[2022-06-11 04:04:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 04:05:09] [INFO ] [Real]Absence check using state equation in 12884 ms returned sat
[2022-06-11 04:05:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 04:05:10] [INFO ] [Nat]Absence check using 12 positive place invariants in 20 ms returned sat
[2022-06-11 04:05:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 04:05:22] [INFO ] [Nat]Absence check using state equation in 12118 ms returned sat
[2022-06-11 04:05:23] [INFO ] State equation strengthened by 3684 read => feed constraints.
[2022-06-11 04:05:28] [INFO ] [Nat]Added 3684 Read/Feed constraints in 4928 ms returned sat
[2022-06-11 04:05:36] [INFO ] Deduced a trap composed of 19 places in 6969 ms of which 2 ms to minimize.
[2022-06-11 04:05:43] [INFO ] Deduced a trap composed of 58 places in 6723 ms of which 1 ms to minimize.
[2022-06-11 04:05:51] [INFO ] Deduced a trap composed of 47 places in 7247 ms of which 2 ms to minimize.
[2022-06-11 04:05:59] [INFO ] Deduced a trap composed of 256 places in 7124 ms of which 2 ms to minimize.
[2022-06-11 04:05:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1296/1296 places, 89703/89703 transitions.
Applied a total of 0 rules in 443 ms. Remains 1296 /1296 variables (removed 0) and now considering 89703/89703 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89703/89703 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1296/1296 places, 89703/89703 transitions.
Applied a total of 0 rules in 462 ms. Remains 1296 /1296 variables (removed 0) and now considering 89703/89703 (removed 0) transitions.
[2022-06-11 04:06:00] [INFO ] Flow matrix only has 62237 transitions (discarded 27466 similar events)
// Phase 1: matrix 62237 rows 1296 cols
[2022-06-11 04:06:00] [INFO ] Computed 12 place invariants in 253 ms
[2022-06-11 04:06:04] [INFO ] Implicit Places using invariants in 3797 ms returned []
Implicit Place search using SMT only with invariants took 3798 ms to find 0 implicit places.
[2022-06-11 04:06:04] [INFO ] Flow matrix only has 62237 transitions (discarded 27466 similar events)
// Phase 1: matrix 62237 rows 1296 cols
[2022-06-11 04:06:04] [INFO ] Computed 12 place invariants in 175 ms
[2022-06-11 04:06:34] [INFO ] Performed 84896/89703 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-11 04:06:36] [INFO ] Dead Transitions using invariants and state equation in 32044 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89703/89703 transitions.
Ending property specific reduction for RERS2020-PT-pb107-UpperBounds-00 in 142143 ms.
Starting property specific reduction for RERS2020-PT-pb107-UpperBounds-01
Normalized transition count is 62424 out of 89908 initially.
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-11 04:06:36] [INFO ] Computed 12 place invariants in 291 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 508 ms. (steps per millisecond=19 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
[2022-06-11 04:06:37] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-11 04:06:37] [INFO ] Computed 12 place invariants in 318 ms
[2022-06-11 04:06:38] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2022-06-11 04:06:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 04:06:42] [INFO ] [Real]Absence check using state equation in 4826 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Drop transitions removed 210 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 1296/1296 places, 89698/89698 transitions.
Applied a total of 0 rules in 549 ms. Remains 1296 /1296 variables (removed 0) and now considering 89698/89698 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89698/89698 transitions.
Normalized transition count is 62237 out of 89698 initially.
// Phase 1: matrix 62237 rows 1296 cols
[2022-06-11 04:06:43] [INFO ] Computed 12 place invariants in 221 ms
Interrupted random walk after 553788 steps, including 4 resets, run timeout after 30001 ms. (steps per millisecond=18 ) properties seen 0
Interrupted Best-First random walk after 689308 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=137 ) properties seen 0
[2022-06-11 04:07:18] [INFO ] Flow matrix only has 62237 transitions (discarded 27461 similar events)
// Phase 1: matrix 62237 rows 1296 cols
[2022-06-11 04:07:19] [INFO ] Computed 12 place invariants in 198 ms
[2022-06-11 04:07:19] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2022-06-11 04:07:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 04:07:31] [INFO ] [Real]Absence check using state equation in 12499 ms returned sat
[2022-06-11 04:07:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 04:07:32] [INFO ] [Nat]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-11 04:07:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 04:07:45] [INFO ] [Nat]Absence check using state equation in 12902 ms returned sat
[2022-06-11 04:07:46] [INFO ] State equation strengthened by 3685 read => feed constraints.
[2022-06-11 04:07:51] [INFO ] [Nat]Added 3685 Read/Feed constraints in 5511 ms returned sat
[2022-06-11 04:07:59] [INFO ] Deduced a trap composed of 166 places in 7260 ms of which 2 ms to minimize.
[2022-06-11 04:08:06] [INFO ] Deduced a trap composed of 27 places in 6110 ms of which 1 ms to minimize.
[2022-06-11 04:08:13] [INFO ] Deduced a trap composed of 20 places in 5914 ms of which 1 ms to minimize.
[2022-06-11 04:08:20] [INFO ] Deduced a trap composed of 69 places in 6237 ms of which 1 ms to minimize.
[2022-06-11 04:08:20] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1296/1296 places, 89698/89698 transitions.
Applied a total of 0 rules in 526 ms. Remains 1296 /1296 variables (removed 0) and now considering 89698/89698 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89698/89698 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1296/1296 places, 89698/89698 transitions.
Applied a total of 0 rules in 553 ms. Remains 1296 /1296 variables (removed 0) and now considering 89698/89698 (removed 0) transitions.
[2022-06-11 04:08:21] [INFO ] Flow matrix only has 62237 transitions (discarded 27461 similar events)
// Phase 1: matrix 62237 rows 1296 cols
[2022-06-11 04:08:22] [INFO ] Computed 12 place invariants in 264 ms
[2022-06-11 04:08:25] [INFO ] Implicit Places using invariants in 4032 ms returned []
Implicit Place search using SMT only with invariants took 4033 ms to find 0 implicit places.
[2022-06-11 04:08:25] [INFO ] Flow matrix only has 62237 transitions (discarded 27461 similar events)
// Phase 1: matrix 62237 rows 1296 cols
[2022-06-11 04:08:26] [INFO ] Computed 12 place invariants in 204 ms
[2022-06-11 04:08:56] [INFO ] Performed 83205/89698 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-11 04:08:58] [INFO ] Dead Transitions using invariants and state equation in 32688 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89698/89698 transitions.
Ending property specific reduction for RERS2020-PT-pb107-UpperBounds-01 in 141960 ms.
Starting property specific reduction for RERS2020-PT-pb107-UpperBounds-04
Normalized transition count is 62424 out of 89908 initially.
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-11 04:08:58] [INFO ] Computed 12 place invariants in 238 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 578 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
[2022-06-11 04:08:59] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-11 04:08:59] [INFO ] Computed 12 place invariants in 234 ms
[2022-06-11 04:09:00] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned sat
[2022-06-11 04:09:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 04:09:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Drop transitions removed 362 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 1296/1296 places, 89546/89546 transitions.
Applied a total of 0 rules in 476 ms. Remains 1296 /1296 variables (removed 0) and now considering 89546/89546 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89546/89546 transitions.
Normalized transition count is 62132 out of 89546 initially.
// Phase 1: matrix 62132 rows 1296 cols
[2022-06-11 04:09:05] [INFO ] Computed 12 place invariants in 268 ms
Interrupted random walk after 557451 steps, including 2 resets, run timeout after 30013 ms. (steps per millisecond=18 ) properties seen 0
Interrupted Best-First random walk after 724022 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=144 ) properties seen 0
[2022-06-11 04:09:40] [INFO ] Flow matrix only has 62132 transitions (discarded 27414 similar events)
// Phase 1: matrix 62132 rows 1296 cols
[2022-06-11 04:09:41] [INFO ] Computed 12 place invariants in 255 ms
[2022-06-11 04:09:41] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned sat
[2022-06-11 04:09:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 04:09:53] [INFO ] [Real]Absence check using state equation in 12535 ms returned sat
[2022-06-11 04:09:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 04:09:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 22 ms returned sat
[2022-06-11 04:09:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 04:10:07] [INFO ] [Nat]Absence check using state equation in 13030 ms returned sat
[2022-06-11 04:10:08] [INFO ] State equation strengthened by 3685 read => feed constraints.
[2022-06-11 04:10:14] [INFO ] [Nat]Added 3685 Read/Feed constraints in 5708 ms returned sat
[2022-06-11 04:10:22] [INFO ] Deduced a trap composed of 19 places in 7370 ms of which 2 ms to minimize.
[2022-06-11 04:10:30] [INFO ] Deduced a trap composed of 219 places in 7032 ms of which 2 ms to minimize.
[2022-06-11 04:10:37] [INFO ] Deduced a trap composed of 52 places in 6188 ms of which 3 ms to minimize.
[2022-06-11 04:10:46] [INFO ] Deduced a trap composed of 70 places in 8434 ms of which 2 ms to minimize.
[2022-06-11 04:10:46] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1296/1296 places, 89546/89546 transitions.
Applied a total of 0 rules in 525 ms. Remains 1296 /1296 variables (removed 0) and now considering 89546/89546 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89546/89546 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1296/1296 places, 89546/89546 transitions.
Applied a total of 0 rules in 517 ms. Remains 1296 /1296 variables (removed 0) and now considering 89546/89546 (removed 0) transitions.
[2022-06-11 04:10:47] [INFO ] Flow matrix only has 62132 transitions (discarded 27414 similar events)
// Phase 1: matrix 62132 rows 1296 cols
[2022-06-11 04:10:47] [INFO ] Computed 12 place invariants in 242 ms
[2022-06-11 04:10:52] [INFO ] Implicit Places using invariants in 4513 ms returned []
Implicit Place search using SMT only with invariants took 4514 ms to find 0 implicit places.
[2022-06-11 04:10:52] [INFO ] Flow matrix only has 62132 transitions (discarded 27414 similar events)
// Phase 1: matrix 62132 rows 1296 cols
[2022-06-11 04:10:52] [INFO ] Computed 12 place invariants in 236 ms
[2022-06-11 04:11:22] [INFO ] Performed 81744/89546 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-11 04:11:25] [INFO ] Dead Transitions using invariants and state equation in 33297 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89546/89546 transitions.
Ending property specific reduction for RERS2020-PT-pb107-UpperBounds-04 in 146898 ms.
Starting property specific reduction for RERS2020-PT-pb107-UpperBounds-05
Normalized transition count is 62424 out of 89908 initially.
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-11 04:11:25] [INFO ] Computed 12 place invariants in 270 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 533 ms. (steps per millisecond=18 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
[2022-06-11 04:11:26] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-11 04:11:26] [INFO ] Computed 12 place invariants in 237 ms
[2022-06-11 04:11:26] [INFO ] [Real]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-11 04:11:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 04:11: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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Drop transitions removed 25 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 1296/1296 places, 89883/89883 transitions.
Applied a total of 0 rules in 443 ms. Remains 1296 /1296 variables (removed 0) and now considering 89883/89883 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89883/89883 transitions.
Normalized transition count is 62399 out of 89883 initially.
// Phase 1: matrix 62399 rows 1296 cols
[2022-06-11 04:11:32] [INFO ] Computed 12 place invariants in 280 ms
Interrupted random walk after 595138 steps, including 5 resets, run timeout after 30001 ms. (steps per millisecond=19 ) properties seen 0
Interrupted Best-First random walk after 800935 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=160 ) properties seen 0
[2022-06-11 04:12:07] [INFO ] Flow matrix only has 62399 transitions (discarded 27484 similar events)
// Phase 1: matrix 62399 rows 1296 cols
[2022-06-11 04:12:07] [INFO ] Computed 12 place invariants in 225 ms
[2022-06-11 04:12:08] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2022-06-11 04:12:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 04:12:20] [INFO ] [Real]Absence check using state equation in 12341 ms returned sat
[2022-06-11 04:12:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 04:12:21] [INFO ] [Nat]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-11 04:12:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 04:12:34] [INFO ] [Nat]Absence check using state equation in 12654 ms returned sat
[2022-06-11 04:12:34] [INFO ] State equation strengthened by 3685 read => feed constraints.
[2022-06-11 04:12:41] [INFO ] [Nat]Added 3685 Read/Feed constraints in 6846 ms returned sat
[2022-06-11 04:12:49] [INFO ] Deduced a trap composed of 19 places in 7186 ms of which 1 ms to minimize.
[2022-06-11 04:12:57] [INFO ] Deduced a trap composed of 69 places in 6716 ms of which 2 ms to minimize.
[2022-06-11 04:13:04] [INFO ] Deduced a trap composed of 50 places in 6618 ms of which 1 ms to minimize.
[2022-06-11 04:13:11] [INFO ] Deduced a trap composed of 46 places in 6428 ms of which 3 ms to minimize.
[2022-06-11 04:13:11] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1296/1296 places, 89883/89883 transitions.
Applied a total of 0 rules in 434 ms. Remains 1296 /1296 variables (removed 0) and now considering 89883/89883 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89883/89883 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1296/1296 places, 89883/89883 transitions.
Applied a total of 0 rules in 431 ms. Remains 1296 /1296 variables (removed 0) and now considering 89883/89883 (removed 0) transitions.
[2022-06-11 04:13:12] [INFO ] Flow matrix only has 62399 transitions (discarded 27484 similar events)
// Phase 1: matrix 62399 rows 1296 cols
[2022-06-11 04:13:12] [INFO ] Computed 12 place invariants in 228 ms
[2022-06-11 04:13:16] [INFO ] Implicit Places using invariants in 4017 ms returned []
Implicit Place search using SMT only with invariants took 4019 ms to find 0 implicit places.
[2022-06-11 04:13:16] [INFO ] Flow matrix only has 62399 transitions (discarded 27484 similar events)
// Phase 1: matrix 62399 rows 1296 cols
[2022-06-11 04:13:16] [INFO ] Computed 12 place invariants in 229 ms
[2022-06-11 04:13:47] [INFO ] Performed 81881/89883 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-11 04:13:50] [INFO ] Dead Transitions using invariants and state equation in 33286 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89883/89883 transitions.
Ending property specific reduction for RERS2020-PT-pb107-UpperBounds-05 in 144655 ms.
Starting property specific reduction for RERS2020-PT-pb107-UpperBounds-06
Normalized transition count is 62424 out of 89908 initially.
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-11 04:13:50] [INFO ] Computed 12 place invariants in 319 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 497 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
[2022-06-11 04:13:51] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-11 04:13:51] [INFO ] Computed 12 place invariants in 237 ms
[2022-06-11 04:13:51] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2022-06-11 04:13:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 04:13:56] [INFO ] [Real]Absence check using state equation in 4799 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Drop transitions removed 32 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 1296/1296 places, 89876/89876 transitions.
Applied a total of 0 rules in 441 ms. Remains 1296 /1296 variables (removed 0) and now considering 89876/89876 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89876/89876 transitions.
Normalized transition count is 62415 out of 89876 initially.
// Phase 1: matrix 62415 rows 1296 cols
[2022-06-11 04:13:57] [INFO ] Computed 12 place invariants in 279 ms
Interrupted random walk after 584676 steps, including 3 resets, run timeout after 30001 ms. (steps per millisecond=19 ) properties seen 0
Interrupted Best-First random walk after 758971 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=151 ) properties seen 0
[2022-06-11 04:14:32] [INFO ] Flow matrix only has 62415 transitions (discarded 27461 similar events)
// Phase 1: matrix 62415 rows 1296 cols
[2022-06-11 04:14:32] [INFO ] Computed 12 place invariants in 243 ms
[2022-06-11 04:14:32] [INFO ] [Real]Absence check using 12 positive place invariants in 24 ms returned sat
[2022-06-11 04:14:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 04:14:45] [INFO ] [Real]Absence check using state equation in 12328 ms returned sat
[2022-06-11 04:14:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 04:14:46] [INFO ] [Nat]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-11 04:14:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 04:14:58] [INFO ] [Nat]Absence check using state equation in 12795 ms returned sat
[2022-06-11 04:14:59] [INFO ] State equation strengthened by 3687 read => feed constraints.
[2022-06-11 04:15:04] [INFO ] [Nat]Added 3687 Read/Feed constraints in 5452 ms returned sat
[2022-06-11 04:15:12] [INFO ] Deduced a trap composed of 49 places in 7006 ms of which 10 ms to minimize.
[2022-06-11 04:15:19] [INFO ] Deduced a trap composed of 19 places in 6400 ms of which 1 ms to minimize.
[2022-06-11 04:15:27] [INFO ] Deduced a trap composed of 69 places in 6669 ms of which 1 ms to minimize.
[2022-06-11 04:15:33] [INFO ] Deduced a trap composed of 208 places in 5510 ms of which 2 ms to minimize.
[2022-06-11 04:15:33] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1296/1296 places, 89876/89876 transitions.
Applied a total of 0 rules in 441 ms. Remains 1296 /1296 variables (removed 0) and now considering 89876/89876 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89876/89876 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1296/1296 places, 89876/89876 transitions.
Applied a total of 0 rules in 459 ms. Remains 1296 /1296 variables (removed 0) and now considering 89876/89876 (removed 0) transitions.
[2022-06-11 04:15:34] [INFO ] Flow matrix only has 62415 transitions (discarded 27461 similar events)
// Phase 1: matrix 62415 rows 1296 cols
[2022-06-11 04:15:35] [INFO ] Computed 12 place invariants in 287 ms
[2022-06-11 04:15:39] [INFO ] Implicit Places using invariants in 4353 ms returned []
Implicit Place search using SMT only with invariants took 4354 ms to find 0 implicit places.
[2022-06-11 04:15:39] [INFO ] Flow matrix only has 62415 transitions (discarded 27461 similar events)
// Phase 1: matrix 62415 rows 1296 cols
[2022-06-11 04:15:39] [INFO ] Computed 12 place invariants in 290 ms
[2022-06-11 04:16:09] [INFO ] Performed 82213/89876 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-11 04:16:12] [INFO ] Dead Transitions using invariants and state equation in 33339 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89876/89876 transitions.
Ending property specific reduction for RERS2020-PT-pb107-UpperBounds-06 in 142391 ms.
Starting property specific reduction for RERS2020-PT-pb107-UpperBounds-07
Normalized transition count is 62424 out of 89908 initially.
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-11 04:16:12] [INFO ] Computed 12 place invariants in 258 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 559 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
[2022-06-11 04:16:13] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-11 04:16:13] [INFO ] Computed 12 place invariants in 241 ms
[2022-06-11 04:16:13] [INFO ] [Real]Absence check using 12 positive place invariants in 23 ms returned sat
[2022-06-11 04:16:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 04:16:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Drop transitions removed 75 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 1296/1296 places, 89833/89833 transitions.
Applied a total of 0 rules in 529 ms. Remains 1296 /1296 variables (removed 0) and now considering 89833/89833 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89833/89833 transitions.
Normalized transition count is 62360 out of 89833 initially.
// Phase 1: matrix 62360 rows 1296 cols
[2022-06-11 04:16:19] [INFO ] Computed 12 place invariants in 256 ms
Interrupted random walk after 523773 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=17 ) properties seen 0
Interrupted Best-First random walk after 642154 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=128 ) properties seen 0
[2022-06-11 04:16:54] [INFO ] Flow matrix only has 62360 transitions (discarded 27473 similar events)
// Phase 1: matrix 62360 rows 1296 cols
[2022-06-11 04:16:55] [INFO ] Computed 12 place invariants in 316 ms
[2022-06-11 04:16:55] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned sat
[2022-06-11 04:16:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 04:17:08] [INFO ] [Real]Absence check using state equation in 13241 ms returned sat
[2022-06-11 04:17:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 04:17:09] [INFO ] [Nat]Absence check using 12 positive place invariants in 21 ms returned sat
[2022-06-11 04:17:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 04:17:22] [INFO ] [Nat]Absence check using state equation in 12639 ms returned sat
[2022-06-11 04:17:22] [INFO ] State equation strengthened by 3684 read => feed constraints.
[2022-06-11 04:17:28] [INFO ] [Nat]Added 3684 Read/Feed constraints in 5527 ms returned sat
[2022-06-11 04:17:36] [INFO ] Deduced a trap composed of 68 places in 7272 ms of which 1 ms to minimize.
[2022-06-11 04:17:42] [INFO ] Deduced a trap composed of 19 places in 5613 ms of which 1 ms to minimize.
[2022-06-11 04:17:49] [INFO ] Deduced a trap composed of 107 places in 5761 ms of which 1 ms to minimize.
[2022-06-11 04:17:56] [INFO ] Deduced a trap composed of 41 places in 5694 ms of which 1 ms to minimize.
[2022-06-11 04:17:56] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1296/1296 places, 89833/89833 transitions.
Applied a total of 0 rules in 452 ms. Remains 1296 /1296 variables (removed 0) and now considering 89833/89833 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89833/89833 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1296/1296 places, 89833/89833 transitions.
Applied a total of 0 rules in 451 ms. Remains 1296 /1296 variables (removed 0) and now considering 89833/89833 (removed 0) transitions.
[2022-06-11 04:17:57] [INFO ] Flow matrix only has 62360 transitions (discarded 27473 similar events)
// Phase 1: matrix 62360 rows 1296 cols
[2022-06-11 04:17:57] [INFO ] Computed 12 place invariants in 239 ms
[2022-06-11 04:18:01] [INFO ] Implicit Places using invariants in 4285 ms returned []
Implicit Place search using SMT only with invariants took 4288 ms to find 0 implicit places.
[2022-06-11 04:18:01] [INFO ] Flow matrix only has 62360 transitions (discarded 27473 similar events)
// Phase 1: matrix 62360 rows 1296 cols
[2022-06-11 04:18:01] [INFO ] Computed 12 place invariants in 216 ms
[2022-06-11 04:18:31] [INFO ] Performed 81900/89833 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-11 04:18:34] [INFO ] Dead Transitions using invariants and state equation in 33312 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89833/89833 transitions.
Ending property specific reduction for RERS2020-PT-pb107-UpperBounds-07 in 142195 ms.
Starting property specific reduction for RERS2020-PT-pb107-UpperBounds-09
Normalized transition count is 62424 out of 89908 initially.
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-11 04:18:34] [INFO ] Computed 12 place invariants in 245 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 576 ms. (steps per millisecond=17 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
[2022-06-11 04:18:35] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-11 04:18:35] [INFO ] Computed 12 place invariants in 262 ms
[2022-06-11 04:18:36] [INFO ] [Real]Absence check using 12 positive place invariants in 24 ms returned sat
[2022-06-11 04:18:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 04:18:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Drop transitions removed 257 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 1296/1296 places, 89651/89651 transitions.
Applied a total of 0 rules in 576 ms. Remains 1296 /1296 variables (removed 0) and now considering 89651/89651 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89651/89651 transitions.
Normalized transition count is 62235 out of 89651 initially.
// Phase 1: matrix 62235 rows 1296 cols
[2022-06-11 04:18:41] [INFO ] Computed 12 place invariants in 215 ms
Interrupted random walk after 594736 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=19 ) properties seen 0
Interrupted Best-First random walk after 798907 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=159 ) properties seen 0
[2022-06-11 04:19:16] [INFO ] Flow matrix only has 62235 transitions (discarded 27416 similar events)
// Phase 1: matrix 62235 rows 1296 cols
[2022-06-11 04:19:17] [INFO ] Computed 12 place invariants in 279 ms
[2022-06-11 04:19:17] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2022-06-11 04:19:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 04:19:30] [INFO ] [Real]Absence check using state equation in 12641 ms returned sat
[2022-06-11 04:19:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 04:19:31] [INFO ] [Nat]Absence check using 12 positive place invariants in 29 ms returned sat
[2022-06-11 04:19:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 04:19:43] [INFO ] [Nat]Absence check using state equation in 11923 ms returned sat
[2022-06-11 04:19:43] [INFO ] State equation strengthened by 3686 read => feed constraints.
[2022-06-11 04:19:48] [INFO ] [Nat]Added 3686 Read/Feed constraints in 4691 ms returned sat
[2022-06-11 04:19:55] [INFO ] Deduced a trap composed of 19 places in 6379 ms of which 2 ms to minimize.
[2022-06-11 04:20:02] [INFO ] Deduced a trap composed of 49 places in 5646 ms of which 3 ms to minimize.
[2022-06-11 04:20:09] [INFO ] Deduced a trap composed of 47 places in 6485 ms of which 1 ms to minimize.
[2022-06-11 04:20:16] [INFO ] Deduced a trap composed of 290 places in 6548 ms of which 2 ms to minimize.
[2022-06-11 04:20:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1296/1296 places, 89651/89651 transitions.
Applied a total of 0 rules in 425 ms. Remains 1296 /1296 variables (removed 0) and now considering 89651/89651 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89651/89651 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1296/1296 places, 89651/89651 transitions.
Applied a total of 0 rules in 435 ms. Remains 1296 /1296 variables (removed 0) and now considering 89651/89651 (removed 0) transitions.
[2022-06-11 04:20:17] [INFO ] Flow matrix only has 62235 transitions (discarded 27416 similar events)
// Phase 1: matrix 62235 rows 1296 cols
[2022-06-11 04:20:17] [INFO ] Computed 12 place invariants in 210 ms
[2022-06-11 04:20:21] [INFO ] Implicit Places using invariants in 3879 ms returned []
Implicit Place search using SMT only with invariants took 3891 ms to find 0 implicit places.
[2022-06-11 04:20:21] [INFO ] Flow matrix only has 62235 transitions (discarded 27416 similar events)
// Phase 1: matrix 62235 rows 1296 cols
[2022-06-11 04:20:21] [INFO ] Computed 12 place invariants in 286 ms
[2022-06-11 04:20:52] [INFO ] Performed 88738/89651 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-11 04:20:52] [INFO ] Dead Transitions using invariants and state equation in 30829 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89651/89651 transitions.
Ending property specific reduction for RERS2020-PT-pb107-UpperBounds-09 in 137879 ms.
Starting property specific reduction for RERS2020-PT-pb107-UpperBounds-12
Normalized transition count is 62424 out of 89908 initially.
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-11 04:20:52] [INFO ] Computed 12 place invariants in 201 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 496 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
[2022-06-11 04:20:53] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-11 04:20:53] [INFO ] Computed 12 place invariants in 198 ms
[2022-06-11 04:20:53] [INFO ] [Real]Absence check using 12 positive place invariants in 22 ms returned sat
[2022-06-11 04:20:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 04:20:58] [INFO ] [Real]Absence check using state equation in 4801 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Drop transitions removed 90 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 1296/1296 places, 89818/89818 transitions.
Applied a total of 0 rules in 429 ms. Remains 1296 /1296 variables (removed 0) and now considering 89818/89818 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89818/89818 transitions.
Normalized transition count is 62391 out of 89818 initially.
// Phase 1: matrix 62391 rows 1296 cols
[2022-06-11 04:20:59] [INFO ] Computed 12 place invariants in 225 ms
Interrupted random walk after 635256 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties seen 0
Interrupted Best-First random walk after 790046 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=157 ) properties seen 0
[2022-06-11 04:21:34] [INFO ] Flow matrix only has 62391 transitions (discarded 27427 similar events)
// Phase 1: matrix 62391 rows 1296 cols
[2022-06-11 04:21:34] [INFO ] Computed 12 place invariants in 251 ms
[2022-06-11 04:21:34] [INFO ] [Real]Absence check using 12 positive place invariants in 25 ms returned sat
[2022-06-11 04:21:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 04:21:47] [INFO ] [Real]Absence check using state equation in 12386 ms returned sat
[2022-06-11 04:21:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 04:21:48] [INFO ] [Nat]Absence check using 12 positive place invariants in 20 ms returned sat
[2022-06-11 04:21:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 04:22:00] [INFO ] [Nat]Absence check using state equation in 12178 ms returned sat
[2022-06-11 04:22:00] [INFO ] State equation strengthened by 3685 read => feed constraints.
[2022-06-11 04:22:05] [INFO ] [Nat]Added 3685 Read/Feed constraints in 4383 ms returned sat
[2022-06-11 04:22:10] [INFO ] Deduced a trap composed of 26 places in 4727 ms of which 1 ms to minimize.
[2022-06-11 04:22:16] [INFO ] Deduced a trap composed of 19 places in 5067 ms of which 1 ms to minimize.
[2022-06-11 04:22:22] [INFO ] Deduced a trap composed of 68 places in 5412 ms of which 1 ms to minimize.
[2022-06-11 04:22:28] [INFO ] Deduced a trap composed of 97 places in 4879 ms of which 1 ms to minimize.
[2022-06-11 04:22:33] [INFO ] Deduced a trap composed of 52 places in 4441 ms of which 1 ms to minimize.
[2022-06-11 04:22:33] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1296/1296 places, 89818/89818 transitions.
Applied a total of 0 rules in 417 ms. Remains 1296 /1296 variables (removed 0) and now considering 89818/89818 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89818/89818 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1296/1296 places, 89818/89818 transitions.
Applied a total of 0 rules in 419 ms. Remains 1296 /1296 variables (removed 0) and now considering 89818/89818 (removed 0) transitions.
[2022-06-11 04:22:34] [INFO ] Flow matrix only has 62391 transitions (discarded 27427 similar events)
// Phase 1: matrix 62391 rows 1296 cols
[2022-06-11 04:22:34] [INFO ] Computed 12 place invariants in 191 ms
[2022-06-11 04:22:38] [INFO ] Implicit Places using invariants in 3590 ms returned []
Implicit Place search using SMT only with invariants took 3608 ms to find 0 implicit places.
[2022-06-11 04:22:38] [INFO ] Flow matrix only has 62391 transitions (discarded 27427 similar events)
// Phase 1: matrix 62391 rows 1296 cols
[2022-06-11 04:22:38] [INFO ] Computed 12 place invariants in 198 ms
[2022-06-11 04:23:08] [INFO ] Performed 86460/89818 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-11 04:23:09] [INFO ] Dead Transitions using invariants and state equation in 31480 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89818/89818 transitions.
Ending property specific reduction for RERS2020-PT-pb107-UpperBounds-12 in 137270 ms.
Starting property specific reduction for RERS2020-PT-pb107-UpperBounds-13
Normalized transition count is 62424 out of 89908 initially.
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-11 04:23:10] [INFO ] Computed 12 place invariants in 198 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 504 ms. (steps per millisecond=19 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
[2022-06-11 04:23:10] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-11 04:23:10] [INFO ] Computed 12 place invariants in 184 ms
[2022-06-11 04:23:11] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned sat
[2022-06-11 04:23:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 04:23:15] [INFO ] [Real]Absence check using state equation in 4810 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Drop transitions removed 81 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 1296/1296 places, 89827/89827 transitions.
Applied a total of 0 rules in 464 ms. Remains 1296 /1296 variables (removed 0) and now considering 89827/89827 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89827/89827 transitions.
Normalized transition count is 62366 out of 89827 initially.
// Phase 1: matrix 62366 rows 1296 cols
[2022-06-11 04:23:16] [INFO ] Computed 12 place invariants in 214 ms
Interrupted random walk after 655752 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties seen 0
Interrupted Best-First random walk after 858586 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=171 ) properties seen 0
[2022-06-11 04:23:51] [INFO ] Flow matrix only has 62366 transitions (discarded 27461 similar events)
// Phase 1: matrix 62366 rows 1296 cols
[2022-06-11 04:23:51] [INFO ] Computed 12 place invariants in 188 ms
[2022-06-11 04:23:52] [INFO ] [Real]Absence check using 12 positive place invariants in 22 ms returned sat
[2022-06-11 04:23:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 04:24:04] [INFO ] [Real]Absence check using state equation in 12321 ms returned sat
[2022-06-11 04:24:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 04:24:05] [INFO ] [Nat]Absence check using 12 positive place invariants in 24 ms returned sat
[2022-06-11 04:24:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 04:24:17] [INFO ] [Nat]Absence check using state equation in 12279 ms returned sat
[2022-06-11 04:24:18] [INFO ] State equation strengthened by 3686 read => feed constraints.
[2022-06-11 04:24:23] [INFO ] [Nat]Added 3686 Read/Feed constraints in 5693 ms returned sat
[2022-06-11 04:24:30] [INFO ] Deduced a trap composed of 26 places in 5876 ms of which 1 ms to minimize.
[2022-06-11 04:24:36] [INFO ] Deduced a trap composed of 19 places in 5054 ms of which 1 ms to minimize.
[2022-06-11 04:24:42] [INFO ] Deduced a trap composed of 49 places in 4973 ms of which 1 ms to minimize.
[2022-06-11 04:24:48] [INFO ] Deduced a trap composed of 52 places in 5255 ms of which 1 ms to minimize.
[2022-06-11 04:24:54] [INFO ] Deduced a trap composed of 104 places in 5210 ms of which 0 ms to minimize.
[2022-06-11 04:24:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1296/1296 places, 89827/89827 transitions.
Applied a total of 0 rules in 427 ms. Remains 1296 /1296 variables (removed 0) and now considering 89827/89827 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89827/89827 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1296/1296 places, 89827/89827 transitions.
Applied a total of 0 rules in 435 ms. Remains 1296 /1296 variables (removed 0) and now considering 89827/89827 (removed 0) transitions.
[2022-06-11 04:24:55] [INFO ] Flow matrix only has 62366 transitions (discarded 27461 similar events)
// Phase 1: matrix 62366 rows 1296 cols
[2022-06-11 04:24:55] [INFO ] Computed 12 place invariants in 238 ms
[2022-06-11 04:24:59] [INFO ] Implicit Places using invariants in 4030 ms returned []
Implicit Place search using SMT only with invariants took 4031 ms to find 0 implicit places.
[2022-06-11 04:24:59] [INFO ] Flow matrix only has 62366 transitions (discarded 27461 similar events)
// Phase 1: matrix 62366 rows 1296 cols
[2022-06-11 04:24:59] [INFO ] Computed 12 place invariants in 234 ms
[2022-06-11 04:25:29] [INFO ] Performed 85231/89827 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-11 04:25:31] [INFO ] Dead Transitions using invariants and state equation in 31956 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1296/1296 places, 89827/89827 transitions.
Ending property specific reduction for RERS2020-PT-pb107-UpperBounds-13 in 141243 ms.
Starting property specific reduction for RERS2020-PT-pb107-UpperBounds-14
Normalized transition count is 62424 out of 89908 initially.
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-11 04:25:31] [INFO ] Computed 12 place invariants in 189 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 513 ms. (steps per millisecond=19 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
[2022-06-11 04:25:31] [INFO ] Flow matrix only has 62424 transitions (discarded 27484 similar events)
// Phase 1: matrix 62424 rows 1296 cols
[2022-06-11 04:25:32] [INFO ] Computed 12 place invariants in 268 ms
[2022-06-11 04:25:32] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned sat
[2022-06-11 04:25:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 04:25:37] [INFO ] [Real]Absence check using state equation in 4821 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1296 places. Attempting structural reductions.
Drop transitions removed 43 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 1296/1296 places, 89865/89865 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 36 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1295 transition count 89867
Applied a total of 2 rules in 749 ms. Remains 1295 /1296 variables (removed 1) and now considering 89867/89865 (removed -2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1295/1296 places, 89867/89865 transitions.
Normalized transition count is 62383 out of 89867 initially.
// Phase 1: matrix 62383 rows 1295 cols
[2022-06-11 04:25:38] [INFO ] Computed 12 place invariants in 228 ms
Interrupted random walk after 635940 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties seen 0
Interrupted Best-First random walk after 867358 steps, including 3 resets, run timeout after 5001 ms. (steps per millisecond=173 ) properties seen 0
[2022-06-11 04:26:13] [INFO ] Flow matrix only has 62383 transitions (discarded 27484 similar events)
// Phase 1: matrix 62383 rows 1295 cols
[2022-06-11 04:26:13] [INFO ] Computed 12 place invariants in 242 ms
[2022-06-11 04:26:13] [INFO ] [Real]Absence check using 12 positive place invariants in 23 ms returned sat
[2022-06-11 04:26:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-11 04:26:26] [INFO ] [Real]Absence check using state equation in 12448 ms returned sat
[2022-06-11 04:26:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-11 04:26:27] [INFO ] [Nat]Absence check using 12 positive place invariants in 19 ms returned sat
[2022-06-11 04:26:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-11 04:26:39] [INFO ] [Nat]Absence check using state equation in 11925 ms returned sat
[2022-06-11 04:26:39] [INFO ] State equation strengthened by 3687 read => feed constraints.
[2022-06-11 04:26:44] [INFO ] [Nat]Added 3687 Read/Feed constraints in 4835 ms returned sat
[2022-06-11 04:26:52] [INFO ] Deduced a trap composed of 42 places in 6737 ms of which 3 ms to minimize.
[2022-06-11 04:26:59] [INFO ] Deduced a trap composed of 20 places in 6974 ms of which 1 ms to minimize.
[2022-06-11 04:27:07] [INFO ] Deduced a trap composed of 50 places in 6371 ms of which 1 ms to minimize.
[2022-06-11 04:27:15] [INFO ] Deduced a trap composed of 166 places in 7858 ms of which 1 ms to minimize.
[2022-06-11 04:27:15] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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] Max seen :[0]
Support contains 1 out of 1295 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1295/1295 places, 89867/89867 transitions.
Applied a total of 0 rules in 431 ms. Remains 1295 /1295 variables (removed 0) and now considering 89867/89867 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1295/1295 places, 89867/89867 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1295/1295 places, 89867/89867 transitions.
Applied a total of 0 rules in 432 ms. Remains 1295 /1295 variables (removed 0) and now considering 89867/89867 (removed 0) transitions.
[2022-06-11 04:27:16] [INFO ] Flow matrix only has 62383 transitions (discarded 27484 similar events)
// Phase 1: matrix 62383 rows 1295 cols
[2022-06-11 04:27:16] [INFO ] Computed 12 place invariants in 335 ms
[2022-06-11 04:27:20] [INFO ] Implicit Places using invariants in 4148 ms returned []
Implicit Place search using SMT only with invariants took 4153 ms to find 0 implicit places.
[2022-06-11 04:27:20] [INFO ] Flow matrix only has 62383 transitions (discarded 27484 similar events)
// Phase 1: matrix 62383 rows 1295 cols
[2022-06-11 04:27:20] [INFO ] Computed 12 place invariants in 249 ms
[2022-06-11 04:27:51] [INFO ] Performed 85169/89867 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-11 04:27:52] [INFO ] Dead Transitions using invariants and state equation in 31998 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1295/1295 places, 89867/89867 transitions.
Ending property specific reduction for RERS2020-PT-pb107-UpperBounds-14 in 141705 ms.
[2022-06-11 04:27:56] [INFO ] Flatten gal took : 3426 ms
[2022-06-11 04:27:58] [INFO ] Applying decomposition
[2022-06-11 04:28:01] [INFO ] Flatten gal took : 2910 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4944053629825646702.txt' '-o' '/tmp/graph4944053629825646702.bin' '-w' '/tmp/graph4944053629825646702.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4944053629825646702.bin' '-l' '-1' '-v' '-w' '/tmp/graph4944053629825646702.weights' '-q' '0' '-e' '0.001'
[2022-06-11 04:28:08] [INFO ] Decomposing Gal with order
[2022-06-11 04:28:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 04:28:17] [INFO ] Removed a total of 194781 redundant transitions.
[2022-06-11 04:28:18] [INFO ] Flatten gal took : 7790 ms
[2022-06-11 04:28:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 3299 labels/synchronizations in 3401 ms.
[2022-06-11 04:28:23] [INFO ] Time to serialize gal into /tmp/UpperBounds12966492882757174622.gal : 215 ms
[2022-06-11 04:28:23] [INFO ] Time to serialize properties into /tmp/UpperBounds9401560792316176639.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12966492882757174622.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9401560792316176639.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds9401560792316176639.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.64396e+13,213.635,2472124,3851,13528,525148,581824,38164,665723,17420,1.27939e+06,0
Total reachable state count : 16439581208014
Verifying 10 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property RERS2020-PT-pb107-UpperBounds-00 :0 <= i4.u137.ps637 <= 0
FORMULA RERS2020-PT-pb107-UpperBounds-00 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
RERS2020-PT-pb107-UpperBounds-00,0,213.815,2472124,1,0,525148,581824,39055,665723,17890,1.27939e+06,6045
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property RERS2020-PT-pb107-UpperBounds-01 :0 <= i2.u38.ps1287 <= 0
FORMULA RERS2020-PT-pb107-UpperBounds-01 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
RERS2020-PT-pb107-UpperBounds-01,0,213.828,2472124,1,0,525148,581824,39176,665723,17901,1.27939e+06,6681
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property RERS2020-PT-pb107-UpperBounds-04 :0 <= i6.u102.ps565 <= 0
FORMULA RERS2020-PT-pb107-UpperBounds-04 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
RERS2020-PT-pb107-UpperBounds-04,0,213.839,2472124,1,0,525148,581824,39230,665723,17907,1.27939e+06,6840
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property RERS2020-PT-pb107-UpperBounds-05 :0 <= i7.u145.ps69 <= 0
FORMULA RERS2020-PT-pb107-UpperBounds-05 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
RERS2020-PT-pb107-UpperBounds-05,0,213.866,2472124,1,0,525148,581824,39254,665723,18541,1.27939e+06,6903
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property RERS2020-PT-pb107-UpperBounds-06 :0 <= i7.u145.ps311 <= 0
FORMULA RERS2020-PT-pb107-UpperBounds-06 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
RERS2020-PT-pb107-UpperBounds-06,0,213.882,2472124,1,0,525148,581824,39277,665723,18873,1.27939e+06,6964
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property RERS2020-PT-pb107-UpperBounds-07 :0 <= i2.u47.ps1182 <= 0
FORMULA RERS2020-PT-pb107-UpperBounds-07 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
RERS2020-PT-pb107-UpperBounds-07,0,213.888,2472124,1,0,525148,581824,39340,665723,18873,1.27939e+06,7311
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property RERS2020-PT-pb107-UpperBounds-09 :0 <= i1.u26.ps554 <= 0
FORMULA RERS2020-PT-pb107-UpperBounds-09 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
RERS2020-PT-pb107-UpperBounds-09,0,213.892,2472124,1,0,525148,581824,39381,665723,18877,1.27939e+06,7462
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property RERS2020-PT-pb107-UpperBounds-12 :0 <= i5.u5.ps1057 <= 0
FORMULA RERS2020-PT-pb107-UpperBounds-12 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
RERS2020-PT-pb107-UpperBounds-12,0,213.897,2472124,1,0,525148,581824,39415,665723,18889,1.27939e+06,7635
Min sum of variable value : 0
Maximum sum along a path : 0
Bounds property RERS2020-PT-pb107-UpperBounds-13 :0 <= i2.u53.ps1126 <= 0
FORMULA RERS2020-PT-pb107-UpperBounds-13 0 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
RERS2020-PT-pb107-UpperBounds-13,0,213.901,2472124,1,0,525148,581824,39472,665723,18891,1.27939e+06,8006
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property RERS2020-PT-pb107-UpperBounds-14 :0 <= i7.u145.ps230 <= 1
FORMULA RERS2020-PT-pb107-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
RERS2020-PT-pb107-UpperBounds-14,0,213.922,2472124,1,0,525148,581824,39495,665723,19314,1.27939e+06,8114
Total runtime 2457753 ms.
BK_STOP 1654921918009
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="RERS2020-PT-pb107"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is RERS2020-PT-pb107, 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 r312-tall-165472282600677"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RERS2020-PT-pb107.tgz
mv RERS2020-PT-pb107 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 ;