About the Execution of 2023-gold for LamportFastMutEx-COL-4
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
551.888 | 23790.00 | 33682.00 | 347.90 | 1 3 4 3 3 4 3 12 1 3 4 4 1 4 4 4 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r241-tall-171649628200136.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-4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r241-tall-171649628200136
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.8K Apr 13 07:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 13 07:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 13 07:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K 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.7K 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.6K Apr 22 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 07:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 13 07:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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 40K 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-4-UpperBounds-00
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-01
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-02
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-03
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-04
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-05
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-06
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-07
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-08
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-09
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-10
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-11
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-12
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-13
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-14
FORMULA_NAME LamportFastMutEx-COL-4-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716553123012
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-4
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202304061127
[2024-05-24 12:18:44] [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:18:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 12:18:44] [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:18:44] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 12:18:45] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 683 ms
[2024-05-24 12:18:45] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 135 PT places and 285.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2024-05-24 12:18:45] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2024-05-24 12:18:45] [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:18:45] [INFO ] Computed 2 invariants in 6 ms
FORMULA LamportFastMutEx-COL-4-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-4-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-24 12:18:45] [INFO ] Invariant cache hit.
[2024-05-24 12:18:45] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-24 12:18:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:45] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-24 12:18:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:18:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-24 12:18:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:45] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-24 12:18:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:18:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 12:18:45] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-24 12:18:45] [INFO ] Added : 7 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 17 ms.
[2024-05-24 12:18:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:18:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:45] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-24 12:18:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:18:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-24 12:18:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:45] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-24 12:18:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 12:18:45] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-24 12:18:45] [INFO ] Added : 5 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 12:18:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:18:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:45] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-24 12:18:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:18:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:18:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:45] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-24 12:18:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 12:18:45] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 12:18:45] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 12:18:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:18:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:45] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-24 12:18:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:18:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:18:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:45] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-24 12:18:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 12:18:45] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 12:18:45] [INFO ] Added : 7 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2024-05-24 12:18:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:18:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:45] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-24 12:18:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:18:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:18:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:45] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-24 12:18:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 12:18:45] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 12:18:45] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2024-05-24 12:18:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:18:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:45] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-24 12:18:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:18:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:18:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:45] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-24 12:18:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 12:18:45] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 12:18:45] [INFO ] Added : 11 causal constraints over 3 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2024-05-24 12:18:45] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-24 12:18:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:45] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-24 12:18:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:18:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:18:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:45] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-24 12:18:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 12:18:45] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 12:18:45] [INFO ] Added : 11 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 8 ms.
[2024-05-24 12:18:45] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:18:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:45] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-24 12:18:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:18:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:18:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:46] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-24 12:18:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 12:18:46] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 12:18:46] [INFO ] Added : 6 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 12:18:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:18:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:46] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-24 12:18:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:18:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-24 12:18:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:46] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-24 12:18:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 12:18:46] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 12:18:46] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 12:18:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:18:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:46] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-24 12:18:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:18:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:18:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:46] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-24 12:18:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 12:18:46] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 12:18:46] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2024-05-24 12:18:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:18:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:46] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-24 12:18:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:18:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-24 12:18:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:46] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-24 12:18:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 12:18:46] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 12:18:46] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-05-24 12:18:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:18:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:46] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-24 12:18:46] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 12:18:46] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 12:18:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:18:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 12:18:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:46] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-24 12:18:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 12:18:46] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 12:18:46] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [4, 4, 4, 4, 4, 4, 16, 4, 4, 4, 4, 4]
Domain [pid(5), pid(5)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-24 12:18:46] [INFO ] Unfolded HLPN to a Petri net with 135 places and 230 transitions 990 arcs in 21 ms.
[2024-05-24 12:18:46] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 50 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :45
FORMULA LamportFastMutEx-COL-4-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :28
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :28
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :29
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 9) seen :23
FORMULA LamportFastMutEx-COL-4-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-24 12:18:46] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 102 cols
[2024-05-24 12:18:46] [INFO ] Computed 26 invariants in 6 ms
[2024-05-24 12:18:46] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2024-05-24 12:18:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:46] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-24 12:18:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:18:46] [INFO ] [Nat]Absence check using 26 positive place invariants in 9 ms returned sat
[2024-05-24 12:18:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:46] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-24 12:18:46] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-24 12:18:46] [INFO ] [Nat]Added 40 Read/Feed constraints in 6 ms returned sat
[2024-05-24 12:18:46] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 5 ms to minimize.
[2024-05-24 12:18:46] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-05-24 12:18:46] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-24 12:18:46] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-24 12:18:46] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-24 12:18:46] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-24 12:18:46] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-24 12:18:46] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-24 12:18:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 351 ms
[2024-05-24 12:18:46] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2024-05-24 12:18:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:47] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-24 12:18:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:18:47] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2024-05-24 12:18:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:47] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-24 12:18:47] [INFO ] [Nat]Added 40 Read/Feed constraints in 5 ms returned sat
[2024-05-24 12:18:47] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-24 12:18:47] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-24 12:18:47] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-24 12:18:47] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-24 12:18:47] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-24 12:18:47] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-24 12:18:47] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-24 12:18:47] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-24 12:18:47] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-24 12:18:47] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-24 12:18:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 431 ms
[2024-05-24 12:18:47] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2024-05-24 12:18:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:47] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-24 12:18:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:18:47] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2024-05-24 12:18:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:47] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-24 12:18:47] [INFO ] [Nat]Added 40 Read/Feed constraints in 7 ms returned sat
[2024-05-24 12:18:47] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-24 12:18:47] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-24 12:18:47] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-24 12:18:47] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-24 12:18:47] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-24 12:18:47] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2024-05-24 12:18:47] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-24 12:18:47] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-24 12:18:48] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-24 12:18:48] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-24 12:18:48] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-24 12:18:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 444 ms
[2024-05-24 12:18:48] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2024-05-24 12:18:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:48] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-24 12:18:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:18:48] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2024-05-24 12:18:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:48] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-24 12:18:48] [INFO ] [Nat]Added 40 Read/Feed constraints in 8 ms returned sat
[2024-05-24 12:18:48] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-24 12:18:48] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-24 12:18:48] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-24 12:18:48] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-24 12:18:48] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-24 12:18:48] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 4 ms to minimize.
[2024-05-24 12:18:48] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-24 12:18:48] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-24 12:18:48] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-24 12:18:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 332 ms
[2024-05-24 12:18:48] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2024-05-24 12:18:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:48] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-24 12:18:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:18:48] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2024-05-24 12:18:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:48] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-24 12:18:48] [INFO ] [Nat]Added 40 Read/Feed constraints in 11 ms returned sat
[2024-05-24 12:18:48] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-24 12:18:48] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-24 12:18:48] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-24 12:18:48] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-24 12:18:48] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-24 12:18:48] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-24 12:18:48] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-24 12:18:49] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-24 12:18:49] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-24 12:18:49] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-24 12:18:49] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-24 12:18:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 477 ms
[2024-05-24 12:18:49] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2024-05-24 12:18:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:49] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-24 12:18:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:18:49] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2024-05-24 12:18:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:49] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-24 12:18:49] [INFO ] [Nat]Added 40 Read/Feed constraints in 6 ms returned sat
[2024-05-24 12:18:49] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-24 12:18:49] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-24 12:18:49] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-24 12:18:49] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-24 12:18:49] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-24 12:18:49] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-24 12:18:49] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-24 12:18:49] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 3 ms to minimize.
[2024-05-24 12:18:49] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-24 12:18:49] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2024-05-24 12:18:49] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-24 12:18:49] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-24 12:18:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 549 ms
[2024-05-24 12:18:49] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2024-05-24 12:18:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:49] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-24 12:18:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:18:49] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2024-05-24 12:18:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:49] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-24 12:18:49] [INFO ] [Nat]Added 40 Read/Feed constraints in 6 ms returned sat
[2024-05-24 12:18:49] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-24 12:18:50] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-24 12:18:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 93 ms
[2024-05-24 12:18:50] [INFO ] Computed and/alt/rep : 128/512/128 causal constraints (skipped 12 transitions) in 9 ms.
[2024-05-24 12:18:50] [INFO ] Added : 54 causal constraints over 11 iterations in 115 ms. Result :sat
Minimization took 56 ms.
[2024-05-24 12:18:50] [INFO ] [Real]Absence check using 26 positive place invariants in 5 ms returned sat
[2024-05-24 12:18:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:50] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-24 12:18:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:18:50] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2024-05-24 12:18:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:50] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-24 12:18:50] [INFO ] [Nat]Added 40 Read/Feed constraints in 6 ms returned sat
[2024-05-24 12:18:50] [INFO ] Computed and/alt/rep : 128/512/128 causal constraints (skipped 12 transitions) in 8 ms.
[2024-05-24 12:18:50] [INFO ] Added : 18 causal constraints over 5 iterations in 62 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [3, 3, 3, 3, 12, 3, 4, 4] Max seen :[3, 3, 3, 3, 12, 3, 1, 3]
FORMULA LamportFastMutEx-COL-4-UpperBounds-09 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-07 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-4-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 180/180 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 176
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 98 transition count 172
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 94 transition count 172
Applied a total of 16 rules in 27 ms. Remains 94 /102 variables (removed 8) and now considering 172/180 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 94/102 places, 172/180 transitions.
Normalized transition count is 136 out of 172 initially.
// Phase 1: matrix 136 rows 94 cols
[2024-05-24 12:18:50] [INFO ] Computed 26 invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1343 ms. (steps per millisecond=744 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 494 ms. (steps per millisecond=2024 ) properties (out of 1) seen :1
[2024-05-24 12:18:52] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 94 cols
[2024-05-24 12:18:52] [INFO ] Computed 26 invariants in 8 ms
[2024-05-24 12:18:52] [INFO ] [Real]Absence check using 26 positive place invariants in 3 ms returned sat
[2024-05-24 12:18:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:52] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-24 12:18:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:18:52] [INFO ] [Nat]Absence check using 26 positive place invariants in 4 ms returned sat
[2024-05-24 12:18:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:52] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-24 12:18:52] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-24 12:18:52] [INFO ] [Nat]Added 40 Read/Feed constraints in 8 ms returned sat
[2024-05-24 12:18:52] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-24 12:18:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-05-24 12:18:52] [INFO ] Computed and/alt/rep : 116/496/116 causal constraints (skipped 16 transitions) in 9 ms.
[2024-05-24 12:18:52] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-24 12:18:52] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2024-05-24 12:18:52] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-24 12:18:52] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2024-05-24 12:18:52] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2024-05-24 12:18:53] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-05-24 12:18:53] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 350 ms
[2024-05-24 12:18:53] [INFO ] Added : 49 causal constraints over 11 iterations in 473 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[1]
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 94 /94 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 94/94 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 172/172 transitions.
Applied a total of 0 rules in 6 ms. Remains 94 /94 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2024-05-24 12:18:53] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2024-05-24 12:18:53] [INFO ] Invariant cache hit.
[2024-05-24 12:18:53] [INFO ] Implicit Places using invariants in 73 ms returned [62, 63, 64, 65]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 76 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 90/94 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 88 ms. Remains : 90/94 places, 172/172 transitions.
Normalized transition count is 136 out of 172 initially.
// Phase 1: matrix 136 rows 90 cols
[2024-05-24 12:18:53] [INFO ] Computed 22 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1227 ms. (steps per millisecond=814 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 479 ms. (steps per millisecond=2087 ) properties (out of 1) seen :1
[2024-05-24 12:18:54] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2024-05-24 12:18:54] [INFO ] Computed 22 invariants in 3 ms
[2024-05-24 12:18:54] [INFO ] [Real]Absence check using 22 positive place invariants in 3 ms returned sat
[2024-05-24 12:18:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:55] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-24 12:18:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:18:55] [INFO ] [Nat]Absence check using 22 positive place invariants in 4 ms returned sat
[2024-05-24 12:18:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:55] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-24 12:18:55] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-24 12:18:55] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-24 12:18:55] [INFO ] Computed and/alt/rep : 120/496/120 causal constraints (skipped 12 transitions) in 9 ms.
[2024-05-24 12:18:55] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-24 12:18:55] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-24 12:18:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 80 ms
[2024-05-24 12:18:55] [INFO ] Added : 51 causal constraints over 11 iterations in 192 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[1]
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 90/90 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2024-05-24 12:18:55] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2024-05-24 12:18:55] [INFO ] Invariant cache hit.
[2024-05-24 12:18:55] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-24 12:18:55] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2024-05-24 12:18:55] [INFO ] Invariant cache hit.
[2024-05-24 12:18:55] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-24 12:18:55] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-05-24 12:18:55] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-24 12:18:55] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2024-05-24 12:18:55] [INFO ] Invariant cache hit.
[2024-05-24 12:18:55] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 269 ms. Remains : 90/90 places, 172/172 transitions.
Starting property specific reduction for LamportFastMutEx-COL-4-UpperBounds-12
Normalized transition count is 136 out of 172 initially.
// Phase 1: matrix 136 rows 90 cols
[2024-05-24 12:18:55] [INFO ] Computed 22 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :1
[2024-05-24 12:18:55] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2024-05-24 12:18:55] [INFO ] Computed 22 invariants in 1 ms
[2024-05-24 12:18:55] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2024-05-24 12:18:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:55] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-24 12:18:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:18:55] [INFO ] [Nat]Absence check using 22 positive place invariants in 4 ms returned sat
[2024-05-24 12:18:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:55] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-24 12:18:55] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-24 12:18:55] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-24 12:18:55] [INFO ] Computed and/alt/rep : 120/496/120 causal constraints (skipped 12 transitions) in 8 ms.
[2024-05-24 12:18:55] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-24 12:18:55] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-24 12:18:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 86 ms
[2024-05-24 12:18:56] [INFO ] Added : 51 causal constraints over 11 iterations in 214 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[1]
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 90/90 places, 172/172 transitions.
Normalized transition count is 136 out of 172 initially.
// Phase 1: matrix 136 rows 90 cols
[2024-05-24 12:18:56] [INFO ] Computed 22 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1231 ms. (steps per millisecond=812 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 476 ms. (steps per millisecond=2100 ) properties (out of 1) seen :1
[2024-05-24 12:18:57] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
// Phase 1: matrix 136 rows 90 cols
[2024-05-24 12:18:57] [INFO ] Computed 22 invariants in 3 ms
[2024-05-24 12:18:57] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2024-05-24 12:18:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:57] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-24 12:18:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:18:57] [INFO ] [Nat]Absence check using 22 positive place invariants in 4 ms returned sat
[2024-05-24 12:18:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:18:57] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-24 12:18:57] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-24 12:18:57] [INFO ] [Nat]Added 24 Read/Feed constraints in 3 ms returned sat
[2024-05-24 12:18:57] [INFO ] Computed and/alt/rep : 120/496/120 causal constraints (skipped 12 transitions) in 8 ms.
[2024-05-24 12:18:58] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-24 12:18:58] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-24 12:18:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 74 ms
[2024-05-24 12:18:58] [INFO ] Added : 51 causal constraints over 11 iterations in 191 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : [4] Max seen :[1]
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 90/90 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2024-05-24 12:18:58] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2024-05-24 12:18:58] [INFO ] Invariant cache hit.
[2024-05-24 12:18:58] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-24 12:18:58] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2024-05-24 12:18:58] [INFO ] Invariant cache hit.
[2024-05-24 12:18:58] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-24 12:18:58] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-05-24 12:18:58] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-24 12:18:58] [INFO ] Flow matrix only has 136 transitions (discarded 36 similar events)
[2024-05-24 12:18:58] [INFO ] Invariant cache hit.
[2024-05-24 12:18:58] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 90/90 places, 172/172 transitions.
Ending property specific reduction for LamportFastMutEx-COL-4-UpperBounds-12 in 2855 ms.
[2024-05-24 12:18:58] [INFO ] Flatten gal took : 44 ms
[2024-05-24 12:18:58] [INFO ] Applying decomposition
[2024-05-24 12:18:58] [INFO ] Flatten gal took : 15 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/graph7908219446530720755.txt' '-o' '/tmp/graph7908219446530720755.bin' '-w' '/tmp/graph7908219446530720755.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7908219446530720755.bin' '-l' '-1' '-v' '-w' '/tmp/graph7908219446530720755.weights' '-q' '0' '-e' '0.001'
[2024-05-24 12:18:58] [INFO ] Decomposing Gal with order
[2024-05-24 12:18:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 12:18:58] [INFO ] Removed a total of 191 redundant transitions.
[2024-05-24 12:18:58] [INFO ] Flatten gal took : 35 ms
[2024-05-24 12:18:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 7 ms.
[2024-05-24 12:18:58] [INFO ] Time to serialize gal into /tmp/UpperBounds106030097271040050.gal : 4 ms
[2024-05-24 12:18:58] [INFO ] Time to serialize properties into /tmp/UpperBounds1247317600675734409.prop : 1 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/UpperBounds106030097271040050.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1247317600675734409.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 ...303
Loading property file /tmp/UpperBounds1247317600675734409.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,1.4985e+06,6.90521,198616,2,45060,5,904615,6,0,567,726111,0
Total reachable state count : 1498496
Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property LamportFastMutEx-COL-4-UpperBounds-12 :0 <= gi6.gu15.P_CS_21_1+gi0.gu13.P_CS_21_2+gi5.gu14.P_CS_21_3+gi4.gu16.P_CS_21_4 <= 1
FORMULA LamportFastMutEx-COL-4-UpperBounds-12 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
LamportFastMutEx-COL-4-UpperBounds-12,0,6.94713,198616,1,0,7,904615,9,1,799,726111,4
Total runtime 21386 ms.
BK_STOP 1716553146802
--------------------
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-4"
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-4, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r241-tall-171649628200136"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-4.tgz
mv LamportFastMutEx-COL-4 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;