About the Execution of LTSMin+red for LamportFastMutEx-COL-4
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 374.212 | 30091.00 | 59633.00 | 376.40 | 4 12 4 1 3 4 12 1 1 3 4 3 4 3 3 4 | 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-167856418800357.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-4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856418800357
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 8.8K Feb 25 13:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 13:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 13:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 13:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 17K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 13:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 174K Feb 25 13:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 13:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 13:43 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 40K 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-4-UpperBounds-00
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-01
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-02
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-03
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-04
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-05
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-06
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-07
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-08
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-09
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-10
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-11
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-12
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-13
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-14
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679505365451
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-4
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 17:16:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 17:16:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 17:16:07] [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 17:16:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 17:16:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 461 ms
[2023-03-22 17:16:07] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 135 PT places and 285.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-22 17:16:07] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 3 ms.
[2023-03-22 17:16:07] [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 17:16:07] [INFO ] Computed 2 place invariants in 6 ms
FORMULA LamportFastMutEx-COL-4-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-22 17:16:07] [INFO ] Invariant cache hit.
[2023-03-22 17:16:07] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-22 17:16:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:07] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-22 17:16:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:16:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-22 17:16:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:07] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-22 17:16:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 17:16:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 17:16:07] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-22 17:16:07] [INFO ] Added : 5 causal constraints over 1 iterations in 28 ms. Result :sat
Minimization took 5 ms.
[2023-03-22 17:16:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:08] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-22 17:16:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:16:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:16:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:08] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 17:16:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 17:16:08] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 17:16:08] [INFO ] Added : 11 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 16 ms.
[2023-03-22 17:16:08] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 17:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:08] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-22 17:16:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:16:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:16:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:08] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-22 17:16:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 17:16:08] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-22 17:16:08] [INFO ] Added : 6 causal constraints over 2 iterations in 26 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 17:16:08] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 17:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:08] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 17:16:08] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 17:16:08] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 17:16:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:16:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:16:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:08] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-22 17:16:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 17:16:08] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 17:16:08] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 17:16:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:08] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 17:16:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:16:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:16:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:08] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-22 17:16:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 17:16:08] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 17:16:08] [INFO ] Added : 11 causal constraints over 3 iterations in 13 ms. Result :sat
Minimization took 18 ms.
[2023-03-22 17:16:08] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-22 17:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:08] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-22 17:16:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:16:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:16:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:08] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-22 17:16:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 17:16:08] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 17:16:08] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 17:16:08] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-22 17:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:08] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 17:16:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:16:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:16:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:08] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-22 17:16:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 17:16:08] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 17:16:08] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 17:16:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:08] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-22 17:16:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:16:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:16:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:08] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-22 17:16:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 17:16:08] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 17:16:08] [INFO ] Added : 5 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 6 ms.
[2023-03-22 17:16:08] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-22 17:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:08] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-22 17:16:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:16:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:16:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:08] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-22 17:16:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 17:16:08] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-22 17:16:08] [INFO ] Added : 7 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 6 ms.
[2023-03-22 17:16:08] [INFO ] [Real]Absence check using 2 positive place invariants in 29 ms returned sat
[2023-03-22 17:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:09] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2023-03-22 17:16:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:16:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:16:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:09] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-22 17:16:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 17:16:09] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 17:16:09] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 17:16:09] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 17:16:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:09] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 17:16:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:16:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:16:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:09] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 17:16:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 17:16:09] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 17:16:09] [INFO ] Added : 11 causal constraints over 3 iterations in 13 ms. Result :sat
Minimization took 6 ms.
[2023-03-22 17:16:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:16:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:09] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-22 17:16:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:16:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:16:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:09] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-22 17:16:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 17:16:09] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 17:16:09] [INFO ] Added : 6 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [4, 16, 4, 4, 16, 4, 4, 4, 4, 4, 4, 4]
Domain [pid(5), pid(5)] 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 17:16:09] [INFO ] Unfolded HLPN to a Petri net with 135 places and 230 transitions 990 arcs in 16 ms.
[2023-03-22 17:16:09] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 50 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :50
FORMULA LamportFastMutEx-COL-4-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :32
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :32
FORMULA LamportFastMutEx-COL-4-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :37
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :17
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :19
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :29
[2023-03-22 17:16:09] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 102 cols
[2023-03-22 17:16:09] [INFO ] Computed 26 place invariants in 12 ms
[2023-03-22 17:16:09] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-22 17:16:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:09] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-22 17:16:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:16:09] [INFO ] [Nat]Absence check using 26 positive place invariants in 6 ms returned sat
[2023-03-22 17:16:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:09] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-22 17:16:09] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-22 17:16:09] [INFO ] [Nat]Added 40 Read/Feed constraints in 13 ms returned sat
[2023-03-22 17:16:09] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 4 ms to minimize.
[2023-03-22 17:16:09] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2023-03-22 17:16:09] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2023-03-22 17:16:09] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2023-03-22 17:16:09] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2023-03-22 17:16:09] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2023-03-22 17:16:10] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2023-03-22 17:16:10] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2023-03-22 17:16:10] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2023-03-22 17:16:10] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2023-03-22 17:16:10] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2023-03-22 17:16:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 513 ms
[2023-03-22 17:16:10] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-22 17:16:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:10] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-22 17:16:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:16:10] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-22 17:16:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:10] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-22 17:16:10] [INFO ] [Nat]Added 40 Read/Feed constraints in 13 ms returned sat
[2023-03-22 17:16:10] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2023-03-22 17:16:10] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2023-03-22 17:16:10] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2023-03-22 17:16:10] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2023-03-22 17:16:10] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2023-03-22 17:16:10] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2023-03-22 17:16:10] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2023-03-22 17:16:10] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2023-03-22 17:16:10] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 3 ms to minimize.
[2023-03-22 17:16:10] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2023-03-22 17:16:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 514 ms
[2023-03-22 17:16:10] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-22 17:16:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:10] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-22 17:16:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:16:10] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-22 17:16:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:10] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-22 17:16:10] [INFO ] [Nat]Added 40 Read/Feed constraints in 20 ms returned sat
[2023-03-22 17:16:11] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2023-03-22 17:16:11] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2023-03-22 17:16:11] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2023-03-22 17:16:11] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2023-03-22 17:16:11] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2023-03-22 17:16:11] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2023-03-22 17:16:11] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2023-03-22 17:16:11] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2023-03-22 17:16:11] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 352 ms
[2023-03-22 17:16:11] [INFO ] Computed and/alt/rep : 128/512/128 causal constraints (skipped 12 transitions) in 16 ms.
[2023-03-22 17:16:11] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2023-03-22 17:16:11] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2023-03-22 17:16:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2023-03-22 17:16:11] [INFO ] Added : 40 causal constraints over 9 iterations in 226 ms. Result :sat
Minimization took 189 ms.
[2023-03-22 17:16:11] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-22 17:16:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:11] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-22 17:16:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:16:11] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-22 17:16:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:11] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-22 17:16:11] [INFO ] [Nat]Added 40 Read/Feed constraints in 7 ms returned sat
[2023-03-22 17:16:11] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2023-03-22 17:16:11] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2023-03-22 17:16:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 92 ms
[2023-03-22 17:16:11] [INFO ] Computed and/alt/rep : 128/512/128 causal constraints (skipped 12 transitions) in 8 ms.
[2023-03-22 17:16:12] [INFO ] Added : 54 causal constraints over 11 iterations in 127 ms. Result :sat
Minimization took 57 ms.
[2023-03-22 17:16:12] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-22 17:16:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:12] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-22 17:16:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:16:12] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-22 17:16:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:12] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-22 17:16:12] [INFO ] [Nat]Added 40 Read/Feed constraints in 10 ms returned sat
[2023-03-22 17:16:12] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2023-03-22 17:16:12] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2023-03-22 17:16:12] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2023-03-22 17:16:12] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2023-03-22 17:16:12] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2023-03-22 17:16:12] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2023-03-22 17:16:12] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2023-03-22 17:16:12] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2023-03-22 17:16:12] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2023-03-22 17:16:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 321 ms
[2023-03-22 17:16:12] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-22 17:16:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:12] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-22 17:16:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:16:12] [INFO ] [Nat]Absence check using 26 positive place invariants in 6 ms returned sat
[2023-03-22 17:16:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:12] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-22 17:16:12] [INFO ] [Nat]Added 40 Read/Feed constraints in 7 ms returned sat
[2023-03-22 17:16:12] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2023-03-22 17:16:12] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2023-03-22 17:16:12] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2023-03-22 17:16:12] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2023-03-22 17:16:12] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2023-03-22 17:16:13] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2023-03-22 17:16:13] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2023-03-22 17:16:13] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2023-03-22 17:16:13] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2023-03-22 17:16:13] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2023-03-22 17:16:13] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2023-03-22 17:16:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 415 ms
[2023-03-22 17:16:13] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-22 17:16:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:13] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-22 17:16:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:16:13] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-22 17:16:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:13] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-22 17:16:13] [INFO ] [Nat]Added 40 Read/Feed constraints in 9 ms returned sat
[2023-03-22 17:16:13] [INFO ] Computed and/alt/rep : 128/512/128 causal constraints (skipped 12 transitions) in 12 ms.
[2023-03-22 17:16:13] [INFO ] Added : 18 causal constraints over 5 iterations in 70 ms. Result :sat
Minimization took 23 ms.
[2023-03-22 17:16:13] [INFO ] [Real]Absence check using 26 positive place invariants in 7 ms returned sat
[2023-03-22 17:16:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:13] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-22 17:16:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:16:13] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-22 17:16:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:13] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-22 17:16:13] [INFO ] [Nat]Added 40 Read/Feed constraints in 7 ms returned sat
[2023-03-22 17:16:13] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2023-03-22 17:16:13] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2023-03-22 17:16:13] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2023-03-22 17:16:13] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2023-03-22 17:16:13] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2023-03-22 17:16:13] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2023-03-22 17:16:13] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2023-03-22 17:16:13] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2023-03-22 17:16:13] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2023-03-22 17:16:13] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2023-03-22 17:16:14] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2023-03-22 17:16:14] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2023-03-22 17:16:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 513 ms
[2023-03-22 17:16:14] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-22 17:16:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:14] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-22 17:16:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:16:14] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-22 17:16:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:14] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-22 17:16:14] [INFO ] [Nat]Added 40 Read/Feed constraints in 7 ms returned sat
[2023-03-22 17:16:14] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2023-03-22 17:16:14] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2023-03-22 17:16:14] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2023-03-22 17:16:14] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 4 ms to minimize.
[2023-03-22 17:16:14] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2023-03-22 17:16:14] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2023-03-22 17:16:14] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2023-03-22 17:16:14] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2023-03-22 17:16:14] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2023-03-22 17:16:14] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2023-03-22 17:16:14] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2023-03-22 17:16:14] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2023-03-22 17:16:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 627 ms
Current structural bounds on expressions (after SMT) : [12, 3, 16, 4, 3, 3, 4, 3, 3] Max seen :[12, 3, 10, 1, 3, 3, 3, 3, 3]
FORMULA LamportFastMutEx-COL-4-UpperBounds-14 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-11 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-09 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-01 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 20 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 180/180 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 102 transition count 176
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 98 transition count 176
Applied a total of 8 rules in 27 ms. Remains 98 /102 variables (removed 4) and now considering 176/180 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 98/102 places, 176/180 transitions.
Normalized transition count is 140 out of 176 initially.
// Phase 1: matrix 140 rows 98 cols
[2023-03-22 17:16:15] [INFO ] Computed 26 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1595 ms. (steps per millisecond=626 ) properties (out of 2) seen :13
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 671 ms. (steps per millisecond=1490 ) properties (out of 2) seen :13
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 563 ms. (steps per millisecond=1776 ) properties (out of 2) seen :13
[2023-03-22 17:16:17] [INFO ] Flow matrix only has 140 transitions (discarded 36 similar events)
// Phase 1: matrix 140 rows 98 cols
[2023-03-22 17:16:17] [INFO ] Computed 26 place invariants in 6 ms
[2023-03-22 17:16:17] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-22 17:16:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:17] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-22 17:16:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:16:17] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-22 17:16:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:17] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-22 17:16:17] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-22 17:16:18] [INFO ] [Nat]Added 40 Read/Feed constraints in 20 ms returned sat
[2023-03-22 17:16:18] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2023-03-22 17:16:18] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2023-03-22 17:16:18] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2023-03-22 17:16:18] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2023-03-22 17:16:18] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2023-03-22 17:16:18] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2023-03-22 17:16:18] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2023-03-22 17:16:18] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2023-03-22 17:16:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 343 ms
[2023-03-22 17:16:18] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-22 17:16:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:18] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-22 17:16:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:16:18] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2023-03-22 17:16:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:18] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-22 17:16:18] [INFO ] [Nat]Added 40 Read/Feed constraints in 5 ms returned sat
[2023-03-22 17:16:18] [INFO ] Computed and/alt/rep : 124/508/124 causal constraints (skipped 12 transitions) in 11 ms.
[2023-03-22 17:16:18] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2023-03-22 17:16:18] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2023-03-22 17:16:18] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2023-03-22 17:16:18] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2023-03-22 17:16:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 190 ms
[2023-03-22 17:16:18] [INFO ] Added : 33 causal constraints over 8 iterations in 292 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : [12, 4] Max seen :[12, 1]
FORMULA LamportFastMutEx-COL-4-UpperBounds-06 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 176/176 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 94 transition count 172
Applied a total of 8 rules in 13 ms. Remains 94 /98 variables (removed 4) and now considering 172/176 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 94/98 places, 172/176 transitions.
Normalized transition count is 136 out of 172 initially.
// Phase 1: matrix 136 rows 94 cols
[2023-03-22 17:16:18] [INFO ] Computed 26 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1381 ms. (steps per millisecond=724 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 532 ms. (steps per millisecond=1879 ) properties (out of 1) seen :1
[2023-03-22 17:16:20] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 94 cols
[2023-03-22 17:16:20] [INFO ] Computed 26 place invariants in 5 ms
[2023-03-22 17:16:20] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-22 17:16:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:20] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-22 17:16:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:16:20] [INFO ] [Nat]Absence check using 26 positive place invariants in 6 ms returned sat
[2023-03-22 17:16:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:20] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-22 17:16:20] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-22 17:16:20] [INFO ] [Nat]Added 40 Read/Feed constraints in 5 ms returned sat
[2023-03-22 17:16:20] [INFO ] Computed and/alt/rep : 116/496/116 causal constraints (skipped 16 transitions) in 8 ms.
[2023-03-22 17:16:21] [INFO ] Added : 37 causal constraints over 8 iterations in 106 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[1]
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 172/172 transitions.
Applied a total of 0 rules in 7 ms. Remains 94 /94 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 94/94 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 172/172 transitions.
Applied a total of 0 rules in 6 ms. Remains 94 /94 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2023-03-22 17:16:21] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2023-03-22 17:16:21] [INFO ] Invariant cache hit.
[2023-03-22 17:16:21] [INFO ] Implicit Places using invariants in 78 ms returned [62, 63, 64, 65]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 85 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 90/94 places, 172/172 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 97 ms. Remains : 90/94 places, 172/172 transitions.
Normalized transition count is 136 out of 172 initially.
// Phase 1: matrix 136 rows 90 cols
[2023-03-22 17:16:21] [INFO ] Computed 22 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1321 ms. (steps per millisecond=757 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 522 ms. (steps per millisecond=1915 ) properties (out of 1) seen :1
[2023-03-22 17:16:23] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2023-03-22 17:16:23] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-22 17:16:23] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned sat
[2023-03-22 17:16:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:23] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-22 17:16:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:16:23] [INFO ] [Nat]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-22 17:16:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:23] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-22 17:16:23] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-22 17:16:23] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2023-03-22 17:16:23] [INFO ] Computed and/alt/rep : 120/496/120 causal constraints (skipped 12 transitions) in 8 ms.
[2023-03-22 17:16:23] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2023-03-22 17:16:23] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2023-03-22 17:16:23] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2023-03-22 17:16:23] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2023-03-22 17:16:23] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2023-03-22 17:16:23] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2023-03-22 17:16:23] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2023-03-22 17:16:23] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2023-03-22 17:16:23] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2023-03-22 17:16:23] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2023-03-22 17:16:23] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2023-03-22 17:16:23] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 530 ms
[2023-03-22 17:16:23] [INFO ] Added : 51 causal constraints over 11 iterations in 653 ms. Result :sat
Minimization took 70 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[1]
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 90/90 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2023-03-22 17:16:24] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2023-03-22 17:16:24] [INFO ] Invariant cache hit.
[2023-03-22 17:16:24] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-22 17:16:24] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2023-03-22 17:16:24] [INFO ] Invariant cache hit.
[2023-03-22 17:16:24] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-22 17:16:24] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-22 17:16:24] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-22 17:16:24] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2023-03-22 17:16:24] [INFO ] Invariant cache hit.
[2023-03-22 17:16:24] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 286 ms. Remains : 90/90 places, 172/172 transitions.
Starting property specific reduction for LamportFastMutEx-COL-4-UpperBounds-07
Normalized transition count is 136 out of 172 initially.
// Phase 1: matrix 136 rows 90 cols
[2023-03-22 17:16:24] [INFO ] Computed 22 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :1
[2023-03-22 17:16:24] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2023-03-22 17:16:24] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-22 17:16:24] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-22 17:16:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:24] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-22 17:16:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:16:24] [INFO ] [Nat]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-22 17:16:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:24] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-22 17:16:24] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-22 17:16:24] [INFO ] [Nat]Added 24 Read/Feed constraints in 12 ms returned sat
[2023-03-22 17:16:24] [INFO ] Computed and/alt/rep : 120/496/120 causal constraints (skipped 12 transitions) in 8 ms.
[2023-03-22 17:16:24] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2023-03-22 17:16:24] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2023-03-22 17:16:24] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2023-03-22 17:16:24] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2023-03-22 17:16:24] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2023-03-22 17:16:24] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2023-03-22 17:16:24] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2023-03-22 17:16:24] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2023-03-22 17:16:24] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2023-03-22 17:16:25] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2023-03-22 17:16:25] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2023-03-22 17:16:25] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 507 ms
[2023-03-22 17:16:25] [INFO ] Added : 51 causal constraints over 11 iterations in 628 ms. Result :sat
Minimization took 70 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[1]
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 90/90 places, 172/172 transitions.
Normalized transition count is 136 out of 172 initially.
// Phase 1: matrix 136 rows 90 cols
[2023-03-22 17:16:25] [INFO ] Computed 22 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1322 ms. (steps per millisecond=756 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 515 ms. (steps per millisecond=1941 ) properties (out of 1) seen :1
[2023-03-22 17:16:27] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2023-03-22 17:16:27] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-22 17:16:27] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-22 17:16:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:27] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-22 17:16:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:16:27] [INFO ] [Nat]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-22 17:16:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:16:27] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-22 17:16:27] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-22 17:16:27] [INFO ] [Nat]Added 24 Read/Feed constraints in 4 ms returned sat
[2023-03-22 17:16:27] [INFO ] Computed and/alt/rep : 120/496/120 causal constraints (skipped 12 transitions) in 8 ms.
[2023-03-22 17:16:27] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2023-03-22 17:16:27] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2023-03-22 17:16:27] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2023-03-22 17:16:27] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2023-03-22 17:16:27] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2023-03-22 17:16:27] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2023-03-22 17:16:27] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2023-03-22 17:16:27] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2023-03-22 17:16:27] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2023-03-22 17:16:27] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2023-03-22 17:16:27] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2023-03-22 17:16:27] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 496 ms
[2023-03-22 17:16:27] [INFO ] Added : 51 causal constraints over 11 iterations in 612 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[1]
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 90/90 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2023-03-22 17:16:27] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2023-03-22 17:16:27] [INFO ] Invariant cache hit.
[2023-03-22 17:16:27] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-22 17:16:27] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2023-03-22 17:16:27] [INFO ] Invariant cache hit.
[2023-03-22 17:16:28] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-22 17:16:28] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-03-22 17:16:28] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-22 17:16:28] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2023-03-22 17:16:28] [INFO ] Invariant cache hit.
[2023-03-22 17:16:28] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 90/90 places, 172/172 transitions.
Ending property specific reduction for LamportFastMutEx-COL-4-UpperBounds-07 in 3849 ms.
[2023-03-22 17:16:28] [INFO ] Flatten gal took : 72 ms
[2023-03-22 17:16:28] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-22 17:16:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 90 places, 172 transitions and 772 arcs took 2 ms.
Total runtime 21150 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/1023/ub_0_
FORMULA LamportFastMutEx-COL-4-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
BK_STOP 1679505395542
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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
ub formula name LamportFastMutEx-COL-4-UpperBounds-07
ub formula formula --maxsum=/tmp/1023/ub_0_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 90 places, 172 transitions and 772 arcs
pnml2lts-sym: Petri net LamportFastMutEx_COL_4_unf analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 172->144 groups
pnml2lts-sym: Regrouping took 0.020 real 0.030 user 0.000 sys
pnml2lts-sym: state vector length is 90; there are 144 groups
pnml2lts-sym: Computing maximum sum over 4 state variables.
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: Exploration took 555516 group checks and 0 next state calls
pnml2lts-sym: reachability took 2.940 real 11.710 user 0.000 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.020 user 0.000 sys
pnml2lts-sym: state space has 1498496 states, 76254 nodes
pnml2lts-sym: Maximum sum of /tmp/1023/ub_0_ is: 1
pnml2lts-sym: group_next: 1278 nodes total
pnml2lts-sym: group_explored: 1480 nodes, 1532 short vectors total
pnml2lts-sym: max token count: 1
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-4"
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-4, 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-167856418800357"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-4.tgz
mv LamportFastMutEx-COL-4 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 ;