Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r100-smll-174867008100573.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-05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867008100573
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K 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 51K 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-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 1748998699991

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-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-04 00:58:22] [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:58:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 00:58:23] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2025-06-04 00:58:23] [INFO ] Transformed 125 places.
[2025-06-04 00:58:23] [INFO ] Transformed 246 transitions.
[2025-06-04 00:58:23] [INFO ] Found NUPN structural information;
[2025-06-04 00:58:23] [INFO ] Parsed PT model containing 125 places and 246 transitions and 637 arcs in 384 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 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]
[2025-06-04 00:58:23] [INFO ] Flow matrix only has 229 transitions (discarded 8 similar events)
// Phase 1: matrix 229 rows 125 cols
[2025-06-04 00:58:23] [INFO ] Computed 14 invariants in 29 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 (919 resets) in 94 ms. (105 steps per ms)
FORMULA HealthRecord-PT-05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-09 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-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50003 steps (609 resets) in 103 ms. (480 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-06-04 00:58:23] [INFO ] Flow matrix only has 229 transitions (discarded 8 similar events)
[2025-06-04 00:58:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 00:58:24] [INFO ] [Real]Absence check using 8 positive place invariants in 25 ms returned sat
[2025-06-04 00:58:24] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 10 ms returned sat
[2025-06-04 00:58:24] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2025-06-04 00:58:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:58:24] [INFO ] [Real]Added 1 Read/Feed constraints in 11 ms returned sat
[2025-06-04 00:58:24] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 71 ms.
[2025-06-04 00:58:24] [INFO ] Added : 12 causal constraints over 3 iterations in 238 ms. Result :sat
Minimization took 225 ms.
[2025-06-04 00:58:24] [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:58:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 18 ms returned sat
[2025-06-04 00:58:25] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 8 ms returned sat
[2025-06-04 00:58:25] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2025-06-04 00:58:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 33 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:58:25] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:58:25] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 11 ms to minimize.
[2025-06-04 00:58:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 349 ms
[2025-06-04 00:58:25] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 46 ms.
[2025-06-04 00:58:25] [INFO ] Added : 11 causal constraints over 3 iterations in 187 ms. Result :sat
Minimization took 109 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 00:58:26] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-06-04 00:58:26] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2025-06-04 00:58:26] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2025-06-04 00:58:26] [INFO ] [Real]Added 1 Read/Feed constraints in 6 ms returned sat
[2025-06-04 00:58:26] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 30 ms.
[2025-06-04 00:58:26] [INFO ] Added : 14 causal constraints over 3 iterations in 104 ms. Result :sat
Minimization took 161 ms.
[2025-06-04 00:58:26] [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:58:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2025-06-04 00:58:26] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2025-06-04 00:58:26] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2025-06-04 00:58:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-04 00:58:26] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 27 ms.
[2025-06-04 00:58:26] [INFO ] Added : 17 causal constraints over 4 iterations in 116 ms. Result :sat
Minimization took 108 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 00:58:27] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-06-04 00:58:27] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2025-06-04 00:58:27] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2025-06-04 00:58:27] [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
[2025-06-04 00:58:27] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 4 ms to minimize.
[2025-06-04 00:58:27] [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:58:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2025-06-04 00:58:27] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2025-06-04 00:58:27] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2025-06-04 00:58:27] [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:58:27] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:58:27] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:58:27] [INFO ] Deduced a trap composed of 37 places in 149 ms of which 22 ms to minimize.
[2025-06-04 00:58:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 440 ms
[2025-06-04 00:58:27] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 34 ms.
[2025-06-04 00:58:28] [INFO ] Added : 11 causal constraints over 3 iterations in 131 ms. Result :sat
Minimization took 167 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 00:58:28] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2025-06-04 00:58:28] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2025-06-04 00:58:28] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2025-06-04 00:58:28] [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:58:28] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 9 ms to minimize.
[2025-06-04 00:58:28] [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:58:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 17 ms returned sat
[2025-06-04 00:58:28] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 8 ms returned sat
[2025-06-04 00:58:28] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2025-06-04 00:58:28] [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:58:28] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:58:29] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:58:29] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 10 ms to minimize.
[2025-06-04 00:58:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 452 ms
[2025-06-04 00:58:29] [INFO ] Computed and/alt/rep : 176/193/176 causal constraints (skipped 52 transitions) in 33 ms.
[2025-06-04 00:58:29] [INFO ] Added : 13 causal constraints over 3 iterations in 135 ms. Result :sat
Minimization took 163 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA HealthRecord-PT-05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 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 6 / 125 are part of one of the 3 SCC in 5 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 457 edges and 122 vertex of which 100 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.2 ms
Discarding 22 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 0 with 90 rules applied. Total rules applied 92 place count 100 transition count 123
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 150 place count 42 transition count 65
Iterating global reduction 1 with 58 rules applied. Total rules applied 208 place count 42 transition count 65
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 208 place count 42 transition count 58
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 222 place count 35 transition count 58
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 235 place count 22 transition count 37
Iterating global reduction 1 with 13 rules applied. Total rules applied 248 place count 22 transition count 37
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 251 place count 22 transition count 34
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 253 place count 20 transition count 31
Iterating global reduction 2 with 2 rules applied. Total rules applied 255 place count 20 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 256 place count 20 transition count 30
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 257 place count 19 transition count 29
Iterating global reduction 3 with 1 rules applied. Total rules applied 258 place count 19 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 259 place count 19 transition count 28
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 261 place count 18 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 262 place count 17 transition count 26
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 8 edges and 15 vertex of which 2 / 15 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 266 place count 14 transition count 25
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 270 place count 13 transition count 22
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 270 place count 13 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 274 place count 11 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 276 place count 11 transition count 18
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 278 place count 10 transition count 17
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 279 place count 10 transition count 16
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 280 place count 10 transition count 15
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 282 place count 9 transition count 14
Applied a total of 282 rules in 95 ms. Remains 9 /125 variables (removed 116) and now considering 14/237 (removed 223) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 9/125 places, 14/237 transitions.
// Phase 1: matrix 14 rows 9 cols
[2025-06-04 00:58:29] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
FORMULA HealthRecord-PT-05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (113815 resets) in 885 ms. (1128 steps per ms)
FORMULA HealthRecord-PT-05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (46220 resets) in 327 ms. (3048 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:58:31] [INFO ] Flatten gal took : 25 ms
[2025-06-04 00:58:31] [INFO ] Flatten gal took : 3 ms
[2025-06-04 00:58:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14699510545483745223.gal : 5 ms
[2025-06-04 00:58:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2080158433169294479.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/ReachabilityCardinality14699510545483745223.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2080158433169294479.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 8841 ms.

BK_STOP 1748998711487

--------------------
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="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-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 r100-smll-174867008100573"
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 '' 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 ;