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-177961079800073.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-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-tall-177961079800073
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.2K Mar 7 13:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 7 13:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 7 13:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Mar 7 13:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 8.8K Mar 7 13:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Mar 7 13:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 7 13:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Mar 7 13:28 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 67K 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-06-UpperBounds-00
FORMULA_NAME HealthRecord-PT-06-UpperBounds-01
FORMULA_NAME HealthRecord-PT-06-UpperBounds-02
FORMULA_NAME HealthRecord-PT-06-UpperBounds-03
FORMULA_NAME HealthRecord-PT-06-UpperBounds-04
FORMULA_NAME HealthRecord-PT-06-UpperBounds-05
FORMULA_NAME HealthRecord-PT-06-UpperBounds-06
FORMULA_NAME HealthRecord-PT-06-UpperBounds-07
FORMULA_NAME HealthRecord-PT-06-UpperBounds-08
FORMULA_NAME HealthRecord-PT-06-UpperBounds-09
FORMULA_NAME HealthRecord-PT-06-UpperBounds-10
FORMULA_NAME HealthRecord-PT-06-UpperBounds-11
FORMULA_NAME HealthRecord-PT-06-UpperBounds-12
FORMULA_NAME HealthRecord-PT-06-UpperBounds-13
FORMULA_NAME HealthRecord-PT-06-UpperBounds-14
FORMULA_NAME HealthRecord-PT-06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779707510860

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-25 11:11:52] [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:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 11:11:52] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2026-05-25 11:11:52] [INFO ] Transformed 154 places.
[2026-05-25 11:11:52] [INFO ] Transformed 319 transitions.
[2026-05-25 11:11:52] [INFO ] Found NUPN structural information;
[2026-05-25 11:11:52] [INFO ] Parsed PT model containing 154 places and 319 transitions and 835 arcs in 163 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 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:52] [INFO ] Flow matrix only has 282 transitions (discarded 12 similar events)
// Phase 1: matrix 282 rows 154 cols
[2026-05-25 11:11:52] [INFO ] Computed 18 invariants in 11 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 (501 resets) in 47 ms. (208 steps per ms)
FORMULA HealthRecord-PT-06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60004 steps (416 resets) in 56 ms. (1052 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2026-05-25 11:11:52] [INFO ] Flow matrix only has 282 transitions (discarded 12 similar events)
[2026-05-25 11:11:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:11:52] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2026-05-25 11:11:52] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2026-05-25 11:11:52] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2026-05-25 11:11:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 11:11:52] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2026-05-25 11:11:52] [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:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2026-05-25 11:11:52] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2026-05-25 11:11:53] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2026-05-25 11:11:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 11:11:53] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 22 ms.
[2026-05-25 11:11:53] [INFO ] Added : 20 causal constraints over 5 iterations in 119 ms. Result :sat
Minimization took 98 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:11:53] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2026-05-25 11:11:53] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2026-05-25 11:11:53] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2026-05-25 11:11:53] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2026-05-25 11:11:53] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 18 ms.
[2026-05-25 11:11:53] [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:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2026-05-25 11:11:53] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2026-05-25 11:11:53] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2026-05-25 11:11:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2026-05-25 11:11:53] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 17 ms.
[2026-05-25 11:11:53] [INFO ] Added : 25 causal constraints over 6 iterations in 99 ms. Result :sat
Minimization took 89 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:11:53] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2026-05-25 11:11:53] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2026-05-25 11:11:53] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2026-05-25 11:11:53] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2026-05-25 11:11:53] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 15 ms.
[2026-05-25 11:11:54] [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:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2026-05-25 11:11:54] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2026-05-25 11:11:54] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2026-05-25 11:11:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2026-05-25 11:11:54] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 17 ms.
[2026-05-25 11:11:54] [INFO ] Added : 22 causal constraints over 5 iterations in 94 ms. Result :sat
Minimization took 93 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:11:54] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2026-05-25 11:11:54] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2026-05-25 11:11:54] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2026-05-25 11:11:54] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 11:11:54] [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:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2026-05-25 11:11:54] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2026-05-25 11:11:54] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2026-05-25 11:11:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 11:11:54] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 14 ms.
[2026-05-25 11:11:54] [INFO ] Added : 19 causal constraints over 5 iterations in 78 ms. Result :sat
Minimization took 88 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:11:54] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2026-05-25 11:11:54] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2026-05-25 11:11:54] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2026-05-25 11:11:54] [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:54] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 9 ms to minimize.
[2026-05-25 11:11:54] [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:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2026-05-25 11:11:55] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2026-05-25 11:11:55] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2026-05-25 11:11:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 11:11:55] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 16 ms.
[2026-05-25 11:11:55] [INFO ] Added : 18 causal constraints over 4 iterations in 70 ms. Result :sat
Minimization took 98 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 11:11:55] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-25 11:11:55] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2026-05-25 11:11:55] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2026-05-25 11:11:55] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 11:11:55] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 13 ms.
[2026-05-25 11:11:55] [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:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-25 11:11:55] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2026-05-25 11:11:55] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2026-05-25 11:11:55] [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:55] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 5 ms to minimize.
[2026-05-25 11:11:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2026-05-25 11:11:55] [INFO ] Computed and/alt/rep : 224/254/224 causal constraints (skipped 57 transitions) in 14 ms.
[2026-05-25 11:11:55] [INFO ] Added : 20 causal constraints over 5 iterations in 79 ms. Result :sat
Minimization took 98 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-06-UpperBounds-07 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 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 294/294 transitions.
Graph (trivial) has 232 edges and 154 vertex of which 12 / 154 are part of one of the 6 SCC in 2 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Graph (complete) has 638 edges and 148 vertex of which 138 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 138 transition count 263
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 14 rules applied. Total rules applied 22 place count 132 transition count 255
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 130 transition count 255
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 24 place count 130 transition count 251
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 35 place count 123 transition count 251
Discarding 74 places :
Symmetric choice reduction at 3 with 74 rule applications. Total rules 109 place count 49 transition count 103
Iterating global reduction 3 with 74 rules applied. Total rules applied 183 place count 49 transition count 103
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 192 place count 40 transition count 85
Iterating global reduction 3 with 9 rules applied. Total rules applied 201 place count 40 transition count 85
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 210 place count 40 transition count 76
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 212 place count 38 transition count 70
Iterating global reduction 4 with 2 rules applied. Total rules applied 214 place count 38 transition count 70
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 216 place count 36 transition count 66
Iterating global reduction 4 with 2 rules applied. Total rules applied 218 place count 36 transition count 66
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 224 place count 36 transition count 60
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -42
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 234 place count 31 transition count 102
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 237 place count 31 transition count 99
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 239 place count 31 transition count 97
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 241 place count 29 transition count 97
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 244 place count 29 transition count 94
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 257 place count 29 transition count 94
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 258 place count 29 transition count 94
Applied a total of 258 rules in 69 ms. Remains 29 /154 variables (removed 125) and now considering 94/294 (removed 200) transitions.
Running 78 sub problems to find dead transitions.
[2026-05-25 11:11:56] [INFO ] Flow matrix only has 87 transitions (discarded 7 similar events)
// Phase 1: matrix 87 rows 29 cols
[2026-05-25 11:11:56] [INFO ] Computed 5 invariants in 1 ms
[2026-05-25 11:11:56] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
At refinement iteration 3 (OVERLAPS) 87/116 variables, 29/34 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 31/65 constraints. Problems are: Problem set: 2 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 11:11:57] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 1/66 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/66 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/116 variables, 0/66 constraints. Problems are: Problem set: 2 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 66 constraints, problems are : Problem set: 2 solved, 76 unsolved in 2160 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 29/29 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 76 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 2/29 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 87/116 variables, 29/34 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 31/65 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 76/141 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 1/142 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/142 constraints. Problems are: Problem set: 2 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/116 variables, 0/142 constraints. Problems are: Problem set: 2 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 142 constraints, problems are : Problem set: 2 solved, 76 unsolved in 4127 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 29/29 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 76/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6405ms problems are : Problem set: 2 solved, 76 unsolved
Search for dead transitions found 2 dead transitions in 6414ms
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 : 29/154 places, 92/294 transitions.
Graph (complete) has 117 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 14 place count 28 transition count 92
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 28 transition count 92
Applied a total of 15 rules in 17 ms. Remains 28 /29 variables (removed 1) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6511 ms. Remains : 28/154 places, 92/294 transitions.
[2026-05-25 11:12:02] [INFO ] Flow matrix only has 85 transitions (discarded 7 similar events)
// Phase 1: matrix 85 rows 28 cols
[2026-05-25 11:12:02] [INFO ] Computed 6 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0] Max Struct:[1, 1]
FORMULA HealthRecord-PT-06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (91 resets) in 425 ms. (2347 steps per ms)
BEST_FIRST walk for 1000000 steps (70 resets) in 333 ms. (2994 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-25 11:12:03] [INFO ] Flow matrix only has 85 transitions (discarded 7 similar events)
[2026-05-25 11:12:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 11:12:03] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-25 11:12:03] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-25 11:12:03] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-25 11:12:03] [INFO ] [Real]Added 30 Read/Feed constraints in 6 ms returned sat
[2026-05-25 11:12:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 11:12:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-25 11:12:03] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2026-05-25 11:12:03] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2026-05-25 11:12:03] [INFO ] Computed and/alt/rep : 6/13/6 causal constraints (skipped 63 transitions) in 7 ms.
[2026-05-25 11:12:03] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 28 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p90) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 90/90 transitions.
Graph (trivial) has 5 edges and 28 vertex of which 2 / 28 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 105 edges and 27 vertex of which 21 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 21 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 20 transition count 74
Applied a total of 17 rules in 5 ms. Remains 20 /28 variables (removed 8) and now considering 74/90 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 20/28 places, 74/90 transitions.
[2026-05-25 11:12:03] [INFO ] Flow matrix only has 67 transitions (discarded 7 similar events)
// Phase 1: matrix 67 rows 20 cols
[2026-05-25 11:12:03] [INFO ] Computed 1 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA HealthRecord-PT-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (291553 resets) in 1107 ms. (902 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
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:12:04] [INFO ] Flatten gal took : 37 ms
[2026-05-25 11:12:04] [INFO ] Flatten gal took : 8 ms
[2026-05-25 11:12:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6829761586734370557.gal : 6 ms
[2026-05-25 11:12:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2335028232269158891.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/ReachabilityCardinality6829761586734370557.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2335028232269158891.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 12512 ms.

BK_STOP 1779707524731

--------------------
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-06"
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-06, 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-177961079800073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-06.tgz
mv HealthRecord-PT-06 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 ;