Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K 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.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 18K 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 109K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K 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 68K 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-09-UpperBounds-00
FORMULA_NAME HealthRecord-PT-09-UpperBounds-01
FORMULA_NAME HealthRecord-PT-09-UpperBounds-02
FORMULA_NAME HealthRecord-PT-09-UpperBounds-03
FORMULA_NAME HealthRecord-PT-09-UpperBounds-04
FORMULA_NAME HealthRecord-PT-09-UpperBounds-05
FORMULA_NAME HealthRecord-PT-09-UpperBounds-06
FORMULA_NAME HealthRecord-PT-09-UpperBounds-07
FORMULA_NAME HealthRecord-PT-09-UpperBounds-08
FORMULA_NAME HealthRecord-PT-09-UpperBounds-09
FORMULA_NAME HealthRecord-PT-09-UpperBounds-10
FORMULA_NAME HealthRecord-PT-09-UpperBounds-11
FORMULA_NAME HealthRecord-PT-09-UpperBounds-12
FORMULA_NAME HealthRecord-PT-09-UpperBounds-13
FORMULA_NAME HealthRecord-PT-09-UpperBounds-14
FORMULA_NAME HealthRecord-PT-09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749001224017

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-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-04 01:40:26] [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:40:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 01:40:27] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2025-06-04 01:40:27] [INFO ] Transformed 157 places.
[2025-06-04 01:40:27] [INFO ] Transformed 327 transitions.
[2025-06-04 01:40:27] [INFO ] Found NUPN structural information;
[2025-06-04 01:40:27] [INFO ] Parsed PT model containing 157 places and 327 transitions and 859 arcs in 421 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 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:40:27] [INFO ] Flow matrix only has 289 transitions (discarded 12 similar events)
// Phase 1: matrix 289 rows 157 cols
[2025-06-04 01:40:27] [INFO ] Computed 18 invariants in 32 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 (590 resets) in 109 ms. (90 steps per ms)
FORMULA HealthRecord-PT-09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-09-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-09-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-09-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-09-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (345 resets) in 115 ms. (431 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:40:27] [INFO ] Flow matrix only has 289 transitions (discarded 12 similar events)
[2025-06-04 01:40:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 01:40:28] [INFO ] [Real]Absence check using 10 positive place invariants in 31 ms returned sat
[2025-06-04 01:40:28] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 13 ms returned sat
[2025-06-04 01:40:28] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2025-06-04 01:40:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:40:28] [INFO ] [Real]Added 1 Read/Feed constraints in 7 ms returned sat
[2025-06-04 01:40:28] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 87 ms.
[2025-06-04 01:40:29] [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:40:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 22 ms returned sat
[2025-06-04 01:40:29] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2025-06-04 01:40:29] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2025-06-04 01:40:29] [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:40:29] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 17 ms to minimize.
[2025-06-04 01:40:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2025-06-04 01:40:29] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 36 ms.
[2025-06-04 01:40:29] [INFO ] Added : 13 causal constraints over 4 iterations in 142 ms. Result :sat
Minimization took 153 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 01:40:30] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-04 01:40:30] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2025-06-04 01:40:30] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2025-06-04 01:40:30] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-04 01:40:30] [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:40:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2025-06-04 01:40:30] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2025-06-04 01:40:30] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2025-06-04 01:40:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-04 01:40:30] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 41 ms.
[2025-06-04 01:40:30] [INFO ] Added : 20 causal constraints over 5 iterations in 234 ms. Result :sat
Minimization took 227 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 01:40:31] [INFO ] [Real]Absence check using 10 positive place invariants in 18 ms returned sat
[2025-06-04 01:40:31] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2025-06-04 01:40:31] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2025-06-04 01:40:31] [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 01:40:31] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 13 ms to minimize.
[2025-06-04 01:40:31] [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:40:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 20 ms returned sat
[2025-06-04 01:40:31] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2025-06-04 01:40:31] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2025-06-04 01:40:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2025-06-04 01:40:31] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 46 ms.
[2025-06-04 01:40:31] [INFO ] Added : 19 causal constraints over 5 iterations in 226 ms. Result :sat
Minimization took 227 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 01:40:32] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-04 01:40:32] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2025-06-04 01:40:32] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2025-06-04 01:40:32] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2025-06-04 01:40:32] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 48 ms.
[2025-06-04 01:40:32] [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:40:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-04 01:40:32] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2025-06-04 01:40:33] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2025-06-04 01:40:33] [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:40:33] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 6 ms to minimize.
[2025-06-04 01:40:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2025-06-04 01:40:33] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 49 ms.
[2025-06-04 01:40:33] [INFO ] Added : 18 causal constraints over 5 iterations in 229 ms. Result :sat
Minimization took 233 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 01:40:33] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2025-06-04 01:40:33] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2025-06-04 01:40:34] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2025-06-04 01:40:34] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2025-06-04 01:40:34] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 57 ms.
[2025-06-04 01:40:34] [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:40:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2025-06-04 01:40:34] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2025-06-04 01:40:34] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2025-06-04 01:40:34] [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:40:34] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:40:34] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 6 ms to minimize.
[2025-06-04 01:40:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 237 ms
[2025-06-04 01:40:34] [INFO ] Computed and/alt/rep : 227/260/227 causal constraints (skipped 61 transitions) in 41 ms.
[2025-06-04 01:40:34] [INFO ] Added : 15 causal constraints over 4 iterations in 211 ms. Result :sat
Minimization took 231 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-09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-09-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-09-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 157 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p8) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 299/299 transitions.
Graph (trivial) has 238 edges and 157 vertex of which 12 / 157 are part of one of the 6 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Graph (complete) has 651 edges and 151 vertex of which 119 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Discarding 32 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Drop transitions (Empty/Sink Transition effects.) removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Iterating post reduction 0 with 110 rules applied. Total rules applied 112 place count 119 transition count 146
Discarding 77 places :
Symmetric choice reduction at 1 with 77 rule applications. Total rules 189 place count 42 transition count 69
Iterating global reduction 1 with 77 rules applied. Total rules applied 266 place count 42 transition count 69
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 266 place count 42 transition count 63
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 278 place count 36 transition count 63
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 290 place count 24 transition count 49
Iterating global reduction 1 with 12 rules applied. Total rules applied 302 place count 24 transition count 49
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 311 place count 24 transition count 40
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 314 place count 21 transition count 35
Iterating global reduction 2 with 3 rules applied. Total rules applied 317 place count 21 transition count 35
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 318 place count 21 transition count 34
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 320 place count 19 transition count 32
Iterating global reduction 3 with 2 rules applied. Total rules applied 322 place count 19 transition count 32
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 328 place count 19 transition count 26
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 330 place count 18 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 331 place count 18 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 332 place count 17 transition count 23
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 336 place count 14 transition count 22
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 342 place count 13 transition count 17
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 342 place count 13 transition count 15
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 346 place count 11 transition count 15
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 347 place count 11 transition count 14
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 349 place count 10 transition count 13
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 352 place count 10 transition count 10
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 353 place count 10 transition count 9
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 355 place count 9 transition count 8
Applied a total of 355 rules in 130 ms. Remains 9 /157 variables (removed 148) and now considering 8/299 (removed 291) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 9/157 places, 8/299 transitions.
[2025-06-04 01:40:35] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 9 cols
[2025-06-04 01:40:35] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 976 ms. (1023 steps per ms)
FORMULA HealthRecord-PT-09-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 616 ms. (1620 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 01:40:37] [INFO ] Flatten gal took : 23 ms
[2025-06-04 01:40:37] [INFO ] Flatten gal took : 5 ms
[2025-06-04 01:40:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9507290839636676521.gal : 4 ms
[2025-06-04 01:40:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10865518762496118044.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/ReachabilityCardinality9507290839636676521.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10865518762496118044.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 10655 ms.

BK_STOP 1749001237675

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

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