Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r176-smll-177961112000219.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool gold2025
Input is LamportFastMutEx-COL-3, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-smll-177961112000219
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 7.6K Mar 7 16:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 7 16:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 7 16:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 7 16:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Mar 15 11:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 11:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 15 11:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 11:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Mar 7 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 7 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 7 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 7 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 11:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 11:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 39K Mar 3 18:30 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 1779768194041

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=LamportFastMutEx-COL-3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
Liveness COL
Running Version 202505121319
[2026-05-26 04:03:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2026-05-26 04:03:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 04:03:16] [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.
[2026-05-26 04:03:17] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-26 04:03:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 882 ms
[2026-05-26 04:03:17] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 100 PT places and 192.0 transition bindings in 29 ms.
[2026-05-26 04:03:17] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 7 ms.
[2026-05-26 04:03:17] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2026-05-26 04:03:17] [INFO ] Unfolded HLPN to a Petri net with 100 places and 156 transitions 664 arcs in 37 ms.
[2026-05-26 04:03:17] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2026-05-26 04:03:17] [INFO ] Unfolded HLPN to a Petri net with 100 places and 156 transitions 664 arcs in 14 ms.
[2026-05-26 04:03:17] [INFO ] Unfolded 17 HLPN properties in 1 ms.
[2026-05-26 04:03:17] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 0 ms.
[2026-05-26 04:03:17] [INFO ] Skeletonized 17 HLPN properties in 2 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(4), pid(4)] 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.
[2026-05-26 04:03:17] [INFO ] Unfolded HLPN to a Petri net with 100 places and 156 transitions 664 arcs in 33 ms.
[2026-05-26 04:03:17] [INFO ] Unfolded 17 HLPN properties in 1 ms.
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 42 transitions.
Built sparse matrix representations for Structural reductions in 2 ms.17734KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 71/71 places, 114/114 transitions.
Computed a total of 1 stabilizing places and 3 stable transitions
Computed a total of 1 stabilizing places and 3 stable transitions
Computed a total of 1 stabilizing places and 3 stable transitions
Applied a total of 0 rules in 29 ms. Remains 71 /71 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 49 ms. Remains : 71/71 places, 114/114 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 71/71 places, 114/114 transitions.
Computed a total of 1 stabilizing places and 3 stable transitions
Computed a total of 1 stabilizing places and 3 stable transitions
Computed a total of 1 stabilizing places and 3 stable transitions
Applied a total of 0 rules in 14 ms. Remains 71 /71 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2026-05-26 04:03:18] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
// Phase 1: matrix 96 rows 71 cols
[2026-05-26 04:03:18] [INFO ] Computed 17 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 04:03:18] [INFO ] Implicit Places using invariants in 337 ms returned []
[2026-05-26 04:03:18] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2026-05-26 04:03:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 04:03:18] [INFO ] State equation strengthened by 27 read => feed constraints.
[2026-05-26 04:03:18] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-26 04:03:18] [INFO ] Redundant transitions in 5 ms returned []
Running 111 sub problems to find dead transitions.
[2026-05-26 04:03:18] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2026-05-26 04:03:18] [INFO ] Invariant cache hit.
[2026-05-26 04:03:18] [INFO ] State equation strengthened by 27 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 111 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:20] [INFO ] Deduced a trap composed of 9 places in 245 ms of which 111 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:20] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 11 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:20] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 11 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:20] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:20] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:20] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:20] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:20] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:20] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 5 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD26 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:21] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 5 ms to minimize.
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:21] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 4 ms to minimize.
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:21] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 4 ms to minimize.
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:21] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:21] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:21] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:21] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:21] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:21] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 4 ms to minimize.
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:21] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 9 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD50 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:22] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 8 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 20/37 constraints. Problems are: Problem set: 18 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:22] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:22] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:22] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:22] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:22] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:22] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:22] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:22] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:23] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:23] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:23] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:23] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:23] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:23] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:23] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:23] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 16/53 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/53 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 96/167 variables, 71/124 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 27/151 constraints. Problems are: Problem set: 18 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:25] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 1/152 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/152 constraints. Problems are: Problem set: 18 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:27] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:28] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 10 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/167 variables, 2/154 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/154 constraints. Problems are: Problem set: 18 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:30] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 5 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/167 variables, 1/155 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 0/155 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 12 (OVERLAPS) 0/167 variables, 0/155 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 155 constraints, problems are : Problem set: 18 solved, 93 unsolved in 14607 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 71/71 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 18 solved, 93 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 5/5 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 23/28 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/28 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 3/71 variables, 12/40 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 17/57 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/57 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 96/167 variables, 71/128 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 27/155 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 93/248 constraints. Problems are: Problem set: 18 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:36] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 1/249 constraints. Problems are: Problem set: 18 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:37] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 1/250 constraints. Problems are: Problem set: 18 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:39] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 12 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 1/251 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 0/251 constraints. Problems are: Problem set: 18 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:42] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 11 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/167 variables, 1/252 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 0/252 constraints. Problems are: Problem set: 18 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:48] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 5 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/167 variables, 1/253 constraints. Problems are: Problem set: 18 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:50] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:50] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 6 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/167 variables, 2/255 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/167 variables, 0/255 constraints. Problems are: Problem set: 18 solved, 93 unsolved
At refinement iteration 18 (OVERLAPS) 0/167 variables, 0/255 constraints. Problems are: Problem set: 18 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 255 constraints, problems are : Problem set: 18 solved, 93 unsolved in 23254 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 71/71 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 93/111 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 37985ms problems are : Problem set: 18 solved, 93 unsolved
Search for dead transitions found 18 dead transitions in 38001ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 71/71 places, 96/114 transitions.
Computed a total of 1 stabilizing places and 3 stable transitions
Computed a total of 1 stabilizing places and 3 stable transitions
Computed a total of 1 stabilizing places and 3 stable transitions
Applied a total of 0 rules in 7 ms. Remains 71 /71 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-26 04:03:56] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in DEADLOCK mode , in 2 iterations and 38733 ms. Remains : 71/71 places, 96/114 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1456 ms (no deadlock found). (steps per millisecond=858 )
Random directed walk for 1250002 steps, including 0 resets, run took 1008 ms (no deadlock found). (steps per millisecond=1240 )
[2026-05-26 04:03:59] [INFO ] Flow matrix only has 84 transitions (discarded 12 similar events)
// Phase 1: matrix 84 rows 71 cols
[2026-05-26 04:03:59] [INFO ] Computed 17 invariants in 4 ms
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2026-05-26 04:03:59] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2026-05-26 04:03:59] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2026-05-26 04:03:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2026-05-26 04:03:59] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2026-05-26 04:03:59] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2026-05-26 04:03:59] [INFO ] State equation strengthened by 24 read => feed constraints.
[2026-05-26 04:03:59] [INFO ] [Nat]Added 24 Read/Feed constraints in 13 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:59] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:59] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:59] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:59] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:03:59] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:04:00] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:04:00] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:04:00] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:04:00] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:04:00] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:04:00] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 04:04:00] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 5 ms to minimize.
[2026-05-26 04:04:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 903 ms
[2026-05-26 04:04:00] [INFO ] Unfolded HLPN to a Petri net with 100 places and 156 transitions 664 arcs in 8 ms.
[2026-05-26 04:04:00] [INFO ] Unfolded 17 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 42 transitions.
RANDOM walk for 379 steps (0 resets) in 96 ms. (3 steps per ms) remains 0/16 properties
[2026-05-26 04:04:00] [INFO ] Flatten gal took : 74 ms
[2026-05-26 04:04:00] [INFO ] Flatten gal took : 29 ms
[2026-05-26 04:04:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14277997500210246582.gal : 18 ms
[2026-05-26 04:04:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7967095144702445972.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14277997500210246582.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7967095144702445972.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
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 29 places in 2 ms
Reduce places removed 29 places and 42 transitions.
[2026-05-26 04:04:00] [INFO ] Flatten gal took : 31 ms
[2026-05-26 04:04:00] [INFO ] Flatten gal took : 28 ms
[2026-05-26 04:04:00] [INFO ] Time to serialize gal into /tmp/CTLFireability14563815753583471375.gal : 10 ms
[2026-05-26 04:04:00] [INFO ] Time to serialize properties into /tmp/CTLFireability12309267959069624681.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14563815753583471375.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12309267959069624681.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,19742,0.493181,14316,2,3788,5,32353,6,0,400,38317,0


Converting to forward existential form...Done !
original formula: AG(EF(((((((((P_start_1_1==1)&&(P_start_1_2==1))&&((P_start_1_3==1)&&(x_0==1)))&&(((x_1==0)&&(x_2==0))&&((x_3==0)&&(y_0==1))))&&((((y_1==...1292
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((((P_start_1_1==1)&&(P_start_1_2==1))&&((P_start_1_3==1)&&(x_0==1)))&&(((x_1...1352
Reverse transition relation is NOT exact ! Due to transitions T_setx_3x0i1, T_setx_3x0i2, T_setx_3x0i3, T_setx_3x1i1, T_setx_3x1i2, T_setx_3x1i3, T_setx_3x...1035
(forward)formula 0,0,1.58543,41848,1,0,252,160756,228,97,2888,142625,215
ITS tools runner thread asked to quit. Dying gracefully.
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 42 transitions.
[2026-05-26 04:04:02] [INFO ] Flatten gal took : 18 ms
[2026-05-26 04:04:02] [INFO ] Flatten gal took : 17 ms
[2026-05-26 04:04:02] [INFO ] Time to serialize gal into /tmp/CTLFireability13115605305452250156.gal : 5 ms
[2026-05-26 04:04:02] [INFO ] Time to serialize properties into /tmp/CTLFireability4896152812156074925.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13115605305452250156.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4896152812156074925.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 17 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,19742,0.365044,14384,2,3788,5,32353,6,0,400,38317,0


Converting to forward existential form...Done !
original formula: AG(EF((((((P_start_1_2>=1)&&(P_b_5>=1))||((P_start_1_2>=1)&&(P_b_4>=1)))||(((P_start_1_1>=1)&&(P_b_3>=1))||((P_start_1_3>=1)&&(P_b_7>=1))...226
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((P_start_1_2>=1)&&(P_b_5>=1))||((P_start_1_2>=1)&&(P_b_4>=1)))||(((P_start_1_...286
Reverse transition relation is NOT exact ! Due to transitions T_setx_3x0i1, T_setx_3x0i2, T_setx_3x0i3, T_setx_3x1i1, T_setx_3x1i2, T_setx_3x1i3, T_setx_3x...1035
(forward)formula 0,1,2.70884,76132,1,0,275,378040,228,111,2726,328297,255
Formula is TRUE !
Detected timeout of ITS tools.
[2026-05-26 04:04:05] [INFO ] Flatten gal took : 26 ms
[2026-05-26 04:04:05] [INFO ] Applying decomposition
[2026-05-26 04:04:05] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9346663094230956785.txt' '-o' '/tmp/graph9346663094230956785.bin' '-w' '/tmp/graph9346663094230956785.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9346663094230956785.bin' '-l' '-1' '-v' '-w' '/tmp/graph9346663094230956785.weights' '-q' '0' '-e' '0.001'
[2026-05-26 04:04:05] [INFO ] Decomposing Gal with order
[2026-05-26 04:04:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 04:04:05] [INFO ] Removed a total of 123 redundant transitions.
[2026-05-26 04:04:06] [INFO ] Flatten gal took : 79 ms
[2026-05-26 04:04:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 17 ms.
[2026-05-26 04:04:06] [INFO ] Time to serialize gal into /tmp/CTLFireability13088689948904508496.gal : 8 ms
[2026-05-26 04:04:06] [INFO ] Time to serialize properties into /tmp/CTLFireability11943147933581906822.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13088689948904508496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11943147933581906822.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 16 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,19742,0.532683,14532,684,84,19401,272,321,37033,79,1005,0


Converting to forward existential form...Done !
original formula: AG(EF(((((((i0.u0.x_1>=1)&&(i2.u2.P_setx_3_3>=1))||((i2.u2.x_3>=1)&&(i0.u0.P_setx_3_1>=1)))||(((i2.u2.x_3>=1)&&(i1.u1.P_setx_3_2>=1))||((...538
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((i0.u0.x_1>=1)&&(i2.u2.P_setx_3_3>=1))||((i2.u2.x_3>=1)&&(i0.u0.P_setx_3_1>=...598
Reverse transition relation is NOT exact ! Due to transitions T_setx_3x0i1, T_setx_3x0i2, T_setx_3x0i3, T_setx_3x1i2, T_setx_3x1i3, T_setx_3x2i1, T_setx_3x...871
(forward)formula 0,1,0.900425,19268,1,0,30228,1111,1373,54643,367,3975,78359
Formula is TRUE !

***************************************

original formula: AG(EF(((((((i5.u6.y_1>=1)&&(i0.u3.P_ify0_4_1>=1))||((i5.u6.y_1>=1)&&(i1.u4.P_ify0_4_2>=1)))||(((i5.u6.y_2>=1)&&(i0.u3.P_ify0_4_1>=1))||((...409
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((i5.u6.y_1>=1)&&(i0.u3.P_ify0_4_1>=1))||((i5.u6.y_1>=1)&&(i1.u4.P_ify0_4_2>=...469
(forward)formula 1,1,1.15985,27972,1,0,48493,1133,1412,81269,370,4164,120332
Formula is TRUE !

***************************************

original formula: AG(EF((((((i0.u0.P_b_3>=1)&&(i0.u3.P_setbi_5_1>=1))||((i0.u0.P_b_2>=1)&&(i0.u3.P_setbi_5_1>=1)))||(((i1.u1.P_b_4>=1)&&(i1.u4.P_setbi_5_2>...298
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((i0.u0.P_b_3>=1)&&(i0.u3.P_setbi_5_1>=1))||((i0.u0.P_b_2>=1)&&(i0.u3.P_setbi_...358
(forward)formula 2,1,1.40568,35652,1,0,64566,1136,1456,102400,372,4222,157840
Formula is TRUE !

***************************************

original formula: AG(EF(((((i5.u6.y_0>=1)&&(i2.u20.P_awaity_3>=1))||((i5.u6.y_0>=1)&&(i1.u19.P_awaity_2>=1)))||((i5.u6.y_0>=1)&&(i0.u18.P_awaity_1>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((i5.u6.y_0>=1)&&(i2.u20.P_awaity_3>=1))||((i5.u6.y_0>=1)&&(i1.u19.P_awaity_2>=...214
(forward)formula 3,1,1.69649,44868,1,0,83592,1210,1473,130556,372,4430,200569
Formula is TRUE !

***************************************

original formula: AG(EF(((((i5.u6.y_0>=1)&&(i1.u4.P_ify0_4_2>=1))||((i5.u6.y_0>=1)&&(i2.u5.P_ify0_4_3>=1)))||((i5.u6.y_0>=1)&&(i0.u3.P_ify0_4_1>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((i5.u6.y_0>=1)&&(i1.u4.P_ify0_4_2>=1))||((i5.u6.y_0>=1)&&(i2.u5.P_ify0_4_3>=1)...211
(forward)formula 4,1,1.89659,50116,1,0,94296,1223,1483,144804,372,4514,224835
Formula is TRUE !

***************************************

original formula: AG(EF(((((((i5.u6.y_2>=1)&&(i4.u7.P_sety_9_1>=1))||((i5.u6.y_0>=1)&&(i5.u6.P_sety_9_2>=1)))||(((i5.u6.y_0>=1)&&(i3.u8.P_sety_9_3>=1))||((...538
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((i5.u6.y_2>=1)&&(i4.u7.P_sety_9_1>=1))||((i5.u6.y_0>=1)&&(i5.u6.P_sety_9_2>=...598
(forward)formula 5,1,2.02565,53956,1,0,101841,1224,1554,154757,389,4537,239967
Formula is TRUE !

***************************************

original formula: AG(EF(((((((i0.u0.x_1>=1)&&(i3.u8.P_ifxi_10_3>=1))||((i1.u1.x_2>=1)&&(i4.u7.P_ifxi_10_1>=1)))||(((i3.u8.x_0>=1)&&(i5.u6.P_ifxi_10_2>=1))|...418
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((i0.u0.x_1>=1)&&(i3.u8.P_ifxi_10_3>=1))||((i1.u1.x_2>=1)&&(i4.u7.P_ifxi_10_1...478
(forward)formula 6,1,2.25136,59716,1,0,114007,1247,1593,168927,389,4691,267603
Formula is TRUE !

***************************************

original formula: AG(EF((((((i0.u0.P_b_3>=1)&&(i4.u7.P_setbi_11_1>=1))||((i0.u0.P_b_2>=1)&&(i4.u7.P_setbi_11_1>=1)))||(((i1.u1.P_b_4>=1)&&(i5.u6.P_setbi_11...304
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((i0.u0.P_b_3>=1)&&(i4.u7.P_setbi_11_1>=1))||((i0.u0.P_b_2>=1)&&(i4.u7.P_setbi...364
(forward)formula 7,1,2.35234,62660,1,0,119999,1247,1624,176347,389,4700,278910
Formula is TRUE !

***************************************

original formula: AG(EF((((i4.u7.P_fordo_12_1>=1)||(i3.u8.P_fordo_12_3>=1))||(i1.u1.P_fordo_12_2>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i4.u7.P_fordo_12_1>=1)||(i3.u8.P_fordo_12_3>=1))||(i1.u1.P_fordo_12_2>=1)))))]...163
(forward)formula 8,1,2.54208,68420,1,0,131434,1248,1630,192304,389,4711,304082
Formula is TRUE !

***************************************

original formula: AG(EF((((((((i1.u1.P_b_4>=1)&&(i1.u15.P_wait_10>=1))&&(i1.u14.P_await_13_2>=1))||(((i2.u2.P_b_6>=1)&&(i4.u13.P_wait_7>=1))&&(i4.u9.P_awai...671
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((((i1.u1.P_b_4>=1)&&(i1.u15.P_wait_10>=1))&&(i1.u14.P_await_13_2>=1))||(((i2....731
(forward)formula 9,1,2.81457,75076,1,0,144794,1250,1736,211772,391,4743,333402
Formula is TRUE !
Detected timeout of ITS tools.
[2026-05-26 04:04:09] [INFO ] Flatten gal took : 10 ms
[2026-05-26 04:04:09] [INFO ] Flatten gal took : 11 ms
[2026-05-26 04:04:09] [INFO ] Time to serialize gal into /tmp/CTLFireability3596806397590883884.gal : 1 ms
[2026-05-26 04:04:09] [INFO ] Time to serialize properties into /tmp/CTLFireability9841351300816496570.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3596806397590883884.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9841351300816496570.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,19742,0.319695,14384,2,3788,5,32353,6,0,400,38317,0


Converting to forward existential form...Done !
original formula: AG(EF((((((P_await_13_1>=1)&&(P_done_5>=1))&&((P_done_6>=1)&&(P_done_7>=1)))||(((P_await_13_2>=1)&&(P_done_9>=1))&&((P_done_10>=1)&&(P_do...243
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((P_await_13_1>=1)&&(P_done_5>=1))&&((P_done_6>=1)&&(P_done_7>=1)))||(((P_awai...303
Reverse transition relation is NOT exact ! Due to transitions T_setx_3x0i1, T_setx_3x0i2, T_setx_3x0i3, T_setx_3x1i1, T_setx_3x1i2, T_setx_3x1i3, T_setx_3x...1035
(forward)formula 0,1,2.65118,78060,1,0,292,392223,228,116,2741,337349,270
Formula is TRUE !

***************************************

original formula: AG(EF(((((((y_3>=1)&&(P_ifyi_15_2>=1))||((y_3>=1)&&(P_ifyi_15_1>=1)))||(((y_2>=1)&&(P_ifyi_15_3>=1))||((y_1>=1)&&(P_ifyi_15_3>=1))))||(((...310
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((y_3>=1)&&(P_ifyi_15_2>=1))||((y_3>=1)&&(P_ifyi_15_1>=1)))||(((y_2>=1)&&(P_i...370
(forward)formula 1,1,4.59058,127312,1,0,340,693164,229,148,2745,577479,351
Formula is TRUE !

***************************************

original formula: AG(EF(((((y_2>=1)&&(P_ifyi_15_2>=1))||((y_3>=1)&&(P_ifyi_15_3>=1)))||((y_1>=1)&&(P_ifyi_15_1>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((y_2>=1)&&(P_ifyi_15_2>=1))||((y_3>=1)&&(P_ifyi_15_3>=1)))||((y_1>=1)&&(P_ifyi...178
(forward)formula 2,1,7.1752,187232,1,0,386,1.04028e+06,230,173,2747,843837,417
Formula is TRUE !

***************************************

original formula: AG(EF(((((x_1>=1)&&(P_ifxi_10_1>=1))||((x_2>=1)&&(P_ifxi_10_2>=1)))||((x_3>=1)&&(P_ifxi_10_3>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((x_1>=1)&&(P_ifxi_10_1>=1))||((x_2>=1)&&(P_ifxi_10_2>=1)))||((x_3>=1)&&(P_ifxi...178
(forward)formula 3,1,8.81001,227196,1,0,418,1.28325e+06,231,193,2749,1.03615e+06,468
Formula is TRUE !

***************************************

original formula: AG(EF(((((((y_0>=1)&&(P_CS_21_3>=1))||((y_0>=1)&&(P_CS_21_2>=1)))||(((y_0>=1)&&(P_CS_21_1>=1))||((y_2>=1)&&(P_CS_21_1>=1))))||((((y_2>=1)...382
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((y_0>=1)&&(P_CS_21_3>=1))||((y_0>=1)&&(P_CS_21_2>=1)))||(((y_0>=1)&&(P_CS_21...442
(forward)formula 4,1,9.51968,249240,1,0,436,1.41528e+06,232,203,2754,1.14326e+06,494
Formula is TRUE !

***************************************

original formula: AG(EF((((((P_b_6>=1)&&(P_setbi_24_3>=1))||((P_b_2>=1)&&(P_setbi_24_1>=1)))||(((P_b_7>=1)&&(P_setbi_24_3>=1))||((P_b_5>=1)&&(P_setbi_24_2>...232
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((P_b_6>=1)&&(P_setbi_24_3>=1))||((P_b_2>=1)&&(P_setbi_24_1>=1)))||(((P_b_7>=1...292
(forward)formula 5,1,10.2455,269080,1,0,454,1.54312e+06,233,213,2759,1.24879e+06,521
Formula is TRUE !

***************************************

Able to resolve query Liveness after proving 18 properties.
FORMULA Liveness TRUE TECHNIQUES RANDOM_WALK DECISION_DIAGRAMS TOPOLOGICAL INITIAL_STATE USE_NUPN
Total runtime 62895 ms.

BK_STOP 1779768259514

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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-3"
export BK_EXAMINATION="Liveness"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is LamportFastMutEx-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 r176-smll-177961112000219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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