About the Execution of 2025-gold for HealthRecord-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 421.275 | 12010.00 | 19635.00 | 202.70 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
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.r159-tall-177961079800072.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 HealthRecord-PT-05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-tall-177961079800072
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 7.9K Mar 7 13:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Mar 7 13:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 7 13:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 13:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 10:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Mar 7 13:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 191K Mar 7 13:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 7 13:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 7 13:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 51K 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 HealthRecord-PT-05-UpperBounds-00
FORMULA_NAME HealthRecord-PT-05-UpperBounds-01
FORMULA_NAME HealthRecord-PT-05-UpperBounds-02
FORMULA_NAME HealthRecord-PT-05-UpperBounds-03
FORMULA_NAME HealthRecord-PT-05-UpperBounds-04
FORMULA_NAME HealthRecord-PT-05-UpperBounds-05
FORMULA_NAME HealthRecord-PT-05-UpperBounds-06
FORMULA_NAME HealthRecord-PT-05-UpperBounds-07
FORMULA_NAME HealthRecord-PT-05-UpperBounds-08
FORMULA_NAME HealthRecord-PT-05-UpperBounds-09
FORMULA_NAME HealthRecord-PT-05-UpperBounds-10
FORMULA_NAME HealthRecord-PT-05-UpperBounds-11
FORMULA_NAME HealthRecord-PT-05-UpperBounds-12
FORMULA_NAME HealthRecord-PT-05-UpperBounds-13
FORMULA_NAME HealthRecord-PT-05-UpperBounds-14
FORMULA_NAME HealthRecord-PT-05-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779707501765
Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-25 11:11:43] [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-25 11:11:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 11:11:43] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2026-05-25 11:11:43] [INFO ] Transformed 125 places.
[2026-05-25 11:11:43] [INFO ] Transformed 246 transitions.
[2026-05-25 11:11:43] [INFO ] Found NUPN structural information;
[2026-05-25 11:11:43] [INFO ] Parsed PT model containing 125 places and 246 transitions and 637 arcs in 147 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-25 11:11:43] [INFO ] Flow matrix only has 229 transitions (discarded 8 similar events)
// Phase 1: matrix 229 rows 125 cols
[2026-05-25 11:11:43] [INFO ] Computed 14 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (926 resets) in 43 ms. (227 steps per ms)
FORMULA HealthRecord-PT-05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50003 steps (605 resets) in 48 ms. (1020 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2026-05-25 11:11:43] [INFO ] Flow matrix only has 229 transitions (discarded 8 similar events)
[2026-05-25 11:11:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:11:43] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2026-05-25 11:11:43] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2026-05-25 11:11:43] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2026-05-25 11:11:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 11:11:43] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2026-05-25 11:11:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:11:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2026-05-25 11:11:43] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2026-05-25 11:11:43] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2026-05-25 11:11:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 11:11:44] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 19 ms.
[2026-05-25 11:11:44] [INFO ] Added : 17 causal constraints over 4 iterations in 88 ms. Result :sat
Minimization took 92 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:11:44] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-25 11:11:44] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2026-05-25 11:11:44] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2026-05-25 11:11:44] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 11:11:44] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 8 ms to minimize.
[2026-05-25 11:11:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:11:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-25 11:11:44] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2026-05-25 11:11:44] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2026-05-25 11:11:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 11:11:44] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 11:11:44] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 11:11:44] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 5 ms to minimize.
[2026-05-25 11:11:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 215 ms
[2026-05-25 11:11:44] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 25 ms.
[2026-05-25 11:11:44] [INFO ] Added : 11 causal constraints over 3 iterations in 73 ms. Result :sat
Minimization took 78 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:11:44] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-25 11:11:44] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2026-05-25 11:11:45] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2026-05-25 11:11:45] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 11:11:45] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 4 ms to minimize.
[2026-05-25 11:11:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:11:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-25 11:11:45] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2026-05-25 11:11:45] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2026-05-25 11:11:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 11:11:45] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 11:11:45] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 10 ms to minimize.
[2026-05-25 11:11:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 137 ms
[2026-05-25 11:11:45] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 15 ms.
[2026-05-25 11:11:45] [INFO ] Added : 9 causal constraints over 2 iterations in 48 ms. Result :sat
Minimization took 82 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:11:45] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-25 11:11:45] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2026-05-25 11:11:45] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2026-05-25 11:11:45] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 11:11:45] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 18 ms.
[2026-05-25 11:11:45] [INFO ] Added : 14 causal constraints over 3 iterations in 65 ms. Result :sat
Minimization took 115 ms.
[2026-05-25 11:11:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:11:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-25 11:11:45] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2026-05-25 11:11:45] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2026-05-25 11:11:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2026-05-25 11:11:45] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 13 ms.
[2026-05-25 11:11:45] [INFO ] Added : 29 causal constraints over 6 iterations in 89 ms. Result :sat
Minimization took 82 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:11:46] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-25 11:11:46] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2026-05-25 11:11:46] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2026-05-25 11:11:46] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 11:11:46] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 3 ms to minimize.
[2026-05-25 11:11:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:11:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2026-05-25 11:11:46] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2026-05-25 11:11:46] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2026-05-25 11:11:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 11:11:46] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 11:11:46] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 11:11:46] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 7 ms to minimize.
[2026-05-25 11:11:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 222 ms
[2026-05-25 11:11:46] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 14 ms.
[2026-05-25 11:11:46] [INFO ] Added : 14 causal constraints over 3 iterations in 53 ms. Result :sat
Minimization took 82 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0] Max Struct:[1, 1]
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 237/237 transitions.
Graph (trivial) has 180 edges and 125 vertex of which 4 / 125 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 459 edges and 123 vertex of which 115 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 115 transition count 222
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 113 transition count 218
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 111 transition count 218
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 70 place count 53 transition count 102
Iterating global reduction 3 with 58 rules applied. Total rules applied 128 place count 53 transition count 102
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 137 place count 44 transition count 84
Iterating global reduction 3 with 9 rules applied. Total rules applied 146 place count 44 transition count 84
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 150 place count 44 transition count 80
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 152 place count 42 transition count 74
Iterating global reduction 4 with 2 rules applied. Total rules applied 154 place count 42 transition count 74
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 156 place count 40 transition count 70
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 40 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 160 place count 40 transition count 68
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 170 place count 35 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 171 place count 35 transition count 92
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 174 place count 35 transition count 89
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 177 place count 32 transition count 89
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 178 place count 32 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 179 place count 31 transition count 88
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 7 with 14 rules applied. Total rules applied 193 place count 31 transition count 88
Applied a total of 193 rules in 59 ms. Remains 31 /125 variables (removed 94) and now considering 88/237 (removed 149) transitions.
Running 72 sub problems to find dead transitions.
[2026-05-25 11:11:46] [INFO ] Flow matrix only has 75 transitions (discarded 13 similar events)
// Phase 1: matrix 75 rows 31 cols
[2026-05-25 11:11:46] [INFO ] Computed 6 invariants in 2 ms
[2026-05-25 11:11:46] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 72 unsolved
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
At refinement iteration 3 (OVERLAPS) 75/106 variables, 31/37 constraints. Problems are: Problem set: 2 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 16/53 constraints. Problems are: Problem set: 2 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/53 constraints. Problems are: Problem set: 2 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 0/106 variables, 0/53 constraints. Problems are: Problem set: 2 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 53 constraints, problems are : Problem set: 2 solved, 70 unsolved in 1650 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 31/31 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 70 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 70 unsolved
At refinement iteration 3 (OVERLAPS) 75/106 variables, 31/37 constraints. Problems are: Problem set: 2 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 16/53 constraints. Problems are: Problem set: 2 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 70/123 constraints. Problems are: Problem set: 2 solved, 70 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 11:11:50] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 1/124 constraints. Problems are: Problem set: 2 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/124 constraints. Problems are: Problem set: 2 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/106 variables, 0/124 constraints. Problems are: Problem set: 2 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 124 constraints, problems are : Problem set: 2 solved, 70 unsolved in 4148 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 31/31 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 70/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 5898ms problems are : Problem set: 2 solved, 70 unsolved
Search for dead transitions found 2 dead transitions in 5909ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 31/125 places, 86/237 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 30 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 30 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 29 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 29 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 28 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 28 transition count 79
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 15 place count 28 transition count 70
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 25 place count 28 transition count 70
Applied a total of 25 rules in 13 ms. Remains 28 /31 variables (removed 3) and now considering 70/86 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5996 ms. Remains : 28/125 places, 70/237 transitions.
[2026-05-25 11:11:52] [INFO ] Flow matrix only has 61 transitions (discarded 9 similar events)
// Phase 1: matrix 61 rows 28 cols
[2026-05-25 11:11:52] [INFO ] Computed 8 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0] Max Struct:[1, 1]
FORMULA HealthRecord-PT-05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (3 resets) in 368 ms. (2710 steps per ms)
BEST_FIRST walk for 1000000 steps (5 resets) in 300 ms. (3322 steps per ms)
FORMULA HealthRecord-PT-05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2026-05-25 11:11:53] [INFO ] Flatten gal took : 39 ms
[2026-05-25 11:11:53] [INFO ] Flatten gal took : 11 ms
[2026-05-25 11:11:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5854976034198620044.gal : 6 ms
[2026-05-25 11:11:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18302673601198310106.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/ReachabilityCardinality5854976034198620044.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18302673601198310106.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 10545 ms.
BK_STOP 1779707513775
--------------------
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="HealthRecord-PT-05"
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 HealthRecord-PT-05, 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 r159-tall-177961079800072"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-05.tgz
mv HealthRecord-PT-05 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 '
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 ;
