Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r100-smll-174867008100557.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is HealthRecord-PT-03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867008100557
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 49K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748997459930

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-04 00:37:42] [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]
[2025-06-04 00:37:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 00:37:43] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2025-06-04 00:37:43] [INFO ] Transformed 121 places.
[2025-06-04 00:37:43] [INFO ] Transformed 232 transitions.
[2025-06-04 00:37:43] [INFO ] Found NUPN structural information;
[2025-06-04 00:37:43] [INFO ] Parsed PT model containing 121 places and 232 transitions and 597 arcs in 389 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 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]
[2025-06-04 00:37:43] [INFO ] Flow matrix only has 217 transitions (discarded 8 similar events)
// Phase 1: matrix 217 rows 121 cols
[2025-06-04 00:37:43] [INFO ] Computed 14 invariants in 23 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 (664 resets) in 86 ms. (114 steps per ms)
FORMULA HealthRecord-PT-03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60006 steps (612 resets) in 118 ms. (504 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]
[2025-06-04 00:37:43] [INFO ] Flow matrix only has 217 transitions (discarded 8 similar events)
[2025-06-04 00:37:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 00:37:43] [INFO ] [Real]Absence check using 8 positive place invariants in 26 ms returned sat
[2025-06-04 00:37:43] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 12 ms returned sat
[2025-06-04 00:37:44] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2025-06-04 00:37:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:37:44] [INFO ] [Real]Added 1 Read/Feed constraints in 11 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:37:44] [INFO ] Deduced a trap composed of 29 places in 221 ms of which 25 ms to minimize.
[2025-06-04 00:37:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 00:37:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 23 ms returned sat
[2025-06-04 00:37:44] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 8 ms returned sat
[2025-06-04 00:37:45] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2025-06-04 00:37:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 24 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:37:45] [INFO ] Deduced a trap composed of 29 places in 172 ms of which 10 ms to minimize.
[2025-06-04 00:37:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2025-06-04 00:37:45] [INFO ] Computed and/alt/rep : 170/183/170 causal constraints (skipped 46 transitions) in 42 ms.
[2025-06-04 00:37:45] [INFO ] Added : 16 causal constraints over 4 iterations in 219 ms. Result :sat
Minimization took 189 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 00:37:45] [INFO ] [Real]Absence check using 8 positive place invariants in 21 ms returned sat
[2025-06-04 00:37:45] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 12 ms returned sat
[2025-06-04 00:37:46] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2025-06-04 00:37:46] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:37:46] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 8 ms to minimize.
[2025-06-04 00:37:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 00:37:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2025-06-04 00:37:46] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2025-06-04 00:37:46] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2025-06-04 00:37:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:37:46] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:37:46] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 9 ms to minimize.
[2025-06-04 00:37:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 286 ms
[2025-06-04 00:37:46] [INFO ] Computed and/alt/rep : 170/183/170 causal constraints (skipped 46 transitions) in 38 ms.
[2025-06-04 00:37:46] [INFO ] Added : 15 causal constraints over 4 iterations in 175 ms. Result :sat
Minimization took 187 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 00:37:47] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2025-06-04 00:37:47] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 9 ms returned sat
[2025-06-04 00:37:47] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2025-06-04 00:37:47] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-04 00:37:47] [INFO ] Computed and/alt/rep : 170/183/170 causal constraints (skipped 46 transitions) in 33 ms.
[2025-06-04 00:37:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 00:37:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2025-06-04 00:37:47] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 9 ms returned sat
[2025-06-04 00:37:47] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2025-06-04 00:37:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-04 00:37:47] [INFO ] Computed and/alt/rep : 170/183/170 causal constraints (skipped 46 transitions) in 31 ms.
[2025-06-04 00:37:47] [INFO ] Added : 26 causal constraints over 6 iterations in 224 ms. Result :sat
Minimization took 183 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 00:37:48] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2025-06-04 00:37:48] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2025-06-04 00:37:48] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2025-06-04 00:37:48] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:37:48] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 9 ms to minimize.
[2025-06-04 00:37:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 00:37:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2025-06-04 00:37:48] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2025-06-04 00:37:48] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2025-06-04 00:37:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:37:49] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:37:49] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 9 ms to minimize.
[2025-06-04 00:37:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 312 ms
[2025-06-04 00:37:49] [INFO ] Computed and/alt/rep : 170/183/170 causal constraints (skipped 46 transitions) in 31 ms.
[2025-06-04 00:37:49] [INFO ] Added : 16 causal constraints over 4 iterations in 162 ms. Result :sat
Minimization took 189 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 00:37:49] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2025-06-04 00:37:49] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2025-06-04 00:37:49] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2025-06-04 00:37:49] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:37:49] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 20 ms to minimize.
[2025-06-04 00:37:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 00:37:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2025-06-04 00:37:50] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2025-06-04 00:37:50] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2025-06-04 00:37:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:37:50] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:37:50] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:37:50] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 8 ms to minimize.
[2025-06-04 00:37:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 397 ms
[2025-06-04 00:37:50] [INFO ] Computed and/alt/rep : 170/183/170 causal constraints (skipped 46 transitions) in 38 ms.
[2025-06-04 00:37:50] [INFO ] Added : 18 causal constraints over 4 iterations in 177 ms. Result :sat
Minimization took 186 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 00:37:51] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2025-06-04 00:37:51] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 11 ms returned sat
[2025-06-04 00:37:51] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2025-06-04 00:37:51] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:37:51] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 7 ms to minimize.
[2025-06-04 00:37:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 00:37:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2025-06-04 00:37:51] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2025-06-04 00:37:51] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2025-06-04 00:37:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:37:51] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:37:51] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 8 ms to minimize.
[2025-06-04 00:37:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 255 ms
[2025-06-04 00:37:51] [INFO ] Computed and/alt/rep : 170/183/170 causal constraints (skipped 46 transitions) in 26 ms.
[2025-06-04 00:37:51] [INFO ] Added : 15 causal constraints over 4 iterations in 147 ms. Result :sat
Minimization took 182 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-03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-03-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-03-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-03-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 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 225/225 transitions.
Graph (trivial) has 177 edges and 121 vertex of which 10 / 121 are part of one of the 5 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 429 edges and 116 vertex of which 90 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.1 ms
Discarding 26 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Drop transitions (Empty/Sink Transition effects.) removed 83 transitions
Reduce isomorphic transitions removed 83 transitions.
Iterating post reduction 0 with 83 rules applied. Total rules applied 85 place count 90 transition count 108
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 138 place count 37 transition count 55
Iterating global reduction 1 with 53 rules applied. Total rules applied 191 place count 37 transition count 55
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 191 place count 37 transition count 50
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 201 place count 32 transition count 50
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 212 place count 21 transition count 35
Iterating global reduction 1 with 11 rules applied. Total rules applied 223 place count 21 transition count 35
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 227 place count 21 transition count 31
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 229 place count 19 transition count 28
Iterating global reduction 2 with 2 rules applied. Total rules applied 231 place count 19 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 232 place count 19 transition count 27
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 233 place count 18 transition count 26
Iterating global reduction 3 with 1 rules applied. Total rules applied 234 place count 18 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 235 place count 18 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 237 place count 17 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 238 place count 16 transition count 23
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 10 edges and 14 vertex of which 2 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 242 place count 13 transition count 22
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 246 place count 12 transition count 19
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 246 place count 12 transition count 16
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 252 place count 9 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 253 place count 9 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 255 place count 8 transition count 14
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 256 place count 8 transition count 13
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 257 place count 8 transition count 12
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 259 place count 7 transition count 11
Applied a total of 259 rules in 123 ms. Remains 7 /121 variables (removed 114) and now considering 11/225 (removed 214) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 7/121 places, 11/225 transitions.
// Phase 1: matrix 11 rows 7 cols
[2025-06-04 00:37:52] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0] Max Struct:[1, 1]
FORMULA HealthRecord-PT-03-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (83324 resets) in 790 ms. (1264 steps per ms)
FORMULA HealthRecord-PT-03-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (41685 resets) in 335 ms. (2976 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 )
[2025-06-04 00:37:53] [INFO ] Flatten gal took : 21 ms
[2025-06-04 00:37:53] [INFO ] Flatten gal took : 5 ms
[2025-06-04 00:37:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8129847733469901169.gal : 8 ms
[2025-06-04 00:37:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2572621904883896347.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/ReachabilityCardinality8129847733469901169.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2572621904883896347.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 11266 ms.

BK_STOP 1748997474014

--------------------
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-03"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is HealthRecord-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 r100-smll-174867008100557"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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