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.r154-tall-174876825500349.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 Peterson-COL-3, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r154-tall-174876825500349
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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 4.0K 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.5K 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 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 114K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 43K 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 1748843464193

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-COL-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 05:51:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-02 05:51:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:51:05] [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-02 05:51:05] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-02 05:51:06] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 535 ms
[2025-06-02 05:51:06] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 256 PT places and 396.0 transition bindings in 17 ms.
[2025-06-02 05:51:06] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 4 ms.
[2025-06-02 05:51:06] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2025-06-02 05:51:06] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions 1112 arcs in 22 ms.
[2025-06-02 05:51:06] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2025-06-02 05:51:06] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions 1112 arcs in 6 ms.
[2025-06-02 05:51:06] [INFO ] Unfolded 14 HLPN properties in 0 ms.
[2025-06-02 05:51:06] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 0 ms.
[2025-06-02 05:51:06] [INFO ] Skeletonized 14 HLPN properties in 1 ms.
Reduce places removed 2 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 [Process(4), Tour(3), Process(4)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 3)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2025-06-02 05:51:06] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions 1112 arcs in 15 ms.
[2025-06-02 05:51:06] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 24 transitions.
Built sparse matrix representations for Structural reductions in 2 ms.17619KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 244/244 places, 332/332 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 24 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 35 ms. Remains : 244/244 places, 332/332 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 244/244 places, 332/332 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 14 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2025-06-02 05:51:06] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2025-06-02 05:51:06] [INFO ] Computed 15 invariants in 23 ms
[2025-06-02 05:51:06] [INFO ] Implicit Places using invariants in 195 ms returned []
[2025-06-02 05:51:06] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-02 05:51:06] [INFO ] Invariant cache hit.
[2025-06-02 05:51:06] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-02 05:51:06] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2025-06-02 05:51:06] [INFO ] Redundant transitions in 19 ms returned []
Running 328 sub problems to find dead transitions.
[2025-06-02 05:51:06] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-02 05:51:06] [INFO ] Invariant cache hit.
[2025-06-02 05:51:06] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2025-06-02 05:51:08] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 26 ms to minimize.
[2025-06-02 05:51:08] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2025-06-02 05:51:08] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2025-06-02 05:51:08] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 2 ms to minimize.
[2025-06-02 05:51:08] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2025-06-02 05:51:09] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2025-06-02 05:51:09] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 2 ms to minimize.
[2025-06-02 05:51:09] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 2 ms to minimize.
[2025-06-02 05:51:09] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 2 ms to minimize.
[2025-06-02 05:51:09] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 2 ms to minimize.
[2025-06-02 05:51:09] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:51:09] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 2 ms to minimize.
[2025-06-02 05:51:09] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2025-06-02 05:51:09] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:51:09] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2025-06-02 05:51:09] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:51:09] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 2 ms to minimize.
[2025-06-02 05:51:09] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 2 ms to minimize.
[2025-06-02 05:51:09] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:51:10] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2025-06-02 05:51:10] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:51:10] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2025-06-02 05:51:10] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:51:10] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2025-06-02 05:51:10] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2025-06-02 05:51:10] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:51:10] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2025-06-02 05:51:10] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2025-06-02 05:51:10] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 2 ms to minimize.
[2025-06-02 05:51:10] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:51:10] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2025-06-02 05:51:10] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 2 ms to minimize.
[2025-06-02 05:51:11] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2025-06-02 05:51:11] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2025-06-02 05:51:11] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 4 ms to minimize.
[2025-06-02 05:51:11] [INFO ] Deduced a trap composed of 53 places in 38 ms of which 1 ms to minimize.
[2025-06-02 05:51:11] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2025-06-02 05:51:11] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 1 ms to minimize.
[2025-06-02 05:51:11] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 1 ms to minimize.
[2025-06-02 05:51:11] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2025-06-02 05:51:13] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:51:13] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2025-06-02 05:51:13] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2025-06-02 05:51:13] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2025-06-02 05:51:13] [INFO ] Deduced a trap composed of 45 places in 32 ms of which 1 ms to minimize.
[2025-06-02 05:51:13] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2025-06-02 05:51:13] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:51:14] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:51:14] [INFO ] Deduced a trap composed of 89 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:51:14] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:51:14] [INFO ] Deduced a trap composed of 61 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:51:14] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:51:14] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:51:14] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:51:14] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2025-06-02 05:51:15] [INFO ] Deduced a trap composed of 68 places in 59 ms of which 3 ms to minimize.
[2025-06-02 05:51:15] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:51:15] [INFO ] Deduced a trap composed of 69 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:51:15] [INFO ] Deduced a trap composed of 87 places in 59 ms of which 1 ms to minimize.
[2025-06-02 05:51:15] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2025-06-02 05:51:16] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 2 ms to minimize.
[2025-06-02 05:51:16] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2025-06-02 05:51:16] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 2 ms to minimize.
[2025-06-02 05:51:17] [INFO ] Deduced a trap composed of 97 places in 64 ms of which 2 ms to minimize.
[2025-06-02 05:51:17] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 2 ms to minimize.
[2025-06-02 05:51:17] [INFO ] Deduced a trap composed of 70 places in 40 ms of which 1 ms to minimize.
[2025-06-02 05:51:17] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:51:17] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:51:17] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:51:17] [INFO ] Deduced a trap composed of 61 places in 47 ms of which 1 ms to minimize.
[2025-06-02 05:51:18] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2025-06-02 05:51:18] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:51:18] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 0 ms to minimize.
[2025-06-02 05:51:18] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2025-06-02 05:51:18] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2025-06-02 05:51:18] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:51:18] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2025-06-02 05:51:18] [INFO ] Deduced a trap composed of 56 places in 45 ms of which 1 ms to minimize.
[2025-06-02 05:51:19] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 19/90 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2025-06-02 05:51:20] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2025-06-02 05:51:21] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 1 ms to minimize.
[2025-06-02 05:51:21] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:51:21] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:51:21] [INFO ] Deduced a trap composed of 70 places in 45 ms of which 1 ms to minimize.
[2025-06-02 05:51:21] [INFO ] Deduced a trap composed of 78 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2025-06-02 05:51:24] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:51:26] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2025-06-02 05:51:26] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 1 ms to minimize.
[2025-06-02 05:51:26] [INFO ] Deduced a trap composed of 86 places in 56 ms of which 1 ms to minimize.
[2025-06-02 05:51:26] [INFO ] Deduced a trap composed of 69 places in 50 ms of which 1 ms to minimize.
[2025-06-02 05:51:26] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 1 ms to minimize.
[2025-06-02 05:51:26] [INFO ] Deduced a trap composed of 76 places in 56 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 7/103 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2025-06-02 05:51:27] [INFO ] Deduced a trap composed of 54 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 10 (OVERLAPS) 4/244 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 12 (OVERLAPS) 308/552 variables, 244/352 constraints. Problems are: Problem set: 0 solved, 328 unsolved
SMT process timed out in 30147ms, After SMT, problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 30167ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 30681 ms. Remains : 244/244 places, 332/332 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1178 ms (no deadlock found). (steps per millisecond=1061 )
Random directed walk for 1250004 steps, including 0 resets, run took 1193 ms (no deadlock found). (steps per millisecond=1047 )
[2025-06-02 05:51:39] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-02 05:51:39] [INFO ] Invariant cache hit.
[2025-06-02 05:51:39] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2025-06-02 05:51:39] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 7 ms returned unsat
[2025-06-02 05:51:39] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions 1112 arcs in 4 ms.
[2025-06-02 05:51:39] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 24 transitions.
RANDOM walk for 40000 steps (8 resets) in 588 ms. (67 steps per ms) remains 1/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
[2025-06-02 05:51:39] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-02 05:51:39] [INFO ] Invariant cache hit.
[2025-06-02 05:51:39] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 216/228 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/232 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 308/540 variables, 232/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 57/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/552 variables, 12/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/552 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/552 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 316 constraints, problems are : Problem set: 0 solved, 1 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 216/228 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/232 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 308/540 variables, 232/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 57/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/552 variables, 12/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:51:40] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2025-06-02 05:51:40] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 2 ms to minimize.
[2025-06-02 05:51:40] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 3/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/552 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 05:51:40] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 1 ms to minimize.
[2025-06-02 05:51:40] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 2 ms to minimize.
[2025-06-02 05:51:40] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/552 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/552 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/552 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 552/552 variables, and 323 constraints, problems are : Problem set: 0 solved, 1 unsolved in 585 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 795ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 12 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 244 transition count 242
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 154 transition count 242
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 180 place count 154 transition count 191
Deduced a syphon composed of 51 places in 5 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 282 place count 103 transition count 191
Applied a total of 282 rules in 50 ms. Remains 103 /244 variables (removed 141) and now considering 191/332 (removed 141) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 103/244 places, 191/332 transitions.
RANDOM walk for 4000000 steps (8 resets) in 7571 ms. (528 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2612 ms. (1530 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 33 steps, run visited all 1 properties in 6 ms. (steps per millisecond=5 )
Probabilistic random walk after 33 steps, saw 29 distinct states, run finished after 10 ms. (steps per millisecond=3 ) properties seen :1
Able to resolve query QuasiLiveness after proving 14 properties.
Net is quasi-live, checking if it is reversible to establish liveness.
Net is conservative; using simplified expression for initial state.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 24 transitions.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 24 transitions.
Unable to solve all queries for examination Liveness. Remains :14 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 14 properties from file /home/mcc/execution/Liveness.xml in 0 ms.
Working with output stream class java.io.PrintStream
Total runtime 37929 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Peterson-COL-3

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 11
TRANSITIONS: 14
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 7
COLOR VARS: 3
ARCS: 42
LOADING TIME: 0.138

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 256
TRANSITIONS: 356
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 1112
UNFOLDING TIME: 0.121

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.037
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 0.458
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: 853
MODEL NAME: /home/mcc/execution/model
256 places, 356 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="Peterson-COL-3"
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 Peterson-COL-3, 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 r154-tall-174876825500349"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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