Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K 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.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 162K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K 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 67K 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-07-UpperBounds-00
FORMULA_NAME HealthRecord-PT-07-UpperBounds-01
FORMULA_NAME HealthRecord-PT-07-UpperBounds-02
FORMULA_NAME HealthRecord-PT-07-UpperBounds-03
FORMULA_NAME HealthRecord-PT-07-UpperBounds-04
FORMULA_NAME HealthRecord-PT-07-UpperBounds-05
FORMULA_NAME HealthRecord-PT-07-UpperBounds-06
FORMULA_NAME HealthRecord-PT-07-UpperBounds-07
FORMULA_NAME HealthRecord-PT-07-UpperBounds-08
FORMULA_NAME HealthRecord-PT-07-UpperBounds-09
FORMULA_NAME HealthRecord-PT-07-UpperBounds-10
FORMULA_NAME HealthRecord-PT-07-UpperBounds-11
FORMULA_NAME HealthRecord-PT-07-UpperBounds-12
FORMULA_NAME HealthRecord-PT-07-UpperBounds-13
FORMULA_NAME HealthRecord-PT-07-UpperBounds-14
FORMULA_NAME HealthRecord-PT-07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748999833929

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-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-04 01:17:16] [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 01:17:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 01:17:17] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2025-06-04 01:17:17] [INFO ] Transformed 155 places.
[2025-06-04 01:17:17] [INFO ] Transformed 320 transitions.
[2025-06-04 01:17:17] [INFO ] Found NUPN structural information;
[2025-06-04 01:17:17] [INFO ] Parsed PT model containing 155 places and 320 transitions and 839 arcs in 402 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 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]
[2025-06-04 01:17:17] [INFO ] Flow matrix only has 283 transitions (discarded 12 similar events)
// Phase 1: matrix 283 rows 155 cols
[2025-06-04 01:17:17] [INFO ] Computed 18 invariants in 24 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 (527 resets) in 91 ms. (108 steps per ms)
FORMULA HealthRecord-PT-07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60005 steps (476 resets) in 125 ms. (476 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-06-04 01:17:17] [INFO ] Flow matrix only has 283 transitions (discarded 12 similar events)
[2025-06-04 01:17:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 01:17:18] [INFO ] [Real]Absence check using 10 positive place invariants in 30 ms returned sat
[2025-06-04 01:17:18] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 33 ms returned sat
[2025-06-04 01:17:18] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2025-06-04 01:17:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:17:18] [INFO ] [Real]Added 1 Read/Feed constraints in 19 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:17:18] [INFO ] Deduced a trap composed of 30 places in 359 ms of which 28 ms to minimize.
[2025-06-04 01:17:19] [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 01:17:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 22 ms returned sat
[2025-06-04 01:17:19] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 34 ms returned sat
[2025-06-04 01:17:19] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2025-06-04 01:17:19] [INFO ] [Nat]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 01:17:19] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 14 ms to minimize.
[2025-06-04 01:17:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2025-06-04 01:17:19] [INFO ] Computed and/alt/rep : 224/255/224 causal constraints (skipped 58 transitions) in 76 ms.
[2025-06-04 01:17:20] [INFO ] Added : 27 causal constraints over 6 iterations in 360 ms. Result :sat
Minimization took 236 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 01:17:20] [INFO ] [Real]Absence check using 10 positive place invariants in 19 ms returned sat
[2025-06-04 01:17:20] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2025-06-04 01:17:20] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2025-06-04 01:17:20] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2025-06-04 01:17:20] [INFO ] Computed and/alt/rep : 224/255/224 causal constraints (skipped 58 transitions) in 50 ms.
[2025-06-04 01:17:20] [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 01:17:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 20 ms returned sat
[2025-06-04 01:17:20] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 13 ms returned sat
[2025-06-04 01:17:21] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2025-06-04 01:17:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 19 ms returned sat
[2025-06-04 01:17:21] [INFO ] Computed and/alt/rep : 224/255/224 causal constraints (skipped 58 transitions) in 50 ms.
[2025-06-04 01:17:21] [INFO ] Added : 14 causal constraints over 3 iterations in 180 ms. Result :sat
Minimization took 239 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 01:17:21] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-04 01:17:21] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2025-06-04 01:17:21] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2025-06-04 01:17:21] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-04 01:17:21] [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 01:17:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2025-06-04 01:17:22] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2025-06-04 01:17:22] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2025-06-04 01:17:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2025-06-04 01:17:22] [INFO ] Computed and/alt/rep : 224/255/224 causal constraints (skipped 58 transitions) in 46 ms.
[2025-06-04 01:17:22] [INFO ] Added : 19 causal constraints over 5 iterations in 218 ms. Result :sat
Minimization took 231 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 01:17:22] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-04 01:17:22] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2025-06-04 01:17:22] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2025-06-04 01:17:23] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-04 01:17:23] [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 01:17:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2025-06-04 01:17:23] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2025-06-04 01:17:23] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2025-06-04 01:17:23] [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 01:17:23] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 21 ms to minimize.
[2025-06-04 01:17:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2025-06-04 01:17:23] [INFO ] Computed and/alt/rep : 224/255/224 causal constraints (skipped 58 transitions) in 43 ms.
[2025-06-04 01:17:23] [INFO ] Added : 15 causal constraints over 4 iterations in 188 ms. Result :sat
Minimization took 229 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 01:17:24] [INFO ] [Real]Absence check using 10 positive place invariants in 18 ms returned sat
[2025-06-04 01:17:24] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2025-06-04 01:17:24] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2025-06-04 01:17:24] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2025-06-04 01:17: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 01:17:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2025-06-04 01:17:24] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2025-06-04 01:17:24] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2025-06-04 01:17:24] [INFO ] [Nat]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 01:17:24] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 20 ms to minimize.
[2025-06-04 01:17:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2025-06-04 01:17:24] [INFO ] Computed and/alt/rep : 224/255/224 causal constraints (skipped 58 transitions) in 42 ms.
[2025-06-04 01:17:24] [INFO ] Added : 13 causal constraints over 3 iterations in 162 ms. Result :sat
Minimization took 239 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-07-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-07-UpperBounds-11 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 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 295/295 transitions.
Graph (trivial) has 231 edges and 155 vertex of which 14 / 155 are part of one of the 7 SCC in 6 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Graph (complete) has 639 edges and 148 vertex of which 114 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.2 ms
Discarding 34 places :
Also discarding 21 output transitions
Drop transitions (Output transitions of discarded places.) removed 21 transitions
Drop transitions (Empty/Sink Transition effects.) removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 0 with 104 rules applied. Total rules applied 106 place count 114 transition count 143
Discarding 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 178 place count 42 transition count 71
Iterating global reduction 1 with 72 rules applied. Total rules applied 250 place count 42 transition count 71
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 250 place count 42 transition count 69
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 254 place count 40 transition count 69
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 264 place count 30 transition count 59
Iterating global reduction 1 with 10 rules applied. Total rules applied 274 place count 30 transition count 59
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 282 place count 30 transition count 51
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 284 place count 28 transition count 48
Iterating global reduction 2 with 2 rules applied. Total rules applied 286 place count 28 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 287 place count 28 transition count 47
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 288 place count 27 transition count 46
Iterating global reduction 3 with 1 rules applied. Total rules applied 289 place count 27 transition count 46
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 292 place count 27 transition count 43
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 300 place count 23 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 302 place count 23 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 303 place count 22 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 304 place count 21 transition count 36
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 307 place count 21 transition count 33
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 5 with 2 rules applied. Total rules applied 309 place count 20 transition count 32
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 310 place count 19 transition count 31
Iterating global reduction 5 with 1 rules applied. Total rules applied 311 place count 19 transition count 31
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 314 place count 19 transition count 28
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 315 place count 19 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 316 place count 18 transition count 27
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 317 place count 18 transition count 27
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 318 place count 18 transition count 26
Applied a total of 318 rules in 116 ms. Remains 18 /155 variables (removed 137) and now considering 26/295 (removed 269) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 18/155 places, 26/295 transitions.
[2025-06-04 01:17:25] [INFO ] Flow matrix only has 22 transitions (discarded 4 similar events)
// Phase 1: matrix 22 rows 18 cols
[2025-06-04 01:17:25] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
FORMULA HealthRecord-PT-07-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (80020 resets) in 1506 ms. (663 steps per ms)
FORMULA HealthRecord-PT-07-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (26401 resets) in 454 ms. (2197 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 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 01:17:27] [INFO ] Flatten gal took : 51 ms
[2025-06-04 01:17:27] [INFO ] Flatten gal took : 12 ms
[2025-06-04 01:17:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8152350847464089883.gal : 10 ms
[2025-06-04 01:17:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17053043061541039638.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/ReachabilityCardinality8152350847464089883.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17053043061541039638.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 11220 ms.

BK_STOP 1748999848049

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

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