Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r255-tall-167856440300046.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
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 r255-tall-167856440300046
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.4K Feb 25 13:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 13:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 13:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 13:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 13:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 13:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 13:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 13:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 41K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME LamportFastMutEx-COL-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 1678749852458

Running Version 202205111006
[2023-03-13 23:24:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-13 23:24:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 23:24:13] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-13 23:24:14] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-13 23:24:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 628 ms
[2023-03-13 23:24:14] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 174 PT places and 396.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-13 23:24:14] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 5 ms.
[2023-03-13 23:24:14] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 17 rows 15 cols
[2023-03-13 23:24:14] [INFO ] Computed 2 place invariants in 9 ms
FORMULA LamportFastMutEx-COL-5-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-UpperBounds-09 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 17 rows 15 cols
[2023-03-13 23:24:14] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-13 23:24:14] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-13 23:24:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:14] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 23:24:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:24:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-13 23:24:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:14] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-13 23:24:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 23:24:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:24:14] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 23:24:14] [INFO ] Added : 11 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 5 ms.
[2023-03-13 23:24:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:24:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:14] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-13 23:24:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:24:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-13 23:24:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:14] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-13 23:24:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:24:14] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 23:24:14] [INFO ] Added : 5 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2023-03-13 23:24:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:24:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:14] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-13 23:24:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:24:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:24:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:14] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-13 23:24:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:24:14] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 23:24:14] [INFO ] Added : 7 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 3 ms.
[2023-03-13 23:24:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:24:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:14] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-13 23:24:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:24:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:24:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:14] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-13 23:24:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:24:14] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 23:24:14] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2023-03-13 23:24:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:24:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:15] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-13 23:24:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:24:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:24:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:15] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-13 23:24:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:24:15] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 23:24:15] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2023-03-13 23:24:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:24:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:15] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-13 23:24:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:24:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-13 23:24:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:15] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-13 23:24:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:24:15] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 23:24:15] [INFO ] Added : 6 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2023-03-13 23:24:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:24:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:15] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-13 23:24:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:24:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:24:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:15] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-13 23:24:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:24:15] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 23:24:15] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2023-03-13 23:24:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:24:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:15] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-13 23:24:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:24:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-13 23:24:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:15] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-13 23:24:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:24:15] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 23:24:15] [INFO ] Added : 5 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 3 ms.
[2023-03-13 23:24:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:24:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:15] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-13 23:24:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:24:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-13 23:24:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:15] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-13 23:24:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:24:15] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 23:24:15] [INFO ] Added : 11 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 16 ms.
[2023-03-13 23:24:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:24:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:15] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-13 23:24:15] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:24:15] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 23:24:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:24:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:24:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:15] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-13 23:24:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:24:15] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 23:24:15] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2023-03-13 23:24:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:24:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:15] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-13 23:24:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:24:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:24:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:15] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-13 23:24:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:24:15] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 23:24:15] [INFO ] Added : 7 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2023-03-13 23:24:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:24:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:15] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-13 23:24:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:24:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:24:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:15] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-13 23:24:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:24:15] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 23:24:15] [INFO ] Added : 5 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 3 ms.
[2023-03-13 23:24:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:24:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:15] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-13 23:24:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:24:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:24:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:15] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-13 23:24:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:24:15] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 23:24:15] [INFO ] Added : 11 causal constraints over 3 iterations in 13 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [5, 5, 5, 5, 5, 5, 5, 5, 25, 5, 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.
[2023-03-13 23:24:15] [INFO ] Unfolded HLPN to a Petri net with 174 places and 318 transitions 1380 arcs in 20 ms.
[2023-03-13 23:24:15] [INFO ] Unfolded 13 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 56 ms. (steps per millisecond=178 ) properties (out of 13) seen :63
FORMULA LamportFastMutEx-COL-5-UpperBounds-12 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-06 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-03 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 10) seen :41
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :32
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :37
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :44
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :35
FORMULA LamportFastMutEx-COL-5-UpperBounds-10 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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 :31
[2023-03-13 23:24:15] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2023-03-13 23:24:15] [INFO ] Computed 37 place invariants in 13 ms
[2023-03-13 23:24:15] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-13 23:24:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:15] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-13 23:24:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:24:15] [INFO ] [Nat]Absence check using 37 positive place invariants in 9 ms returned sat
[2023-03-13 23:24:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:16] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-13 23:24:16] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-13 23:24:16] [INFO ] [Nat]Added 55 Read/Feed constraints in 11 ms returned sat
[2023-03-13 23:24:16] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 6 ms to minimize.
[2023-03-13 23:24:16] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2023-03-13 23:24:16] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2023-03-13 23:24:16] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2023-03-13 23:24:16] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2023-03-13 23:24:16] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2023-03-13 23:24:16] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2023-03-13 23:24:16] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2023-03-13 23:24:16] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2023-03-13 23:24:16] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2023-03-13 23:24:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 536 ms
[2023-03-13 23:24:16] [INFO ] [Real]Absence check using 37 positive place invariants in 8 ms returned sat
[2023-03-13 23:24:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:16] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-13 23:24:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:24:16] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-13 23:24:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:16] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-13 23:24:16] [INFO ] [Nat]Added 55 Read/Feed constraints in 9 ms returned sat
[2023-03-13 23:24:16] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 0 ms to minimize.
[2023-03-13 23:24:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-03-13 23:24:16] [INFO ] Computed and/alt/rep : 175/790/175 causal constraints (skipped 20 transitions) in 15 ms.
[2023-03-13 23:24:16] [INFO ] Added : 55 causal constraints over 11 iterations in 191 ms. Result :sat
Minimization took 41 ms.
[2023-03-13 23:24:17] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-13 23:24:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:17] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-13 23:24:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:24:17] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-13 23:24:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:17] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-13 23:24:17] [INFO ] [Nat]Added 55 Read/Feed constraints in 11 ms returned sat
[2023-03-13 23:24:17] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2023-03-13 23:24:17] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2023-03-13 23:24:17] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2023-03-13 23:24:17] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2023-03-13 23:24:17] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 0 ms to minimize.
[2023-03-13 23:24:17] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2023-03-13 23:24:17] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 3 ms to minimize.
[2023-03-13 23:24:17] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2023-03-13 23:24:17] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2023-03-13 23:24:17] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2023-03-13 23:24:17] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2023-03-13 23:24:17] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2023-03-13 23:24:17] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2023-03-13 23:24:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 713 ms
[2023-03-13 23:24:17] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-13 23:24:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:18] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-13 23:24:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:24:18] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-13 23:24:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:18] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-13 23:24:18] [INFO ] [Nat]Added 55 Read/Feed constraints in 7 ms returned sat
[2023-03-13 23:24:18] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2023-03-13 23:24:18] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2023-03-13 23:24:18] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2023-03-13 23:24:18] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2023-03-13 23:24:18] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2023-03-13 23:24:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 273 ms
[2023-03-13 23:24:18] [INFO ] Computed and/alt/rep : 175/790/175 causal constraints (skipped 20 transitions) in 16 ms.
[2023-03-13 23:24:18] [INFO ] Added : 38 causal constraints over 8 iterations in 160 ms. Result :sat
Minimization took 56 ms.
[2023-03-13 23:24:18] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-13 23:24:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:18] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-13 23:24:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:24:18] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-13 23:24:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:18] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-13 23:24:18] [INFO ] [Nat]Added 55 Read/Feed constraints in 9 ms returned sat
[2023-03-13 23:24:18] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2023-03-13 23:24:18] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2023-03-13 23:24:18] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 0 ms to minimize.
[2023-03-13 23:24:18] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2023-03-13 23:24:19] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2023-03-13 23:24:19] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2023-03-13 23:24:19] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2023-03-13 23:24:19] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 0 ms to minimize.
[2023-03-13 23:24:19] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2023-03-13 23:24:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 509 ms
[2023-03-13 23:24:19] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-13 23:24:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:19] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-13 23:24:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:24:19] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-13 23:24:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:19] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-13 23:24:19] [INFO ] [Nat]Added 55 Read/Feed constraints in 8 ms returned sat
[2023-03-13 23:24:19] [INFO ] Computed and/alt/rep : 175/790/175 causal constraints (skipped 20 transitions) in 13 ms.
[2023-03-13 23:24:19] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2023-03-13 23:24:19] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2023-03-13 23:24:19] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2023-03-13 23:24:19] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2023-03-13 23:24:19] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2023-03-13 23:24:19] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2023-03-13 23:24:20] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2023-03-13 23:24:20] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 0 ms to minimize.
[2023-03-13 23:24:20] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
[2023-03-13 23:24:20] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2023-03-13 23:24:20] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2023-03-13 23:24:20] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 710 ms
[2023-03-13 23:24:20] [INFO ] Added : 87 causal constraints over 19 iterations in 1005 ms. Result :sat
Minimization took 88 ms.
[2023-03-13 23:24:20] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-13 23:24:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:20] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-13 23:24:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:24:20] [INFO ] [Nat]Absence check using 37 positive place invariants in 8 ms returned sat
[2023-03-13 23:24:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:20] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-13 23:24:20] [INFO ] [Nat]Added 55 Read/Feed constraints in 20 ms returned sat
[2023-03-13 23:24:20] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2023-03-13 23:24:20] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2023-03-13 23:24:20] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2023-03-13 23:24:20] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2023-03-13 23:24:20] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2023-03-13 23:24:21] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2023-03-13 23:24:21] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2023-03-13 23:24:21] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2023-03-13 23:24:21] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2023-03-13 23:24:21] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2023-03-13 23:24:21] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2023-03-13 23:24:21] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2023-03-13 23:24:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 678 ms
[2023-03-13 23:24:21] [INFO ] [Real]Absence check using 37 positive place invariants in 5 ms returned sat
[2023-03-13 23:24:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:21] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-13 23:24:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:24:21] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-13 23:24:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:21] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-13 23:24:21] [INFO ] [Nat]Added 55 Read/Feed constraints in 6 ms returned sat
[2023-03-13 23:24:21] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2023-03-13 23:24:21] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2023-03-13 23:24:21] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2023-03-13 23:24:21] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2023-03-13 23:24:21] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2023-03-13 23:24:21] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2023-03-13 23:24:21] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2023-03-13 23:24:21] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2023-03-13 23:24:21] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2023-03-13 23:24:21] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 448 ms
[2023-03-13 23:24:21] [INFO ] Computed and/alt/rep : 175/790/175 causal constraints (skipped 20 transitions) in 14 ms.
[2023-03-13 23:24:22] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2023-03-13 23:24:22] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2023-03-13 23:24:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 128 ms
[2023-03-13 23:24:22] [INFO ] Added : 66 causal constraints over 14 iterations in 357 ms. Result :sat
Minimization took 79 ms.
[2023-03-13 23:24:22] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-13 23:24:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:22] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-13 23:24:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:24:22] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-13 23:24:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:22] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-13 23:24:22] [INFO ] [Nat]Added 55 Read/Feed constraints in 16 ms returned sat
[2023-03-13 23:24:22] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2023-03-13 23:24:22] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2023-03-13 23:24:22] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2023-03-13 23:24:22] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2023-03-13 23:24:22] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:24:22] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:24:22] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:24:22] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2023-03-13 23:24:22] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:24:22] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2023-03-13 23:24:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 380 ms
Current structural bounds on expressions (after SMT) : [4, 5, 4, 5, 4, 5, 20, 5, 4] Max seen :[4, 4, 4, 3, 4, 1, 20, 3, 4]
FORMULA LamportFastMutEx-COL-5-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-08 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 15 out of 137 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 137/137 places, 260/260 transitions.
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 137 transition count 255
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 132 transition count 255
Applied a total of 10 rules in 34 ms. Remains 132 /137 variables (removed 5) and now considering 255/260 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 132/137 places, 255/260 transitions.
Normalized transition count is 195 out of 255 initially.
// Phase 1: matrix 195 rows 132 cols
[2023-03-13 23:24:23] [INFO ] Computed 37 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1823 ms. (steps per millisecond=548 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 468 ms. (steps per millisecond=2136 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 606 ms. (steps per millisecond=1650 ) properties (out of 3) seen :8
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 530 ms. (steps per millisecond=1886 ) properties (out of 3) seen :6
[2023-03-13 23:24:26] [INFO ] Flow matrix only has 195 transitions (discarded 60 similar events)
// Phase 1: matrix 195 rows 132 cols
[2023-03-13 23:24:26] [INFO ] Computed 37 place invariants in 5 ms
[2023-03-13 23:24:26] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-13 23:24:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:26] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-13 23:24:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:24:26] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-13 23:24:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:26] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-13 23:24:26] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-13 23:24:26] [INFO ] [Nat]Added 55 Read/Feed constraints in 10 ms returned sat
[2023-03-13 23:24:26] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2023-03-13 23:24:27] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2023-03-13 23:24:27] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2023-03-13 23:24:27] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2023-03-13 23:24:27] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2023-03-13 23:24:27] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2023-03-13 23:24:27] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 0 ms to minimize.
[2023-03-13 23:24:27] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2023-03-13 23:24:27] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 0 ms to minimize.
[2023-03-13 23:24:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 612 ms
[2023-03-13 23:24:27] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-13 23:24:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:27] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-13 23:24:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:24:27] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2023-03-13 23:24:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:27] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-13 23:24:27] [INFO ] [Nat]Added 55 Read/Feed constraints in 6 ms returned sat
[2023-03-13 23:24:27] [INFO ] Computed and/alt/rep : 165/730/165 causal constraints (skipped 25 transitions) in 13 ms.
[2023-03-13 23:24:27] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2023-03-13 23:24:27] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2023-03-13 23:24:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2023-03-13 23:24:27] [INFO ] Added : 46 causal constraints over 10 iterations in 273 ms. Result :sat
Minimization took 63 ms.
[2023-03-13 23:24:28] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-13 23:24:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:28] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-13 23:24:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:24:28] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-13 23:24:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:28] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-13 23:24:28] [INFO ] [Nat]Added 55 Read/Feed constraints in 10 ms returned sat
[2023-03-13 23:24:28] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 0 ms to minimize.
[2023-03-13 23:24:28] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2023-03-13 23:24:28] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2023-03-13 23:24:28] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2023-03-13 23:24:28] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 0 ms to minimize.
[2023-03-13 23:24:28] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2023-03-13 23:24:28] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2023-03-13 23:24:28] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2023-03-13 23:24:28] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2023-03-13 23:24:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 534 ms
Current structural bounds on expressions (after SMT) : [4, 5, 4] Max seen :[4, 1, 4]
FORMULA LamportFastMutEx-COL-5-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 5 out of 132 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 132/132 places, 255/255 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 127 transition count 250
Applied a total of 10 rules in 31 ms. Remains 127 /132 variables (removed 5) and now considering 250/255 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/132 places, 250/255 transitions.
Normalized transition count is 190 out of 250 initially.
// Phase 1: matrix 190 rows 127 cols
[2023-03-13 23:24:28] [INFO ] Computed 37 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1629 ms. (steps per millisecond=613 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 591 ms. (steps per millisecond=1692 ) properties (out of 1) seen :1
[2023-03-13 23:24:31] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 127 cols
[2023-03-13 23:24:31] [INFO ] Computed 37 place invariants in 3 ms
[2023-03-13 23:24:31] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-13 23:24:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:31] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-13 23:24:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:24:31] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-13 23:24:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:31] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-13 23:24:31] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-13 23:24:31] [INFO ] [Nat]Added 55 Read/Feed constraints in 6 ms returned sat
[2023-03-13 23:24:31] [INFO ] Computed and/alt/rep : 160/770/160 causal constraints (skipped 25 transitions) in 14 ms.
[2023-03-13 23:24:31] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2023-03-13 23:24:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-13 23:24:31] [INFO ] Added : 45 causal constraints over 9 iterations in 197 ms. Result :sat
Minimization took 67 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 127 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 127/127 places, 250/250 transitions.
Applied a total of 0 rules in 10 ms. Remains 127 /127 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 250/250 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 127/127 places, 250/250 transitions.
Applied a total of 0 rules in 9 ms. Remains 127 /127 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-13 23:24:31] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 127 cols
[2023-03-13 23:24:31] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-13 23:24:31] [INFO ] Implicit Places using invariants in 101 ms returned [82, 83, 84, 85, 86]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 103 ms to find 5 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 122/127 places, 250/250 transitions.
Applied a total of 0 rules in 7 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 122/127 places, 250/250 transitions.
Normalized transition count is 190 out of 250 initially.
// Phase 1: matrix 190 rows 122 cols
[2023-03-13 23:24:31] [INFO ] Computed 32 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1532 ms. (steps per millisecond=652 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 574 ms. (steps per millisecond=1742 ) properties (out of 1) seen :1
[2023-03-13 23:24:33] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2023-03-13 23:24:33] [INFO ] Computed 32 place invariants in 3 ms
[2023-03-13 23:24:33] [INFO ] [Real]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-13 23:24:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:33] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-13 23:24:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:24:33] [INFO ] [Nat]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-13 23:24:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:33] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-13 23:24:33] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-13 23:24:33] [INFO ] [Nat]Added 30 Read/Feed constraints in 5 ms returned sat
[2023-03-13 23:24:33] [INFO ] Computed and/alt/rep : 160/720/160 causal constraints (skipped 25 transitions) in 14 ms.
[2023-03-13 23:24:34] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2023-03-13 23:24:34] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 0 ms to minimize.
[2023-03-13 23:24:34] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 0 ms to minimize.
[2023-03-13 23:24:34] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2023-03-13 23:24:34] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 0 ms to minimize.
[2023-03-13 23:24:34] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2023-03-13 23:24:34] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 0 ms to minimize.
[2023-03-13 23:24:34] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2023-03-13 23:24:34] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:24:34] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 0 ms to minimize.
[2023-03-13 23:24:34] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2023-03-13 23:24:34] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 763 ms
[2023-03-13 23:24:35] [INFO ] Added : 82 causal constraints over 17 iterations in 1030 ms. Result :sat
Minimization took 92 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 13 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 122/122 places, 250/250 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 8 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-13 23:24:35] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2023-03-13 23:24:35] [INFO ] Computed 32 place invariants in 1 ms
[2023-03-13 23:24:35] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-13 23:24:35] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2023-03-13 23:24:35] [INFO ] Computed 32 place invariants in 2 ms
[2023-03-13 23:24:35] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-13 23:24:35] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2023-03-13 23:24:35] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-13 23:24:35] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2023-03-13 23:24:35] [INFO ] Computed 32 place invariants in 5 ms
[2023-03-13 23:24:35] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 122/122 places, 250/250 transitions.
Starting property specific reduction for LamportFastMutEx-COL-5-UpperBounds-07
Normalized transition count is 190 out of 250 initially.
// Phase 1: matrix 190 rows 122 cols
[2023-03-13 23:24:35] [INFO ] Computed 32 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :1
[2023-03-13 23:24:35] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2023-03-13 23:24:35] [INFO ] Computed 32 place invariants in 2 ms
[2023-03-13 23:24:35] [INFO ] [Real]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-13 23:24:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:35] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-13 23:24:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:24:35] [INFO ] [Nat]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-13 23:24:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:35] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-13 23:24:35] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-13 23:24:35] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2023-03-13 23:24:35] [INFO ] Computed and/alt/rep : 160/720/160 causal constraints (skipped 25 transitions) in 22 ms.
[2023-03-13 23:24:36] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 0 ms to minimize.
[2023-03-13 23:24:36] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 0 ms to minimize.
[2023-03-13 23:24:36] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2023-03-13 23:24:36] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2023-03-13 23:24:36] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2023-03-13 23:24:36] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2023-03-13 23:24:36] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2023-03-13 23:24:36] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2023-03-13 23:24:36] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2023-03-13 23:24:36] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2023-03-13 23:24:36] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2023-03-13 23:24:36] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 762 ms
[2023-03-13 23:24:36] [INFO ] Added : 82 causal constraints over 17 iterations in 1033 ms. Result :sat
Minimization took 90 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 6 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 122/122 places, 250/250 transitions.
Normalized transition count is 190 out of 250 initially.
// Phase 1: matrix 190 rows 122 cols
[2023-03-13 23:24:36] [INFO ] Computed 32 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1560 ms. (steps per millisecond=641 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 569 ms. (steps per millisecond=1757 ) properties (out of 1) seen :1
[2023-03-13 23:24:39] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2023-03-13 23:24:39] [INFO ] Computed 32 place invariants in 2 ms
[2023-03-13 23:24:39] [INFO ] [Real]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-13 23:24:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:39] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-13 23:24:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:24:39] [INFO ] [Nat]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-13 23:24:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:24:39] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-13 23:24:39] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-13 23:24:39] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2023-03-13 23:24:39] [INFO ] Computed and/alt/rep : 160/720/160 causal constraints (skipped 25 transitions) in 15 ms.
[2023-03-13 23:24:39] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2023-03-13 23:24:39] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 0 ms to minimize.
[2023-03-13 23:24:39] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 0 ms to minimize.
[2023-03-13 23:24:39] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2023-03-13 23:24:39] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2023-03-13 23:24:39] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2023-03-13 23:24:39] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 0 ms to minimize.
[2023-03-13 23:24:40] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2023-03-13 23:24:40] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2023-03-13 23:24:40] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2023-03-13 23:24:40] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2023-03-13 23:24:40] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 763 ms
[2023-03-13 23:24:40] [INFO ] Added : 82 causal constraints over 17 iterations in 1038 ms. Result :sat
Minimization took 90 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 6 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 122/122 places, 250/250 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 6 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-13 23:24:40] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2023-03-13 23:24:40] [INFO ] Computed 32 place invariants in 2 ms
[2023-03-13 23:24:40] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-13 23:24:40] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2023-03-13 23:24:40] [INFO ] Computed 32 place invariants in 1 ms
[2023-03-13 23:24:40] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-13 23:24:40] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-13 23:24:40] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-13 23:24:40] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2023-03-13 23:24:40] [INFO ] Computed 32 place invariants in 3 ms
[2023-03-13 23:24:40] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 122/122 places, 250/250 transitions.
Ending property specific reduction for LamportFastMutEx-COL-5-UpperBounds-07 in 5212 ms.
[2023-03-13 23:24:40] [INFO ] Flatten gal took : 47 ms
[2023-03-13 23:24:40] [INFO ] Applying decomposition
[2023-03-13 23:24:40] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8619455336724019202.txt' '-o' '/tmp/graph8619455336724019202.bin' '-w' '/tmp/graph8619455336724019202.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8619455336724019202.bin' '-l' '-1' '-v' '-w' '/tmp/graph8619455336724019202.weights' '-q' '0' '-e' '0.001'
[2023-03-13 23:24:40] [INFO ] Decomposing Gal with order
[2023-03-13 23:24:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-13 23:24:41] [INFO ] Removed a total of 337 redundant transitions.
[2023-03-13 23:24:41] [INFO ] Flatten gal took : 43 ms
[2023-03-13 23:24:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 9 ms.
[2023-03-13 23:24:41] [INFO ] Time to serialize gal into /tmp/UpperBounds13524566642590794894.gal : 5 ms
[2023-03-13 23:24:41] [INFO ] Time to serialize properties into /tmp/UpperBounds1577715333583447108.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13524566642590794894.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1577715333583447108.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...296
Loading property file /tmp/UpperBounds1577715333583447108.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,4.35093e+08,157.533,2526460,2,403660,5,1.10095e+07,6,0,766,8.80923e+06,0
Total reachable state count : 435092592

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property LamportFastMutEx-COL-5-UpperBounds-07 :0 <= gi7.gu16.P_CS_21_1+gi5.gu17.P_CS_21_2+gi8.gu18.P_CS_21_3+gi8.gu20.P_CS_21_4+gi0.gu19.P_CS_21_5 ...159
FORMULA LamportFastMutEx-COL-5-UpperBounds-07 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-5-UpperBounds-07,0,157.943,2526460,1,0,7,1.10095e+07,9,1,1081,8.80923e+06,4
Total runtime 185639 ms.

BK_STOP 1678750039367

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
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 r255-tall-167856440300046"
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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;