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.r223-smll-177969946300030.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 PhilosophersDyn-PT-03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-smll-177969946300030
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 11K Mar 5 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 5 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 5 13:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K Mar 5 13:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 16 08:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 16 08:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 16 08:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K Mar 16 08:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 5 13:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Mar 5 13:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Mar 5 13:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Mar 5 13:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 16 08:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 16 08:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 87K 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 positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-00
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-01
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-02
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-03
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-04
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-05
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-06
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-07
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-08
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-09
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-10
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-11
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-12
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-13
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-14
FORMULA_NAME PhilosophersDyn-PT-03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779803544287

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-PT-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-26 13:52:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 13:52:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 13:52:26] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2026-05-26 13:52:26] [INFO ] Transformed 30 places.
[2026-05-26 13:52:26] [INFO ] Transformed 84 transitions.
[2026-05-26 13:52:26] [INFO ] Parsed PT model containing 30 places and 84 transitions and 564 arcs in 290 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Reduction of identical properties reduced properties to check from 16 to 13
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2026-05-26 13:52:26] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2026-05-26 13:52:26] [INFO ] Computed 11 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 1, 1] Max Struct:[3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA PhilosophersDyn-PT-03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (1426 resets) in 70 ms. (140 steps per ms)
FORMULA PhilosophersDyn-PT-03-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PhilosophersDyn-PT-03-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (296 resets) in 34 ms. (285 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[3]
[2026-05-26 13:52:26] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
[2026-05-26 13:52:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 13:52:27] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2026-05-26 13:52:27] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 4 ms returned sat
[2026-05-26 13:52:27] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2026-05-26 13:52:27] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-26 13:52:27] [INFO ] [Real]Added 36 Read/Feed constraints in 16 ms returned sat
[2026-05-26 13:52:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-26 13:52:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-26 13:52:27] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-26 13:52:27] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2026-05-26 13:52:27] [INFO ] [Nat]Added 36 Read/Feed constraints in 12 ms returned sat
[2026-05-26 13:52:27] [INFO ] Computed and/alt/rep : 6/45/6 causal constraints (skipped 48 transitions) in 51 ms.
[2026-05-26 13:52:27] [INFO ] Added : 0 causal constraints over 0 iterations in 86 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[3]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 81/81 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 78
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 27 transition count 78
Applied a total of 6 rules in 52 ms. Remains 27 /30 variables (removed 3) and now considering 78/81 (removed 3) transitions.
Running 75 sub problems to find dead transitions.
[2026-05-26 13:52:27] [INFO ] Flow matrix only has 54 transitions (discarded 24 similar events)
// Phase 1: matrix 54 rows 27 cols
[2026-05-26 13:52:27] [INFO ] Computed 11 invariants in 3 ms
[2026-05-26 13:52:27] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Problem TDEAD10 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 8/8 constraints. Problems are: Problem set: 12 solved, 63 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 3/11 constraints. Problems are: Problem set: 30 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 30 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 54/81 variables, 27/38 constraints. Problems are: Problem set: 30 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 36/74 constraints. Problems are: Problem set: 30 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/74 constraints. Problems are: Problem set: 30 solved, 45 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 13:52:29] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 6 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/81 variables, 1/75 constraints. Problems are: Problem set: 30 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/75 constraints. Problems are: Problem set: 30 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 0/81 variables, 0/75 constraints. Problems are: Problem set: 30 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 75 constraints, problems are : Problem set: 30 solved, 45 unsolved in 2514 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 27/27 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 30 solved, 45 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 8/8 constraints. Problems are: Problem set: 30 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 3/11 constraints. Problems are: Problem set: 30 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 1/12 constraints. Problems are: Problem set: 30 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/12 constraints. Problems are: Problem set: 30 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 54/81 variables, 27/39 constraints. Problems are: Problem set: 30 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 36/75 constraints. Problems are: Problem set: 30 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 45/120 constraints. Problems are: Problem set: 30 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/120 constraints. Problems are: Problem set: 30 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 0/81 variables, 0/120 constraints. Problems are: Problem set: 30 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 120 constraints, problems are : Problem set: 30 solved, 45 unsolved in 2214 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 27/27 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 45/75 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4900ms problems are : Problem set: 30 solved, 45 unsolved
Search for dead transitions found 30 dead transitions in 4916ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 27/30 places, 48/81 transitions.
Applied a total of 0 rules in 4 ms. Remains 27 /27 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4992 ms. Remains : 27/30 places, 48/81 transitions.
// Phase 1: matrix 48 rows 27 cols
[2026-05-26 13:52:32] [INFO ] Computed 11 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[3]
RANDOM walk for 1000000 steps (146569 resets) in 1953 ms. (511 steps per ms)
BEST_FIRST walk for 1000001 steps (45441 resets) in 737 ms. (1355 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[3]
[2026-05-26 13:52:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 13:52:35] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-26 13:52:35] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 4 ms returned sat
[2026-05-26 13:52:35] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2026-05-26 13:52:35] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-26 13:52:35] [INFO ] [Real]Added 30 Read/Feed constraints in 7 ms returned sat
[2026-05-26 13:52:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 13:52:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 13 ms returned sat
[2026-05-26 13:52:35] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2026-05-26 13:52:35] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2026-05-26 13:52:35] [INFO ] [Nat]Added 30 Read/Feed constraints in 11 ms returned sat
[2026-05-26 13:52:35] [INFO ] Computed and/alt/rep : 12/93/12 causal constraints (skipped 33 transitions) in 8 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 13:52:35] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 4 ms to minimize.
[2026-05-26 13:52:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2026-05-26 13:52:35] [INFO ] Added : 5 causal constraints over 2 iterations in 114 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[3]
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 27/27 places, 48/48 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2026-05-26 13:52:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 13:52:35] [INFO ] Implicit Places using invariants in 81 ms returned [1, 18, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 84 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 24/27 places, 48/48 transitions.
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 24 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 21 transition count 45
Applied a total of 6 rules in 8 ms. Remains 21 /24 variables (removed 3) and now considering 45/48 (removed 3) transitions.
// Phase 1: matrix 45 rows 21 cols
[2026-05-26 13:52:35] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 13:52:35] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-26 13:52:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 13:52:35] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-26 13:52:35] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 21/27 places, 45/48 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 271 ms. Remains : 21/27 places, 45/48 transitions.
[2026-05-26 13:52:35] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[3]
RANDOM walk for 1000000 steps (203521 resets) in 1709 ms. (584 steps per ms)
BEST_FIRST walk for 1000001 steps (66666 resets) in 597 ms. (1672 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[3]
[2026-05-26 13:52:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 13:52:38] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-26 13:52:38] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 13:52:38] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2026-05-26 13:52:38] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-26 13:52:38] [INFO ] [Real]Added 30 Read/Feed constraints in 8 ms returned sat
[2026-05-26 13:52:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-26 13:52:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-26 13:52:38] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-26 13:52:38] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2026-05-26 13:52:38] [INFO ] [Nat]Added 30 Read/Feed constraints in 9 ms returned sat
[2026-05-26 13:52:38] [INFO ] Computed and/alt/rep : 9/69/9 causal constraints (skipped 33 transitions) in 7 ms.
[2026-05-26 13:52:38] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[3]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[3]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 21/21 places, 45/45 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2026-05-26 13:52:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 13:52:38] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-26 13:52:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-26 13:52:38] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-26 13:52:38] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-26 13:52:38] [INFO ] Redundant transitions in 0 ms returned []
Running 42 sub problems to find dead transitions.
[2026-05-26 13:52:38] [INFO ] Invariant cache hit.
[2026-05-26 13:52:38] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 13:52:38] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 45/66 variables, 21/30 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 30/60 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-26 13:52:39] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 0/66 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 61 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1561 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (OVERLAPS) 45/66 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 30/61 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 42/103 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 0/66 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 103 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1855 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3459ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 3460ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3638 ms. Remains : 21/21 places, 45/45 transitions.
RANDOM walk for 40000 steps (8160 resets) in 958 ms. (41 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (2664 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
[2026-05-26 13:52:42] [INFO ] Flatten gal took : 57 ms
[2026-05-26 13:52:42] [INFO ] Flatten gal took : 22 ms
BEST_FIRST walk for 40004 steps (2664 resets) in 226 ms. (176 steps per ms) remains 2/2 properties
Probably explored full state space saw : 58 states, properties seen :0
[2026-05-26 13:52:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7338490382749158647.gal : 11 ms
Probabilistic random walk after 154 steps, saw 58 distinct states, run finished after 19 ms. (steps per millisecond=8 ) properties seen :0
Explored full state space saw : 58 states, properties seen :0
Exhaustive walk after 154 steps, saw 58 distinct states, run finished after 5 ms. (steps per millisecond=30 ) properties seen :0
[2026-05-26 13:52:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5221637967091129732.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7338490382749158647.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5221637967091129732.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
FORMULA PhilosophersDyn-PT-03-UpperBounds-02 2 TECHNIQUES REACHABILITY_MIN
FORMULA PhilosophersDyn-PT-03-UpperBounds-01 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 16295 ms.

BK_STOP 1779803562723

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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 UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="PhilosophersDyn-PT-03"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool gold2025"
echo " Input is PhilosophersDyn-PT-03, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r223-smll-177969946300030"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-03.tgz
mv PhilosophersDyn-PT-03 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;