About the Execution of Marcie+red for LamportFastMutEx-COL-6
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9752.808 | 3600000.00 | 3636258.00 | 8001.10 | 6 1 ? 6 30 6 5 5 6 5 1 6 6 5 5 5 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r234-tall-167856420200373.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 marciexred
Input is LamportFastMutEx-COL-6, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420200373
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.1K Feb 25 13:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 13:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 13:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 13:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 8.2K Feb 25 13:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 13:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Feb 25 13:43 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 42K 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-6-UpperBounds-00
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-01
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-02
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-03
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-04
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-05
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-06
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-07
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-08
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-09
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-10
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-11
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-12
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-13
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-14
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679485357932
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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-6
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 11:42:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 11:42:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 11:42:39] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-22 11:42:39] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 11:42:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 667 ms
[2023-03-22 11:42:40] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 217 PT places and 525.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-22 11:42:40] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2023-03-22 11:42:40] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 17 rows 15 cols
[2023-03-22 11:42:40] [INFO ] Computed 2 place invariants in 3 ms
FORMULA LamportFastMutEx-COL-6-UpperBounds-12 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-6-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-6-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-6-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-22 11:42:40] [INFO ] Invariant cache hit.
[2023-03-22 11:42:40] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-22 11:42:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:40] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-22 11:42:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:42:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 11:42:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:40] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-22 11:42:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 11:42:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 11:42:40] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 11:42:40] [INFO ] Added : 5 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2023-03-22 11:42:40] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 11:42:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:40] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-22 11:42:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:42:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 11:42:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:40] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-22 11:42:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 11:42:40] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 11:42:40] [INFO ] Added : 5 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 11:42:40] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 11:42:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:40] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-22 11:42:40] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-22 11:42:40] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 11:42:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:42:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 11:42:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:40] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-22 11:42:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 12 ms returned sat
[2023-03-22 11:42:40] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-22 11:42:40] [INFO ] Added : 5 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 11:42:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 11:42:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:40] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 11:42:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:42:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 11:42:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:40] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-22 11:42:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-22 11:42:40] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 11:42:40] [INFO ] Added : 11 causal constraints over 3 iterations in 13 ms. Result :sat
Minimization took 8 ms.
[2023-03-22 11:42:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 11:42:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:40] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 11:42:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:42:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 11:42:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:40] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-22 11:42:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 11:42:40] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 11:42:40] [INFO ] Added : 11 causal constraints over 3 iterations in 12 ms. Result :sat
Minimization took 7 ms.
[2023-03-22 11:42:40] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-22 11:42:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:40] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 11:42:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:42:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 11:42:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:40] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 11:42:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 11:42:40] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 11:42:40] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 11:42:40] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 11:42:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:40] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 11:42:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:42:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 11:42:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:40] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 11:42:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 11:42:40] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 11:42:40] [INFO ] Added : 5 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 11:42:41] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-22 11:42:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:41] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 11:42:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:42:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 11:42:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:41] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-22 11:42:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 11:42:41] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 11:42:41] [INFO ] Added : 7 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 7 ms.
[2023-03-22 11:42:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 11:42:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:41] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-22 11:42:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:42:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-22 11:42:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:41] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-22 11:42:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 11:42:41] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 11:42:41] [INFO ] Added : 5 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 11:42:41] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-22 11:42:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:41] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 11:42:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:42:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 11:42:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:41] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 11:42:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 11:42:41] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 11:42:41] [INFO ] Added : 11 causal constraints over 3 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 11:42:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 11:42:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:41] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-22 11:42:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:42:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 11:42:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:41] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 11:42:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 11:42:41] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 11:42:41] [INFO ] Added : 7 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 11:42:41] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-22 11:42:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:41] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-22 11:42:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:42:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 11:42:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:41] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-22 11:42:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-22 11:42:41] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 11:42:41] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [6, 6, 6, 36, 6, 6, 6, 6, 6, 6, 6, 6]
Domain [pid(7), pid(7)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-22 11:42:41] [INFO ] Unfolded HLPN to a Petri net with 217 places and 420 transitions 1834 arcs in 25 ms.
[2023-03-22 11:42:41] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 66 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :66
FORMULA LamportFastMutEx-COL-6-UpperBounds-08 6 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :50
FORMULA LamportFastMutEx-COL-6-UpperBounds-00 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :41
FORMULA LamportFastMutEx-COL-6-UpperBounds-03 6 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 9) seen :39
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :43
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :40
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :52
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :43
[2023-03-22 11:42:41] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2023-03-22 11:42:41] [INFO ] Computed 50 place invariants in 10 ms
[2023-03-22 11:42:41] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-22 11:42:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:41] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2023-03-22 11:42:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:42:41] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2023-03-22 11:42:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:41] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-22 11:42:41] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-22 11:42:41] [INFO ] [Nat]Added 72 Read/Feed constraints in 19 ms returned sat
[2023-03-22 11:42:42] [INFO ] Deduced a trap composed of 18 places in 220 ms of which 6 ms to minimize.
[2023-03-22 11:42:42] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2023-03-22 11:42:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 309 ms
[2023-03-22 11:42:42] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 24 ms.
[2023-03-22 11:42:42] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2023-03-22 11:42:42] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2023-03-22 11:42:42] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 0 ms to minimize.
[2023-03-22 11:42:42] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2023-03-22 11:42:43] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2023-03-22 11:42:43] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2023-03-22 11:42:43] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2023-03-22 11:42:43] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 0 ms to minimize.
[2023-03-22 11:42:43] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2023-03-22 11:42:43] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 0 ms to minimize.
[2023-03-22 11:42:43] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2023-03-22 11:42:43] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2023-03-22 11:42:43] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1011 ms
[2023-03-22 11:42:43] [INFO ] Added : 116 causal constraints over 25 iterations in 1499 ms. Result :sat
Minimization took 167 ms.
[2023-03-22 11:42:43] [INFO ] [Real]Absence check using 50 positive place invariants in 13 ms returned sat
[2023-03-22 11:42:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:43] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-22 11:42:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:42:44] [INFO ] [Nat]Absence check using 50 positive place invariants in 11 ms returned sat
[2023-03-22 11:42:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:44] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-22 11:42:44] [INFO ] [Nat]Added 72 Read/Feed constraints in 34 ms returned sat
[2023-03-22 11:42:44] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 0 ms to minimize.
[2023-03-22 11:42:44] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2023-03-22 11:42:44] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2023-03-22 11:42:44] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2023-03-22 11:42:44] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2023-03-22 11:42:44] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2023-03-22 11:42:44] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2023-03-22 11:42:44] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 2 ms to minimize.
[2023-03-22 11:42:44] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2023-03-22 11:42:44] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2023-03-22 11:42:44] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2023-03-22 11:42:44] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2023-03-22 11:42:44] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2023-03-22 11:42:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 832 ms
[2023-03-22 11:42:44] [INFO ] [Real]Absence check using 50 positive place invariants in 12 ms returned sat
[2023-03-22 11:42:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:45] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-22 11:42:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:42:45] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 11:42:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:45] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-22 11:42:45] [INFO ] [Nat]Added 72 Read/Feed constraints in 19 ms returned sat
[2023-03-22 11:42:45] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2023-03-22 11:42:45] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2023-03-22 11:42:45] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2023-03-22 11:42:45] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2023-03-22 11:42:45] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2023-03-22 11:42:45] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2023-03-22 11:42:45] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2023-03-22 11:42:45] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2023-03-22 11:42:45] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 446 ms
[2023-03-22 11:42:45] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 19 ms.
[2023-03-22 11:42:46] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2023-03-22 11:42:46] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2023-03-22 11:42:46] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2023-03-22 11:42:46] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2023-03-22 11:42:46] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2023-03-22 11:42:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 387 ms
[2023-03-22 11:42:46] [INFO ] Added : 169 causal constraints over 35 iterations in 1168 ms. Result :sat
Minimization took 98 ms.
[2023-03-22 11:42:46] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 11:42:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:46] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-22 11:42:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:42:47] [INFO ] [Nat]Absence check using 50 positive place invariants in 14 ms returned sat
[2023-03-22 11:42:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:47] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-22 11:42:47] [INFO ] [Nat]Added 72 Read/Feed constraints in 9 ms returned sat
[2023-03-22 11:42:47] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2023-03-22 11:42:47] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2023-03-22 11:42:47] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2023-03-22 11:42:47] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2023-03-22 11:42:47] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2023-03-22 11:42:47] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 0 ms to minimize.
[2023-03-22 11:42:47] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2023-03-22 11:42:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 452 ms
[2023-03-22 11:42:47] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 17 ms.
[2023-03-22 11:42:47] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2023-03-22 11:42:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-22 11:42:48] [INFO ] Added : 93 causal constraints over 20 iterations in 462 ms. Result :sat
Minimization took 123 ms.
[2023-03-22 11:42:48] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 11:42:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:48] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-22 11:42:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:42:48] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 11:42:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:48] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-22 11:42:48] [INFO ] [Nat]Added 72 Read/Feed constraints in 16 ms returned sat
[2023-03-22 11:42:48] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2023-03-22 11:42:48] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2023-03-22 11:42:48] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2023-03-22 11:42:48] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2023-03-22 11:42:48] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2023-03-22 11:42:48] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2023-03-22 11:42:48] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2023-03-22 11:42:48] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2023-03-22 11:42:48] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 4 ms to minimize.
[2023-03-22 11:42:48] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2023-03-22 11:42:48] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2023-03-22 11:42:48] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2023-03-22 11:42:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 607 ms
[2023-03-22 11:42:49] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 11:42:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:49] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-22 11:42:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:42:49] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 11:42:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:49] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-22 11:42:49] [INFO ] [Nat]Added 72 Read/Feed constraints in 7 ms returned sat
[2023-03-22 11:42:49] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 20 ms.
[2023-03-22 11:42:49] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2023-03-22 11:42:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-22 11:42:49] [INFO ] Added : 79 causal constraints over 18 iterations in 380 ms. Result :sat
Minimization took 116 ms.
[2023-03-22 11:42:49] [INFO ] [Real]Absence check using 50 positive place invariants in 10 ms returned sat
[2023-03-22 11:42:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:49] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-22 11:42:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:42:49] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-22 11:42:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:49] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-22 11:42:49] [INFO ] [Nat]Added 72 Read/Feed constraints in 21 ms returned sat
[2023-03-22 11:42:49] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2023-03-22 11:42:50] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2023-03-22 11:42:50] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2023-03-22 11:42:50] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2023-03-22 11:42:50] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 2 ms to minimize.
[2023-03-22 11:42:50] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2023-03-22 11:42:50] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2023-03-22 11:42:50] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 5 ms to minimize.
[2023-03-22 11:42:50] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2023-03-22 11:42:50] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2023-03-22 11:42:50] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2023-03-22 11:42:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 570 ms
[2023-03-22 11:42:50] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-22 11:42:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:50] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-22 11:42:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:42:50] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-22 11:42:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:50] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-22 11:42:50] [INFO ] [Nat]Added 72 Read/Feed constraints in 13 ms returned sat
[2023-03-22 11:42:50] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2023-03-22 11:42:50] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-22 11:42:50] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 0 ms to minimize.
[2023-03-22 11:42:50] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2023-03-22 11:42:51] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2023-03-22 11:42:51] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2023-03-22 11:42:51] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2023-03-22 11:42:51] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2023-03-22 11:42:51] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2023-03-22 11:42:51] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2023-03-22 11:42:51] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2023-03-22 11:42:51] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2023-03-22 11:42:51] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2023-03-22 11:42:51] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2023-03-22 11:42:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 845 ms
[2023-03-22 11:42:51] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 11:42:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:51] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-22 11:42:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:42:51] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 11:42:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:51] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-22 11:42:51] [INFO ] [Nat]Added 72 Read/Feed constraints in 13 ms returned sat
[2023-03-22 11:42:51] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2023-03-22 11:42:51] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 0 ms to minimize.
[2023-03-22 11:42:51] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 0 ms to minimize.
[2023-03-22 11:42:51] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2023-03-22 11:42:52] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2023-03-22 11:42:52] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2023-03-22 11:42:52] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2023-03-22 11:42:52] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2023-03-22 11:42:52] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 0 ms to minimize.
[2023-03-22 11:42:52] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2023-03-22 11:42:52] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2023-03-22 11:42:52] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2023-03-22 11:42:52] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2023-03-22 11:42:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 859 ms
Current structural bounds on expressions (after SMT) : [6, 30, 6, 6, 5, 6, 5, 5, 5] Max seen :[1, 30, 4, 4, 5, 3, 5, 5, 5]
FORMULA LamportFastMutEx-COL-6-UpperBounds-15 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-14 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-13 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-09 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-04 30 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-11 6 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 18 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 354/354 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 170 transition count 348
Applied a total of 12 rules in 40 ms. Remains 170 /176 variables (removed 6) and now considering 348/354 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 170/176 places, 348/354 transitions.
Normalized transition count is 258 out of 348 initially.
// Phase 1: matrix 258 rows 170 cols
[2023-03-22 11:42:53] [INFO ] Computed 50 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2036 ms. (steps per millisecond=491 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 587 ms. (steps per millisecond=1703 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 430 ms. (steps per millisecond=2325 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 559 ms. (steps per millisecond=1788 ) properties (out of 3) seen :10
[2023-03-22 11:42:56] [INFO ] Flow matrix only has 258 transitions (discarded 90 similar events)
// Phase 1: matrix 258 rows 170 cols
[2023-03-22 11:42:56] [INFO ] Computed 50 place invariants in 6 ms
[2023-03-22 11:42:56] [INFO ] [Real]Absence check using 50 positive place invariants in 7 ms returned sat
[2023-03-22 11:42:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:56] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-22 11:42:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:42:56] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2023-03-22 11:42:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:56] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-22 11:42:56] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-22 11:42:56] [INFO ] [Nat]Added 72 Read/Feed constraints in 10 ms returned sat
[2023-03-22 11:42:57] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 0 ms to minimize.
[2023-03-22 11:42:57] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2023-03-22 11:42:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 125 ms
[2023-03-22 11:42:57] [INFO ] Computed and/alt/rep : 228/1284/228 causal constraints (skipped 24 transitions) in 25 ms.
[2023-03-22 11:42:57] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2023-03-22 11:42:57] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2023-03-22 11:42:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 126 ms
[2023-03-22 11:42:57] [INFO ] Added : 103 causal constraints over 21 iterations in 564 ms. Result :sat
Minimization took 173 ms.
[2023-03-22 11:42:57] [INFO ] [Real]Absence check using 50 positive place invariants in 7 ms returned sat
[2023-03-22 11:42:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:57] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-22 11:42:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:42:57] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 11:42:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:58] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-22 11:42:58] [INFO ] [Nat]Added 72 Read/Feed constraints in 25 ms returned sat
[2023-03-22 11:42:58] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2023-03-22 11:42:58] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2023-03-22 11:42:58] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2023-03-22 11:42:58] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2023-03-22 11:42:58] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 0 ms to minimize.
[2023-03-22 11:42:58] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2023-03-22 11:42:58] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2023-03-22 11:42:58] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2023-03-22 11:42:58] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2023-03-22 11:42:58] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2023-03-22 11:42:58] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2023-03-22 11:42:58] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2023-03-22 11:42:58] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2023-03-22 11:42:58] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2023-03-22 11:42:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 676 ms
[2023-03-22 11:42:58] [INFO ] [Real]Absence check using 50 positive place invariants in 7 ms returned sat
[2023-03-22 11:42:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:58] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-22 11:42:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:42:58] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 11:42:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:42:58] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-22 11:42:58] [INFO ] [Nat]Added 72 Read/Feed constraints in 12 ms returned sat
[2023-03-22 11:42:59] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2023-03-22 11:42:59] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2023-03-22 11:42:59] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2023-03-22 11:42:59] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2023-03-22 11:42:59] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2023-03-22 11:42:59] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2023-03-22 11:42:59] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2023-03-22 11:42:59] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2023-03-22 11:42:59] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2023-03-22 11:42:59] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2023-03-22 11:42:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 579 ms
Current structural bounds on expressions (after SMT) : [6, 5, 5] Max seen :[1, 5, 5]
FORMULA LamportFastMutEx-COL-6-UpperBounds-07 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-06 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 6 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 348/348 transitions.
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 170 transition count 342
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 164 transition count 342
Applied a total of 12 rules in 29 ms. Remains 164 /170 variables (removed 6) and now considering 342/348 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 164/170 places, 342/348 transitions.
Normalized transition count is 252 out of 342 initially.
// Phase 1: matrix 252 rows 164 cols
[2023-03-22 11:42:59] [INFO ] Computed 50 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1719 ms. (steps per millisecond=581 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 559 ms. (steps per millisecond=1788 ) properties (out of 1) seen :1
[2023-03-22 11:43:01] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 164 cols
[2023-03-22 11:43:01] [INFO ] Computed 50 place invariants in 4 ms
[2023-03-22 11:43:01] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-22 11:43:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:43:01] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-22 11:43:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:43:02] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2023-03-22 11:43:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:43:02] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-22 11:43:02] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-22 11:43:02] [INFO ] [Nat]Added 72 Read/Feed constraints in 9 ms returned sat
[2023-03-22 11:43:02] [INFO ] Computed and/alt/rep : 216/1194/216 causal constraints (skipped 30 transitions) in 20 ms.
[2023-03-22 11:43:02] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2023-03-22 11:43:02] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 0 ms to minimize.
[2023-03-22 11:43:02] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 0 ms to minimize.
[2023-03-22 11:43:02] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2023-03-22 11:43:02] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2023-03-22 11:43:02] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 0 ms to minimize.
[2023-03-22 11:43:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 521 ms
[2023-03-22 11:43:02] [INFO ] Added : 63 causal constraints over 13 iterations in 784 ms. Result :sat
Minimization took 131 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Support contains 6 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 342/342 transitions.
Applied a total of 0 rules in 12 ms. Remains 164 /164 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 164/164 places, 342/342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 342/342 transitions.
Applied a total of 0 rules in 10 ms. Remains 164 /164 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2023-03-22 11:43:03] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2023-03-22 11:43:03] [INFO ] Invariant cache hit.
[2023-03-22 11:43:03] [INFO ] Implicit Places using invariants in 137 ms returned [104, 105, 106, 107, 108, 109]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 138 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 158/164 places, 342/342 transitions.
Applied a total of 0 rules in 9 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 158 ms. Remains : 158/164 places, 342/342 transitions.
Normalized transition count is 252 out of 342 initially.
// Phase 1: matrix 252 rows 158 cols
[2023-03-22 11:43:03] [INFO ] Computed 44 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1649 ms. (steps per millisecond=606 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 548 ms. (steps per millisecond=1824 ) properties (out of 1) seen :1
[2023-03-22 11:43:05] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2023-03-22 11:43:05] [INFO ] Computed 44 place invariants in 5 ms
[2023-03-22 11:43:05] [INFO ] [Real]Absence check using 44 positive place invariants in 7 ms returned sat
[2023-03-22 11:43:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:43:05] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-22 11:43:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:43:05] [INFO ] [Nat]Absence check using 44 positive place invariants in 7 ms returned sat
[2023-03-22 11:43:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:43:05] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-22 11:43:05] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 11:43:05] [INFO ] [Nat]Added 36 Read/Feed constraints in 6 ms returned sat
[2023-03-22 11:43:05] [INFO ] Computed and/alt/rep : 216/1122/216 causal constraints (skipped 30 transitions) in 17 ms.
[2023-03-22 11:43:05] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2023-03-22 11:43:06] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2023-03-22 11:43:06] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2023-03-22 11:43:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 231 ms
[2023-03-22 11:43:06] [INFO ] Added : 65 causal constraints over 14 iterations in 480 ms. Result :sat
Minimization took 115 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 8 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 158/158 places, 342/342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2023-03-22 11:43:06] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2023-03-22 11:43:06] [INFO ] Invariant cache hit.
[2023-03-22 11:43:06] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-22 11:43:06] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2023-03-22 11:43:06] [INFO ] Invariant cache hit.
[2023-03-22 11:43:06] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 11:43:06] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2023-03-22 11:43:06] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-22 11:43:06] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2023-03-22 11:43:06] [INFO ] Invariant cache hit.
[2023-03-22 11:43:06] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 484 ms. Remains : 158/158 places, 342/342 transitions.
Starting property specific reduction for LamportFastMutEx-COL-6-UpperBounds-02
Normalized transition count is 252 out of 342 initially.
// Phase 1: matrix 252 rows 158 cols
[2023-03-22 11:43:06] [INFO ] Computed 44 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :1
[2023-03-22 11:43:06] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2023-03-22 11:43:06] [INFO ] Computed 44 place invariants in 2 ms
[2023-03-22 11:43:06] [INFO ] [Real]Absence check using 44 positive place invariants in 6 ms returned sat
[2023-03-22 11:43:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:43:06] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-22 11:43:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:43:06] [INFO ] [Nat]Absence check using 44 positive place invariants in 8 ms returned sat
[2023-03-22 11:43:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:43:07] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-22 11:43:07] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 11:43:07] [INFO ] [Nat]Added 36 Read/Feed constraints in 6 ms returned sat
[2023-03-22 11:43:07] [INFO ] Computed and/alt/rep : 216/1122/216 causal constraints (skipped 30 transitions) in 15 ms.
[2023-03-22 11:43:07] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 0 ms to minimize.
[2023-03-22 11:43:07] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2023-03-22 11:43:07] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2023-03-22 11:43:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 207 ms
[2023-03-22 11:43:07] [INFO ] Added : 65 causal constraints over 14 iterations in 450 ms. Result :sat
Minimization took 106 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 158/158 places, 342/342 transitions.
Normalized transition count is 252 out of 342 initially.
// Phase 1: matrix 252 rows 158 cols
[2023-03-22 11:43:07] [INFO ] Computed 44 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1655 ms. (steps per millisecond=604 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 573 ms. (steps per millisecond=1745 ) properties (out of 1) seen :1
[2023-03-22 11:43:09] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2023-03-22 11:43:09] [INFO ] Computed 44 place invariants in 3 ms
[2023-03-22 11:43:09] [INFO ] [Real]Absence check using 44 positive place invariants in 7 ms returned sat
[2023-03-22 11:43:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 11:43:09] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-22 11:43:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 11:43:10] [INFO ] [Nat]Absence check using 44 positive place invariants in 6 ms returned sat
[2023-03-22 11:43:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 11:43:10] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-22 11:43:10] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 11:43:10] [INFO ] [Nat]Added 36 Read/Feed constraints in 6 ms returned sat
[2023-03-22 11:43:10] [INFO ] Computed and/alt/rep : 216/1122/216 causal constraints (skipped 30 transitions) in 17 ms.
[2023-03-22 11:43:10] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 0 ms to minimize.
[2023-03-22 11:43:10] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2023-03-22 11:43:10] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2023-03-22 11:43:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 228 ms
[2023-03-22 11:43:10] [INFO ] Added : 65 causal constraints over 14 iterations in 469 ms. Result :sat
Minimization took 107 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 8 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 158/158 places, 342/342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 7 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2023-03-22 11:43:10] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2023-03-22 11:43:10] [INFO ] Invariant cache hit.
[2023-03-22 11:43:10] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-22 11:43:10] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2023-03-22 11:43:10] [INFO ] Invariant cache hit.
[2023-03-22 11:43:10] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 11:43:11] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2023-03-22 11:43:11] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-22 11:43:11] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
[2023-03-22 11:43:11] [INFO ] Invariant cache hit.
[2023-03-22 11:43:11] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 570 ms. Remains : 158/158 places, 342/342 transitions.
Ending property specific reduction for LamportFastMutEx-COL-6-UpperBounds-02 in 4545 ms.
[2023-03-22 11:43:11] [INFO ] Flatten gal took : 96 ms
[2023-03-22 11:43:11] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-22 11:43:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 158 places, 342 transitions and 1638 arcs took 4 ms.
Total runtime 32201 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: LamportFastMutEx_COL_6_unf
(NrP: 158 NrTr: 342 NrArc: 1638)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.005sec
net check time: 0m 0.000sec
init dd package: 0m 2.732sec
before gc: list nodes free: 781035
after gc: idd nodes used:966075, unused:63033925; list nodes free:272618551
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 6389436 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16095032 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
25991 76650 138828 166872 194643 237253 264839 304925 358322 674561 955346 967953 973218 919212
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-6"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is LamportFastMutEx-COL-6, 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 r234-tall-167856420200373"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-6.tgz
mv LamportFastMutEx-COL-6 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;