About the Execution of 2023-gold for LamportFastMutEx-COL-5
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
365.252 | 13293.00 | 21185.00 | 318.20 | 5 1 4 4 20 5 4 4 5 4 5 20 5 4 1 5 | 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-171649628200141.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-5, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r241-tall-171649628200141
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 7.6K Apr 13 07:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 13 07:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 13 07:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 13 07:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Apr 13 07:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 44K Apr 13 07:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K 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 41K 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-5-UpperBounds-00
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-01
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-02
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-03
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-04
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-05
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-06
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-07
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-08
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-09
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-10
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-11
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-12
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-13
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-14
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716553157907
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-5
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202304061127
[2024-05-24 12:19:19] [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 12:19:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 12:19:19] [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 12:19:19] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 12:19:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 433 ms
[2024-05-24 12:19:19] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 174 PT places and 396.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2024-05-24 12:19:19] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2024-05-24 12:19:19] [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 12:19:19] [INFO ] Computed 2 invariants in 6 ms
FORMULA LamportFastMutEx-COL-5-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-UpperBounds-10 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-UpperBounds-00 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-24 12:19:20] [INFO ] Invariant cache hit.
[2024-05-24 12:19:20] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:20] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-24 12:19:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:19:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:20] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-24 12:19:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:19:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 12:19:20] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-24 12:19:20] [INFO ] Added : 11 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 6 ms.
[2024-05-24 12:19:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:20] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-24 12:19:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:19:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:20] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 12:19:20] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 12:19:20] [INFO ] Added : 6 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 3 ms.
[2024-05-24 12:19:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:20] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-24 12:19:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:19:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:20] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 12:19:20] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 12:19:20] [INFO ] Added : 11 causal constraints over 3 iterations in 14 ms. Result :sat
Minimization took 8 ms.
[2024-05-24 12:19:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:20] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 12:19:20] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 12:19:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:19:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:20] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 12:19:20] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-24 12:19:20] [INFO ] Added : 5 causal constraints over 1 iterations in 26 ms. Result :sat
Minimization took 11 ms.
[2024-05-24 12:19:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:20] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-24 12:19:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:19:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:20] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 12:19:20] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 12:19:20] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2024-05-24 12:19:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:20] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-24 12:19:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:19:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:20] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 12:19:20] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 12:19:20] [INFO ] Added : 7 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 12:19:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:20] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-24 12:19:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:19:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:20] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 12:19:20] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 12:19:20] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 12:19:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:20] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-24 12:19:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:19:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:20] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-24 12:19:20] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 12:19:20] [INFO ] Added : 11 causal constraints over 3 iterations in 18 ms. Result :sat
Minimization took 6 ms.
[2024-05-24 12:19:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:20] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-24 12:19:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:19:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:20] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 12:19:20] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 12:19:20] [INFO ] Added : 11 causal constraints over 3 iterations in 16 ms. Result :sat
Minimization took 7 ms.
[2024-05-24 12:19:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:20] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-24 12:19:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:19:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:20] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 12:19:20] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 12:19:20] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2024-05-24 12:19:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:20] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-24 12:19:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:19:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:20] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-24 12:19:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 12:19:21] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 12:19:21] [INFO ] Added : 7 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2024-05-24 12:19:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:19:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:21] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-24 12:19:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:19:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-24 12:19:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:21] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-24 12:19:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 12:19:21] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 12:19:21] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [5, 5, 25, 5, 5, 5, 5, 5, 25, 5, 5, 5]
Domain [pid(6), pid(6)] 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 12:19:21] [INFO ] Unfolded HLPN to a Petri net with 174 places and 318 transitions 1380 arcs in 23 ms.
[2024-05-24 12:19:21] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 58 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :67
FORMULA LamportFastMutEx-COL-5-UpperBounds-15 5 TECHNIQUES TOPOLOGICAL RANDOM_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 :50
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :49
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :58
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :46
FORMULA LamportFastMutEx-COL-5-UpperBounds-05 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :32
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :24
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :60
FORMULA LamportFastMutEx-COL-5-UpperBounds-12 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :50
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :31
[2024-05-24 12:19:21] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2024-05-24 12:19:21] [INFO ] Computed 37 invariants in 16 ms
[2024-05-24 12:19:21] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-05-24 12:19:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:21] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-24 12:19:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:19:21] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-05-24 12:19:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:21] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-24 12:19:21] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-24 12:19:21] [INFO ] [Nat]Added 55 Read/Feed constraints in 14 ms returned sat
[2024-05-24 12:19:21] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 3 ms to minimize.
[2024-05-24 12:19:21] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-24 12:19:21] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-24 12:19:21] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-24 12:19:21] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-24 12:19:21] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-24 12:19:21] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-24 12:19:21] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-24 12:19:21] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-24 12:19:21] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-24 12:19:21] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-24 12:19:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 490 ms
[2024-05-24 12:19:21] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-24 12:19:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:22] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-24 12:19:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:19:22] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-24 12:19:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:22] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-24 12:19:22] [INFO ] [Nat]Added 55 Read/Feed constraints in 9 ms returned sat
[2024-05-24 12:19:22] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-24 12:19:22] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 0 ms to minimize.
[2024-05-24 12:19:22] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2024-05-24 12:19:22] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-24 12:19:22] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-24 12:19:22] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-24 12:19:22] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 4 ms to minimize.
[2024-05-24 12:19:22] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-24 12:19:22] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
[2024-05-24 12:19:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 486 ms
[2024-05-24 12:19:22] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-24 12:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:22] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-24 12:19:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:19:22] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-24 12:19:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:22] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-24 12:19:22] [INFO ] [Nat]Added 55 Read/Feed constraints in 41 ms returned sat
[2024-05-24 12:19:22] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-05-24 12:19:22] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-24 12:19:22] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-05-24 12:19:22] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-24 12:19:23] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-24 12:19:23] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-24 12:19:23] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-24 12:19:23] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 3 ms to minimize.
[2024-05-24 12:19:23] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-24 12:19:23] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-24 12:19:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 526 ms
[2024-05-24 12:19:23] [INFO ] [Real]Absence check using 37 positive place invariants in 5 ms returned sat
[2024-05-24 12:19:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:23] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-24 12:19:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:19:23] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-24 12:19:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:23] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-24 12:19:23] [INFO ] [Nat]Added 55 Read/Feed constraints in 6 ms returned sat
[2024-05-24 12:19:23] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-24 12:19:23] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-24 12:19:23] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-24 12:19:23] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-24 12:19:23] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 4 ms to minimize.
[2024-05-24 12:19:23] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-24 12:19:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 310 ms
[2024-05-24 12:19:23] [INFO ] Computed and/alt/rep : 175/790/175 causal constraints (skipped 20 transitions) in 11 ms.
[2024-05-24 12:19:23] [INFO ] Added : 28 causal constraints over 6 iterations in 111 ms. Result :sat
Minimization took 53 ms.
[2024-05-24 12:19:23] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-24 12:19:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:24] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-24 12:19:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:19:24] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-24 12:19:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:24] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-24 12:19:24] [INFO ] [Nat]Added 55 Read/Feed constraints in 9 ms returned sat
[2024-05-24 12:19:24] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 0 ms to minimize.
[2024-05-24 12:19:24] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2024-05-24 12:19:24] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-24 12:19:24] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-24 12:19:24] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-24 12:19:24] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-24 12:19:24] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-24 12:19:24] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-24 12:19:24] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-24 12:19:24] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-24 12:19:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 478 ms
[2024-05-24 12:19:24] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-24 12:19:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:24] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-24 12:19:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:19:24] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2024-05-24 12:19:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:24] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-24 12:19:24] [INFO ] [Nat]Added 55 Read/Feed constraints in 10 ms returned sat
[2024-05-24 12:19:24] [INFO ] Computed and/alt/rep : 175/790/175 causal constraints (skipped 20 transitions) in 14 ms.
[2024-05-24 12:19:24] [INFO ] Added : 24 causal constraints over 5 iterations in 85 ms. Result :sat
Minimization took 32 ms.
[2024-05-24 12:19:24] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-24 12:19:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:24] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-24 12:19:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:19:24] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2024-05-24 12:19:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:25] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-24 12:19:25] [INFO ] [Nat]Added 55 Read/Feed constraints in 10 ms returned sat
[2024-05-24 12:19:25] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-05-24 12:19:25] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-05-24 12:19:25] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-24 12:19:25] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-24 12:19:25] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2024-05-24 12:19:25] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-05-24 12:19:25] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2024-05-24 12:19:25] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-24 12:19:25] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-24 12:19:25] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-24 12:19:25] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 8 ms to minimize.
[2024-05-24 12:19:25] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-24 12:19:25] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-24 12:19:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 664 ms
[2024-05-24 12:19:25] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-05-24 12:19:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:25] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-24 12:19:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:19:25] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-05-24 12:19:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:25] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-24 12:19:25] [INFO ] [Nat]Added 55 Read/Feed constraints in 17 ms returned sat
[2024-05-24 12:19:25] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-24 12:19:25] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-24 12:19:25] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2024-05-24 12:19:26] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-24 12:19:26] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-24 12:19:26] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-24 12:19:26] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-24 12:19:26] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-24 12:19:26] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 2 ms to minimize.
[2024-05-24 12:19:26] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
[2024-05-24 12:19:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 477 ms
[2024-05-24 12:19:26] [INFO ] [Real]Absence check using 37 positive place invariants in 5 ms returned sat
[2024-05-24 12:19:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:26] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-24 12:19:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:19:26] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-24 12:19:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:26] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-24 12:19:26] [INFO ] [Nat]Added 55 Read/Feed constraints in 9 ms returned sat
[2024-05-24 12:19:26] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2024-05-24 12:19:26] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-24 12:19:26] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-24 12:19:26] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-24 12:19:26] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-05-24 12:19:26] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 6 ms to minimize.
[2024-05-24 12:19:26] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-24 12:19:26] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-24 12:19:26] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-24 12:19:26] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-24 12:19:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 466 ms
Current structural bounds on expressions (after SMT) : [4, 4, 20, 5, 4, 5, 4, 20, 4] Max seen :[4, 4, 20, 3, 4, 4, 4, 20, 4]
FORMULA LamportFastMutEx-COL-5-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-11 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-04 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 10 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 260/260 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 132 transition count 255
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 15 place count 132 transition count 250
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 20 place count 127 transition count 250
Applied a total of 20 rules in 38 ms. Remains 127 /137 variables (removed 10) and now considering 250/260 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 127/137 places, 250/260 transitions.
Normalized transition count is 190 out of 250 initially.
// Phase 1: matrix 190 rows 127 cols
[2024-05-24 12:19:27] [INFO ] Computed 37 invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1703 ms. (steps per millisecond=587 ) properties (out of 2) seen :9
FORMULA LamportFastMutEx-COL-5-UpperBounds-08 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 532 ms. (steps per millisecond=1879 ) properties (out of 1) seen :4
[2024-05-24 12:19:29] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 127 cols
[2024-05-24 12:19:29] [INFO ] Computed 37 invariants in 12 ms
[2024-05-24 12:19:29] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-24 12:19:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:29] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-24 12:19:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:19:29] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-24 12:19:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:19:29] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-24 12:19:29] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-24 12:19:29] [INFO ] [Nat]Added 55 Read/Feed constraints in 8 ms returned sat
[2024-05-24 12:19:29] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-05-24 12:19:29] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2024-05-24 12:19:29] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-24 12:19:29] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-24 12:19:29] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2024-05-24 12:19:29] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-24 12:19:29] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2024-05-24 12:19:29] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-24 12:19:30] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-24 12:19:30] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
[2024-05-24 12:19:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 556 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[4]
FORMULA LamportFastMutEx-COL-5-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 10821 ms.
BK_STOP 1716553171200
--------------------
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-5"
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-5, 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-171649628200141"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-5.tgz
mv LamportFastMutEx-COL-5 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 ;