Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r111-smll-174867015900070.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 gold2024
Input is HealthRecord-PT-03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-smll-174867015900070
=====================================================================

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

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748785490050

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 13:44:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 13:44:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 13:44:52] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2025-06-01 13:44:53] [INFO ] Transformed 121 places.
[2025-06-01 13:44:53] [INFO ] Transformed 232 transitions.
[2025-06-01 13:44:53] [INFO ] Found NUPN structural information;
[2025-06-01 13:44:53] [INFO ] Parsed PT model containing 121 places and 232 transitions and 597 arcs in 502 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-01 13:44:53] [INFO ] Flow matrix only has 217 transitions (discarded 8 similar events)
// Phase 1: matrix 217 rows 121 cols
[2025-06-01 13:44:53] [INFO ] Computed 14 invariants in 12 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 (674 resets) in 51 ms. (192 steps per ms)
FORMULA HealthRecord-PT-03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-03-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (514 resets) in 76 ms. (649 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-01 13:44:53] [INFO ] Flow matrix only has 217 transitions (discarded 8 similar events)
[2025-06-01 13:44:53] [INFO ] Invariant cache hit.
[2025-06-01 13:44:53] [INFO ] [Real]Absence check using 8 positive place invariants in 21 ms returned sat
[2025-06-01 13:44:53] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 20 ms returned sat
[2025-06-01 13:44:53] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2025-06-01 13:44:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 13:44:54] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2025-06-01 13:44:54] [INFO ] Computed and/alt/rep : 170/183/170 causal constraints (skipped 46 transitions) in 65 ms.
[2025-06-01 13:44:54] [INFO ] Added : 8 causal constraints over 2 iterations in 163 ms. Result :sat
Minimization took 246 ms.
[2025-06-01 13:44:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:44:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2025-06-01 13:44:54] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2025-06-01 13:44:54] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2025-06-01 13:44:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2025-06-01 13:44:54] [INFO ] Computed and/alt/rep : 170/183/170 causal constraints (skipped 46 transitions) in 44 ms.
[2025-06-01 13:44:54] [INFO ] Added : 8 causal constraints over 2 iterations in 135 ms. Result :sat
Minimization took 196 ms.
[2025-06-01 13:44:55] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2025-06-01 13:44:55] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2025-06-01 13:44:55] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2025-06-01 13:44:55] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:44:55] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 28 ms to minimize.
[2025-06-01 13:44:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:44:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-01 13:44:55] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2025-06-01 13:44:55] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2025-06-01 13:44:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:44:55] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 3 ms to minimize.
[2025-06-01 13:44:56] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2025-06-01 13:44:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 239 ms
[2025-06-01 13:44:56] [INFO ] Computed and/alt/rep : 170/183/170 causal constraints (skipped 46 transitions) in 33 ms.
[2025-06-01 13:44:56] [INFO ] Added : 16 causal constraints over 4 iterations in 124 ms. Result :sat
Minimization took 139 ms.
[2025-06-01 13:44:56] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-01 13:44:56] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2025-06-01 13:44:56] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2025-06-01 13:44:56] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-01 13:44:56] [INFO ] Computed and/alt/rep : 170/183/170 causal constraints (skipped 46 transitions) in 22 ms.
[2025-06-01 13:44:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:44:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-01 13:44:56] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2025-06-01 13:44:56] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2025-06-01 13:44:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 13:44:56] [INFO ] Computed and/alt/rep : 170/183/170 causal constraints (skipped 46 transitions) in 24 ms.
[2025-06-01 13:44:56] [INFO ] Added : 26 causal constraints over 6 iterations in 129 ms. Result :sat
Minimization took 132 ms.
[2025-06-01 13:44:57] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-01 13:44:57] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2025-06-01 13:44:57] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2025-06-01 13:44:57] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:44:57] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2025-06-01 13:44:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:44:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-01 13:44:57] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2025-06-01 13:44:57] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2025-06-01 13:44:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:44:57] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
[2025-06-01 13:44:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2025-06-01 13:44:57] [INFO ] Computed and/alt/rep : 170/183/170 causal constraints (skipped 46 transitions) in 30 ms.
[2025-06-01 13:44:57] [INFO ] Added : 17 causal constraints over 4 iterations in 134 ms. Result :sat
Minimization took 182 ms.
[2025-06-01 13:44:57] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2025-06-01 13:44:57] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2025-06-01 13:44:57] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2025-06-01 13:44:57] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:44:58] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 3 ms to minimize.
[2025-06-01 13:44:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:44:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-01 13:44:58] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2025-06-01 13:44:58] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2025-06-01 13:44:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-01 13:44:58] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2025-06-01 13:44:58] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 2 ms to minimize.
[2025-06-01 13:44:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 143 ms
[2025-06-01 13:44:58] [INFO ] Computed and/alt/rep : 170/183/170 causal constraints (skipped 46 transitions) in 25 ms.
[2025-06-01 13:44:58] [INFO ] Added : 19 causal constraints over 4 iterations in 96 ms. Result :sat
Minimization took 131 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-03-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-03-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-03-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-03-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 121 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p11) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 223/223 transitions.
Graph (trivial) has 177 edges and 121 vertex of which 10 / 121 are part of one of the 5 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 427 edges and 116 vertex of which 90 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.1 ms
Discarding 26 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Drop transitions (Empty/Sink Transition effects.) removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 0 with 84 rules applied. Total rules applied 86 place count 90 transition count 105
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 138 place count 38 transition count 53
Iterating global reduction 1 with 52 rules applied. Total rules applied 190 place count 38 transition count 53
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 190 place count 38 transition count 48
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 200 place count 33 transition count 48
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 213 place count 20 transition count 31
Iterating global reduction 1 with 13 rules applied. Total rules applied 226 place count 20 transition count 31
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 230 place count 20 transition count 27
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 234 place count 16 transition count 20
Iterating global reduction 2 with 4 rules applied. Total rules applied 238 place count 16 transition count 20
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 239 place count 16 transition count 19
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 242 place count 13 transition count 16
Iterating global reduction 3 with 3 rules applied. Total rules applied 245 place count 13 transition count 16
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 247 place count 13 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 4 with 2 rules applied. Total rules applied 249 place count 12 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 250 place count 11 transition count 12
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 6 edges and 9 vertex of which 2 / 9 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 254 place count 8 transition count 11
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 258 place count 7 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 258 place count 7 transition count 7
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 260 place count 6 transition count 7
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 261 place count 6 transition count 6
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 263 place count 5 transition count 5
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 264 place count 5 transition count 4
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 265 place count 5 transition count 3
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 268 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 268 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 270 place count 2 transition count 1
Applied a total of 270 rules in 87 ms. Remains 2 /121 variables (removed 119) and now considering 1/223 (removed 222) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 2/121 places, 1/223 transitions.
// Phase 1: matrix 1 rows 2 cols
[2025-06-01 13:44:58] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA HealthRecord-PT-03-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (500000 resets) in 317 ms. (3144 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-01 13:44:59] [INFO ] Flatten gal took : 245 ms
[2025-06-01 13:44:59] [INFO ] Flatten gal took : 2 ms
[2025-06-01 13:44:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15928010608665520073.gal : 6 ms
[2025-06-01 13:44:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality103614124129226286.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15928010608665520073.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality103614124129226286.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
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 6927 ms.

BK_STOP 1748785499596

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-03"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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 gold2024"
echo " Input is HealthRecord-PT-03, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r111-smll-174867015900070"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-03.tgz
mv HealthRecord-PT-03 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;