About the Execution of 2023-gold for LamportFastMutEx-COL-8
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16218.252 | 3600000.00 | 2904581.00 | 471403.30 | 8 7 8 7 7 ? 56 7 8 8 7 1 8 ? 56 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r241-tall-171649628300156.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is LamportFastMutEx-COL-8, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r241-tall-171649628300156
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.1K Apr 13 07:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 13 07:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 13 07:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 13 07:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 07:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 13 07:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 13 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 13 07:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 44K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-00
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-01
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-02
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-03
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-04
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-05
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-06
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-07
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-08
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-09
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-10
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-11
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-12
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-13
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-14
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716556845655
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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-8
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202304061127
[2024-05-24 13:20:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 13:20:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 13:20:47] [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.
[2024-05-24 13:20:47] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 13:20:47] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 456 ms
[2024-05-24 13:20:47] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 315 PT places and 837.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2024-05-24 13:20:47] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 3 ms.
[2024-05-24 13:20:47] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 17 rows 15 cols
[2024-05-24 13:20:47] [INFO ] Computed 2 invariants in 7 ms
FORMULA LamportFastMutEx-COL-8-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-8-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-8-UpperBounds-08 8 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-24 13:20:47] [INFO ] Invariant cache hit.
[2024-05-24 13:20:47] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-24 13:20:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:47] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-24 13:20:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:20:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-24 13:20:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:47] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-24 13:20:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:20:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 13:20:47] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 13:20:47] [INFO ] Added : 5 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 19 ms.
[2024-05-24 13:20:48] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-24 13:20:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:48] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-24 13:20:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:20:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-05-24 13:20:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:48] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-24 13:20:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2024-05-24 13:20:48] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-24 13:20:48] [INFO ] Added : 6 causal constraints over 2 iterations in 27 ms. Result :sat
Minimization took 3 ms.
[2024-05-24 13:20:48] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-24 13:20:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:48] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-24 13:20:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:20:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 13:20:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:48] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-24 13:20:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 13:20:48] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 13:20:48] [INFO ] Added : 5 causal constraints over 1 iterations in 45 ms. Result :sat
Minimization took 6 ms.
[2024-05-24 13:20:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 13:20:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:48] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-24 13:20:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:20:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 13:20:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:48] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-24 13:20:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 13:20:48] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 13:20:48] [INFO ] Added : 7 causal constraints over 2 iterations in 39 ms. Result :sat
Minimization took 5 ms.
[2024-05-24 13:20:48] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-24 13:20:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:48] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-24 13:20:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:20:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-24 13:20:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:48] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-24 13:20:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2024-05-24 13:20:48] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-24 13:20:48] [INFO ] Added : 7 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 6 ms.
[2024-05-24 13:20:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 13:20:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:48] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-24 13:20:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:20:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 13:20:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:48] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-24 13:20:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 13:20:48] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 13:20:48] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2024-05-24 13:20:48] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-24 13:20:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:48] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-24 13:20:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:20:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 13:20:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:48] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-24 13:20:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 13:20:48] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-24 13:20:48] [INFO ] Added : 11 causal constraints over 3 iterations in 17 ms. Result :sat
Minimization took 12 ms.
[2024-05-24 13:20:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 13:20:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:48] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-24 13:20:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:20:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 9 ms returned sat
[2024-05-24 13:20:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:48] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-24 13:20:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 13:20:48] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 13:20:48] [INFO ] Added : 11 causal constraints over 3 iterations in 95 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 13:20:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 13:20:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:48] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-24 13:20:48] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 13:20:48] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 13:20:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:20:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 13:20:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:48] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-24 13:20:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 13:20:48] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 13:20:49] [INFO ] Added : 5 causal constraints over 1 iterations in 26 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 13:20:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 13:20:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:49] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-24 13:20:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:20:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 13:20:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:49] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-24 13:20:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 13:20:49] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-24 13:20:49] [INFO ] Added : 6 causal constraints over 2 iterations in 26 ms. Result :sat
Minimization took 3 ms.
[2024-05-24 13:20:49] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-24 13:20:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:49] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-24 13:20:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:20:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 13:20:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:49] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-24 13:20:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 13:20:49] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 13:20:49] [INFO ] Added : 5 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 3 ms.
[2024-05-24 13:20:49] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-24 13:20:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:49] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-24 13:20:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:20:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-24 13:20:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:49] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-24 13:20:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 13:20:49] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 13:20:49] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 13:20:49] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-24 13:20:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:49] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-24 13:20:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:20:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 13:20:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:49] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-24 13:20:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-24 13:20:49] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 13:20:49] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [8, 8, 8, 8, 8, 8, 64, 8, 8, 8, 8, 8, 64]
Domain [pid(9), pid(9)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-24 13:20:49] [INFO ] Unfolded HLPN to a Petri net with 315 places and 666 transitions 2934 arcs in 24 ms.
[2024-05-24 13:20:49] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 82 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 13) seen :128
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :40
FORMULA LamportFastMutEx-COL-8-UpperBounds-00 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :12
FORMULA LamportFastMutEx-COL-8-UpperBounds-02 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :45
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :88
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :80
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :78
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :83
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :101
FORMULA LamportFastMutEx-COL-8-UpperBounds-12 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :89
[2024-05-24 13:20:49] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2024-05-24 13:20:49] [INFO ] Computed 82 invariants in 21 ms
[2024-05-24 13:20:49] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2024-05-24 13:20:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:49] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-24 13:20:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:20:49] [INFO ] [Nat]Absence check using 82 positive place invariants in 29 ms returned sat
[2024-05-24 13:20:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:49] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-05-24 13:20:49] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 13:20:49] [INFO ] [Nat]Added 112 Read/Feed constraints in 14 ms returned sat
[2024-05-24 13:20:50] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 9 ms to minimize.
[2024-05-24 13:20:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2024-05-24 13:20:50] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 38 ms.
[2024-05-24 13:20:50] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 1 ms to minimize.
[2024-05-24 13:20:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2024-05-24 13:20:50] [INFO ] Added : 7 causal constraints over 3 iterations in 273 ms. Result :sat
Minimization took 78 ms.
[2024-05-24 13:20:50] [INFO ] [Real]Absence check using 82 positive place invariants in 15 ms returned sat
[2024-05-24 13:20:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:50] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-05-24 13:20:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:20:50] [INFO ] [Nat]Absence check using 82 positive place invariants in 13 ms returned sat
[2024-05-24 13:20:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:50] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-05-24 13:20:50] [INFO ] [Nat]Added 112 Read/Feed constraints in 14 ms returned sat
[2024-05-24 13:20:50] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2024-05-24 13:20:51] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 2 ms to minimize.
[2024-05-24 13:20:51] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-24 13:20:51] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-24 13:20:51] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2024-05-24 13:20:51] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-24 13:20:51] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-24 13:20:51] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2024-05-24 13:20:51] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-24 13:20:51] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 0 ms to minimize.
[2024-05-24 13:20:51] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 927 ms
[2024-05-24 13:20:51] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 36 ms.
[2024-05-24 13:20:52] [INFO ] Added : 45 causal constraints over 9 iterations in 294 ms. Result :sat
Minimization took 60 ms.
[2024-05-24 13:20:52] [INFO ] [Real]Absence check using 82 positive place invariants in 13 ms returned sat
[2024-05-24 13:20:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:52] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-05-24 13:20:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:20:52] [INFO ] [Nat]Absence check using 82 positive place invariants in 14 ms returned sat
[2024-05-24 13:20:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:52] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-05-24 13:20:52] [INFO ] [Nat]Added 112 Read/Feed constraints in 28 ms returned sat
[2024-05-24 13:20:52] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-24 13:20:52] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 0 ms to minimize.
[2024-05-24 13:20:52] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-24 13:20:52] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 0 ms to minimize.
[2024-05-24 13:20:52] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-05-24 13:20:52] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-24 13:20:52] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 0 ms to minimize.
[2024-05-24 13:20:53] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-24 13:20:53] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-24 13:20:53] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-24 13:20:53] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-24 13:20:53] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-24 13:20:53] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-24 13:20:53] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-24 13:20:53] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-24 13:20:53] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-24 13:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 1118 ms
[2024-05-24 13:20:53] [INFO ] [Real]Absence check using 82 positive place invariants in 13 ms returned sat
[2024-05-24 13:20:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:53] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-05-24 13:20:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:20:53] [INFO ] [Nat]Absence check using 82 positive place invariants in 14 ms returned sat
[2024-05-24 13:20:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:53] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-05-24 13:20:53] [INFO ] [Nat]Added 112 Read/Feed constraints in 14 ms returned sat
[2024-05-24 13:20:53] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 31 ms.
[2024-05-24 13:20:54] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 0 ms to minimize.
[2024-05-24 13:20:54] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-05-24 13:20:54] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 0 ms to minimize.
[2024-05-24 13:20:54] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 0 ms to minimize.
[2024-05-24 13:20:54] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 1 ms to minimize.
[2024-05-24 13:20:54] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 1 ms to minimize.
[2024-05-24 13:20:54] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 1 ms to minimize.
[2024-05-24 13:20:55] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 0 ms to minimize.
[2024-05-24 13:20:55] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-24 13:20:55] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1061 ms
[2024-05-24 13:20:55] [INFO ] Added : 40 causal constraints over 8 iterations in 1335 ms. Result :sat
Minimization took 68 ms.
[2024-05-24 13:20:55] [INFO ] [Real]Absence check using 82 positive place invariants in 17 ms returned sat
[2024-05-24 13:20:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:55] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-05-24 13:20:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:20:55] [INFO ] [Nat]Absence check using 82 positive place invariants in 20 ms returned sat
[2024-05-24 13:20:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:55] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2024-05-24 13:20:55] [INFO ] [Nat]Added 112 Read/Feed constraints in 100 ms returned sat
[2024-05-24 13:20:55] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-24 13:20:55] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-24 13:20:55] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-05-24 13:20:56] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-24 13:20:56] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2024-05-24 13:20:56] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-24 13:20:56] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-05-24 13:20:56] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-24 13:20:56] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-05-24 13:20:56] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 744 ms
[2024-05-24 13:20:56] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 37 ms.
[2024-05-24 13:20:56] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2024-05-24 13:20:56] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2024-05-24 13:20:56] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-24 13:20:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 247 ms
[2024-05-24 13:20:57] [INFO ] Added : 48 causal constraints over 11 iterations in 599 ms. Result :sat
Minimization took 145 ms.
[2024-05-24 13:20:57] [INFO ] [Real]Absence check using 82 positive place invariants in 15 ms returned sat
[2024-05-24 13:20:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:57] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-05-24 13:20:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:20:57] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2024-05-24 13:20:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:57] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-05-24 13:20:57] [INFO ] [Nat]Added 112 Read/Feed constraints in 32 ms returned sat
[2024-05-24 13:20:57] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 0 ms to minimize.
[2024-05-24 13:20:57] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 2 ms to minimize.
[2024-05-24 13:20:57] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-24 13:20:57] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-24 13:20:57] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-24 13:20:58] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-24 13:20:58] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-24 13:20:58] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 10 ms to minimize.
[2024-05-24 13:20:58] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-24 13:20:58] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2024-05-24 13:20:58] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
[2024-05-24 13:20:58] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2024-05-24 13:20:58] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2024-05-24 13:20:58] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-24 13:20:58] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2024-05-24 13:20:58] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2024-05-24 13:20:58] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2024-05-24 13:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 17 trap constraints in 1369 ms
[2024-05-24 13:20:58] [INFO ] [Real]Absence check using 82 positive place invariants in 17 ms returned sat
[2024-05-24 13:20:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:59] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-24 13:20:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:20:59] [INFO ] [Nat]Absence check using 82 positive place invariants in 15 ms returned sat
[2024-05-24 13:20:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:20:59] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-05-24 13:20:59] [INFO ] [Nat]Added 112 Read/Feed constraints in 36 ms returned sat
[2024-05-24 13:20:59] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 0 ms to minimize.
[2024-05-24 13:20:59] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 1 ms to minimize.
[2024-05-24 13:20:59] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 1 ms to minimize.
[2024-05-24 13:20:59] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 0 ms to minimize.
[2024-05-24 13:20:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 466 ms
[2024-05-24 13:20:59] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 29 ms.
[2024-05-24 13:21:00] [INFO ] Added : 126 causal constraints over 26 iterations in 707 ms. Result :sat
Minimization took 94 ms.
[2024-05-24 13:21:00] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2024-05-24 13:21:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:21:00] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-24 13:21:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:21:00] [INFO ] [Nat]Absence check using 82 positive place invariants in 13 ms returned sat
[2024-05-24 13:21:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:21:00] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-24 13:21:00] [INFO ] [Nat]Added 112 Read/Feed constraints in 13 ms returned sat
[2024-05-24 13:21:00] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 0 ms to minimize.
[2024-05-24 13:21:01] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-24 13:21:01] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 0 ms to minimize.
[2024-05-24 13:21:01] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 0 ms to minimize.
[2024-05-24 13:21:01] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
[2024-05-24 13:21:01] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-24 13:21:01] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-24 13:21:01] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 0 ms to minimize.
[2024-05-24 13:21:01] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-05-24 13:21:01] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 859 ms
[2024-05-24 13:21:01] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 29 ms.
[2024-05-24 13:21:01] [INFO ] Added : 41 causal constraints over 9 iterations in 281 ms. Result :sat
Minimization took 117 ms.
[2024-05-24 13:21:02] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2024-05-24 13:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:21:02] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-05-24 13:21:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:21:02] [INFO ] [Nat]Absence check using 82 positive place invariants in 15 ms returned sat
[2024-05-24 13:21:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:21:02] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-24 13:21:02] [INFO ] [Nat]Added 112 Read/Feed constraints in 19 ms returned sat
[2024-05-24 13:21:02] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 1 ms to minimize.
[2024-05-24 13:21:02] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-24 13:21:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 181 ms
[2024-05-24 13:21:02] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 24 ms.
[2024-05-24 13:21:03] [INFO ] Deduced a trap composed of 48 places in 114 ms of which 0 ms to minimize.
[2024-05-24 13:21:03] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 0 ms to minimize.
[2024-05-24 13:21:03] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 0 ms to minimize.
[2024-05-24 13:21:03] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 0 ms to minimize.
[2024-05-24 13:21:04] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2024-05-24 13:21:04] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 0 ms to minimize.
[2024-05-24 13:21:04] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 0 ms to minimize.
[2024-05-24 13:21:04] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 1 ms to minimize.
[2024-05-24 13:21:04] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-24 13:21:04] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 0 ms to minimize.
[2024-05-24 13:21:04] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-24 13:21:04] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1458 ms
[2024-05-24 13:21:04] [INFO ] Added : 144 causal constraints over 30 iterations in 2349 ms. Result :sat
Minimization took 219 ms.
[2024-05-24 13:21:05] [INFO ] [Real]Absence check using 82 positive place invariants in 16 ms returned sat
[2024-05-24 13:21:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:21:05] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-05-24 13:21:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:21:05] [INFO ] [Nat]Absence check using 82 positive place invariants in 18 ms returned sat
[2024-05-24 13:21:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:21:05] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-24 13:21:05] [INFO ] [Nat]Added 112 Read/Feed constraints in 79 ms returned sat
[2024-05-24 13:21:05] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 0 ms to minimize.
[2024-05-24 13:21:05] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-05-24 13:21:05] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-24 13:21:05] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 0 ms to minimize.
[2024-05-24 13:21:06] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-24 13:21:06] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2024-05-24 13:21:06] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-24 13:21:06] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 1 ms to minimize.
[2024-05-24 13:21:06] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 0 ms to minimize.
[2024-05-24 13:21:06] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-24 13:21:06] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2024-05-24 13:21:06] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-24 13:21:06] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2024-05-24 13:21:06] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2024-05-24 13:21:06] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 0 ms to minimize.
[2024-05-24 13:21:06] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2024-05-24 13:21:07] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-05-24 13:21:07] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 0 ms to minimize.
[2024-05-24 13:21:07] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 0 ms to minimize.
[2024-05-24 13:21:07] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2175 ms
[2024-05-24 13:21:07] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 29 ms.
[2024-05-24 13:21:08] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 0 ms to minimize.
[2024-05-24 13:21:08] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2024-05-24 13:21:08] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-24 13:21:09] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-24 13:21:09] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 0 ms to minimize.
[2024-05-24 13:21:09] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 0 ms to minimize.
[2024-05-24 13:21:09] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-24 13:21:09] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 0 ms to minimize.
[2024-05-24 13:21:09] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 0 ms to minimize.
[2024-05-24 13:21:09] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1038 ms
[2024-05-24 13:21:09] [INFO ] Added : 135 causal constraints over 29 iterations in 1940 ms. Result :sat
Minimization took 661 ms.
Current structural bounds on expressions (after SMT) : [8, 8, 7, 8, 64, 7, 8, 8, 8, 64] Max seen :[5, 4, 7, 4, 34, 7, 7, 5, 1, 52]
FORMULA LamportFastMutEx-COL-8-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 176 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 34 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 266/266 places, 584/584 transitions.
Normalized transition count is 416 out of 584 initially.
// Phase 1: matrix 416 rows 266 cols
[2024-05-24 13:21:12] [INFO ] Computed 82 invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4374 ms. (steps per millisecond=228 ) properties (out of 8) seen :121
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1089 ms. (steps per millisecond=918 ) properties (out of 8) seen :89
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 979 ms. (steps per millisecond=1021 ) properties (out of 8) seen :37
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1005 ms. (steps per millisecond=995 ) properties (out of 8) seen :28
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2125 ms. (steps per millisecond=470 ) properties (out of 8) seen :111
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 812 ms. (steps per millisecond=1231 ) properties (out of 8) seen :59
FORMULA LamportFastMutEx-COL-8-UpperBounds-09 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1040 ms. (steps per millisecond=961 ) properties (out of 7) seen :106
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2240 ms. (steps per millisecond=446 ) properties (out of 7) seen :95
[2024-05-24 13:21:26] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2024-05-24 13:21:26] [INFO ] Computed 82 invariants in 6 ms
[2024-05-24 13:21:26] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2024-05-24 13:21:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:21:26] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2024-05-24 13:21:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:21:26] [INFO ] [Nat]Absence check using 82 positive place invariants in 13 ms returned sat
[2024-05-24 13:21:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:21:26] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-24 13:21:26] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 13:21:26] [INFO ] [Nat]Added 112 Read/Feed constraints in 33 ms returned sat
[2024-05-24 13:21:27] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 0 ms to minimize.
[2024-05-24 13:21:27] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 0 ms to minimize.
[2024-05-24 13:21:27] [INFO ] Deduced a trap composed of 47 places in 89 ms of which 1 ms to minimize.
[2024-05-24 13:21:27] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 1 ms to minimize.
[2024-05-24 13:21:27] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
[2024-05-24 13:21:27] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 0 ms to minimize.
[2024-05-24 13:21:27] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 0 ms to minimize.
[2024-05-24 13:21:27] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-24 13:21:27] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-24 13:21:27] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2024-05-24 13:21:28] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 1 ms to minimize.
[2024-05-24 13:21:28] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2024-05-24 13:21:28] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2024-05-24 13:21:28] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 0 ms to minimize.
[2024-05-24 13:21:28] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 0 ms to minimize.
[2024-05-24 13:21:28] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2024-05-24 13:21:28] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2024-05-24 13:21:28] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 0 ms to minimize.
[2024-05-24 13:21:29] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 0 ms to minimize.
[2024-05-24 13:21:29] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 0 ms to minimize.
[2024-05-24 13:21:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 20 trap constraints in 2213 ms
[2024-05-24 13:21:29] [INFO ] [Real]Absence check using 82 positive place invariants in 13 ms returned sat
[2024-05-24 13:21:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:21:29] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-24 13:21:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:21:29] [INFO ] [Nat]Absence check using 82 positive place invariants in 14 ms returned sat
[2024-05-24 13:21:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:21:29] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-05-24 13:21:29] [INFO ] [Nat]Added 112 Read/Feed constraints in 25 ms returned sat
[2024-05-24 13:21:29] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2024-05-24 13:21:29] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-05-24 13:21:29] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-24 13:21:29] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 0 ms to minimize.
[2024-05-24 13:21:29] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-05-24 13:21:29] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 0 ms to minimize.
[2024-05-24 13:21:30] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-24 13:21:30] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-24 13:21:30] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2024-05-24 13:21:30] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-24 13:21:30] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2024-05-24 13:21:30] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 0 ms to minimize.
[2024-05-24 13:21:30] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-24 13:21:30] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-24 13:21:30] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
[2024-05-24 13:21:30] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 1 ms to minimize.
[2024-05-24 13:21:30] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-24 13:21:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 17 trap constraints in 1533 ms
[2024-05-24 13:21:31] [INFO ] [Real]Absence check using 82 positive place invariants in 15 ms returned sat
[2024-05-24 13:21:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:21:31] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-24 13:21:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:21:31] [INFO ] [Nat]Absence check using 82 positive place invariants in 14 ms returned sat
[2024-05-24 13:21:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:21:31] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-05-24 13:21:31] [INFO ] [Nat]Added 112 Read/Feed constraints in 24 ms returned sat
[2024-05-24 13:21:31] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 26 ms.
[2024-05-24 13:21:31] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 1 ms to minimize.
[2024-05-24 13:21:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2024-05-24 13:21:31] [INFO ] Added : 45 causal constraints over 10 iterations in 450 ms. Result :sat
Minimization took 70 ms.
[2024-05-24 13:21:31] [INFO ] [Real]Absence check using 82 positive place invariants in 18 ms returned sat
[2024-05-24 13:21:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:21:31] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-24 13:21:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:21:32] [INFO ] [Nat]Absence check using 82 positive place invariants in 17 ms returned sat
[2024-05-24 13:21:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:21:32] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-05-24 13:21:32] [INFO ] [Nat]Added 112 Read/Feed constraints in 126 ms returned sat
[2024-05-24 13:21:32] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-24 13:21:32] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-24 13:21:32] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2024-05-24 13:21:32] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2024-05-24 13:21:32] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-24 13:21:32] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-24 13:21:32] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-24 13:21:32] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2024-05-24 13:21:32] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2024-05-24 13:21:32] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-24 13:21:33] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 3 ms to minimize.
[2024-05-24 13:21:33] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2024-05-24 13:21:33] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-24 13:21:33] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 949 ms
[2024-05-24 13:21:33] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 22 ms.
[2024-05-24 13:21:33] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-24 13:21:33] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-24 13:21:33] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 0 ms to minimize.
[2024-05-24 13:21:33] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2024-05-24 13:21:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 401 ms
[2024-05-24 13:21:34] [INFO ] Added : 66 causal constraints over 14 iterations in 827 ms. Result :sat
Minimization took 565 ms.
[2024-05-24 13:21:34] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2024-05-24 13:21:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:21:34] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-24 13:21:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:21:34] [INFO ] [Nat]Absence check using 82 positive place invariants in 14 ms returned sat
[2024-05-24 13:21:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:21:34] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-05-24 13:21:34] [INFO ] [Nat]Added 112 Read/Feed constraints in 15 ms returned sat
[2024-05-24 13:21:34] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 0 ms to minimize.
[2024-05-24 13:21:35] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 0 ms to minimize.
[2024-05-24 13:21:35] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2024-05-24 13:21:35] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 0 ms to minimize.
[2024-05-24 13:21:35] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-24 13:21:35] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-24 13:21:35] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 1 ms to minimize.
[2024-05-24 13:21:35] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2024-05-24 13:21:35] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 736 ms
[2024-05-24 13:21:35] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 23 ms.
[2024-05-24 13:21:35] [INFO ] Added : 54 causal constraints over 11 iterations in 334 ms. Result :sat
Minimization took 113 ms.
[2024-05-24 13:21:36] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2024-05-24 13:21:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:21:36] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-05-24 13:21:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:21:36] [INFO ] [Nat]Absence check using 82 positive place invariants in 14 ms returned sat
[2024-05-24 13:21:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:21:36] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-24 13:21:36] [INFO ] [Nat]Added 112 Read/Feed constraints in 19 ms returned sat
[2024-05-24 13:21:36] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 0 ms to minimize.
[2024-05-24 13:21:36] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2024-05-24 13:21:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 199 ms
[2024-05-24 13:21:36] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 23 ms.
[2024-05-24 13:21:37] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 1 ms to minimize.
[2024-05-24 13:21:37] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 0 ms to minimize.
[2024-05-24 13:21:37] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 1 ms to minimize.
[2024-05-24 13:21:37] [INFO ] Deduced a trap composed of 57 places in 102 ms of which 1 ms to minimize.
[2024-05-24 13:21:38] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2024-05-24 13:21:38] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 1 ms to minimize.
[2024-05-24 13:21:38] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 0 ms to minimize.
[2024-05-24 13:21:38] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 1 ms to minimize.
[2024-05-24 13:21:38] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-05-24 13:21:38] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 1 ms to minimize.
[2024-05-24 13:21:38] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-24 13:21:38] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1341 ms
[2024-05-24 13:21:38] [INFO ] Added : 144 causal constraints over 30 iterations in 2198 ms. Result :sat
Minimization took 217 ms.
[2024-05-24 13:21:39] [INFO ] [Real]Absence check using 82 positive place invariants in 18 ms returned sat
[2024-05-24 13:21:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:21:39] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-05-24 13:21:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:21:39] [INFO ] [Nat]Absence check using 82 positive place invariants in 18 ms returned sat
[2024-05-24 13:21:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:21:39] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-24 13:21:39] [INFO ] [Nat]Added 112 Read/Feed constraints in 73 ms returned sat
[2024-05-24 13:21:39] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 0 ms to minimize.
[2024-05-24 13:21:39] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 0 ms to minimize.
[2024-05-24 13:21:39] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-24 13:21:39] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 0 ms to minimize.
[2024-05-24 13:21:39] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-24 13:21:39] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-24 13:21:39] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-24 13:21:40] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-24 13:21:40] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-05-24 13:21:40] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2024-05-24 13:21:40] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-24 13:21:40] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-05-24 13:21:40] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-24 13:21:40] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2024-05-24 13:21:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 1385 ms
Current structural bounds on expressions (after SMT) : [7, 7, 8, 64, 8, 8, 56] Max seen :[7, 7, 7, 51, 6, 1, 56]
FORMULA LamportFastMutEx-COL-8-UpperBounds-14 56 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 88 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 584/584 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 266 transition count 576
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 258 transition count 576
Applied a total of 16 rules in 49 ms. Remains 258 /266 variables (removed 8) and now considering 576/584 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 258/266 places, 576/584 transitions.
Normalized transition count is 408 out of 576 initially.
// Phase 1: matrix 408 rows 258 cols
[2024-05-24 13:21:42] [INFO ] Computed 82 invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3311 ms. (steps per millisecond=302 ) properties (out of 4) seen :47
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 813 ms. (steps per millisecond=1230 ) properties (out of 4) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1877 ms. (steps per millisecond=532 ) properties (out of 4) seen :58
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 840 ms. (steps per millisecond=1190 ) properties (out of 4) seen :29
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 865 ms. (steps per millisecond=1156 ) properties (out of 4) seen :46
[2024-05-24 13:21:50] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 258 cols
[2024-05-24 13:21:50] [INFO ] Computed 82 invariants in 7 ms
[2024-05-24 13:21:50] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2024-05-24 13:21:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:21:50] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-24 13:21:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:21:50] [INFO ] [Nat]Absence check using 82 positive place invariants in 13 ms returned sat
[2024-05-24 13:21:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:21:50] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-05-24 13:21:50] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 13:21:50] [INFO ] [Nat]Added 112 Read/Feed constraints in 24 ms returned sat
[2024-05-24 13:21:50] [INFO ] Computed and/alt/rep : 224/984/224 causal constraints (skipped 176 transitions) in 26 ms.
[2024-05-24 13:21:51] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 1 ms to minimize.
[2024-05-24 13:21:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2024-05-24 13:21:51] [INFO ] Added : 66 causal constraints over 14 iterations in 560 ms. Result :sat
Minimization took 74 ms.
[2024-05-24 13:21:51] [INFO ] [Real]Absence check using 82 positive place invariants in 16 ms returned sat
[2024-05-24 13:21:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:21:51] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-24 13:21:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:21:51] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2024-05-24 13:21:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:21:51] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-24 13:21:51] [INFO ] [Nat]Added 112 Read/Feed constraints in 133 ms returned sat
[2024-05-24 13:21:51] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2024-05-24 13:21:51] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 0 ms to minimize.
[2024-05-24 13:21:51] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2024-05-24 13:21:51] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 0 ms to minimize.
[2024-05-24 13:21:52] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2024-05-24 13:21:52] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-24 13:21:52] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-24 13:21:52] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 0 ms to minimize.
[2024-05-24 13:21:52] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 0 ms to minimize.
[2024-05-24 13:21:52] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-24 13:21:52] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 0 ms to minimize.
[2024-05-24 13:21:52] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2024-05-24 13:21:52] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2024-05-24 13:21:52] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2024-05-24 13:21:52] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 0 ms to minimize.
[2024-05-24 13:21:53] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-24 13:21:53] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1473 ms
[2024-05-24 13:21:53] [INFO ] Computed and/alt/rep : 224/984/224 causal constraints (skipped 176 transitions) in 23 ms.
[2024-05-24 13:21:53] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2024-05-24 13:21:53] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2024-05-24 13:21:53] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 0 ms to minimize.
[2024-05-24 13:21:54] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2024-05-24 13:21:54] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-24 13:21:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 647 ms
[2024-05-24 13:21:54] [INFO ] Added : 91 causal constraints over 19 iterations in 1213 ms. Result :sat
Minimization took 246 ms.
[2024-05-24 13:21:54] [INFO ] [Real]Absence check using 82 positive place invariants in 13 ms returned sat
[2024-05-24 13:21:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:21:54] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-24 13:21:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:21:54] [INFO ] [Nat]Absence check using 82 positive place invariants in 14 ms returned sat
[2024-05-24 13:21:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:21:54] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-05-24 13:21:54] [INFO ] [Nat]Added 112 Read/Feed constraints in 30 ms returned sat
[2024-05-24 13:21:54] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2024-05-24 13:21:55] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 1 ms to minimize.
[2024-05-24 13:21:55] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 0 ms to minimize.
[2024-05-24 13:21:55] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 0 ms to minimize.
[2024-05-24 13:21:55] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 0 ms to minimize.
[2024-05-24 13:21:55] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 0 ms to minimize.
[2024-05-24 13:21:55] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 0 ms to minimize.
[2024-05-24 13:21:55] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 0 ms to minimize.
[2024-05-24 13:21:55] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
[2024-05-24 13:21:56] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 1 ms to minimize.
[2024-05-24 13:21:56] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 0 ms to minimize.
[2024-05-24 13:21:56] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 0 ms to minimize.
[2024-05-24 13:21:56] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 0 ms to minimize.
[2024-05-24 13:21:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 1537 ms
[2024-05-24 13:21:56] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2024-05-24 13:21:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:21:56] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2024-05-24 13:21:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:21:56] [INFO ] [Nat]Absence check using 82 positive place invariants in 13 ms returned sat
[2024-05-24 13:21:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:21:56] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-05-24 13:21:56] [INFO ] [Nat]Added 112 Read/Feed constraints in 13 ms returned sat
[2024-05-24 13:21:56] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 0 ms to minimize.
[2024-05-24 13:21:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2024-05-24 13:21:56] [INFO ] Computed and/alt/rep : 224/984/224 causal constraints (skipped 176 transitions) in 25 ms.
[2024-05-24 13:21:57] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 0 ms to minimize.
[2024-05-24 13:21:57] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2024-05-24 13:21:57] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 2 ms to minimize.
[2024-05-24 13:21:57] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 0 ms to minimize.
[2024-05-24 13:21:57] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 1 ms to minimize.
[2024-05-24 13:21:57] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-24 13:21:58] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 1 ms to minimize.
[2024-05-24 13:21:58] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2024-05-24 13:21:58] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 1 ms to minimize.
[2024-05-24 13:21:58] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 1 ms to minimize.
[2024-05-24 13:21:58] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2024-05-24 13:21:58] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 0 ms to minimize.
[2024-05-24 13:21:58] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 0 ms to minimize.
[2024-05-24 13:21:58] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 0 ms to minimize.
[2024-05-24 13:21:59] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 0 ms to minimize.
[2024-05-24 13:21:59] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1960 ms
[2024-05-24 13:21:59] [INFO ] Added : 58 causal constraints over 13 iterations in 2328 ms. Result :sat
Minimization took 157 ms.
Current structural bounds on expressions (after SMT) : [8, 64, 7, 8] Max seen :[7, 51, 7, 1]
FORMULA LamportFastMutEx-COL-8-UpperBounds-10 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 80 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 576/576 transitions.
Applied a total of 0 rules in 15 ms. Remains 258 /258 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 258/258 places, 576/576 transitions.
Normalized transition count is 408 out of 576 initially.
// Phase 1: matrix 408 rows 258 cols
[2024-05-24 13:22:00] [INFO ] Computed 82 invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3074 ms. (steps per millisecond=325 ) properties (out of 3) seen :44
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 830 ms. (steps per millisecond=1204 ) properties (out of 3) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1825 ms. (steps per millisecond=547 ) properties (out of 3) seen :54
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 894 ms. (steps per millisecond=1118 ) properties (out of 3) seen :41
[2024-05-24 13:22:06] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 258 cols
[2024-05-24 13:22:06] [INFO ] Computed 82 invariants in 6 ms
[2024-05-24 13:22:06] [INFO ] [Real]Absence check using 82 positive place invariants in 13 ms returned sat
[2024-05-24 13:22:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:22:06] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-05-24 13:22:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:22:07] [INFO ] [Nat]Absence check using 82 positive place invariants in 14 ms returned sat
[2024-05-24 13:22:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:22:07] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-24 13:22:07] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-24 13:22:07] [INFO ] [Nat]Added 112 Read/Feed constraints in 27 ms returned sat
[2024-05-24 13:22:07] [INFO ] Computed and/alt/rep : 224/984/224 causal constraints (skipped 176 transitions) in 26 ms.
[2024-05-24 13:22:07] [INFO ] Deduced a trap composed of 45 places in 140 ms of which 1 ms to minimize.
[2024-05-24 13:22:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2024-05-24 13:22:07] [INFO ] Added : 66 causal constraints over 14 iterations in 597 ms. Result :sat
Minimization took 80 ms.
[2024-05-24 13:22:07] [INFO ] [Real]Absence check using 82 positive place invariants in 16 ms returned sat
[2024-05-24 13:22:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:22:07] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-24 13:22:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:22:08] [INFO ] [Nat]Absence check using 82 positive place invariants in 19 ms returned sat
[2024-05-24 13:22:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:22:08] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-24 13:22:08] [INFO ] [Nat]Added 112 Read/Feed constraints in 133 ms returned sat
[2024-05-24 13:22:08] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2024-05-24 13:22:08] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2024-05-24 13:22:08] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-05-24 13:22:08] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 0 ms to minimize.
[2024-05-24 13:22:08] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-05-24 13:22:08] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-24 13:22:08] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 0 ms to minimize.
[2024-05-24 13:22:09] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 0 ms to minimize.
[2024-05-24 13:22:09] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 0 ms to minimize.
[2024-05-24 13:22:09] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2024-05-24 13:22:09] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 0 ms to minimize.
[2024-05-24 13:22:09] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2024-05-24 13:22:09] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-24 13:22:09] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2024-05-24 13:22:09] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 0 ms to minimize.
[2024-05-24 13:22:09] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-24 13:22:09] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1516 ms
[2024-05-24 13:22:09] [INFO ] Computed and/alt/rep : 224/984/224 causal constraints (skipped 176 transitions) in 32 ms.
[2024-05-24 13:22:10] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2024-05-24 13:22:10] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2024-05-24 13:22:10] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 1 ms to minimize.
[2024-05-24 13:22:10] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 0 ms to minimize.
[2024-05-24 13:22:10] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2024-05-24 13:22:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 701 ms
[2024-05-24 13:22:11] [INFO ] Added : 91 causal constraints over 19 iterations in 1320 ms. Result :sat
Minimization took 237 ms.
[2024-05-24 13:22:11] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2024-05-24 13:22:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:22:11] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-24 13:22:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:22:11] [INFO ] [Nat]Absence check using 82 positive place invariants in 14 ms returned sat
[2024-05-24 13:22:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:22:11] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-24 13:22:11] [INFO ] [Nat]Added 112 Read/Feed constraints in 14 ms returned sat
[2024-05-24 13:22:11] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 0 ms to minimize.
[2024-05-24 13:22:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2024-05-24 13:22:11] [INFO ] Computed and/alt/rep : 224/984/224 causal constraints (skipped 176 transitions) in 27 ms.
[2024-05-24 13:22:12] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 0 ms to minimize.
[2024-05-24 13:22:12] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2024-05-24 13:22:12] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 0 ms to minimize.
[2024-05-24 13:22:12] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 0 ms to minimize.
[2024-05-24 13:22:12] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 1 ms to minimize.
[2024-05-24 13:22:12] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-24 13:22:13] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 1 ms to minimize.
[2024-05-24 13:22:13] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2024-05-24 13:22:13] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 0 ms to minimize.
[2024-05-24 13:22:13] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 0 ms to minimize.
[2024-05-24 13:22:13] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 0 ms to minimize.
[2024-05-24 13:22:13] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 0 ms to minimize.
[2024-05-24 13:22:13] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 0 ms to minimize.
[2024-05-24 13:22:13] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 0 ms to minimize.
[2024-05-24 13:22:14] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 0 ms to minimize.
[2024-05-24 13:22:14] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1977 ms
[2024-05-24 13:22:14] [INFO ] Added : 58 causal constraints over 13 iterations in 2396 ms. Result :sat
Minimization took 160 ms.
Current structural bounds on expressions (after SMT) : [8, 64, 8] Max seen :[7, 51, 1]
Support contains 80 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 576/576 transitions.
Applied a total of 0 rules in 14 ms. Remains 258 /258 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 258/258 places, 576/576 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 576/576 transitions.
Applied a total of 0 rules in 15 ms. Remains 258 /258 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2024-05-24 13:22:15] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2024-05-24 13:22:15] [INFO ] Invariant cache hit.
[2024-05-24 13:22:15] [INFO ] Implicit Places using invariants in 223 ms returned [162, 163, 164, 165, 166, 167, 168, 169]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 226 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 250/258 places, 576/576 transitions.
Applied a total of 0 rules in 13 ms. Remains 250 /250 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 255 ms. Remains : 250/258 places, 576/576 transitions.
Normalized transition count is 408 out of 576 initially.
// Phase 1: matrix 408 rows 250 cols
[2024-05-24 13:22:15] [INFO ] Computed 74 invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3033 ms. (steps per millisecond=329 ) properties (out of 3) seen :40
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 821 ms. (steps per millisecond=1218 ) properties (out of 3) seen :10
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1567 ms. (steps per millisecond=638 ) properties (out of 3) seen :55
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 868 ms. (steps per millisecond=1152 ) properties (out of 3) seen :35
[2024-05-24 13:22:21] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 250 cols
[2024-05-24 13:22:21] [INFO ] Computed 74 invariants in 9 ms
[2024-05-24 13:22:21] [INFO ] [Real]Absence check using 74 positive place invariants in 12 ms returned sat
[2024-05-24 13:22:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:22:21] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-24 13:22:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:22:21] [INFO ] [Nat]Absence check using 74 positive place invariants in 12 ms returned sat
[2024-05-24 13:22:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:22:22] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-05-24 13:22:22] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-24 13:22:22] [INFO ] [Nat]Added 48 Read/Feed constraints in 11 ms returned sat
[2024-05-24 13:22:22] [INFO ] Computed and/alt/rep : 224/920/224 causal constraints (skipped 176 transitions) in 26 ms.
[2024-05-24 13:22:23] [INFO ] Added : 162 causal constraints over 34 iterations in 959 ms. Result :sat
Minimization took 84 ms.
[2024-05-24 13:22:23] [INFO ] [Real]Absence check using 74 positive place invariants in 15 ms returned sat
[2024-05-24 13:22:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:22:23] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-05-24 13:22:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:22:23] [INFO ] [Nat]Absence check using 74 positive place invariants in 17 ms returned sat
[2024-05-24 13:22:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:22:23] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-24 13:22:23] [INFO ] [Nat]Added 48 Read/Feed constraints in 41 ms returned sat
[2024-05-24 13:22:23] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 1 ms to minimize.
[2024-05-24 13:22:23] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 ms to minimize.
[2024-05-24 13:22:23] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 1 ms to minimize.
[2024-05-24 13:22:23] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 0 ms to minimize.
[2024-05-24 13:22:23] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-24 13:22:24] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 0 ms to minimize.
[2024-05-24 13:22:24] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-24 13:22:24] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-24 13:22:24] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-24 13:22:24] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-24 13:22:24] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2024-05-24 13:22:24] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 0 ms to minimize.
[2024-05-24 13:22:24] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2024-05-24 13:22:24] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1258 ms
[2024-05-24 13:22:24] [INFO ] Computed and/alt/rep : 224/920/224 causal constraints (skipped 176 transitions) in 26 ms.
[2024-05-24 13:22:25] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-24 13:22:25] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-24 13:22:25] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-24 13:22:25] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-24 13:22:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 279 ms
[2024-05-24 13:22:25] [INFO ] Added : 135 causal constraints over 27 iterations in 1039 ms. Result :sat
Minimization took 172 ms.
[2024-05-24 13:22:26] [INFO ] [Real]Absence check using 74 positive place invariants in 11 ms returned sat
[2024-05-24 13:22:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:22:26] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-24 13:22:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:22:26] [INFO ] [Nat]Absence check using 74 positive place invariants in 12 ms returned sat
[2024-05-24 13:22:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:22:26] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-05-24 13:22:26] [INFO ] [Nat]Added 48 Read/Feed constraints in 9 ms returned sat
[2024-05-24 13:22:26] [INFO ] Computed and/alt/rep : 224/920/224 causal constraints (skipped 176 transitions) in 25 ms.
[2024-05-24 13:22:26] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2024-05-24 13:22:26] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 0 ms to minimize.
[2024-05-24 13:22:27] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 0 ms to minimize.
[2024-05-24 13:22:27] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 0 ms to minimize.
[2024-05-24 13:22:27] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 0 ms to minimize.
[2024-05-24 13:22:27] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2024-05-24 13:22:27] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2024-05-24 13:22:27] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 0 ms to minimize.
[2024-05-24 13:22:27] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 0 ms to minimize.
[2024-05-24 13:22:28] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 0 ms to minimize.
[2024-05-24 13:22:28] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 0 ms to minimize.
[2024-05-24 13:22:28] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 0 ms to minimize.
[2024-05-24 13:22:28] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 0 ms to minimize.
[2024-05-24 13:22:28] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 0 ms to minimize.
[2024-05-24 13:22:28] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 1 ms to minimize.
[2024-05-24 13:22:28] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 0 ms to minimize.
[2024-05-24 13:22:29] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 0 ms to minimize.
[2024-05-24 13:22:29] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 1 ms to minimize.
[2024-05-24 13:22:29] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-05-24 13:22:29] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 0 ms to minimize.
[2024-05-24 13:22:29] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 1 ms to minimize.
[2024-05-24 13:22:29] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 0 ms to minimize.
[2024-05-24 13:22:29] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 0 ms to minimize.
[2024-05-24 13:22:29] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-24 13:22:30] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 0 ms to minimize.
[2024-05-24 13:22:30] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 1 ms to minimize.
[2024-05-24 13:22:30] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 3524 ms
[2024-05-24 13:22:30] [INFO ] Added : 92 causal constraints over 20 iterations in 4073 ms. Result :sat
Minimization took 198 ms.
Current structural bounds on expressions (after SMT) : [8, 64, 8] Max seen :[7, 51, 1]
Support contains 80 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 576/576 transitions.
Applied a total of 0 rules in 15 ms. Remains 250 /250 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 250/250 places, 576/576 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 576/576 transitions.
Applied a total of 0 rules in 9 ms. Remains 250 /250 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2024-05-24 13:22:31] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2024-05-24 13:22:31] [INFO ] Invariant cache hit.
[2024-05-24 13:22:31] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-24 13:22:31] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2024-05-24 13:22:31] [INFO ] Invariant cache hit.
[2024-05-24 13:22:31] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-24 13:22:32] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
[2024-05-24 13:22:32] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-24 13:22:32] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
[2024-05-24 13:22:32] [INFO ] Invariant cache hit.
[2024-05-24 13:22:32] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 840 ms. Remains : 250/250 places, 576/576 transitions.
Starting property specific reduction for LamportFastMutEx-COL-8-UpperBounds-05
Normalized transition count is 408 out of 576 initially.
// Phase 1: matrix 408 rows 250 cols
[2024-05-24 13:22:32] [INFO ] Computed 74 invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :1
[2024-05-24 13:22:32] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 250 cols
[2024-05-24 13:22:32] [INFO ] Computed 74 invariants in 1 ms
[2024-05-24 13:22:32] [INFO ] [Real]Absence check using 74 positive place invariants in 11 ms returned sat
[2024-05-24 13:22:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:22:32] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-24 13:22:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:22:32] [INFO ] [Nat]Absence check using 74 positive place invariants in 11 ms returned sat
[2024-05-24 13:22:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:22:32] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-05-24 13:22:32] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-24 13:22:32] [INFO ] [Nat]Added 48 Read/Feed constraints in 9 ms returned sat
[2024-05-24 13:22:32] [INFO ] Computed and/alt/rep : 224/920/224 causal constraints (skipped 176 transitions) in 25 ms.
[2024-05-24 13:22:33] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-24 13:22:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2024-05-24 13:22:33] [INFO ] Added : 99 causal constraints over 21 iterations in 591 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[4]
Support contains 8 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 576/576 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 242 transition count 568
Applied a total of 16 rules in 19 ms. Remains 242 /250 variables (removed 8) and now considering 568/576 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 242/250 places, 568/576 transitions.
Normalized transition count is 400 out of 568 initially.
// Phase 1: matrix 400 rows 242 cols
[2024-05-24 13:22:33] [INFO ] Computed 74 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2273 ms. (steps per millisecond=439 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 672 ms. (steps per millisecond=1488 ) properties (out of 1) seen :1
[2024-05-24 13:22:36] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2024-05-24 13:22:36] [INFO ] Computed 74 invariants in 6 ms
[2024-05-24 13:22:36] [INFO ] [Real]Absence check using 74 positive place invariants in 12 ms returned sat
[2024-05-24 13:22:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:22:36] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-24 13:22:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:22:36] [INFO ] [Nat]Absence check using 74 positive place invariants in 10 ms returned sat
[2024-05-24 13:22:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:22:36] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-24 13:22:36] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-24 13:22:36] [INFO ] [Nat]Added 48 Read/Feed constraints in 8 ms returned sat
[2024-05-24 13:22:36] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 22 ms.
[2024-05-24 13:22:37] [INFO ] Added : 125 causal constraints over 25 iterations in 639 ms. Result :sat
Minimization took 88 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[6]
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 9 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 242/242 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 9 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-24 13:22:37] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2024-05-24 13:22:37] [INFO ] Invariant cache hit.
[2024-05-24 13:22:38] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-05-24 13:22:38] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2024-05-24 13:22:38] [INFO ] Invariant cache hit.
[2024-05-24 13:22:38] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-24 13:22:38] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 939 ms to find 0 implicit places.
[2024-05-24 13:22:38] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-24 13:22:38] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2024-05-24 13:22:38] [INFO ] Invariant cache hit.
[2024-05-24 13:22:39] [INFO ] Dead Transitions using invariants and state equation in 263 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1262 ms. Remains : 242/242 places, 568/568 transitions.
Ending property specific reduction for LamportFastMutEx-COL-8-UpperBounds-05 in 6834 ms.
Starting property specific reduction for LamportFastMutEx-COL-8-UpperBounds-06
Normalized transition count is 408 out of 576 initially.
// Phase 1: matrix 408 rows 250 cols
[2024-05-24 13:22:39] [INFO ] Computed 74 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :32
[2024-05-24 13:22:39] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 250 cols
[2024-05-24 13:22:39] [INFO ] Computed 74 invariants in 1 ms
[2024-05-24 13:22:39] [INFO ] [Real]Absence check using 74 positive place invariants in 13 ms returned sat
[2024-05-24 13:22:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:22:39] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-24 13:22:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:22:39] [INFO ] [Nat]Absence check using 74 positive place invariants in 14 ms returned sat
[2024-05-24 13:22:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:22:39] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-05-24 13:22:39] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-24 13:22:39] [INFO ] [Nat]Added 48 Read/Feed constraints in 37 ms returned sat
[2024-05-24 13:22:39] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-05-24 13:22:39] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-24 13:22:39] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 0 ms to minimize.
[2024-05-24 13:22:39] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2024-05-24 13:22:40] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 0 ms to minimize.
[2024-05-24 13:22:40] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 0 ms to minimize.
[2024-05-24 13:22:40] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-24 13:22:40] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2024-05-24 13:22:40] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 679 ms
[2024-05-24 13:22:40] [INFO ] Computed and/alt/rep : 224/920/224 causal constraints (skipped 176 transitions) in 21 ms.
[2024-05-24 13:22:40] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2024-05-24 13:22:40] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
[2024-05-24 13:22:41] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 0 ms to minimize.
[2024-05-24 13:22:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 404 ms
[2024-05-24 13:22:41] [INFO ] Added : 92 causal constraints over 20 iterations in 893 ms. Result :sat
Minimization took 134 ms.
Current structural bounds on expressions (after SMT) : [64] Max seen :[32]
Support contains 64 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 576/576 transitions.
Applied a total of 0 rules in 7 ms. Remains 250 /250 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 250/250 places, 576/576 transitions.
Normalized transition count is 408 out of 576 initially.
// Phase 1: matrix 408 rows 250 cols
[2024-05-24 13:22:41] [INFO ] Computed 74 invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2720 ms. (steps per millisecond=367 ) properties (out of 1) seen :36
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1727 ms. (steps per millisecond=579 ) properties (out of 1) seen :56
[2024-05-24 13:22:46] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 250 cols
[2024-05-24 13:22:46] [INFO ] Computed 74 invariants in 9 ms
[2024-05-24 13:22:46] [INFO ] [Real]Absence check using 74 positive place invariants in 16 ms returned sat
[2024-05-24 13:22:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:22:46] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-24 13:22:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:22:46] [INFO ] [Nat]Absence check using 74 positive place invariants in 17 ms returned sat
[2024-05-24 13:22:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:22:46] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-05-24 13:22:46] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-24 13:22:46] [INFO ] [Nat]Added 48 Read/Feed constraints in 87 ms returned sat
[2024-05-24 13:22:46] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2024-05-24 13:22:46] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2024-05-24 13:22:46] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2024-05-24 13:22:46] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2024-05-24 13:22:46] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 0 ms to minimize.
[2024-05-24 13:22:47] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-24 13:22:47] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 0 ms to minimize.
[2024-05-24 13:22:47] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-24 13:22:47] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 0 ms to minimize.
[2024-05-24 13:22:47] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 0 ms to minimize.
[2024-05-24 13:22:47] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 0 ms to minimize.
[2024-05-24 13:22:47] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2024-05-24 13:22:47] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-24 13:22:47] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 1 ms to minimize.
[2024-05-24 13:22:47] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-05-24 13:22:48] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2024-05-24 13:22:48] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2024-05-24 13:22:48] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 0 ms to minimize.
[2024-05-24 13:22:48] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 0 ms to minimize.
[2024-05-24 13:22:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 19 trap constraints in 1980 ms
Current structural bounds on expressions (after SMT) : [56] Max seen :[56]
FORMULA LamportFastMutEx-COL-8-UpperBounds-06 56 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for LamportFastMutEx-COL-8-UpperBounds-06 in 9187 ms.
Starting property specific reduction for LamportFastMutEx-COL-8-UpperBounds-13
Normalized transition count is 408 out of 576 initially.
// Phase 1: matrix 408 rows 250 cols
[2024-05-24 13:22:48] [INFO ] Computed 74 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :1
[2024-05-24 13:22:48] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 250 cols
[2024-05-24 13:22:48] [INFO ] Computed 74 invariants in 4 ms
[2024-05-24 13:22:48] [INFO ] [Real]Absence check using 74 positive place invariants in 11 ms returned sat
[2024-05-24 13:22:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:22:48] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-24 13:22:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:22:48] [INFO ] [Nat]Absence check using 74 positive place invariants in 18 ms returned sat
[2024-05-24 13:22:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:22:48] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-24 13:22:48] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-24 13:22:48] [INFO ] [Nat]Added 48 Read/Feed constraints in 9 ms returned sat
[2024-05-24 13:22:48] [INFO ] Computed and/alt/rep : 224/920/224 causal constraints (skipped 176 transitions) in 23 ms.
[2024-05-24 13:22:49] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
[2024-05-24 13:22:49] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 0 ms to minimize.
[2024-05-24 13:22:49] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 0 ms to minimize.
[2024-05-24 13:22:49] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 0 ms to minimize.
[2024-05-24 13:22:49] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 0 ms to minimize.
[2024-05-24 13:22:50] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2024-05-24 13:22:50] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2024-05-24 13:22:50] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 0 ms to minimize.
[2024-05-24 13:22:50] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 0 ms to minimize.
[2024-05-24 13:22:50] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 1 ms to minimize.
[2024-05-24 13:22:50] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 1 ms to minimize.
[2024-05-24 13:22:50] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 0 ms to minimize.
[2024-05-24 13:22:51] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 0 ms to minimize.
[2024-05-24 13:22:51] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 0 ms to minimize.
[2024-05-24 13:22:51] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 0 ms to minimize.
[2024-05-24 13:22:51] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 0 ms to minimize.
[2024-05-24 13:22:51] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 1 ms to minimize.
[2024-05-24 13:22:51] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 1 ms to minimize.
[2024-05-24 13:22:51] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-24 13:22:51] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 1 ms to minimize.
[2024-05-24 13:22:52] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 1 ms to minimize.
[2024-05-24 13:22:52] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 0 ms to minimize.
[2024-05-24 13:22:52] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 0 ms to minimize.
[2024-05-24 13:22:52] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-24 13:22:52] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 1 ms to minimize.
[2024-05-24 13:22:52] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 0 ms to minimize.
[2024-05-24 13:22:52] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 3464 ms
[2024-05-24 13:22:52] [INFO ] Added : 92 causal constraints over 20 iterations in 4005 ms. Result :sat
Minimization took 193 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Support contains 8 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 576/576 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 242 transition count 568
Applied a total of 16 rules in 13 ms. Remains 242 /250 variables (removed 8) and now considering 568/576 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 242/250 places, 568/576 transitions.
Normalized transition count is 400 out of 568 initially.
// Phase 1: matrix 400 rows 242 cols
[2024-05-24 13:22:53] [INFO ] Computed 74 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2263 ms. (steps per millisecond=441 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 762 ms. (steps per millisecond=1312 ) properties (out of 1) seen :1
[2024-05-24 13:22:56] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2024-05-24 13:22:56] [INFO ] Computed 74 invariants in 5 ms
[2024-05-24 13:22:56] [INFO ] [Real]Absence check using 74 positive place invariants in 12 ms returned sat
[2024-05-24 13:22:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 13:22:56] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-05-24 13:22:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:22:56] [INFO ] [Nat]Absence check using 74 positive place invariants in 11 ms returned sat
[2024-05-24 13:22:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 13:22:56] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-24 13:22:56] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-24 13:22:56] [INFO ] [Nat]Added 48 Read/Feed constraints in 11 ms returned sat
[2024-05-24 13:22:56] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 27 ms.
[2024-05-24 13:22:57] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2024-05-24 13:22:57] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 1 ms to minimize.
[2024-05-24 13:22:57] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 1 ms to minimize.
[2024-05-24 13:22:57] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 1 ms to minimize.
[2024-05-24 13:22:57] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 0 ms to minimize.
[2024-05-24 13:22:57] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 ms to minimize.
[2024-05-24 13:22:58] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2024-05-24 13:22:58] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 0 ms to minimize.
[2024-05-24 13:22:58] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2024-05-24 13:22:58] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 0 ms to minimize.
[2024-05-24 13:22:58] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 1 ms to minimize.
[2024-05-24 13:22:58] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-24 13:22:58] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 0 ms to minimize.
[2024-05-24 13:22:58] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1656 ms
[2024-05-24 13:22:58] [INFO ] Added : 110 causal constraints over 23 iterations in 2288 ms. Result :sat
Minimization took 196 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 8 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 242/242 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 7 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-24 13:22:59] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2024-05-24 13:22:59] [INFO ] Invariant cache hit.
[2024-05-24 13:22:59] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-24 13:22:59] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2024-05-24 13:22:59] [INFO ] Invariant cache hit.
[2024-05-24 13:22:59] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-24 13:22:59] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
[2024-05-24 13:22:59] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-24 13:22:59] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2024-05-24 13:22:59] [INFO ] Invariant cache hit.
[2024-05-24 13:23:00] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 831 ms. Remains : 242/242 places, 568/568 transitions.
Ending property specific reduction for LamportFastMutEx-COL-8-UpperBounds-13 in 11742 ms.
[2024-05-24 13:23:00] [INFO ] Flatten gal took : 76 ms
[2024-05-24 13:23:00] [INFO ] Applying decomposition
[2024-05-24 13:23:00] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9590988990907365856.txt' '-o' '/tmp/graph9590988990907365856.bin' '-w' '/tmp/graph9590988990907365856.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9590988990907365856.bin' '-l' '-1' '-v' '-w' '/tmp/graph9590988990907365856.weights' '-q' '0' '-e' '0.001'
[2024-05-24 13:23:00] [INFO ] Decomposing Gal with order
[2024-05-24 13:23:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 13:23:00] [INFO ] Removed a total of 913 redundant transitions.
[2024-05-24 13:23:00] [INFO ] Flatten gal took : 81 ms
[2024-05-24 13:23:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 13 ms.
[2024-05-24 13:23:00] [INFO ] Time to serialize gal into /tmp/UpperBounds2928797236485817503.gal : 8 ms
[2024-05-24 13:23:00] [INFO ] Time to serialize properties into /tmp/UpperBounds15336466946306167071.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2928797236485817503.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15336466946306167071.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds15336466946306167071.prop.
Detected timeout of ITS tools.
[2024-05-24 13:44:13] [INFO ] Applying decomposition
[2024-05-24 13:44:13] [INFO ] Flatten gal took : 221 ms
[2024-05-24 13:44:14] [INFO ] Decomposing Gal with order
[2024-05-24 13:44:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 13:44:14] [INFO ] Removed a total of 1403 redundant transitions.
[2024-05-24 13:44:14] [INFO ] Flatten gal took : 256 ms
[2024-05-24 13:44:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 57 ms.
[2024-05-24 13:44:14] [INFO ] Time to serialize gal into /tmp/UpperBounds13168077201788049404.gal : 23 ms
[2024-05-24 13:44:14] [INFO ] Time to serialize properties into /tmp/UpperBounds11392690074781592023.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13168077201788049404.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11392690074781592023.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/UpperBounds11392690074781592023.prop.
Detected timeout of ITS tools.
[2024-05-24 14:05:01] [INFO ] Flatten gal took : 469 ms
[2024-05-24 14:05:03] [INFO ] Input system was already deterministic with 576 transitions.
[2024-05-24 14:05:03] [INFO ] Transformed 250 places.
[2024-05-24 14:05:03] [INFO ] Transformed 576 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-24 14:05:03] [INFO ] Time to serialize gal into /tmp/UpperBounds9689281194809181128.gal : 57 ms
[2024-05-24 14:05:03] [INFO ] Time to serialize properties into /tmp/UpperBounds5357297010674528032.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9689281194809181128.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5357297010674528032.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds5357297010674528032.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 159256 kB
After kill :
MemTotal: 16393216 kB
MemFree: 14252884 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-COL-8"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is LamportFastMutEx-COL-8, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r241-tall-171649628300156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-8.tgz
mv LamportFastMutEx-COL-8 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;