fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r111-smll-174867015900069
Last Updated
June 24, 2025

About the Execution of 2024-gold for HealthRecord-PT-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15687.390 10780.00 22322.00 232.00 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

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-174867015900069.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-02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-smll-174867015900069
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 9.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K 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 47K 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-02-UpperBounds-00
FORMULA_NAME HealthRecord-PT-02-UpperBounds-01
FORMULA_NAME HealthRecord-PT-02-UpperBounds-02
FORMULA_NAME HealthRecord-PT-02-UpperBounds-03
FORMULA_NAME HealthRecord-PT-02-UpperBounds-04
FORMULA_NAME HealthRecord-PT-02-UpperBounds-05
FORMULA_NAME HealthRecord-PT-02-UpperBounds-06
FORMULA_NAME HealthRecord-PT-02-UpperBounds-07
FORMULA_NAME HealthRecord-PT-02-UpperBounds-08
FORMULA_NAME HealthRecord-PT-02-UpperBounds-09
FORMULA_NAME HealthRecord-PT-02-UpperBounds-10
FORMULA_NAME HealthRecord-PT-02-UpperBounds-11
FORMULA_NAME HealthRecord-PT-02-UpperBounds-12
FORMULA_NAME HealthRecord-PT-02-UpperBounds-13
FORMULA_NAME HealthRecord-PT-02-UpperBounds-14
FORMULA_NAME HealthRecord-PT-02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748785467019

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-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 13:44:29] [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:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 13:44:29] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2025-06-01 13:44:29] [INFO ] Transformed 119 places.
[2025-06-01 13:44:29] [INFO ] Transformed 225 transitions.
[2025-06-01 13:44:29] [INFO ] Found NUPN structural information;
[2025-06-01 13:44:29] [INFO ] Parsed PT model containing 119 places and 225 transitions and 577 arcs in 372 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Ensure Unique test removed 6 transitions
Reduce redundant transitions removed 6 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:30] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
// Phase 1: matrix 211 rows 119 cols
[2025-06-01 13:44:30] [INFO ] Computed 14 invariants in 22 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 (603 resets) in 55 ms. (178 steps per ms)
FORMULA HealthRecord-PT-02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60005 steps (532 resets) in 100 ms. (594 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:30] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
[2025-06-01 13:44:30] [INFO ] Invariant cache hit.
[2025-06-01 13:44:30] [INFO ] [Real]Absence check using 8 positive place invariants in 19 ms returned sat
[2025-06-01 13:44:30] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 18 ms returned sat
[2025-06-01 13:44:30] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2025-06-01 13:44:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 13:44:30] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:44:30] [INFO ] Computed and/alt/rep : 167/178/167 causal constraints (skipped 43 transitions) in 42 ms.
[2025-06-01 13:44:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:44:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2025-06-01 13:44:31] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 8 ms returned sat
[2025-06-01 13:44:31] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2025-06-01 13:44:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 13:44:31] [INFO ] Computed and/alt/rep : 167/178/167 causal constraints (skipped 43 transitions) in 49 ms.
[2025-06-01 13:44:31] [INFO ] Added : 18 causal constraints over 5 iterations in 157 ms. Result :sat
Minimization took 124 ms.
[2025-06-01 13:44:31] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-01 13:44:31] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2025-06-01 13:44:31] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2025-06-01 13:44:31] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:44:31] [INFO ] Computed and/alt/rep : 167/178/167 causal constraints (skipped 43 transitions) in 37 ms.
[2025-06-01 13:44:31] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:44:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2025-06-01 13:44:32] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2025-06-01 13:44:32] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2025-06-01 13:44:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:44:32] [INFO ] Computed and/alt/rep : 167/178/167 causal constraints (skipped 43 transitions) in 47 ms.
[2025-06-01 13:44:32] [INFO ] Added : 20 causal constraints over 5 iterations in 174 ms. Result :sat
Minimization took 172 ms.
[2025-06-01 13:44:32] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2025-06-01 13:44:32] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2025-06-01 13:44:32] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2025-06-01 13:44:32] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-01 13:44:32] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 24 ms to minimize.
[2025-06-01 13:44:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:44:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2025-06-01 13:44:33] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 7 ms returned sat
[2025-06-01 13:44:33] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2025-06-01 13:44:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2025-06-01 13:44:33] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 3 ms to minimize.
[2025-06-01 13:44:33] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2025-06-01 13:44:33] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 2 ms to minimize.
[2025-06-01 13:44:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 383 ms
[2025-06-01 13:44:33] [INFO ] Computed and/alt/rep : 167/178/167 causal constraints (skipped 43 transitions) in 36 ms.
[2025-06-01 13:44:33] [INFO ] Added : 18 causal constraints over 4 iterations in 159 ms. Result :sat
Minimization took 166 ms.
[2025-06-01 13:44:34] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2025-06-01 13:44:34] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2025-06-01 13:44:34] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2025-06-01 13:44:34] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 13:44:34] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
[2025-06-01 13:44:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:44:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 14 ms returned sat
[2025-06-01 13:44:34] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2025-06-01 13:44:34] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2025-06-01 13:44:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-01 13:44:34] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 2 ms to minimize.
[2025-06-01 13:44:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2025-06-01 13:44:34] [INFO ] Computed and/alt/rep : 167/178/167 causal constraints (skipped 43 transitions) in 22 ms.
[2025-06-01 13:44:34] [INFO ] Added : 19 causal constraints over 5 iterations in 98 ms. Result :sat
Minimization took 127 ms.
[2025-06-01 13:44:34] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2025-06-01 13:44:34] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2025-06-01 13:44:34] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2025-06-01 13:44:34] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 13:44:35] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 2 ms to minimize.
[2025-06-01 13:44:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:44:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2025-06-01 13:44:35] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2025-06-01 13:44:35] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2025-06-01 13:44:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 13:44:35] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 3 ms to minimize.
[2025-06-01 13:44:35] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
[2025-06-01 13:44:35] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 3 ms to minimize.
[2025-06-01 13:44:35] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 2 ms to minimize.
[2025-06-01 13:44:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 483 ms
[2025-06-01 13:44:35] [INFO ] Computed and/alt/rep : 167/178/167 causal constraints (skipped 43 transitions) in 31 ms.
[2025-06-01 13:44:35] [INFO ] Added : 19 causal constraints over 5 iterations in 154 ms. Result :sat
Minimization took 169 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-02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-02-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 119 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p56) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 217/217 transitions.
Graph (trivial) has 174 edges and 119 vertex of which 12 / 119 are part of one of the 6 SCC in 6 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 413 edges and 113 vertex of which 85 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Drop transitions (Empty/Sink Transition effects.) removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 80 rules applied. Total rules applied 82 place count 85 transition count 98
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 131 place count 36 transition count 49
Iterating global reduction 1 with 49 rules applied. Total rules applied 180 place count 36 transition count 49
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 180 place count 36 transition count 45
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 188 place count 32 transition count 45
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 199 place count 21 transition count 32
Iterating global reduction 1 with 11 rules applied. Total rules applied 210 place count 21 transition count 32
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 214 place count 21 transition count 28
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 217 place count 18 transition count 23
Iterating global reduction 2 with 3 rules applied. Total rules applied 220 place count 18 transition count 23
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 221 place count 18 transition count 22
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 223 place count 16 transition count 20
Iterating global reduction 3 with 2 rules applied. Total rules applied 225 place count 16 transition count 20
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 227 place count 16 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 229 place count 15 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 230 place count 14 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 231 place count 13 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 233 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 5 with 2 rules applied. Total rules applied 235 place count 12 transition count 13
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 236 place count 11 transition count 12
Iterating global reduction 5 with 1 rules applied. Total rules applied 237 place count 11 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 238 place count 11 transition count 11
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 239 place count 11 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 240 place count 10 transition count 10
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 241 place count 10 transition count 10
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 242 place count 10 transition count 9
Applied a total of 242 rules in 115 ms. Remains 10 /119 variables (removed 109) and now considering 9/217 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 10/119 places, 9/217 transitions.
// Phase 1: matrix 9 rows 10 cols
[2025-06-01 13:44:36] [INFO ] Computed 3 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (117380 resets) in 620 ms. (1610 steps per ms)
FORMULA HealthRecord-PT-02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (60888 resets) in 340 ms. (2932 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:37] [INFO ] Flatten gal took : 24 ms
[2025-06-01 13:44:37] [INFO ] Flatten gal took : 4 ms
[2025-06-01 13:44:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10533746320348668999.gal : 6 ms
[2025-06-01 13:44:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13044404066939611263.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/ReachabilityCardinality10533746320348668999.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13044404066939611263.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 8209 ms.

BK_STOP 1748785477799

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

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