Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r233-tall-167856418800381.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is LamportFastMutEx-COL-7, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856418800381
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 9.5K Feb 25 13:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 13:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 13:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 13:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 25 13:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 13:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 25 13:47 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 43K 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-7-UpperBounds-00
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-01
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-02
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-03
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-04
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-05
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-06
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-07
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-08
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-09
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-10
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-11
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-12
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-13
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-14
FORMULA_NAME LamportFastMutEx-COL-7-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679511925866

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-7
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 19:05:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 19:05:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 19:05:27] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-22 19:05:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 19:05:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 634 ms
[2023-03-22 19:05:28] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 264 PT places and 672.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-22 19:05:28] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2023-03-22 19:05:28] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 17 rows 15 cols
[2023-03-22 19:05:28] [INFO ] Computed 2 place invariants in 4 ms
FORMULA LamportFastMutEx-COL-7-UpperBounds-15 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-7-UpperBounds-13 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-7-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-7-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-22 19:05:28] [INFO ] Invariant cache hit.
[2023-03-22 19:05:28] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-22 19:05:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:28] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-22 19:05:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:05:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 19:05:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:28] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-22 19:05:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 19:05:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 19:05:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 19:05:28] [INFO ] Added : 11 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 128 ms.
[2023-03-22 19:05:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:05:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:28] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 19:05:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:05:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:05:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:28] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 19:05:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 19:05:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 19:05:28] [INFO ] Added : 5 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 19:05:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:05:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:28] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 19:05:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:05:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:05:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:28] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-22 19:05:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 19:05:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 19:05:28] [INFO ] Added : 7 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 5 ms.
[2023-03-22 19:05:28] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 19:05:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:28] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-22 19:05:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:05:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:05:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:28] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-22 19:05:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 19:05:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 19:05:28] [INFO ] Added : 5 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 19:05:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:05:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:28] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-22 19:05:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:05:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 19:05:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:28] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-22 19:05:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 19:05:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 19:05:28] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 21 ms.
[2023-03-22 19:05:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:05:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:28] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 19:05:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:05:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:05:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:28] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-22 19:05:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 19:05:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 19:05:28] [INFO ] Added : 11 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 10 ms.
[2023-03-22 19:05:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:05:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:28] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-22 19:05:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:05:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:05:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:28] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 19:05:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 19:05:28] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 19:05:29] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 19:05:29] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-22 19:05:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:29] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-22 19:05:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:05:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:05:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:29] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-22 19:05:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 19:05:29] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 19:05:29] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 19:05:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:05:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:29] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 19:05:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:05:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:05:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:29] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 19:05:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 19:05:29] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 19:05:29] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 ms.
[2023-03-22 19:05:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:05:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:29] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 19:05:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:05:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:05:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:29] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-22 19:05:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 19:05:29] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 19:05:29] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 19:05:29] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:05:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:29] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 19:05:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:05:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:05:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:29] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 19:05:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 19:05:29] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 19:05:29] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 19:05:29] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-22 19:05:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:29] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 19:05:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:05:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 19:05:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:29] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-22 19:05:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-22 19:05:29] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 19:05:29] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [49, 7, 7, 7, 7, 49, 7, 7, 7, 7, 7, 7]
Domain [pid(8), pid(8)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-22 19:05:29] [INFO ] Unfolded HLPN to a Petri net with 264 places and 536 transitions 2352 arcs in 27 ms.
[2023-03-22 19:05:29] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 45 places in 2 ms
Reduce places removed 45 places and 74 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :92
FORMULA LamportFastMutEx-COL-7-UpperBounds-08 7 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :84
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :67
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :40
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :76
FORMULA LamportFastMutEx-COL-7-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :74
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 :60
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :79
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 :28
FORMULA LamportFastMutEx-COL-7-UpperBounds-09 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :60
[2023-03-22 19:05:29] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2023-03-22 19:05:29] [INFO ] Computed 65 place invariants in 15 ms
[2023-03-22 19:05:29] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-22 19:05:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:29] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-22 19:05:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:05:29] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-22 19:05:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:29] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2023-03-22 19:05:29] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-22 19:05:29] [INFO ] [Nat]Added 91 Read/Feed constraints in 44 ms returned sat
[2023-03-22 19:05:30] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 4 ms to minimize.
[2023-03-22 19:05:30] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2023-03-22 19:05:30] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2023-03-22 19:05:30] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2023-03-22 19:05:30] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2023-03-22 19:05:30] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2023-03-22 19:05:30] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2023-03-22 19:05:30] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2023-03-22 19:05:30] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2023-03-22 19:05:30] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2023-03-22 19:05:30] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2023-03-22 19:05:30] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2023-03-22 19:05:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 889 ms
[2023-03-22 19:05:30] [INFO ] [Real]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-22 19:05:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:30] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-03-22 19:05:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:05:31] [INFO ] [Nat]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-22 19:05:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:31] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-22 19:05:31] [INFO ] [Nat]Added 91 Read/Feed constraints in 16 ms returned sat
[2023-03-22 19:05:31] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 24 ms.
[2023-03-22 19:05:31] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2023-03-22 19:05:32] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 1 ms to minimize.
[2023-03-22 19:05:32] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2023-03-22 19:05:32] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2023-03-22 19:05:32] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2023-03-22 19:05:32] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2023-03-22 19:05:32] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 528 ms
[2023-03-22 19:05:32] [INFO ] Added : 144 causal constraints over 31 iterations in 1434 ms. Result :sat
Minimization took 289 ms.
[2023-03-22 19:05:32] [INFO ] [Real]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-22 19:05:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:32] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-22 19:05:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:05:33] [INFO ] [Nat]Absence check using 65 positive place invariants in 13 ms returned sat
[2023-03-22 19:05:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:33] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2023-03-22 19:05:33] [INFO ] [Nat]Added 91 Read/Feed constraints in 25 ms returned sat
[2023-03-22 19:05:33] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2023-03-22 19:05:33] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2023-03-22 19:05:33] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2023-03-22 19:05:33] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2023-03-22 19:05:33] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2023-03-22 19:05:33] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2023-03-22 19:05:33] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2023-03-22 19:05:33] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2023-03-22 19:05:33] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
[2023-03-22 19:05:33] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2023-03-22 19:05:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 761 ms
[2023-03-22 19:05:33] [INFO ] [Real]Absence check using 65 positive place invariants in 13 ms returned sat
[2023-03-22 19:05:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:34] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2023-03-22 19:05:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:05:34] [INFO ] [Nat]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-22 19:05:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:34] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-22 19:05:34] [INFO ] [Nat]Added 91 Read/Feed constraints in 13 ms returned sat
[2023-03-22 19:05:34] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 23 ms.
[2023-03-22 19:05:35] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 0 ms to minimize.
[2023-03-22 19:05:35] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 0 ms to minimize.
[2023-03-22 19:05:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 238 ms
[2023-03-22 19:05:35] [INFO ] Added : 129 causal constraints over 27 iterations in 1049 ms. Result :sat
Minimization took 172 ms.
[2023-03-22 19:05:35] [INFO ] [Real]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-22 19:05:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:35] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-22 19:05:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:05:35] [INFO ] [Nat]Absence check using 65 positive place invariants in 14 ms returned sat
[2023-03-22 19:05:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:35] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-22 19:05:35] [INFO ] [Nat]Added 91 Read/Feed constraints in 37 ms returned sat
[2023-03-22 19:05:35] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2023-03-22 19:05:35] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2023-03-22 19:05:35] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2023-03-22 19:05:35] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2023-03-22 19:05:35] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
[2023-03-22 19:05:35] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2023-03-22 19:05:36] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2023-03-22 19:05:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 409 ms
[2023-03-22 19:05:36] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 24 ms.
[2023-03-22 19:05:36] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2023-03-22 19:05:36] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2023-03-22 19:05:36] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2023-03-22 19:05:36] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2023-03-22 19:05:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 348 ms
[2023-03-22 19:05:36] [INFO ] Added : 46 causal constraints over 10 iterations in 644 ms. Result :sat
Minimization took 111 ms.
[2023-03-22 19:05:36] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-22 19:05:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:36] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2023-03-22 19:05:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:05:37] [INFO ] [Nat]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-22 19:05:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:37] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-22 19:05:37] [INFO ] [Nat]Added 91 Read/Feed constraints in 18 ms returned sat
[2023-03-22 19:05:37] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 0 ms to minimize.
[2023-03-22 19:05:37] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2023-03-22 19:05:37] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 0 ms to minimize.
[2023-03-22 19:05:37] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2023-03-22 19:05:37] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2023-03-22 19:05:37] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2023-03-22 19:05:37] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2023-03-22 19:05:37] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 0 ms to minimize.
[2023-03-22 19:05:37] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2023-03-22 19:05:37] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2023-03-22 19:05:37] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2023-03-22 19:05:38] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 0 ms to minimize.
[2023-03-22 19:05:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 951 ms
[2023-03-22 19:05:38] [INFO ] [Real]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-22 19:05:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:38] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2023-03-22 19:05:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:05:38] [INFO ] [Nat]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-22 19:05:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:38] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2023-03-22 19:05:38] [INFO ] [Nat]Added 91 Read/Feed constraints in 24 ms returned sat
[2023-03-22 19:05:38] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 0 ms to minimize.
[2023-03-22 19:05:38] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 1 ms to minimize.
[2023-03-22 19:05:38] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 1 ms to minimize.
[2023-03-22 19:05:38] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 1 ms to minimize.
[2023-03-22 19:05:38] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2023-03-22 19:05:38] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 0 ms to minimize.
[2023-03-22 19:05:38] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 1 ms to minimize.
[2023-03-22 19:05:39] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 0 ms to minimize.
[2023-03-22 19:05:39] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2023-03-22 19:05:39] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 0 ms to minimize.
[2023-03-22 19:05:39] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 0 ms to minimize.
[2023-03-22 19:05:39] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2023-03-22 19:05:39] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2023-03-22 19:05:39] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 0 ms to minimize.
[2023-03-22 19:05:39] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 0 ms to minimize.
[2023-03-22 19:05:39] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2023-03-22 19:05:39] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2023-03-22 19:05:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 17 trap constraints in 1529 ms
[2023-03-22 19:05:39] [INFO ] [Real]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-22 19:05:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:39] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2023-03-22 19:05:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:05:40] [INFO ] [Nat]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-22 19:05:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:40] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-22 19:05:40] [INFO ] [Nat]Added 91 Read/Feed constraints in 21 ms returned sat
[2023-03-22 19:05:40] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-22 19:05:40] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2023-03-22 19:05:40] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2023-03-22 19:05:40] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2023-03-22 19:05:40] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2023-03-22 19:05:40] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2023-03-22 19:05:40] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 0 ms to minimize.
[2023-03-22 19:05:40] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2023-03-22 19:05:40] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2023-03-22 19:05:40] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2023-03-22 19:05:40] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2023-03-22 19:05:40] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2023-03-22 19:05:40] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2023-03-22 19:05:41] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2023-03-22 19:05:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 921 ms
[2023-03-22 19:05:41] [INFO ] [Real]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-22 19:05:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:41] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-22 19:05:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:05:41] [INFO ] [Nat]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-22 19:05:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:41] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-22 19:05:41] [INFO ] [Nat]Added 91 Read/Feed constraints in 35 ms returned sat
[2023-03-22 19:05:41] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2023-03-22 19:05:41] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2023-03-22 19:05:41] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2023-03-22 19:05:41] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 0 ms to minimize.
[2023-03-22 19:05:41] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2023-03-22 19:05:41] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2023-03-22 19:05:41] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2023-03-22 19:05:41] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2023-03-22 19:05:41] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2023-03-22 19:05:41] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2023-03-22 19:05:41] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2023-03-22 19:05:41] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2023-03-22 19:05:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 674 ms
Current structural bounds on expressions (after SMT) : [42, 7, 6, 7, 49, 6, 6, 6, 6] Max seen :[42, 1, 6, 5, 27, 6, 6, 6, 6]
FORMULA LamportFastMutEx-COL-7-UpperBounds-14 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-UpperBounds-11 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-UpperBounds-07 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-UpperBounds-00 42 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 63 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 462/462 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 219 transition count 455
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 212 transition count 455
Applied a total of 14 rules in 53 ms. Remains 212 /219 variables (removed 7) and now considering 455/462 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 212/219 places, 455/462 transitions.
Normalized transition count is 329 out of 455 initially.
// Phase 1: matrix 329 rows 212 cols
[2023-03-22 19:05:42] [INFO ] Computed 65 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3042 ms. (steps per millisecond=328 ) properties (out of 3) seen :40
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 858 ms. (steps per millisecond=1165 ) properties (out of 3) seen :32
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 804 ms. (steps per millisecond=1243 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1689 ms. (steps per millisecond=592 ) properties (out of 3) seen :48
[2023-03-22 19:05:49] [INFO ] Flow matrix only has 329 transitions (discarded 126 similar events)
// Phase 1: matrix 329 rows 212 cols
[2023-03-22 19:05:49] [INFO ] Computed 65 place invariants in 5 ms
[2023-03-22 19:05:49] [INFO ] [Real]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-22 19:05:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:49] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-22 19:05:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:05:49] [INFO ] [Nat]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-22 19:05:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:49] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-22 19:05:49] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-22 19:05:49] [INFO ] [Nat]Added 91 Read/Feed constraints in 10 ms returned sat
[2023-03-22 19:05:49] [INFO ] Computed and/alt/rep : 287/1666/287 causal constraints (skipped 35 transitions) in 25 ms.
[2023-03-22 19:05:49] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 0 ms to minimize.
[2023-03-22 19:05:50] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2023-03-22 19:05:50] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 0 ms to minimize.
[2023-03-22 19:05:50] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2023-03-22 19:05:50] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2023-03-22 19:05:50] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 0 ms to minimize.
[2023-03-22 19:05:50] [INFO ] Deduced a trap composed of 55 places in 90 ms of which 1 ms to minimize.
[2023-03-22 19:05:50] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 0 ms to minimize.
[2023-03-22 19:05:50] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 0 ms to minimize.
[2023-03-22 19:05:50] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2023-03-22 19:05:51] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2023-03-22 19:05:51] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 0 ms to minimize.
[2023-03-22 19:05:51] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 0 ms to minimize.
[2023-03-22 19:05:51] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1504 ms
[2023-03-22 19:05:51] [INFO ] Added : 112 causal constraints over 25 iterations in 2192 ms. Result :sat
Minimization took 219 ms.
[2023-03-22 19:05:51] [INFO ] [Real]Absence check using 65 positive place invariants in 13 ms returned sat
[2023-03-22 19:05:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:51] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-22 19:05:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:05:51] [INFO ] [Nat]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-22 19:05:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:51] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-22 19:05:51] [INFO ] [Nat]Added 91 Read/Feed constraints in 21 ms returned sat
[2023-03-22 19:05:52] [INFO ] Computed and/alt/rep : 287/1666/287 causal constraints (skipped 35 transitions) in 25 ms.
[2023-03-22 19:05:52] [INFO ] Added : 84 causal constraints over 17 iterations in 422 ms. Result :sat
Minimization took 76 ms.
[2023-03-22 19:05:52] [INFO ] [Real]Absence check using 65 positive place invariants in 14 ms returned sat
[2023-03-22 19:05:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:52] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2023-03-22 19:05:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:05:52] [INFO ] [Nat]Absence check using 65 positive place invariants in 14 ms returned sat
[2023-03-22 19:05:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:52] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-22 19:05:52] [INFO ] [Nat]Added 91 Read/Feed constraints in 91 ms returned sat
[2023-03-22 19:05:52] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2023-03-22 19:05:53] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2023-03-22 19:05:53] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2023-03-22 19:05:53] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2023-03-22 19:05:53] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 0 ms to minimize.
[2023-03-22 19:05:53] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2023-03-22 19:05:53] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2023-03-22 19:05:53] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2023-03-22 19:05:53] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2023-03-22 19:05:53] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2023-03-22 19:05:53] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 0 ms to minimize.
[2023-03-22 19:05:53] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2023-03-22 19:05:53] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 0 ms to minimize.
[2023-03-22 19:05:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 1150 ms
Current structural bounds on expressions (after SMT) : [7, 7, 42] Max seen :[1, 6, 42]
FORMULA LamportFastMutEx-COL-7-UpperBounds-05 42 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 14 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 455/455 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 205 transition count 448
Applied a total of 14 rules in 45 ms. Remains 205 /212 variables (removed 7) and now considering 448/455 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 205/212 places, 448/455 transitions.
Normalized transition count is 322 out of 448 initially.
// Phase 1: matrix 322 rows 205 cols
[2023-03-22 19:05:54] [INFO ] Computed 65 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2373 ms. (steps per millisecond=421 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 772 ms. (steps per millisecond=1295 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 701 ms. (steps per millisecond=1426 ) properties (out of 2) seen :2
[2023-03-22 19:05:58] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 205 cols
[2023-03-22 19:05:58] [INFO ] Computed 65 place invariants in 6 ms
[2023-03-22 19:05:58] [INFO ] [Real]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-22 19:05:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:58] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2023-03-22 19:05:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:05:58] [INFO ] [Nat]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-22 19:05:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:58] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-22 19:05:58] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-22 19:05:58] [INFO ] [Nat]Added 91 Read/Feed constraints in 12 ms returned sat
[2023-03-22 19:05:58] [INFO ] Computed and/alt/rep : 280/1750/280 causal constraints (skipped 35 transitions) in 20 ms.
[2023-03-22 19:05:58] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2023-03-22 19:05:58] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2023-03-22 19:05:59] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2023-03-22 19:05:59] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 0 ms to minimize.
[2023-03-22 19:05:59] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 0 ms to minimize.
[2023-03-22 19:05:59] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-22 19:05:59] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2023-03-22 19:05:59] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 0 ms to minimize.
[2023-03-22 19:05:59] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 829 ms
[2023-03-22 19:05:59] [INFO ] Added : 73 causal constraints over 15 iterations in 1209 ms. Result :sat
Minimization took 147 ms.
[2023-03-22 19:05:59] [INFO ] [Real]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-22 19:05:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:05:59] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-22 19:05:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:05:59] [INFO ] [Nat]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-22 19:05:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:06:00] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-22 19:06:00] [INFO ] [Nat]Added 91 Read/Feed constraints in 15 ms returned sat
[2023-03-22 19:06:00] [INFO ] Computed and/alt/rep : 280/1750/280 causal constraints (skipped 35 transitions) in 23 ms.
[2023-03-22 19:06:00] [INFO ] Added : 38 causal constraints over 8 iterations in 229 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : [7, 7] Max seen :[1, 6]
FORMULA LamportFastMutEx-COL-7-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 7 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 448/448 transitions.
Applied a total of 0 rules in 15 ms. Remains 205 /205 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 205/205 places, 448/448 transitions.
Normalized transition count is 322 out of 448 initially.
// Phase 1: matrix 322 rows 205 cols
[2023-03-22 19:06:00] [INFO ] Computed 65 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2243 ms. (steps per millisecond=445 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 749 ms. (steps per millisecond=1335 ) properties (out of 1) seen :1
[2023-03-22 19:06:03] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 205 cols
[2023-03-22 19:06:03] [INFO ] Computed 65 place invariants in 4 ms
[2023-03-22 19:06:03] [INFO ] [Real]Absence check using 65 positive place invariants in 9 ms returned sat
[2023-03-22 19:06:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:06:03] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2023-03-22 19:06:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:06:03] [INFO ] [Nat]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-22 19:06:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:06:03] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-22 19:06:03] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-22 19:06:03] [INFO ] [Nat]Added 91 Read/Feed constraints in 12 ms returned sat
[2023-03-22 19:06:03] [INFO ] Computed and/alt/rep : 280/1750/280 causal constraints (skipped 35 transitions) in 28 ms.
[2023-03-22 19:06:04] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
[2023-03-22 19:06:04] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 0 ms to minimize.
[2023-03-22 19:06:04] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2023-03-22 19:06:04] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 0 ms to minimize.
[2023-03-22 19:06:04] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 0 ms to minimize.
[2023-03-22 19:06:04] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-22 19:06:04] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2023-03-22 19:06:05] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 0 ms to minimize.
[2023-03-22 19:06:05] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 850 ms
[2023-03-22 19:06:05] [INFO ] Added : 73 causal constraints over 15 iterations in 1253 ms. Result :sat
Minimization took 146 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[1]
Support contains 7 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 448/448 transitions.
Applied a total of 0 rules in 13 ms. Remains 205 /205 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 205/205 places, 448/448 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 448/448 transitions.
Applied a total of 0 rules in 12 ms. Remains 205 /205 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-22 19:06:05] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 19:06:05] [INFO ] Invariant cache hit.
[2023-03-22 19:06:05] [INFO ] Implicit Places using invariants in 204 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 209 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 198/205 places, 448/448 transitions.
Applied a total of 0 rules in 10 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 231 ms. Remains : 198/205 places, 448/448 transitions.
Normalized transition count is 322 out of 448 initially.
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 19:06:05] [INFO ] Computed 58 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2122 ms. (steps per millisecond=471 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 730 ms. (steps per millisecond=1369 ) properties (out of 1) seen :1
[2023-03-22 19:06:08] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 19:06:08] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-22 19:06:08] [INFO ] [Real]Absence check using 58 positive place invariants in 10 ms returned sat
[2023-03-22 19:06:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:06:08] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2023-03-22 19:06:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:06:08] [INFO ] [Nat]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-22 19:06:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:06:08] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-22 19:06:08] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:06:08] [INFO ] [Nat]Added 42 Read/Feed constraints in 13 ms returned sat
[2023-03-22 19:06:08] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 21 ms.
[2023-03-22 19:06:09] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2023-03-22 19:06:09] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2023-03-22 19:06:09] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2023-03-22 19:06:09] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 0 ms to minimize.
[2023-03-22 19:06:09] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2023-03-22 19:06:10] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 0 ms to minimize.
[2023-03-22 19:06:10] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2023-03-22 19:06:10] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2023-03-22 19:06:10] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 0 ms to minimize.
[2023-03-22 19:06:10] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
[2023-03-22 19:06:10] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2023-03-22 19:06:10] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 0 ms to minimize.
[2023-03-22 19:06:10] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1171 ms
[2023-03-22 19:06:10] [INFO ] Added : 146 causal constraints over 31 iterations in 2011 ms. Result :sat
Minimization took 235 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[1]
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 8 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 198/198 places, 448/448 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 7 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-22 19:06:11] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 19:06:11] [INFO ] Invariant cache hit.
[2023-03-22 19:06:11] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-22 19:06:11] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 19:06:11] [INFO ] Invariant cache hit.
[2023-03-22 19:06:11] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:06:11] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
[2023-03-22 19:06:11] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-22 19:06:11] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 19:06:11] [INFO ] Invariant cache hit.
[2023-03-22 19:06:11] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 639 ms. Remains : 198/198 places, 448/448 transitions.
Starting property specific reduction for LamportFastMutEx-COL-7-UpperBounds-01
Normalized transition count is 322 out of 448 initially.
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 19:06:11] [INFO ] Computed 58 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) 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-22 19:06:11] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 19:06:11] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-22 19:06:11] [INFO ] [Real]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-22 19:06:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:06:11] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2023-03-22 19:06:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:06:11] [INFO ] [Nat]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-22 19:06:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:06:12] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-22 19:06:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:06:12] [INFO ] [Nat]Added 42 Read/Feed constraints in 9 ms returned sat
[2023-03-22 19:06:12] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 23 ms.
[2023-03-22 19:06:12] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 0 ms to minimize.
[2023-03-22 19:06:12] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2023-03-22 19:06:13] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2023-03-22 19:06:13] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 0 ms to minimize.
[2023-03-22 19:06:13] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2023-03-22 19:06:13] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2023-03-22 19:06:13] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 0 ms to minimize.
[2023-03-22 19:06:13] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2023-03-22 19:06:13] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 0 ms to minimize.
[2023-03-22 19:06:13] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2023-03-22 19:06:13] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2023-03-22 19:06:13] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 0 ms to minimize.
[2023-03-22 19:06:13] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1159 ms
[2023-03-22 19:06:14] [INFO ] Added : 146 causal constraints over 31 iterations in 1961 ms. Result :sat
Minimization took 237 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[1]
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 8 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 198/198 places, 448/448 transitions.
Normalized transition count is 322 out of 448 initially.
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 19:06:14] [INFO ] Computed 58 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2006 ms. (steps per millisecond=498 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 692 ms. (steps per millisecond=1445 ) properties (out of 1) seen :1
[2023-03-22 19:06:17] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-22 19:06:17] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-22 19:06:17] [INFO ] [Real]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-22 19:06:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 19:06:17] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2023-03-22 19:06:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 19:06:17] [INFO ] [Nat]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-22 19:06:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 19:06:17] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-22 19:06:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:06:17] [INFO ] [Nat]Added 42 Read/Feed constraints in 8 ms returned sat
[2023-03-22 19:06:17] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 20 ms.
[2023-03-22 19:06:18] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 0 ms to minimize.
[2023-03-22 19:06:18] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2023-03-22 19:06:18] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2023-03-22 19:06:18] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 3 ms to minimize.
[2023-03-22 19:06:18] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2023-03-22 19:06:18] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 0 ms to minimize.
[2023-03-22 19:06:18] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 0 ms to minimize.
[2023-03-22 19:06:18] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2023-03-22 19:06:18] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 0 ms to minimize.
[2023-03-22 19:06:19] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 1 ms to minimize.
[2023-03-22 19:06:19] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2023-03-22 19:06:19] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 0 ms to minimize.
[2023-03-22 19:06:19] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1170 ms
[2023-03-22 19:06:19] [INFO ] Added : 146 causal constraints over 31 iterations in 2000 ms. Result :sat
Minimization took 246 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[1]
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 8 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 198/198 places, 448/448 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 448/448 transitions.
Applied a total of 0 rules in 7 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-22 19:06:19] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 19:06:19] [INFO ] Invariant cache hit.
[2023-03-22 19:06:19] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-22 19:06:19] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 19:06:19] [INFO ] Invariant cache hit.
[2023-03-22 19:06:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-22 19:06:20] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
[2023-03-22 19:06:20] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-22 19:06:20] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-22 19:06:20] [INFO ] Invariant cache hit.
[2023-03-22 19:06:20] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 619 ms. Remains : 198/198 places, 448/448 transitions.
Ending property specific reduction for LamportFastMutEx-COL-7-UpperBounds-01 in 8596 ms.
[2023-03-22 19:06:20] [INFO ] Flatten gal took : 71 ms
[2023-03-22 19:06:20] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-22 19:06:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 198 places, 448 transitions and 2212 arcs took 3 ms.
Total runtime 53223 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/1202/ub_0_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9467752 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16093988 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is LamportFastMutEx-COL-7, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-167856418800381"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-7.tgz
mv LamportFastMutEx-COL-7 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 ;