Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r126-tall-174876436600384.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is LamportFastMutEx-COL-4, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tall-174876436600384
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 40K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1748789643057

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=LamportFastMutEx-COL-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 14:54:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-01 14:54:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 14:54:04] [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.
[2025-06-01 14:54:04] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-01 14:54:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 580 ms
[2025-06-01 14:54:05] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 135 PT places and 285.0 transition bindings in 17 ms.
[2025-06-01 14:54:05] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2025-06-01 14:54:05] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2025-06-01 14:54:05] [INFO ] Unfolded HLPN to a Petri net with 135 places and 230 transitions 990 arcs in 20 ms.
[2025-06-01 14:54:05] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2025-06-01 14:54:05] [INFO ] Unfolded HLPN to a Petri net with 135 places and 230 transitions 990 arcs in 6 ms.
[2025-06-01 14:54:05] [INFO ] Unfolded 17 HLPN properties in 0 ms.
[2025-06-01 14:54:05] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 1 ms.
[2025-06-01 14:54:05] [INFO ] Skeletonized 17 HLPN properties in 3 ms.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Domain [pid(5), pid(5)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2025-06-01 14:54:05] [INFO ] Unfolded HLPN to a Petri net with 135 places and 230 transitions 990 arcs in 13 ms.
[2025-06-01 14:54:05] [INFO ] Unfolded 17 HLPN properties in 1 ms.
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 50 transitions.
Built sparse matrix representations for Structural reductions in 1 ms.32290KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 102/102 places, 180/180 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Applied a total of 0 rules in 23 ms. Remains 102 /102 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 34 ms. Remains : 102/102 places, 180/180 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 102/102 places, 180/180 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Applied a total of 0 rules in 10 ms. Remains 102 /102 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2025-06-01 14:54:05] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 102 cols
[2025-06-01 14:54:05] [INFO ] Computed 26 invariants in 13 ms
[2025-06-01 14:54:05] [INFO ] Implicit Places using invariants in 167 ms returned []
[2025-06-01 14:54:05] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2025-06-01 14:54:05] [INFO ] Invariant cache hit.
[2025-06-01 14:54:05] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-06-01 14:54:05] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2025-06-01 14:54:05] [INFO ] Redundant transitions in 5 ms returned []
Running 176 sub problems to find dead transitions.
[2025-06-01 14:54:05] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
[2025-06-01 14:54:05] [INFO ] Invariant cache hit.
[2025-06-01 14:54:05] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2025-06-01 14:54:06] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 16 ms to minimize.
[2025-06-01 14:54:06] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 7 ms to minimize.
[2025-06-01 14:54:06] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2025-06-01 14:54:06] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2025-06-01 14:54:06] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2025-06-01 14:54:06] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2025-06-01 14:54:06] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2025-06-01 14:54:06] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
[2025-06-01 14:54:06] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2025-06-01 14:54:06] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2025-06-01 14:54:06] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2025-06-01 14:54:06] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2025-06-01 14:54:06] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2025-06-01 14:54:06] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2025-06-01 14:54:07] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 2 ms to minimize.
[2025-06-01 14:54:07] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2025-06-01 14:54:07] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2025-06-01 14:54:07] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2025-06-01 14:54:07] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 5 ms to minimize.
[2025-06-01 14:54:07] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD79 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 20/46 constraints. Problems are: Problem set: 5 solved, 171 unsolved
[2025-06-01 14:54:07] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2025-06-01 14:54:07] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2025-06-01 14:54:07] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 5 ms to minimize.
[2025-06-01 14:54:07] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2025-06-01 14:54:07] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2025-06-01 14:54:07] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2025-06-01 14:54:07] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2025-06-01 14:54:07] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2025-06-01 14:54:07] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2025-06-01 14:54:07] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2025-06-01 14:54:08] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2025-06-01 14:54:08] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2025-06-01 14:54:08] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
[2025-06-01 14:54:08] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 2 ms to minimize.
[2025-06-01 14:54:08] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 4 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
[2025-06-01 14:54:08] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2025-06-01 14:54:08] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
Problem TDEAD47 is UNSAT
[2025-06-01 14:54:08] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2025-06-01 14:54:08] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2025-06-01 14:54:08] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 20/66 constraints. Problems are: Problem set: 23 solved, 153 unsolved
[2025-06-01 14:54:08] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2025-06-01 14:54:08] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2025-06-01 14:54:08] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2025-06-01 14:54:08] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2025-06-01 14:54:08] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2025-06-01 14:54:08] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2025-06-01 14:54:08] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2025-06-01 14:54:08] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2025-06-01 14:54:09] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2025-06-01 14:54:09] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2025-06-01 14:54:09] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 2 ms to minimize.
[2025-06-01 14:54:09] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 0 ms to minimize.
Problem TDEAD80 is UNSAT
[2025-06-01 14:54:09] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2025-06-01 14:54:09] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2025-06-01 14:54:09] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2025-06-01 14:54:09] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2025-06-01 14:54:09] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 10 ms to minimize.
[2025-06-01 14:54:09] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2025-06-01 14:54:09] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2025-06-01 14:54:10] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
Problem TDEAD80 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 20/86 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2025-06-01 14:54:10] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2025-06-01 14:54:10] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
[2025-06-01 14:54:10] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2025-06-01 14:54:10] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2025-06-01 14:54:10] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2025-06-01 14:54:10] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2025-06-01 14:54:10] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2025-06-01 14:54:11] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2025-06-01 14:54:11] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2025-06-01 14:54:11] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 10/96 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2025-06-01 14:54:11] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 4 ms to minimize.
[2025-06-01 14:54:11] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 0 ms to minimize.
[2025-06-01 14:54:11] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2025-06-01 14:54:11] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 4/100 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2025-06-01 14:54:12] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2025-06-01 14:54:12] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 2/102 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2025-06-01 14:54:12] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2025-06-01 14:54:13] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2025-06-01 14:54:13] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2025-06-01 14:54:13] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 2 ms to minimize.
[2025-06-01 14:54:13] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2025-06-01 14:54:13] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2025-06-01 14:54:13] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 7/109 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2025-06-01 14:54:13] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2025-06-01 14:54:14] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 2 ms to minimize.
[2025-06-01 14:54:14] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2025-06-01 14:54:14] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2025-06-01 14:54:14] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2025-06-01 14:54:14] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2025-06-01 14:54:14] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 7/116 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2025-06-01 14:54:14] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2025-06-01 14:54:14] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2025-06-01 14:54:14] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2025-06-01 14:54:15] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2025-06-01 14:54:15] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2025-06-01 14:54:15] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2025-06-01 14:54:15] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2025-06-01 14:54:15] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2025-06-01 14:54:15] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2025-06-01 14:54:15] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2025-06-01 14:54:15] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2025-06-01 14:54:15] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2025-06-01 14:54:15] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2025-06-01 14:54:15] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 0 ms to minimize.
[2025-06-01 14:54:15] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 15/131 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2025-06-01 14:54:16] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2025-06-01 14:54:16] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2025-06-01 14:54:16] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2025-06-01 14:54:16] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2025-06-01 14:54:16] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 5/136 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/136 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 12 (OVERLAPS) 144/246 variables, 102/238 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 40/278 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2025-06-01 14:54:18] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2025-06-01 14:54:18] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 2/280 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 0/280 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 16 (OVERLAPS) 0/246 variables, 0/280 constraints. Problems are: Problem set: 24 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 280 constraints, problems are : Problem set: 24 solved, 152 unsolved in 15999 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 112/112 constraints]
Escalating to Integer solving :Problem set: 24 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 6/6 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 60/66 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/66 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 4/102 variables, 20/86 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 52/138 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2025-06-01 14:54:22] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2025-06-01 14:54:22] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2025-06-01 14:54:22] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
[2025-06-01 14:54:22] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2025-06-01 14:54:22] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2025-06-01 14:54:22] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 2 ms to minimize.
[2025-06-01 14:54:22] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2025-06-01 14:54:22] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 8/146 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/146 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 144/246 variables, 102/248 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 40/288 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 152/440 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2025-06-01 14:54:25] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2025-06-01 14:54:25] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2025-06-01 14:54:25] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2025-06-01 14:54:25] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2025-06-01 14:54:26] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 5/445 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2025-06-01 14:54:27] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2025-06-01 14:54:27] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2025-06-01 14:54:28] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 3/448 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2025-06-01 14:54:30] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2025-06-01 14:54:30] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2025-06-01 14:54:31] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2025-06-01 14:54:31] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2025-06-01 14:54:31] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2025-06-01 14:54:31] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/246 variables, 6/454 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2025-06-01 14:54:33] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2025-06-01 14:54:33] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2025-06-01 14:54:33] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/246 variables, 3/457 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2025-06-01 14:54:36] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2025-06-01 14:54:36] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 2/459 constraints. Problems are: Problem set: 24 solved, 152 unsolved
[2025-06-01 14:54:39] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2025-06-01 14:54:39] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2025-06-01 14:54:39] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2025-06-01 14:54:39] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2025-06-01 14:54:40] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2025-06-01 14:54:40] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2025-06-01 14:54:40] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 7/466 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/246 variables, 0/466 constraints. Problems are: Problem set: 24 solved, 152 unsolved
At refinement iteration 17 (OVERLAPS) 0/246 variables, 0/466 constraints. Problems are: Problem set: 24 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 466 constraints, problems are : Problem set: 24 solved, 152 unsolved in 26255 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 152/176 constraints, Known Traps: 146/146 constraints]
After SMT, in 42396ms problems are : Problem set: 24 solved, 152 unsolved
Search for dead transitions found 24 dead transitions in 42409ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 102/102 places, 156/180 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Applied a total of 0 rules in 7 ms. Remains 102 /102 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2025-06-01 14:54:47] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in DEADLOCK mode , in 2 iterations and 42756 ms. Remains : 102/102 places, 156/180 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1528 ms (no deadlock found). (steps per millisecond=818 )
Random directed walk for 1250002 steps, including 0 resets, run took 1214 ms (no deadlock found). (steps per millisecond=1029 )
[2025-06-01 14:54:50] [INFO ] Flow matrix only has 128 transitions (discarded 28 similar events)
// Phase 1: matrix 128 rows 102 cols
[2025-06-01 14:54:50] [INFO ] Computed 26 invariants in 6 ms
[2025-06-01 14:54:50] [INFO ] [Real]Absence check using 26 positive place invariants in 6 ms returned sat
[2025-06-01 14:54:50] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2025-06-01 14:54:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 14:54:50] [INFO ] [Nat]Absence check using 26 positive place invariants in 6 ms returned sat
[2025-06-01 14:54:50] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2025-06-01 14:54:50] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-06-01 14:54:50] [INFO ] [Nat]Added 36 Read/Feed constraints in 7 ms returned sat
[2025-06-01 14:54:50] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2025-06-01 14:54:51] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2025-06-01 14:54:51] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2025-06-01 14:54:51] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2025-06-01 14:54:51] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2025-06-01 14:54:51] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2025-06-01 14:54:51] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2025-06-01 14:54:51] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2025-06-01 14:54:51] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2025-06-01 14:54:51] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2025-06-01 14:54:51] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2025-06-01 14:54:51] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2025-06-01 14:54:51] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2025-06-01 14:54:51] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2025-06-01 14:54:51] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2025-06-01 14:54:51] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2025-06-01 14:54:51] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2025-06-01 14:54:51] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2025-06-01 14:54:51] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2025-06-01 14:54:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 19 trap constraints in 845 ms
[2025-06-01 14:54:51] [INFO ] Unfolded HLPN to a Petri net with 135 places and 230 transitions 990 arcs in 3 ms.
[2025-06-01 14:54:51] [INFO ] Unfolded 17 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 50 transitions.
RANDOM walk for 230 steps (0 resets) in 35 ms. (6 steps per ms) remains 0/16 properties
Able to resolve query QuasiLiveness after proving 17 properties.
Net is quasi-live, checking if it is reversible to establish liveness.
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 50 transitions.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 50 transitions.
Unable to solve all queries for examination Liveness. Remains :17 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 17 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 47509 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running LamportFastMutEx-COL-4

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 18
TRANSITIONS: 17
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 4
COLOR VARS: 5
ARCS: 68
LOADING TIME: 0.147

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 135
TRANSITIONS: 230
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 990
UNFOLDING TIME: 0.092

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.029
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 0.435
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1052
MODEL NAME: /home/mcc/execution/model
135 places, 230 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...

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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-COL-4"
export BK_EXAMINATION="Liveness"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5832"
echo " Executing tool gold2024"
echo " Input is LamportFastMutEx-COL-4, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r126-tall-174876436600384"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-4.tgz
mv LamportFastMutEx-COL-4 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;