About the Execution of LTSMin+red for LamportFastMutEx-COL-8
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3980.659 | 3600000.00 | 14086067.00 | 626.90 | 7 7 7 7 1 8 8 56 ? 1 ? 8 7 56 8 8 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r233-tall-167856418800389.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is LamportFastMutEx-COL-8, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856418800389
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 6.5K Feb 25 13:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 13:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 13:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 13:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 13:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 13:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 13:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 13:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 44K Mar 5 18:22 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 LamportFastMutEx-COL-8-UpperBounds-00
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-01
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-02
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-03
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-04
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-05
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-06
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-07
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-08
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-09
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-10
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-11
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-12
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-13
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-14
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679514236852
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-8
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 19:43:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 19:43:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 19:43:58] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-22 19:43:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 19:43:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 765 ms
[2023-03-22 19:43:59] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 315 PT places and 837.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-22 19:43:59] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2023-03-22 19:43:59] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 17 rows 15 cols
[2023-03-22 19:43:59] [INFO ] Computed 2 place invariants in 7 ms
FORMULA LamportFastMutEx-COL-8-UpperBounds-15 8 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-8-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-8-UpperBounds-06 8 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-8-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-22 19:43:59] [INFO ] Invariant cache hit.
[2023-03-22 19:43:59] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2023-03-22 19:43:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:43:59] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-22 19:43:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:43:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:43:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:43:59] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-22 19:43:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 19:43:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-22 19:43:59] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 19:43:59] [INFO ] Added : 6 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 5 ms.
[2023-03-22 19:43:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:43:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:43:59] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 19:43:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:43:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 19:43:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:43:59] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-22 19:43:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 19:43:59] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 19:43:59] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 19:43:59] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 19:43:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:43:59] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-22 19:43:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:43:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:43:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:43:59] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-22 19:43:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 19:43:59] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 19:43:59] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 19:43:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:43:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:43:59] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 19:43:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:43:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:43:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:43:59] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-22 19:43:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 19:43:59] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 19:43:59] [INFO ] Added : 7 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 19:43:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:43:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:43:59] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 19:43:59] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 19:43:59] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 19:44:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:44:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 19:44:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:00] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-22 19:44:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 19:44:00] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 19:44:00] [INFO ] Added : 5 causal constraints over 1 iterations in 30 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 19:44:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:44:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:00] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 19:44:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:44:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:44:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:00] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-22 19:44:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 19:44:00] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 19:44:00] [INFO ] Added : 11 causal constraints over 3 iterations in 13 ms. Result :sat
Minimization took 11 ms.
[2023-03-22 19:44:00] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 19:44:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:00] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-22 19:44:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:44:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:44:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:00] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-22 19:44:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 19:44:00] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 19:44:00] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 19:44:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:44:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:00] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-22 19:44:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:44:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:44:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:00] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-22 19:44:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 19:44:00] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 19:44:00] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 19:44:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:44:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:00] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 19:44:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:44:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:44:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:00] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-22 19:44:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 19:44:00] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 19:44:00] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 19:44:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:44:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:00] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 19:44:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:44:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:44:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:00] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-22 19:44:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 19:44:00] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 19:44:00] [INFO ] Added : 7 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2023-03-22 19:44:00] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 19:44:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:00] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 19:44:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:44:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:44:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:00] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-22 19:44:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 19:44:00] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 19:44:00] [INFO ] Added : 11 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 13 ms.
[2023-03-22 19:44:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:44:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:00] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-22 19:44:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:44:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:44:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:00] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 19:44:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 19:44:00] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 19:44:00] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [8, 8, 8, 8, 8, 64, 8, 8, 8, 8, 64, 8]
Domain [pid(9), pid(9)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-22 19:44:00] [INFO ] Unfolded HLPN to a Petri net with 315 places and 666 transitions 2934 arcs in 39 ms.
[2023-03-22 19:44:00] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 82 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) seen :118
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :68
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :91
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :82
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :52
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :81
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :75
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :39
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :72
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :96
FORMULA LamportFastMutEx-COL-8-UpperBounds-11 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :102
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :38
FORMULA LamportFastMutEx-COL-8-UpperBounds-14 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-22 19:44:00] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2023-03-22 19:44:00] [INFO ] Computed 82 place invariants in 14 ms
[2023-03-22 19:44:01] [INFO ] [Real]Absence check using 82 positive place invariants in 15 ms returned sat
[2023-03-22 19:44:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:01] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2023-03-22 19:44:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:44:01] [INFO ] [Nat]Absence check using 82 positive place invariants in 26 ms returned sat
[2023-03-22 19:44:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:01] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2023-03-22 19:44:01] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 19:44:01] [INFO ] [Nat]Added 112 Read/Feed constraints in 16 ms returned sat
[2023-03-22 19:44:01] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 6 ms to minimize.
[2023-03-22 19:44:01] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 1 ms to minimize.
[2023-03-22 19:44:01] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2023-03-22 19:44:01] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2023-03-22 19:44:01] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 1 ms to minimize.
[2023-03-22 19:44:02] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2023-03-22 19:44:02] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 0 ms to minimize.
[2023-03-22 19:44:02] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 755 ms
[2023-03-22 19:44:02] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 38 ms.
[2023-03-22 19:44:02] [INFO ] Added : 37 causal constraints over 8 iterations in 276 ms. Result :sat
Minimization took 94 ms.
[2023-03-22 19:44:02] [INFO ] [Real]Absence check using 82 positive place invariants in 16 ms returned sat
[2023-03-22 19:44:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:02] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2023-03-22 19:44:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:44:02] [INFO ] [Nat]Absence check using 82 positive place invariants in 15 ms returned sat
[2023-03-22 19:44:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:02] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2023-03-22 19:44:02] [INFO ] [Nat]Added 112 Read/Feed constraints in 54 ms returned sat
[2023-03-22 19:44:02] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 1 ms to minimize.
[2023-03-22 19:44:03] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2023-03-22 19:44:03] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2023-03-22 19:44:03] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2023-03-22 19:44:03] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2023-03-22 19:44:03] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2023-03-22 19:44:03] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2023-03-22 19:44:03] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2023-03-22 19:44:03] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2023-03-22 19:44:03] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2023-03-22 19:44:03] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2023-03-22 19:44:03] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2023-03-22 19:44:03] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 950 ms
[2023-03-22 19:44:03] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 34 ms.
[2023-03-22 19:44:04] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 0 ms to minimize.
[2023-03-22 19:44:04] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2023-03-22 19:44:04] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2023-03-22 19:44:05] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2023-03-22 19:44:05] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2023-03-22 19:44:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 504 ms
[2023-03-22 19:44:05] [INFO ] Added : 137 causal constraints over 29 iterations in 1430 ms. Result :sat
Minimization took 94 ms.
[2023-03-22 19:44:05] [INFO ] [Real]Absence check using 82 positive place invariants in 15 ms returned sat
[2023-03-22 19:44:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:05] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2023-03-22 19:44:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:44:05] [INFO ] [Nat]Absence check using 82 positive place invariants in 15 ms returned sat
[2023-03-22 19:44:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:05] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-22 19:44:05] [INFO ] [Nat]Added 112 Read/Feed constraints in 29 ms returned sat
[2023-03-22 19:44:05] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2023-03-22 19:44:05] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 0 ms to minimize.
[2023-03-22 19:44:06] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 0 ms to minimize.
[2023-03-22 19:44:06] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 1 ms to minimize.
[2023-03-22 19:44:06] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 0 ms to minimize.
[2023-03-22 19:44:06] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 0 ms to minimize.
[2023-03-22 19:44:06] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 1 ms to minimize.
[2023-03-22 19:44:06] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2023-03-22 19:44:06] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2023-03-22 19:44:06] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 1 ms to minimize.
[2023-03-22 19:44:07] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 3 ms to minimize.
[2023-03-22 19:44:07] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 1 ms to minimize.
[2023-03-22 19:44:07] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2023-03-22 19:44:07] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 0 ms to minimize.
[2023-03-22 19:44:07] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 0 ms to minimize.
[2023-03-22 19:44:07] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 0 ms to minimize.
[2023-03-22 19:44:07] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 0 ms to minimize.
[2023-03-22 19:44:08] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 1 ms to minimize.
[2023-03-22 19:44:08] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 0 ms to minimize.
[2023-03-22 19:44:08] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 0 ms to minimize.
[2023-03-22 19:44:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 20 trap constraints in 2621 ms
[2023-03-22 19:44:08] [INFO ] [Real]Absence check using 82 positive place invariants in 15 ms returned sat
[2023-03-22 19:44:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:08] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2023-03-22 19:44:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:44:08] [INFO ] [Nat]Absence check using 82 positive place invariants in 32 ms returned sat
[2023-03-22 19:44:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:08] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2023-03-22 19:44:08] [INFO ] [Nat]Added 112 Read/Feed constraints in 35 ms returned sat
[2023-03-22 19:44:08] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2023-03-22 19:44:09] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 1 ms to minimize.
[2023-03-22 19:44:09] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2023-03-22 19:44:09] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 0 ms to minimize.
[2023-03-22 19:44:09] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2023-03-22 19:44:09] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 0 ms to minimize.
[2023-03-22 19:44:09] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2023-03-22 19:44:09] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2023-03-22 19:44:09] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 0 ms to minimize.
[2023-03-22 19:44:09] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2023-03-22 19:44:09] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2023-03-22 19:44:10] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2023-03-22 19:44:10] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2023-03-22 19:44:10] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2023-03-22 19:44:10] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2023-03-22 19:44:10] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 1 ms to minimize.
[2023-03-22 19:44:10] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 0 ms to minimize.
[2023-03-22 19:44:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 17 trap constraints in 1718 ms
[2023-03-22 19:44:10] [INFO ] [Real]Absence check using 82 positive place invariants in 19 ms returned sat
[2023-03-22 19:44:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:10] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2023-03-22 19:44:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:44:10] [INFO ] [Nat]Absence check using 82 positive place invariants in 17 ms returned sat
[2023-03-22 19:44:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:10] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2023-03-22 19:44:10] [INFO ] [Nat]Added 112 Read/Feed constraints in 31 ms returned sat
[2023-03-22 19:44:10] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 1 ms to minimize.
[2023-03-22 19:44:11] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 0 ms to minimize.
[2023-03-22 19:44:11] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 0 ms to minimize.
[2023-03-22 19:44:11] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 1 ms to minimize.
[2023-03-22 19:44:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 541 ms
[2023-03-22 19:44:11] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 36 ms.
[2023-03-22 19:44:12] [INFO ] Added : 126 causal constraints over 26 iterations in 781 ms. Result :sat
Minimization took 102 ms.
[2023-03-22 19:44:12] [INFO ] [Real]Absence check using 82 positive place invariants in 18 ms returned sat
[2023-03-22 19:44:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:12] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2023-03-22 19:44:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:44:12] [INFO ] [Nat]Absence check using 82 positive place invariants in 18 ms returned sat
[2023-03-22 19:44:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:12] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-22 19:44:12] [INFO ] [Nat]Added 112 Read/Feed constraints in 87 ms returned sat
[2023-03-22 19:44:12] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 0 ms to minimize.
[2023-03-22 19:44:12] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2023-03-22 19:44:13] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2023-03-22 19:44:13] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2023-03-22 19:44:13] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2023-03-22 19:44:13] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2023-03-22 19:44:13] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 0 ms to minimize.
[2023-03-22 19:44:13] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 0 ms to minimize.
[2023-03-22 19:44:13] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2023-03-22 19:44:13] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2023-03-22 19:44:13] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2023-03-22 19:44:13] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2023-03-22 19:44:13] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2023-03-22 19:44:13] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2023-03-22 19:44:13] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 0 ms to minimize.
[2023-03-22 19:44:14] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2023-03-22 19:44:14] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2023-03-22 19:44:14] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2023-03-22 19:44:14] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2023-03-22 19:44:14] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 0 ms to minimize.
[2023-03-22 19:44:14] [INFO ] Deduced a trap composed of 68 places in 74 ms of which 0 ms to minimize.
[2023-03-22 19:44:14] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2023-03-22 19:44:14] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2148 ms
[2023-03-22 19:44:14] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 34 ms.
[2023-03-22 19:44:15] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 0 ms to minimize.
[2023-03-22 19:44:15] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2023-03-22 19:44:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 333 ms
[2023-03-22 19:44:16] [INFO ] Added : 113 causal constraints over 24 iterations in 1244 ms. Result :sat
Minimization took 560 ms.
[2023-03-22 19:44:16] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2023-03-22 19:44:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:16] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2023-03-22 19:44:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:44:16] [INFO ] [Nat]Absence check using 82 positive place invariants in 17 ms returned sat
[2023-03-22 19:44:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:16] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2023-03-22 19:44:16] [INFO ] [Nat]Added 112 Read/Feed constraints in 14 ms returned sat
[2023-03-22 19:44:17] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 27 ms.
[2023-03-22 19:44:17] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 0 ms to minimize.
[2023-03-22 19:44:17] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 0 ms to minimize.
[2023-03-22 19:44:17] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2023-03-22 19:44:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 307 ms
[2023-03-22 19:44:17] [INFO ] Added : 41 causal constraints over 9 iterations in 601 ms. Result :sat
Minimization took 100 ms.
[2023-03-22 19:44:17] [INFO ] [Real]Absence check using 82 positive place invariants in 15 ms returned sat
[2023-03-22 19:44:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:17] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2023-03-22 19:44:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:44:17] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2023-03-22 19:44:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:17] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-22 19:44:18] [INFO ] [Nat]Added 112 Read/Feed constraints in 21 ms returned sat
[2023-03-22 19:44:18] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 0 ms to minimize.
[2023-03-22 19:44:18] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2023-03-22 19:44:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 186 ms
[2023-03-22 19:44:18] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 25 ms.
[2023-03-22 19:44:19] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 1 ms to minimize.
[2023-03-22 19:44:19] [INFO ] Deduced a trap composed of 63 places in 119 ms of which 1 ms to minimize.
[2023-03-22 19:44:19] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 1 ms to minimize.
[2023-03-22 19:44:19] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 6 ms to minimize.
[2023-03-22 19:44:19] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2023-03-22 19:44:19] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 1 ms to minimize.
[2023-03-22 19:44:20] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 1 ms to minimize.
[2023-03-22 19:44:20] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 1 ms to minimize.
[2023-03-22 19:44:20] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2023-03-22 19:44:20] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 0 ms to minimize.
[2023-03-22 19:44:20] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2023-03-22 19:44:20] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1512 ms
[2023-03-22 19:44:20] [INFO ] Added : 144 causal constraints over 30 iterations in 2432 ms. Result :sat
Minimization took 239 ms.
[2023-03-22 19:44:20] [INFO ] [Real]Absence check using 82 positive place invariants in 17 ms returned sat
[2023-03-22 19:44:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:21] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2023-03-22 19:44:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:44:21] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2023-03-22 19:44:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:21] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2023-03-22 19:44:21] [INFO ] [Nat]Added 112 Read/Feed constraints in 30 ms returned sat
[2023-03-22 19:44:21] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2023-03-22 19:44:21] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2023-03-22 19:44:21] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2023-03-22 19:44:21] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 0 ms to minimize.
[2023-03-22 19:44:21] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2023-03-22 19:44:21] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2023-03-22 19:44:21] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2023-03-22 19:44:21] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2023-03-22 19:44:21] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2023-03-22 19:44:21] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2023-03-22 19:44:22] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2023-03-22 19:44:22] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2023-03-22 19:44:22] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2023-03-22 19:44:22] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2023-03-22 19:44:22] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2023-03-22 19:44:22] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2023-03-22 19:44:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 1185 ms
[2023-03-22 19:44:22] [INFO ] [Real]Absence check using 82 positive place invariants in 19 ms returned sat
[2023-03-22 19:44:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:22] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2023-03-22 19:44:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:44:22] [INFO ] [Nat]Absence check using 82 positive place invariants in 20 ms returned sat
[2023-03-22 19:44:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:22] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2023-03-22 19:44:22] [INFO ] [Nat]Added 112 Read/Feed constraints in 113 ms returned sat
[2023-03-22 19:44:22] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2023-03-22 19:44:23] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-22 19:44:23] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 0 ms to minimize.
[2023-03-22 19:44:23] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2023-03-22 19:44:23] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2023-03-22 19:44:23] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2023-03-22 19:44:23] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2023-03-22 19:44:23] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2023-03-22 19:44:23] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2023-03-22 19:44:23] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 0 ms to minimize.
[2023-03-22 19:44:23] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2023-03-22 19:44:23] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 888 ms
[2023-03-22 19:44:23] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 27 ms.
[2023-03-22 19:44:24] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2023-03-22 19:44:24] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 0 ms to minimize.
[2023-03-22 19:44:24] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2023-03-22 19:44:24] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2023-03-22 19:44:24] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2023-03-22 19:44:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 521 ms
[2023-03-22 19:44:24] [INFO ] Added : 81 causal constraints over 17 iterations in 1152 ms. Result :sat
Minimization took 238 ms.
Current structural bounds on expressions (after SMT) : [8, 8, 7, 7, 8, 64, 8, 8, 7, 64] Max seen :[4, 5, 7, 7, 7, 50, 5, 1, 7, 40]
FORMULA LamportFastMutEx-COL-8-UpperBounds-12 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 168 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 34 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 266/266 places, 584/584 transitions.
Normalized transition count is 416 out of 584 initially.
// Phase 1: matrix 416 rows 266 cols
[2023-03-22 19:44:28] [INFO ] Computed 82 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4526 ms. (steps per millisecond=220 ) properties (out of 7) seen :108
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1170 ms. (steps per millisecond=854 ) properties (out of 7) seen :84
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 950 ms. (steps per millisecond=1052 ) properties (out of 7) seen :87
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 866 ms. (steps per millisecond=1154 ) properties (out of 7) seen :79
FORMULA LamportFastMutEx-COL-8-UpperBounds-05 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1103 ms. (steps per millisecond=906 ) properties (out of 6) seen :20
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1118 ms. (steps per millisecond=894 ) properties (out of 6) seen :85
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2057 ms. (steps per millisecond=486 ) properties (out of 6) seen :115
[2023-03-22 19:44:40] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2023-03-22 19:44:40] [INFO ] Computed 82 place invariants in 4 ms
[2023-03-22 19:44:40] [INFO ] [Real]Absence check using 82 positive place invariants in 15 ms returned sat
[2023-03-22 19:44:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:40] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2023-03-22 19:44:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:44:40] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2023-03-22 19:44:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:40] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2023-03-22 19:44:40] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 19:44:40] [INFO ] [Nat]Added 112 Read/Feed constraints in 34 ms returned sat
[2023-03-22 19:44:40] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 0 ms to minimize.
[2023-03-22 19:44:40] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 0 ms to minimize.
[2023-03-22 19:44:40] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 0 ms to minimize.
[2023-03-22 19:44:40] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2023-03-22 19:44:41] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 0 ms to minimize.
[2023-03-22 19:44:41] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2023-03-22 19:44:41] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 0 ms to minimize.
[2023-03-22 19:44:41] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 0 ms to minimize.
[2023-03-22 19:44:41] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2023-03-22 19:44:41] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2023-03-22 19:44:41] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2023-03-22 19:44:41] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 0 ms to minimize.
[2023-03-22 19:44:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 1275 ms
[2023-03-22 19:44:41] [INFO ] [Real]Absence check using 82 positive place invariants in 15 ms returned sat
[2023-03-22 19:44:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:41] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2023-03-22 19:44:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:44:42] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2023-03-22 19:44:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:42] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2023-03-22 19:44:42] [INFO ] [Nat]Added 112 Read/Feed constraints in 70 ms returned sat
[2023-03-22 19:44:42] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 0 ms to minimize.
[2023-03-22 19:44:42] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2023-03-22 19:44:42] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 0 ms to minimize.
[2023-03-22 19:44:42] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2023-03-22 19:44:42] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2023-03-22 19:44:42] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2023-03-22 19:44:42] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2023-03-22 19:44:42] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2023-03-22 19:44:42] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 0 ms to minimize.
[2023-03-22 19:44:42] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2023-03-22 19:44:43] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2023-03-22 19:44:43] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2023-03-22 19:44:43] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2023-03-22 19:44:43] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2023-03-22 19:44:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 1014 ms
[2023-03-22 19:44:43] [INFO ] [Real]Absence check using 82 positive place invariants in 17 ms returned sat
[2023-03-22 19:44:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:43] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2023-03-22 19:44:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:44:43] [INFO ] [Nat]Absence check using 82 positive place invariants in 21 ms returned sat
[2023-03-22 19:44:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:43] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2023-03-22 19:44:43] [INFO ] [Nat]Added 112 Read/Feed constraints in 85 ms returned sat
[2023-03-22 19:44:43] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 0 ms to minimize.
[2023-03-22 19:44:43] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 0 ms to minimize.
[2023-03-22 19:44:43] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 0 ms to minimize.
[2023-03-22 19:44:44] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 0 ms to minimize.
[2023-03-22 19:44:44] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2023-03-22 19:44:44] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2023-03-22 19:44:44] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2023-03-22 19:44:44] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 0 ms to minimize.
[2023-03-22 19:44:44] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2023-03-22 19:44:44] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2023-03-22 19:44:44] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2023-03-22 19:44:44] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2023-03-22 19:44:44] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2023-03-22 19:44:44] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2023-03-22 19:44:44] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2023-03-22 19:44:44] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2023-03-22 19:44:44] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2023-03-22 19:44:45] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2023-03-22 19:44:45] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2023-03-22 19:44:45] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 0 ms to minimize.
[2023-03-22 19:44:45] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2068 ms
[2023-03-22 19:44:45] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 27 ms.
[2023-03-22 19:44:46] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2023-03-22 19:44:46] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2023-03-22 19:44:47] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2023-03-22 19:44:47] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2023-03-22 19:44:47] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 0 ms to minimize.
[2023-03-22 19:44:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 582 ms
[2023-03-22 19:44:47] [INFO ] Added : 158 causal constraints over 32 iterations in 1672 ms. Result :sat
Minimization took 182 ms.
[2023-03-22 19:44:47] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2023-03-22 19:44:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:47] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2023-03-22 19:44:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:44:47] [INFO ] [Nat]Absence check using 82 positive place invariants in 15 ms returned sat
[2023-03-22 19:44:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:47] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2023-03-22 19:44:47] [INFO ] [Nat]Added 112 Read/Feed constraints in 15 ms returned sat
[2023-03-22 19:44:47] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 26 ms.
[2023-03-22 19:44:48] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 0 ms to minimize.
[2023-03-22 19:44:48] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2023-03-22 19:44:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 200 ms
[2023-03-22 19:44:48] [INFO ] Added : 53 causal constraints over 13 iterations in 617 ms. Result :sat
Minimization took 121 ms.
[2023-03-22 19:44:48] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2023-03-22 19:44:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:48] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2023-03-22 19:44:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:44:48] [INFO ] [Nat]Absence check using 82 positive place invariants in 15 ms returned sat
[2023-03-22 19:44:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:48] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2023-03-22 19:44:48] [INFO ] [Nat]Added 112 Read/Feed constraints in 21 ms returned sat
[2023-03-22 19:44:49] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2023-03-22 19:44:49] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2023-03-22 19:44:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 198 ms
[2023-03-22 19:44:49] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 27 ms.
[2023-03-22 19:44:50] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 0 ms to minimize.
[2023-03-22 19:44:50] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 0 ms to minimize.
[2023-03-22 19:44:50] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
[2023-03-22 19:44:50] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 1 ms to minimize.
[2023-03-22 19:44:50] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2023-03-22 19:44:50] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 1 ms to minimize.
[2023-03-22 19:44:50] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 0 ms to minimize.
[2023-03-22 19:44:51] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 0 ms to minimize.
[2023-03-22 19:44:51] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2023-03-22 19:44:51] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 1 ms to minimize.
[2023-03-22 19:44:51] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2023-03-22 19:44:51] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1374 ms
[2023-03-22 19:44:51] [INFO ] Added : 144 causal constraints over 30 iterations in 2315 ms. Result :sat
Minimization took 247 ms.
[2023-03-22 19:44:51] [INFO ] [Real]Absence check using 82 positive place invariants in 19 ms returned sat
[2023-03-22 19:44:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:51] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2023-03-22 19:44:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:44:51] [INFO ] [Nat]Absence check using 82 positive place invariants in 19 ms returned sat
[2023-03-22 19:44:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:44:52] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2023-03-22 19:44:52] [INFO ] [Nat]Added 112 Read/Feed constraints in 164 ms returned sat
[2023-03-22 19:44:52] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2023-03-22 19:44:52] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2023-03-22 19:44:52] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 0 ms to minimize.
[2023-03-22 19:44:52] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2023-03-22 19:44:52] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2023-03-22 19:44:52] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2023-03-22 19:44:52] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2023-03-22 19:44:52] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2023-03-22 19:44:53] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 0 ms to minimize.
[2023-03-22 19:44:53] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2023-03-22 19:44:53] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2023-03-22 19:44:53] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2023-03-22 19:44:53] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2023-03-22 19:44:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 1935 ms
Current structural bounds on expressions (after SMT) : [7, 7, 64, 8, 8, 56] Max seen :[7, 7, 53, 6, 1, 56]
FORMULA LamportFastMutEx-COL-8-UpperBounds-13 56 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-UpperBounds-00 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 80 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 584/584 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 258 transition count 576
Applied a total of 16 rules in 44 ms. Remains 258 /266 variables (removed 8) and now considering 576/584 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 258/266 places, 576/584 transitions.
Normalized transition count is 408 out of 576 initially.
// Phase 1: matrix 408 rows 258 cols
[2023-03-22 19:44:55] [INFO ] Computed 82 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3613 ms. (steps per millisecond=276 ) properties (out of 3) seen :59
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1886 ms. (steps per millisecond=530 ) properties (out of 3) seen :61
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 857 ms. (steps per millisecond=1166 ) properties (out of 3) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 911 ms. (steps per millisecond=1097 ) properties (out of 3) seen :52
[2023-03-22 19:45:02] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 258 cols
[2023-03-22 19:45:02] [INFO ] Computed 82 place invariants in 6 ms
[2023-03-22 19:45:02] [INFO ] [Real]Absence check using 82 positive place invariants in 19 ms returned sat
[2023-03-22 19:45:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:45:02] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2023-03-22 19:45:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:45:02] [INFO ] [Nat]Absence check using 82 positive place invariants in 19 ms returned sat
[2023-03-22 19:45:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:45:02] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-22 19:45:02] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 19:45:02] [INFO ] [Nat]Added 112 Read/Feed constraints in 71 ms returned sat
[2023-03-22 19:45:03] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-22 19:45:03] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2023-03-22 19:45:03] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2023-03-22 19:45:03] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2023-03-22 19:45:03] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2023-03-22 19:45:03] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2023-03-22 19:45:03] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2023-03-22 19:45:03] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2023-03-22 19:45:03] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2023-03-22 19:45:03] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2023-03-22 19:45:03] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2023-03-22 19:45:03] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2023-03-22 19:45:03] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2023-03-22 19:45:03] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 0 ms to minimize.
[2023-03-22 19:45:03] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2023-03-22 19:45:04] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 2 ms to minimize.
[2023-03-22 19:45:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 1828 ms
[2023-03-22 19:45:04] [INFO ] [Real]Absence check using 82 positive place invariants in 15 ms returned sat
[2023-03-22 19:45:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:45:04] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-22 19:45:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:45:04] [INFO ] [Nat]Absence check using 82 positive place invariants in 18 ms returned sat
[2023-03-22 19:45:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:45:05] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2023-03-22 19:45:05] [INFO ] [Nat]Added 112 Read/Feed constraints in 14 ms returned sat
[2023-03-22 19:45:05] [INFO ] Computed and/alt/rep : 224/1168/224 causal constraints (skipped 176 transitions) in 24 ms.
[2023-03-22 19:45:05] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 1 ms to minimize.
[2023-03-22 19:45:05] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 1 ms to minimize.
[2023-03-22 19:45:05] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 1 ms to minimize.
[2023-03-22 19:45:05] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 0 ms to minimize.
[2023-03-22 19:45:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 487 ms
[2023-03-22 19:45:05] [INFO ] Added : 56 causal constraints over 12 iterations in 862 ms. Result :sat
Minimization took 131 ms.
[2023-03-22 19:45:06] [INFO ] [Real]Absence check using 82 positive place invariants in 13 ms returned sat
[2023-03-22 19:45:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:45:06] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2023-03-22 19:45:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:45:06] [INFO ] [Nat]Absence check using 82 positive place invariants in 13 ms returned sat
[2023-03-22 19:45:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:45:06] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2023-03-22 19:45:06] [INFO ] [Nat]Added 112 Read/Feed constraints in 21 ms returned sat
[2023-03-22 19:45:06] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2023-03-22 19:45:06] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2023-03-22 19:45:06] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 0 ms to minimize.
[2023-03-22 19:45:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 256 ms
[2023-03-22 19:45:06] [INFO ] Computed and/alt/rep : 224/1168/224 causal constraints (skipped 176 transitions) in 23 ms.
[2023-03-22 19:45:07] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 0 ms to minimize.
[2023-03-22 19:45:07] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-22 19:45:07] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2023-03-22 19:45:07] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 0 ms to minimize.
[2023-03-22 19:45:07] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2023-03-22 19:45:07] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 0 ms to minimize.
[2023-03-22 19:45:07] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2023-03-22 19:45:07] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 0 ms to minimize.
[2023-03-22 19:45:07] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 853 ms
[2023-03-22 19:45:08] [INFO ] Added : 85 causal constraints over 18 iterations in 1367 ms. Result :sat
Minimization took 175 ms.
Current structural bounds on expressions (after SMT) : [56, 8, 8] Max seen :[56, 6, 1]
FORMULA LamportFastMutEx-COL-8-UpperBounds-07 56 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 16 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 576/576 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 258 transition count 568
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 250 transition count 568
Applied a total of 16 rules in 41 ms. Remains 250 /258 variables (removed 8) and now considering 568/576 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 250/258 places, 568/576 transitions.
Normalized transition count is 400 out of 568 initially.
// Phase 1: matrix 400 rows 250 cols
[2023-03-22 19:45:08] [INFO ] Computed 82 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2600 ms. (steps per millisecond=384 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 720 ms. (steps per millisecond=1388 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 787 ms. (steps per millisecond=1270 ) properties (out of 2) seen :6
[2023-03-22 19:45:12] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 250 cols
[2023-03-22 19:45:12] [INFO ] Computed 82 place invariants in 9 ms
[2023-03-22 19:45:12] [INFO ] [Real]Absence check using 82 positive place invariants in 13 ms returned sat
[2023-03-22 19:45:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:45:12] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2023-03-22 19:45:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:45:13] [INFO ] [Nat]Absence check using 82 positive place invariants in 14 ms returned sat
[2023-03-22 19:45:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:45:13] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2023-03-22 19:45:13] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 19:45:13] [INFO ] [Nat]Added 112 Read/Feed constraints in 14 ms returned sat
[2023-03-22 19:45:13] [INFO ] Computed and/alt/rep : 216/1096/216 causal constraints (skipped 176 transitions) in 24 ms.
[2023-03-22 19:45:13] [INFO ] Deduced a trap composed of 50 places in 117 ms of which 0 ms to minimize.
[2023-03-22 19:45:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-03-22 19:45:13] [INFO ] Added : 67 causal constraints over 14 iterations in 546 ms. Result :sat
Minimization took 131 ms.
[2023-03-22 19:45:13] [INFO ] [Real]Absence check using 82 positive place invariants in 13 ms returned sat
[2023-03-22 19:45:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:45:13] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2023-03-22 19:45:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:45:14] [INFO ] [Nat]Absence check using 82 positive place invariants in 13 ms returned sat
[2023-03-22 19:45:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:45:14] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2023-03-22 19:45:14] [INFO ] [Nat]Added 112 Read/Feed constraints in 13 ms returned sat
[2023-03-22 19:45:14] [INFO ] Computed and/alt/rep : 216/1096/216 causal constraints (skipped 176 transitions) in 25 ms.
[2023-03-22 19:45:14] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2023-03-22 19:45:14] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2023-03-22 19:45:14] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2023-03-22 19:45:14] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2023-03-22 19:45:14] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2023-03-22 19:45:14] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2023-03-22 19:45:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 419 ms
[2023-03-22 19:45:14] [INFO ] Added : 54 causal constraints over 12 iterations in 777 ms. Result :sat
Minimization took 176 ms.
Current structural bounds on expressions (after SMT) : [8, 8] Max seen :[6, 1]
Support contains 16 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 568/568 transitions.
Applied a total of 0 rules in 15 ms. Remains 250 /250 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 250/250 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 568/568 transitions.
Applied a total of 0 rules in 15 ms. Remains 250 /250 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-22 19:45:15] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 19:45:15] [INFO ] Invariant cache hit.
[2023-03-22 19:45:15] [INFO ] Implicit Places using invariants in 279 ms returned [154, 155, 156, 157, 158, 159, 160, 161]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 282 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 242/250 places, 568/568 transitions.
Applied a total of 0 rules in 14 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 312 ms. Remains : 242/250 places, 568/568 transitions.
Normalized transition count is 400 out of 568 initially.
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 19:45:15] [INFO ] Computed 74 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2461 ms. (steps per millisecond=406 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 711 ms. (steps per millisecond=1406 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 753 ms. (steps per millisecond=1328 ) properties (out of 2) seen :6
[2023-03-22 19:45:19] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 19:45:19] [INFO ] Computed 74 place invariants in 6 ms
[2023-03-22 19:45:19] [INFO ] [Real]Absence check using 74 positive place invariants in 12 ms returned sat
[2023-03-22 19:45:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:45:19] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2023-03-22 19:45:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:45:19] [INFO ] [Nat]Absence check using 74 positive place invariants in 13 ms returned sat
[2023-03-22 19:45:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:45:19] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-22 19:45:19] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 19:45:19] [INFO ] [Nat]Added 48 Read/Feed constraints in 25 ms returned sat
[2023-03-22 19:45:20] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 24 ms.
[2023-03-22 19:45:20] [INFO ] Added : 123 causal constraints over 25 iterations in 693 ms. Result :sat
Minimization took 100 ms.
[2023-03-22 19:45:20] [INFO ] [Real]Absence check using 74 positive place invariants in 12 ms returned sat
[2023-03-22 19:45:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:45:20] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2023-03-22 19:45:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:45:20] [INFO ] [Nat]Absence check using 74 positive place invariants in 13 ms returned sat
[2023-03-22 19:45:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:45:21] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-22 19:45:21] [INFO ] [Nat]Added 48 Read/Feed constraints in 11 ms returned sat
[2023-03-22 19:45:21] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 23 ms.
[2023-03-22 19:45:21] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2023-03-22 19:45:22] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
[2023-03-22 19:45:22] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 2 ms to minimize.
[2023-03-22 19:45:22] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 0 ms to minimize.
[2023-03-22 19:45:22] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2023-03-22 19:45:22] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
[2023-03-22 19:45:22] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2023-03-22 19:45:22] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2023-03-22 19:45:22] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2023-03-22 19:45:23] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 0 ms to minimize.
[2023-03-22 19:45:23] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2023-03-22 19:45:23] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2023-03-22 19:45:23] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1370 ms
[2023-03-22 19:45:23] [INFO ] Added : 134 causal constraints over 27 iterations in 2143 ms. Result :sat
Minimization took 225 ms.
Current structural bounds on expressions (after SMT) : [8, 8] Max seen :[6, 1]
Support contains 16 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 12 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 242/242 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 12 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-22 19:45:23] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 19:45:23] [INFO ] Invariant cache hit.
[2023-03-22 19:45:24] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-22 19:45:24] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 19:45:24] [INFO ] Invariant cache hit.
[2023-03-22 19:45:24] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 19:45:24] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
[2023-03-22 19:45:24] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-22 19:45:24] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 19:45:24] [INFO ] Invariant cache hit.
[2023-03-22 19:45:24] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 829 ms. Remains : 242/242 places, 568/568 transitions.
Starting property specific reduction for LamportFastMutEx-COL-8-UpperBounds-08
Normalized transition count is 400 out of 568 initially.
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 19:45:24] [INFO ] Computed 74 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :1
[2023-03-22 19:45:24] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 19:45:24] [INFO ] Computed 74 place invariants in 4 ms
[2023-03-22 19:45:24] [INFO ] [Real]Absence check using 74 positive place invariants in 11 ms returned sat
[2023-03-22 19:45:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:45:24] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2023-03-22 19:45:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:45:24] [INFO ] [Nat]Absence check using 74 positive place invariants in 15 ms returned sat
[2023-03-22 19:45:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:45:24] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-22 19:45:24] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 19:45:24] [INFO ] [Nat]Added 48 Read/Feed constraints in 10 ms returned sat
[2023-03-22 19:45:25] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 23 ms.
[2023-03-22 19:45:25] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2023-03-22 19:45:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2023-03-22 19:45:25] [INFO ] Added : 79 causal constraints over 16 iterations in 528 ms. Result :sat
Minimization took 94 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[4]
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 11 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 242/242 places, 568/568 transitions.
Normalized transition count is 400 out of 568 initially.
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 19:45:25] [INFO ] Computed 74 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2276 ms. (steps per millisecond=439 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 684 ms. (steps per millisecond=1461 ) properties (out of 1) seen :1
[2023-03-22 19:45:28] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 19:45:28] [INFO ] Computed 74 place invariants in 8 ms
[2023-03-22 19:45:28] [INFO ] [Real]Absence check using 74 positive place invariants in 12 ms returned sat
[2023-03-22 19:45:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:45:28] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2023-03-22 19:45:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:45:28] [INFO ] [Nat]Absence check using 74 positive place invariants in 14 ms returned sat
[2023-03-22 19:45:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:45:29] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-22 19:45:29] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 19:45:29] [INFO ] [Nat]Added 48 Read/Feed constraints in 9 ms returned sat
[2023-03-22 19:45:29] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 27 ms.
[2023-03-22 19:45:29] [INFO ] Added : 123 causal constraints over 25 iterations in 707 ms. Result :sat
Minimization took 101 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[6]
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 11 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 242/242 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 10 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-22 19:45:30] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 19:45:30] [INFO ] Invariant cache hit.
[2023-03-22 19:45:30] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-22 19:45:30] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 19:45:30] [INFO ] Invariant cache hit.
[2023-03-22 19:45:30] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 19:45:30] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
[2023-03-22 19:45:30] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-22 19:45:30] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 19:45:30] [INFO ] Invariant cache hit.
[2023-03-22 19:45:31] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 909 ms. Remains : 242/242 places, 568/568 transitions.
Normalized transition count is 400 out of 568 initially.
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 19:45:31] [INFO ] Computed 74 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2302 ms. (steps per millisecond=434 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 688 ms. (steps per millisecond=1453 ) properties (out of 1) seen :1
[2023-03-22 19:45:34] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 19:45:34] [INFO ] Computed 74 place invariants in 5 ms
[2023-03-22 19:45:34] [INFO ] [Real]Absence check using 74 positive place invariants in 13 ms returned sat
[2023-03-22 19:45:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:45:34] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2023-03-22 19:45:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:45:34] [INFO ] [Nat]Absence check using 74 positive place invariants in 12 ms returned sat
[2023-03-22 19:45:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:45:34] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-22 19:45:34] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 19:45:34] [INFO ] [Nat]Added 48 Read/Feed constraints in 10 ms returned sat
[2023-03-22 19:45:34] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 24 ms.
[2023-03-22 19:45:34] [INFO ] Added : 123 causal constraints over 25 iterations in 713 ms. Result :sat
Minimization took 98 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[6]
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 10 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 242/242 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 8 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-22 19:45:35] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 19:45:35] [INFO ] Invariant cache hit.
[2023-03-22 19:45:35] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-22 19:45:35] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 19:45:35] [INFO ] Invariant cache hit.
[2023-03-22 19:45:35] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 19:45:35] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
[2023-03-22 19:45:35] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-22 19:45:35] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 19:45:35] [INFO ] Invariant cache hit.
[2023-03-22 19:45:36] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 786 ms. Remains : 242/242 places, 568/568 transitions.
Ending property specific reduction for LamportFastMutEx-COL-8-UpperBounds-08 in 11407 ms.
Starting property specific reduction for LamportFastMutEx-COL-8-UpperBounds-10
Normalized transition count is 400 out of 568 initially.
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 19:45:36] [INFO ] Computed 74 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :1
[2023-03-22 19:45:36] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 19:45:36] [INFO ] Computed 74 place invariants in 3 ms
[2023-03-22 19:45:36] [INFO ] [Real]Absence check using 74 positive place invariants in 12 ms returned sat
[2023-03-22 19:45:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:45:36] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2023-03-22 19:45:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:45:36] [INFO ] [Nat]Absence check using 74 positive place invariants in 12 ms returned sat
[2023-03-22 19:45:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:45:36] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-22 19:45:36] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 19:45:36] [INFO ] [Nat]Added 48 Read/Feed constraints in 15 ms returned sat
[2023-03-22 19:45:36] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 28 ms.
[2023-03-22 19:45:37] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2023-03-22 19:45:37] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 0 ms to minimize.
[2023-03-22 19:45:37] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 0 ms to minimize.
[2023-03-22 19:45:37] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 1 ms to minimize.
[2023-03-22 19:45:37] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 0 ms to minimize.
[2023-03-22 19:45:37] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2023-03-22 19:45:37] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2023-03-22 19:45:38] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2023-03-22 19:45:38] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2023-03-22 19:45:38] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 0 ms to minimize.
[2023-03-22 19:45:38] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2023-03-22 19:45:38] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2023-03-22 19:45:38] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1356 ms
[2023-03-22 19:45:38] [INFO ] Added : 134 causal constraints over 27 iterations in 2115 ms. Result :sat
Minimization took 224 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 8 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 242/242 places, 568/568 transitions.
Normalized transition count is 400 out of 568 initially.
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 19:45:38] [INFO ] Computed 74 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2259 ms. (steps per millisecond=442 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 715 ms. (steps per millisecond=1398 ) properties (out of 1) seen :1
[2023-03-22 19:45:41] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 19:45:41] [INFO ] Computed 74 place invariants in 4 ms
[2023-03-22 19:45:41] [INFO ] [Real]Absence check using 74 positive place invariants in 12 ms returned sat
[2023-03-22 19:45:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:45:42] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2023-03-22 19:45:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:45:42] [INFO ] [Nat]Absence check using 74 positive place invariants in 14 ms returned sat
[2023-03-22 19:45:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:45:42] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2023-03-22 19:45:42] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 19:45:42] [INFO ] [Nat]Added 48 Read/Feed constraints in 10 ms returned sat
[2023-03-22 19:45:42] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 23 ms.
[2023-03-22 19:45:43] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2023-03-22 19:45:43] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 1 ms to minimize.
[2023-03-22 19:45:43] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 0 ms to minimize.
[2023-03-22 19:45:43] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 0 ms to minimize.
[2023-03-22 19:45:43] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2023-03-22 19:45:43] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2023-03-22 19:45:43] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2023-03-22 19:45:43] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2023-03-22 19:45:44] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2023-03-22 19:45:44] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 0 ms to minimize.
[2023-03-22 19:45:44] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2023-03-22 19:45:44] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2023-03-22 19:45:44] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1339 ms
[2023-03-22 19:45:44] [INFO ] Added : 134 causal constraints over 27 iterations in 2114 ms. Result :sat
Minimization took 228 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 8 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 242/242 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 8 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-22 19:45:44] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 19:45:44] [INFO ] Invariant cache hit.
[2023-03-22 19:45:44] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-22 19:45:44] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 19:45:44] [INFO ] Invariant cache hit.
[2023-03-22 19:45:45] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 19:45:45] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
[2023-03-22 19:45:45] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-22 19:45:45] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 19:45:45] [INFO ] Invariant cache hit.
[2023-03-22 19:45:45] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 811 ms. Remains : 242/242 places, 568/568 transitions.
Ending property specific reduction for LamportFastMutEx-COL-8-UpperBounds-10 in 9507 ms.
[2023-03-22 19:45:45] [INFO ] Flatten gal took : 79 ms
[2023-03-22 19:45:45] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-22 19:45:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 242 places, 568 transitions and 2888 arcs took 4 ms.
Total runtime 107499 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/1650/ub_0_ --maxsum=/tmp/1650/ub_1_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12159236 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16093380 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023
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="LamportFastMutEx-COL-8"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is LamportFastMutEx-COL-8, 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 r233-tall-167856418800389"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-8.tgz
mv LamportFastMutEx-COL-8 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 ;