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.r235-tall-167856421700381.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 smartxred
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 r235-tall-167856421700381
=====================================================================

--------------------
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 1678649898927

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-7
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-12 19:38:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 19:38:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 19:38:20] [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-12 19:38:20] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-12 19:38:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 709 ms
[2023-03-12 19:38:21] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 264 PT places and 672.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-12 19:38:21] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 7 ms.
[2023-03-12 19:38:21] [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-12 19:38:21] [INFO ] Computed 2 place invariants in 3 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-12 19:38:21] [INFO ] Invariant cache hit.
[2023-03-12 19:38:21] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-12 19:38:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:21] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-12 19:38:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:38:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-12 19:38:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:21] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-12 19:38:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 19:38:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-12 19:38:21] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-12 19:38:21] [INFO ] Added : 11 causal constraints over 3 iterations in 21 ms. Result :sat
Minimization took 9 ms.
[2023-03-12 19:38:21] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-12 19:38:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:21] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-12 19:38:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:38:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-12 19:38:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:21] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-12 19:38:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-12 19:38:21] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 19:38:21] [INFO ] Added : 5 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 3 ms.
[2023-03-12 19:38:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-12 19:38:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:21] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-12 19:38:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:38:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-12 19:38:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:21] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-12 19:38:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-12 19:38:21] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-12 19:38:21] [INFO ] Added : 7 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 5 ms.
[2023-03-12 19:38:21] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-12 19:38:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:21] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-12 19:38:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:38:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-12 19:38:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:21] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-12 19:38:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-12 19:38:21] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 19:38:21] [INFO ] Added : 5 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 8 ms.
[2023-03-12 19:38:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-12 19:38:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:21] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-12 19:38:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:38:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-12 19:38:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:21] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-12 19:38:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-12 19:38:21] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 19:38:21] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 10 ms.
[2023-03-12 19:38:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-12 19:38:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:21] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-12 19:38:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:38:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-12 19:38:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:22] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-12 19:38:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-12 19:38:22] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 19:38:22] [INFO ] Added : 11 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 11 ms.
[2023-03-12 19:38:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-12 19:38:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:22] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-12 19:38:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:38:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-12 19:38:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:22] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-12 19:38:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-12 19:38:22] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 19:38:22] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 3 ms.
[2023-03-12 19:38:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-12 19:38:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:22] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-12 19:38:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:38:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-12 19:38:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:22] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-12 19:38:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-12 19:38:22] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 19:38:22] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2023-03-12 19:38:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-12 19:38:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:22] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-12 19:38:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:38:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-12 19:38:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:22] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-12 19:38:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-12 19:38:22] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 19:38:22] [INFO ] Added : 5 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2023-03-12 19:38:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-12 19:38:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:22] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-12 19:38:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:38:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-12 19:38:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:22] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-12 19:38:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-12 19:38:22] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 19:38:22] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2023-03-12 19:38:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-12 19:38:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:22] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-12 19:38:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:38:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-12 19:38:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:22] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-12 19:38:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-12 19:38:22] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-12 19:38:22] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2023-03-12 19:38:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-12 19:38:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:22] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-12 19:38:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:38:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-12 19:38:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:22] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-12 19:38:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-12 19:38:22] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 19:38:22] [INFO ] Added : 11 causal constraints over 3 iterations in 8 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-12 19:38:22] [INFO ] Unfolded HLPN to a Petri net with 264 places and 536 transitions 2352 arcs in 27 ms.
[2023-03-12 19:38:22] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 45 places in 3 ms
Reduce places removed 45 places and 74 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 12) seen :110
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :69
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :72
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :46
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :84
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 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :89
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 :59
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :70
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) seen :10
FORMULA LamportFastMutEx-COL-7-UpperBounds-08 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :75
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :70
[2023-03-12 19:38:22] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2023-03-12 19:38:22] [INFO ] Computed 65 place invariants in 17 ms
[2023-03-12 19:38:22] [INFO ] [Real]Absence check using 65 positive place invariants in 15 ms returned sat
[2023-03-12 19:38:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:22] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2023-03-12 19:38:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:38:22] [INFO ] [Nat]Absence check using 65 positive place invariants in 19 ms returned sat
[2023-03-12 19:38:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:23] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-12 19:38:23] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-12 19:38:23] [INFO ] [Nat]Added 91 Read/Feed constraints in 44 ms returned sat
[2023-03-12 19:38:23] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 5 ms to minimize.
[2023-03-12 19:38:23] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 0 ms to minimize.
[2023-03-12 19:38:23] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2023-03-12 19:38:23] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 6 ms to minimize.
[2023-03-12 19:38:23] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-12 19:38:23] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2023-03-12 19:38:23] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2023-03-12 19:38:23] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2023-03-12 19:38:23] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2023-03-12 19:38:23] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2023-03-12 19:38:23] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2023-03-12 19:38:23] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2023-03-12 19:38:23] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2023-03-12 19:38:23] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2023-03-12 19:38:23] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 920 ms
[2023-03-12 19:38:24] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 24 ms.
[2023-03-12 19:38:25] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2023-03-12 19:38:25] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2023-03-12 19:38:25] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2023-03-12 19:38:25] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2023-03-12 19:38:25] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 0 ms to minimize.
[2023-03-12 19:38:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 507 ms
[2023-03-12 19:38:25] [INFO ] Added : 182 causal constraints over 37 iterations in 1580 ms. Result :sat
Minimization took 450 ms.
[2023-03-12 19:38:26] [INFO ] [Real]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-12 19:38:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:26] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-03-12 19:38:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:38:26] [INFO ] [Nat]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-12 19:38:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:26] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-12 19:38:26] [INFO ] [Nat]Added 91 Read/Feed constraints in 16 ms returned sat
[2023-03-12 19:38:26] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 24 ms.
[2023-03-12 19:38:27] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 0 ms to minimize.
[2023-03-12 19:38:27] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 0 ms to minimize.
[2023-03-12 19:38:27] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2023-03-12 19:38:27] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2023-03-12 19:38:27] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2023-03-12 19:38:27] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2023-03-12 19:38:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 503 ms
[2023-03-12 19:38:27] [INFO ] Added : 144 causal constraints over 31 iterations in 1387 ms. Result :sat
Minimization took 266 ms.
[2023-03-12 19:38:27] [INFO ] [Real]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-12 19:38:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:28] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2023-03-12 19:38:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:38:28] [INFO ] [Nat]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-12 19:38:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:28] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-12 19:38:28] [INFO ] [Nat]Added 91 Read/Feed constraints in 21 ms returned sat
[2023-03-12 19:38:28] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2023-03-12 19:38:28] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2023-03-12 19:38:28] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2023-03-12 19:38:28] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2023-03-12 19:38:28] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2023-03-12 19:38:28] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 0 ms to minimize.
[2023-03-12 19:38:28] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 0 ms to minimize.
[2023-03-12 19:38:28] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2023-03-12 19:38:28] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2023-03-12 19:38:28] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 4 ms to minimize.
[2023-03-12 19:38:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 737 ms
[2023-03-12 19:38:28] [INFO ] [Real]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-12 19:38:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:29] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-12 19:38:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:38:29] [INFO ] [Nat]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-12 19:38:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:29] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-12 19:38:29] [INFO ] [Nat]Added 91 Read/Feed constraints in 11 ms returned sat
[2023-03-12 19:38:29] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 24 ms.
[2023-03-12 19:38:29] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 0 ms to minimize.
[2023-03-12 19:38:30] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 0 ms to minimize.
[2023-03-12 19:38:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 238 ms
[2023-03-12 19:38:30] [INFO ] Added : 129 causal constraints over 27 iterations in 987 ms. Result :sat
Minimization took 157 ms.
[2023-03-12 19:38:30] [INFO ] [Real]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-12 19:38:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:30] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-12 19:38:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:38:30] [INFO ] [Nat]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-12 19:38:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:30] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-12 19:38:30] [INFO ] [Nat]Added 91 Read/Feed constraints in 74 ms returned sat
[2023-03-12 19:38:30] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2023-03-12 19:38:30] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2023-03-12 19:38:30] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2023-03-12 19:38:30] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2023-03-12 19:38:30] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2023-03-12 19:38:31] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2023-03-12 19:38:31] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2023-03-12 19:38:31] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2023-03-12 19:38:31] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2023-03-12 19:38:31] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2023-03-12 19:38:31] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2023-03-12 19:38:31] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2023-03-12 19:38:31] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2023-03-12 19:38:31] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2023-03-12 19:38:31] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 881 ms
[2023-03-12 19:38:31] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 29 ms.
[2023-03-12 19:38:31] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2023-03-12 19:38:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-12 19:38:31] [INFO ] Added : 56 causal constraints over 12 iterations in 397 ms. Result :sat
Minimization took 202 ms.
[2023-03-12 19:38:32] [INFO ] [Real]Absence check using 65 positive place invariants in 14 ms returned sat
[2023-03-12 19:38:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:32] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-12 19:38:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:38:32] [INFO ] [Nat]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-12 19:38:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:32] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-12 19:38:32] [INFO ] [Nat]Added 91 Read/Feed constraints in 11 ms returned sat
[2023-03-12 19:38:32] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2023-03-12 19:38:32] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2023-03-12 19:38:32] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2023-03-12 19:38:32] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 3 ms to minimize.
[2023-03-12 19:38:32] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2023-03-12 19:38:32] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 0 ms to minimize.
[2023-03-12 19:38:32] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2023-03-12 19:38:32] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 514 ms
[2023-03-12 19:38:32] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 24 ms.
[2023-03-12 19:38:33] [INFO ] Added : 68 causal constraints over 14 iterations in 358 ms. Result :sat
Minimization took 141 ms.
[2023-03-12 19:38:33] [INFO ] [Real]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-12 19:38:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:33] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2023-03-12 19:38:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:38:33] [INFO ] [Nat]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-12 19:38:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:33] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-12 19:38:33] [INFO ] [Nat]Added 91 Read/Feed constraints in 21 ms returned sat
[2023-03-12 19:38:33] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2023-03-12 19:38:33] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 0 ms to minimize.
[2023-03-12 19:38:33] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2023-03-12 19:38:33] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 0 ms to minimize.
[2023-03-12 19:38:34] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 0 ms to minimize.
[2023-03-12 19:38:34] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 0 ms to minimize.
[2023-03-12 19:38:34] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2023-03-12 19:38:34] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 0 ms to minimize.
[2023-03-12 19:38:34] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2023-03-12 19:38:34] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 0 ms to minimize.
[2023-03-12 19:38:34] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 0 ms to minimize.
[2023-03-12 19:38:34] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2023-03-12 19:38:34] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2023-03-12 19:38:34] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2023-03-12 19:38:34] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 0 ms to minimize.
[2023-03-12 19:38:34] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2023-03-12 19:38:35] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2023-03-12 19:38:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 17 trap constraints in 1422 ms
[2023-03-12 19:38:35] [INFO ] [Real]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-12 19:38:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:35] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-12 19:38:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:38:35] [INFO ] [Nat]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-12 19:38:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:35] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-12 19:38:35] [INFO ] [Nat]Added 91 Read/Feed constraints in 15 ms returned sat
[2023-03-12 19:38:35] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 24 ms.
[2023-03-12 19:38:35] [INFO ] Added : 76 causal constraints over 16 iterations in 397 ms. Result :sat
Minimization took 74 ms.
[2023-03-12 19:38:35] [INFO ] [Real]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-12 19:38:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:35] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-12 19:38:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:38:35] [INFO ] [Nat]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-12 19:38:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:36] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-12 19:38:36] [INFO ] [Nat]Added 91 Read/Feed constraints in 20 ms returned sat
[2023-03-12 19:38:36] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2023-03-12 19:38:36] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2023-03-12 19:38:36] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2023-03-12 19:38:36] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2023-03-12 19:38:36] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2023-03-12 19:38:36] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
[2023-03-12 19:38:36] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2023-03-12 19:38:36] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2023-03-12 19:38:36] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2023-03-12 19:38:36] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2023-03-12 19:38:36] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2023-03-12 19:38:36] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2023-03-12 19:38:36] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2023-03-12 19:38:36] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2023-03-12 19:38:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 873 ms
[2023-03-12 19:38:36] [INFO ] [Real]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-12 19:38:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:37] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-12 19:38:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:38:37] [INFO ] [Nat]Absence check using 65 positive place invariants in 11 ms returned sat
[2023-03-12 19:38:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:37] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-12 19:38:37] [INFO ] [Nat]Added 91 Read/Feed constraints in 18 ms returned sat
[2023-03-12 19:38:37] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2023-03-12 19:38:37] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2023-03-12 19:38:37] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2023-03-12 19:38:37] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2023-03-12 19:38:37] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2023-03-12 19:38:37] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2023-03-12 19:38:37] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2023-03-12 19:38:37] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2023-03-12 19:38:37] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2023-03-12 19:38:37] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2023-03-12 19:38:37] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2023-03-12 19:38:37] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2023-03-12 19:38:37] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 639 ms
[2023-03-12 19:38:37] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 21 ms.
[2023-03-12 19:38:38] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2023-03-12 19:38:38] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2023-03-12 19:38:39] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2023-03-12 19:38:39] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 0 ms to minimize.
[2023-03-12 19:38:39] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2023-03-12 19:38:39] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2023-03-12 19:38:39] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 0 ms to minimize.
[2023-03-12 19:38:39] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 0 ms to minimize.
[2023-03-12 19:38:39] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2023-03-12 19:38:39] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2023-03-12 19:38:39] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2023-03-12 19:38:39] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1032 ms
[2023-03-12 19:38:39] [INFO ] Added : 193 causal constraints over 39 iterations in 2065 ms. Result :sat
Minimization took 120 ms.
Current structural bounds on expressions (after SMT) : [49, 7, 6, 7, 49, 7, 6, 7, 6, 7] Max seen :[40, 1, 6, 5, 35, 4, 6, 6, 6, 4]
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-02 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-UpperBounds-09 7 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 126 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 462/462 transitions.
Applied a total of 0 rules in 25 ms. Remains 219 /219 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 219/219 places, 462/462 transitions.
Normalized transition count is 336 out of 462 initially.
// Phase 1: matrix 336 rows 219 cols
[2023-03-12 19:38:41] [INFO ] Computed 65 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3347 ms. (steps per millisecond=298 ) properties (out of 6) seen :85
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1658 ms. (steps per millisecond=603 ) properties (out of 6) seen :65
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 912 ms. (steps per millisecond=1096 ) properties (out of 6) seen :78
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 864 ms. (steps per millisecond=1157 ) properties (out of 6) seen :18
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1506 ms. (steps per millisecond=664 ) properties (out of 6) seen :87
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 874 ms. (steps per millisecond=1144 ) properties (out of 6) seen :68
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 664 ms. (steps per millisecond=1506 ) properties (out of 6) seen :66
[2023-03-12 19:38:51] [INFO ] Flow matrix only has 336 transitions (discarded 126 similar events)
// Phase 1: matrix 336 rows 219 cols
[2023-03-12 19:38:51] [INFO ] Computed 65 place invariants in 6 ms
[2023-03-12 19:38:51] [INFO ] [Real]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-12 19:38:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:51] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2023-03-12 19:38:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:38:51] [INFO ] [Nat]Absence check using 65 positive place invariants in 13 ms returned sat
[2023-03-12 19:38:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:52] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-12 19:38:52] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-12 19:38:52] [INFO ] [Nat]Added 91 Read/Feed constraints in 38 ms returned sat
[2023-03-12 19:38:52] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 0 ms to minimize.
[2023-03-12 19:38:52] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
[2023-03-12 19:38:52] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
[2023-03-12 19:38:52] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2023-03-12 19:38:52] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2023-03-12 19:38:52] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2023-03-12 19:38:52] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2023-03-12 19:38:52] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2023-03-12 19:38:52] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2023-03-12 19:38:52] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2023-03-12 19:38:52] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2023-03-12 19:38:52] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2023-03-12 19:38:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 809 ms
[2023-03-12 19:38:52] [INFO ] [Real]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-12 19:38:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:52] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-12 19:38:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:38:53] [INFO ] [Nat]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-12 19:38:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:53] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-12 19:38:53] [INFO ] [Nat]Added 91 Read/Feed constraints in 16 ms returned sat
[2023-03-12 19:38:53] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 19 ms.
[2023-03-12 19:38:53] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 0 ms to minimize.
[2023-03-12 19:38:53] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 1 ms to minimize.
[2023-03-12 19:38:54] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2023-03-12 19:38:54] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2023-03-12 19:38:54] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2023-03-12 19:38:54] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2023-03-12 19:38:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 461 ms
[2023-03-12 19:38:54] [INFO ] Added : 144 causal constraints over 31 iterations in 1283 ms. Result :sat
Minimization took 260 ms.
[2023-03-12 19:38:54] [INFO ] [Real]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-12 19:38:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:54] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-12 19:38:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:38:54] [INFO ] [Nat]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-12 19:38:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:54] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-12 19:38:54] [INFO ] [Nat]Added 91 Read/Feed constraints in 10 ms returned sat
[2023-03-12 19:38:54] [INFO ] Computed and/alt/rep : 301/1778/301 causal constraints (skipped 28 transitions) in 19 ms.
[2023-03-12 19:38:55] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 0 ms to minimize.
[2023-03-12 19:38:55] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 0 ms to minimize.
[2023-03-12 19:38:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2023-03-12 19:38:55] [INFO ] Added : 129 causal constraints over 27 iterations in 978 ms. Result :sat
Minimization took 153 ms.
[2023-03-12 19:38:56] [INFO ] [Real]Absence check using 65 positive place invariants in 12 ms returned sat
[2023-03-12 19:38:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:56] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-12 19:38:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:38:56] [INFO ] [Nat]Absence check using 65 positive place invariants in 13 ms returned sat
[2023-03-12 19:38:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:56] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-12 19:38:56] [INFO ] [Nat]Added 91 Read/Feed constraints in 91 ms returned sat
[2023-03-12 19:38:56] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-12 19:38:56] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2023-03-12 19:38:56] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2023-03-12 19:38:56] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2023-03-12 19:38:56] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2023-03-12 19:38:56] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2023-03-12 19:38:56] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2023-03-12 19:38:56] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2023-03-12 19:38:56] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2023-03-12 19:38:56] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2023-03-12 19:38:57] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2023-03-12 19:38:57] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2023-03-12 19:38:57] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2023-03-12 19:38:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 815 ms
[2023-03-12 19:38:57] [INFO ] [Real]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-12 19:38:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:57] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-03-12 19:38:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:38:57] [INFO ] [Nat]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-12 19:38:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:57] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-12 19:38:57] [INFO ] [Nat]Added 91 Read/Feed constraints in 17 ms returned sat
[2023-03-12 19:38:57] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
[2023-03-12 19:38:57] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2023-03-12 19:38:57] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2023-03-12 19:38:57] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2023-03-12 19:38:57] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2023-03-12 19:38:57] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2023-03-12 19:38:57] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2023-03-12 19:38:58] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
[2023-03-12 19:38:58] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2023-03-12 19:38:58] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2023-03-12 19:38:58] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2023-03-12 19:38:58] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 0 ms to minimize.
[2023-03-12 19:38:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 898 ms
[2023-03-12 19:38:58] [INFO ] [Real]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-12 19:38:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:58] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-12 19:38:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:38:58] [INFO ] [Nat]Absence check using 65 positive place invariants in 9 ms returned sat
[2023-03-12 19:38:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:38:58] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-12 19:38:58] [INFO ] [Nat]Added 91 Read/Feed constraints in 32 ms returned sat
[2023-03-12 19:38:58] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2023-03-12 19:38:58] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2023-03-12 19:38:58] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2023-03-12 19:38:58] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2023-03-12 19:38:58] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2023-03-12 19:38:58] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2023-03-12 19:38:58] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2023-03-12 19:38:59] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2023-03-12 19:38:59] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2023-03-12 19:38:59] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2023-03-12 19:38:59] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2023-03-12 19:38:59] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2023-03-12 19:38:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 661 ms
Current structural bounds on expressions (after SMT) : [42, 7, 7, 42, 6, 6] Max seen :[42, 1, 5, 42, 6, 6]
FORMULA LamportFastMutEx-COL-7-UpperBounds-14 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-05 42 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-7-UpperBounds-00 42 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 14 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 462/462 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 212 transition count 455
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 21 place count 212 transition count 448
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 28 place count 205 transition count 448
Applied a total of 28 rules in 60 ms. Remains 205 /219 variables (removed 14) and now considering 448/462 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 205/219 places, 448/462 transitions.
Normalized transition count is 322 out of 448 initially.
// Phase 1: matrix 322 rows 205 cols
[2023-03-12 19:38:59] [INFO ] Computed 65 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2169 ms. (steps per millisecond=461 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 658 ms. (steps per millisecond=1519 ) properties (out of 2) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 616 ms. (steps per millisecond=1623 ) properties (out of 2) seen :2
[2023-03-12 19:39:03] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 205 cols
[2023-03-12 19:39:03] [INFO ] Computed 65 place invariants in 6 ms
[2023-03-12 19:39:03] [INFO ] [Real]Absence check using 65 positive place invariants in 9 ms returned sat
[2023-03-12 19:39:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:39:03] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-12 19:39:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:39:03] [INFO ] [Nat]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-12 19:39:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:39:03] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-12 19:39:03] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-12 19:39:03] [INFO ] [Nat]Added 91 Read/Feed constraints in 11 ms returned sat
[2023-03-12 19:39:03] [INFO ] Computed and/alt/rep : 280/1750/280 causal constraints (skipped 35 transitions) in 19 ms.
[2023-03-12 19:39:03] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2023-03-12 19:39:03] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 0 ms to minimize.
[2023-03-12 19:39:03] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2023-03-12 19:39:03] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2023-03-12 19:39:03] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2023-03-12 19:39:03] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 0 ms to minimize.
[2023-03-12 19:39:04] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2023-03-12 19:39:04] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 0 ms to minimize.
[2023-03-12 19:39:04] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 621 ms
[2023-03-12 19:39:04] [INFO ] Added : 54 causal constraints over 12 iterations in 897 ms. Result :sat
Minimization took 115 ms.
[2023-03-12 19:39:04] [INFO ] [Real]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-12 19:39:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:39:04] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-12 19:39:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:39:04] [INFO ] [Nat]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-12 19:39:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:39:04] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-12 19:39:04] [INFO ] [Nat]Added 91 Read/Feed constraints in 15 ms returned sat
[2023-03-12 19:39:04] [INFO ] Computed and/alt/rep : 280/1750/280 causal constraints (skipped 35 transitions) in 22 ms.
[2023-03-12 19:39:04] [INFO ] Added : 38 causal constraints over 8 iterations in 203 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : [7, 7] Max seen :[1, 6]
Support contains 14 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 12 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 12 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 11 ms. Remains 205 /205 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-12 19:39:05] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-12 19:39:05] [INFO ] Invariant cache hit.
[2023-03-12 19:39:05] [INFO ] Implicit Places using invariants in 174 ms returned [128, 129, 130, 131, 132, 133, 134]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 176 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 11 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 199 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-12 19:39:05] [INFO ] Computed 58 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2032 ms. (steps per millisecond=492 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 637 ms. (steps per millisecond=1569 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 603 ms. (steps per millisecond=1658 ) properties (out of 2) seen :2
[2023-03-12 19:39:08] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-12 19:39:08] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-12 19:39:08] [INFO ] [Real]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-12 19:39:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:39:08] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2023-03-12 19:39:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:39:08] [INFO ] [Nat]Absence check using 58 positive place invariants in 8 ms returned sat
[2023-03-12 19:39:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:39:08] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-12 19:39:08] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 19:39:08] [INFO ] [Nat]Added 42 Read/Feed constraints in 15 ms returned sat
[2023-03-12 19:39:08] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 0 ms to minimize.
[2023-03-12 19:39:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-03-12 19:39:08] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 19 ms.
[2023-03-12 19:39:09] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2023-03-12 19:39:09] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 0 ms to minimize.
[2023-03-12 19:39:09] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 0 ms to minimize.
[2023-03-12 19:39:10] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 0 ms to minimize.
[2023-03-12 19:39:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 435 ms
[2023-03-12 19:39:10] [INFO ] Added : 160 causal constraints over 32 iterations in 1269 ms. Result :sat
Minimization took 241 ms.
[2023-03-12 19:39:10] [INFO ] [Real]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-12 19:39:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:39:10] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-12 19:39:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:39:10] [INFO ] [Nat]Absence check using 58 positive place invariants in 8 ms returned sat
[2023-03-12 19:39:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:39:10] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-12 19:39:10] [INFO ] [Nat]Added 42 Read/Feed constraints in 8 ms returned sat
[2023-03-12 19:39:10] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 19 ms.
[2023-03-12 19:39:11] [INFO ] Added : 114 causal constraints over 23 iterations in 540 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : [7, 7] Max seen :[1, 6]
Support contains 14 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 10 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 10 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 9 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-12 19:39:11] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-12 19:39:11] [INFO ] Invariant cache hit.
[2023-03-12 19:39:11] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-12 19:39:11] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-12 19:39:11] [INFO ] Invariant cache hit.
[2023-03-12 19:39:11] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 19:39:12] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2023-03-12 19:39:12] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-12 19:39:12] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-12 19:39:12] [INFO ] Invariant cache hit.
[2023-03-12 19:39:12] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 600 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-12 19:39:12] [INFO ] Computed 58 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :1
[2023-03-12 19:39:12] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-12 19:39:12] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-12 19:39:12] [INFO ] [Real]Absence check using 58 positive place invariants in 8 ms returned sat
[2023-03-12 19:39:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:39:12] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-12 19:39:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:39:12] [INFO ] [Nat]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-12 19:39:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:39:12] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-12 19:39:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 19:39:12] [INFO ] [Nat]Added 42 Read/Feed constraints in 8 ms returned sat
[2023-03-12 19:39:12] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 0 ms to minimize.
[2023-03-12 19:39:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-03-12 19:39:12] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 18 ms.
[2023-03-12 19:39:13] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2023-03-12 19:39:13] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 0 ms to minimize.
[2023-03-12 19:39:13] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 0 ms to minimize.
[2023-03-12 19:39:13] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2023-03-12 19:39:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 430 ms
[2023-03-12 19:39:13] [INFO ] Added : 160 causal constraints over 32 iterations in 1251 ms. Result :sat
Minimization took 234 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 9 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.
Normalized transition count is 322 out of 448 initially.
// Phase 1: matrix 322 rows 198 cols
[2023-03-12 19:39:14] [INFO ] Computed 58 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1931 ms. (steps per millisecond=517 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 620 ms. (steps per millisecond=1612 ) properties (out of 1) seen :1
[2023-03-12 19:39:16] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-12 19:39:16] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-12 19:39:16] [INFO ] [Real]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-12 19:39:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:39:16] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2023-03-12 19:39:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:39:16] [INFO ] [Nat]Absence check using 58 positive place invariants in 8 ms returned sat
[2023-03-12 19:39:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:39:17] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-12 19:39:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 19:39:17] [INFO ] [Nat]Added 42 Read/Feed constraints in 9 ms returned sat
[2023-03-12 19:39:17] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 0 ms to minimize.
[2023-03-12 19:39:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-12 19:39:17] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 19 ms.
[2023-03-12 19:39:18] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2023-03-12 19:39:18] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
[2023-03-12 19:39:18] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2023-03-12 19:39:18] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2023-03-12 19:39:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 429 ms
[2023-03-12 19:39:18] [INFO ] Added : 160 causal constraints over 32 iterations in 1253 ms. Result :sat
Minimization took 234 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-12 19:39:18] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-12 19:39:18] [INFO ] Invariant cache hit.
[2023-03-12 19:39:18] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-12 19:39:18] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-12 19:39:18] [INFO ] Invariant cache hit.
[2023-03-12 19:39:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 19:39:19] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2023-03-12 19:39:19] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-12 19:39:19] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-12 19:39:19] [INFO ] Invariant cache hit.
[2023-03-12 19:39:19] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 591 ms. Remains : 198/198 places, 448/448 transitions.
Ending property specific reduction for LamportFastMutEx-COL-7-UpperBounds-01 in 7216 ms.
Starting property specific reduction for LamportFastMutEx-COL-7-UpperBounds-04
Normalized transition count is 322 out of 448 initially.
// Phase 1: matrix 322 rows 198 cols
[2023-03-12 19:39:19] [INFO ] Computed 58 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :1
[2023-03-12 19:39:19] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-12 19:39:19] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-12 19:39:19] [INFO ] [Real]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-12 19:39:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:39:19] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-12 19:39:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:39:19] [INFO ] [Nat]Absence check using 58 positive place invariants in 8 ms returned sat
[2023-03-12 19:39:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:39:19] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-12 19:39:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 19:39:19] [INFO ] [Nat]Added 42 Read/Feed constraints in 9 ms returned sat
[2023-03-12 19:39:19] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 25 ms.
[2023-03-12 19:39:19] [INFO ] Added : 46 causal constraints over 10 iterations in 261 ms. Result :sat
Minimization took 84 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[4]
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 7 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 7 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-12 19:39:20] [INFO ] Computed 58 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1921 ms. (steps per millisecond=520 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 586 ms. (steps per millisecond=1706 ) properties (out of 1) seen :1
[2023-03-12 19:39:22] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-12 19:39:22] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-12 19:39:22] [INFO ] [Real]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-12 19:39:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:39:22] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2023-03-12 19:39:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:39:22] [INFO ] [Nat]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-12 19:39:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:39:22] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-12 19:39:22] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 19:39:22] [INFO ] [Nat]Added 42 Read/Feed constraints in 8 ms returned sat
[2023-03-12 19:39:22] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 18 ms.
[2023-03-12 19:39:23] [INFO ] Added : 114 causal constraints over 23 iterations in 542 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[6]
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 6 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 6 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 6 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-12 19:39:23] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-12 19:39:23] [INFO ] Invariant cache hit.
[2023-03-12 19:39:23] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-12 19:39:23] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-12 19:39:23] [INFO ] Invariant cache hit.
[2023-03-12 19:39:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 19:39:24] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
[2023-03-12 19:39:24] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-12 19:39:24] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-12 19:39:24] [INFO ] Invariant cache hit.
[2023-03-12 19:39:24] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 582 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-12 19:39:24] [INFO ] Computed 58 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1912 ms. (steps per millisecond=523 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 585 ms. (steps per millisecond=1709 ) properties (out of 1) seen :1
[2023-03-12 19:39:26] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
// Phase 1: matrix 322 rows 198 cols
[2023-03-12 19:39:26] [INFO ] Computed 58 place invariants in 8 ms
[2023-03-12 19:39:26] [INFO ] [Real]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-12 19:39:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 19:39:26] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-12 19:39:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 19:39:26] [INFO ] [Nat]Absence check using 58 positive place invariants in 9 ms returned sat
[2023-03-12 19:39:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 19:39:27] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-12 19:39:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 19:39:27] [INFO ] [Nat]Added 42 Read/Feed constraints in 8 ms returned sat
[2023-03-12 19:39:27] [INFO ] Computed and/alt/rep : 280/1652/280 causal constraints (skipped 35 transitions) in 18 ms.
[2023-03-12 19:39:27] [INFO ] Added : 114 causal constraints over 23 iterations in 559 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : [7] Max seen :[6]
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 6 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 6 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 6 ms. Remains 198 /198 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2023-03-12 19:39:27] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-12 19:39:27] [INFO ] Invariant cache hit.
[2023-03-12 19:39:28] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-12 19:39:28] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-12 19:39:28] [INFO ] Invariant cache hit.
[2023-03-12 19:39:28] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-12 19:39:28] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2023-03-12 19:39:28] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-12 19:39:28] [INFO ] Flow matrix only has 322 transitions (discarded 126 similar events)
[2023-03-12 19:39:28] [INFO ] Invariant cache hit.
[2023-03-12 19:39:28] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 566 ms. Remains : 198/198 places, 448/448 transitions.
Ending property specific reduction for LamportFastMutEx-COL-7-UpperBounds-04 in 9040 ms.
[2023-03-12 19:39:28] [INFO ] Flatten gal took : 59 ms
[2023-03-12 19:39:28] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-12 19:39:28] [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 68294 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running LamportFastMutEx (COL), instance 7
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 198 places, 448 transitions, 2212 arcs.
Final Score: 7659.251
Took : 21 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 158460 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16305328 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
Caught signal 15, terminating.

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="smartxred"
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 smartxred"
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 r235-tall-167856421700381"
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 ;