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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15686.130 12114.00 23222.00 300.70 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-174867015900074.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-07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-smll-174867015900074
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 67K May 29 14:32 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748785588432

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-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 13:46:30] [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:46:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 13:46:31] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2025-06-01 13:46:31] [INFO ] Transformed 155 places.
[2025-06-01 13:46:31] [INFO ] Transformed 320 transitions.
[2025-06-01 13:46:31] [INFO ] Found NUPN structural information;
[2025-06-01 13:46:31] [INFO ] Parsed PT model containing 155 places and 320 transitions and 839 arcs in 518 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-01 13:46:31] [INFO ] Flow matrix only has 283 transitions (discarded 12 similar events)
// Phase 1: matrix 283 rows 155 cols
[2025-06-01 13:46:31] [INFO ] Computed 18 invariants in 24 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (522 resets) in 78 ms. (126 steps per ms)
FORMULA HealthRecord-PT-07-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (397 resets) in 108 ms. (458 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:46:32] [INFO ] Flow matrix only has 283 transitions (discarded 12 similar events)
[2025-06-01 13:46:32] [INFO ] Invariant cache hit.
[2025-06-01 13:46:32] [INFO ] [Real]Absence check using 10 positive place invariants in 24 ms returned sat
[2025-06-01 13:46:32] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 12 ms returned sat
[2025-06-01 13:46:32] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2025-06-01 13:46:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 13:46:32] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2025-06-01 13:46:33] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 20 ms to minimize.
[2025-06-01 13:46:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:46:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 24 ms returned sat
[2025-06-01 13:46:33] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2025-06-01 13:46:33] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2025-06-01 13:46:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2025-06-01 13:46:33] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 8 ms to minimize.
[2025-06-01 13:46:33] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2025-06-01 13:46:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 271 ms
[2025-06-01 13:46:33] [INFO ] Computed and/alt/rep : 224/255/224 causal constraints (skipped 58 transitions) in 59 ms.
[2025-06-01 13:46:33] [INFO ] Added : 23 causal constraints over 5 iterations in 266 ms. Result :sat
Minimization took 181 ms.
[2025-06-01 13:46:34] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-01 13:46:34] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2025-06-01 13:46:34] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2025-06-01 13:46:34] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:46:34] [INFO ] Computed and/alt/rep : 224/255/224 causal constraints (skipped 58 transitions) in 40 ms.
[2025-06-01 13:46:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:46:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-06-01 13:46:34] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2025-06-01 13:46:34] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2025-06-01 13:46:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:46:34] [INFO ] Computed and/alt/rep : 224/255/224 causal constraints (skipped 58 transitions) in 34 ms.
[2025-06-01 13:46:34] [INFO ] Added : 14 causal constraints over 3 iterations in 116 ms. Result :sat
Minimization took 168 ms.
[2025-06-01 13:46:34] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-01 13:46:34] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2025-06-01 13:46:35] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2025-06-01 13:46:35] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 13:46:35] [INFO ] Computed and/alt/rep : 224/255/224 causal constraints (skipped 58 transitions) in 41 ms.
[2025-06-01 13:46:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:46:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-06-01 13:46:35] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2025-06-01 13:46:35] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2025-06-01 13:46:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-01 13:46:35] [INFO ] Computed and/alt/rep : 224/255/224 causal constraints (skipped 58 transitions) in 39 ms.
[2025-06-01 13:46:35] [INFO ] Added : 18 causal constraints over 5 iterations in 188 ms. Result :sat
Minimization took 208 ms.
[2025-06-01 13:46:35] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-06-01 13:46:35] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2025-06-01 13:46:36] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2025-06-01 13:46:36] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 13:46:36] [INFO ] Computed and/alt/rep : 224/255/224 causal constraints (skipped 58 transitions) in 49 ms.
[2025-06-01 13:46:36] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:46:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2025-06-01 13:46:36] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2025-06-01 13:46:36] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2025-06-01 13:46:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2025-06-01 13:46:36] [INFO ] Computed and/alt/rep : 224/255/224 causal constraints (skipped 58 transitions) in 44 ms.
[2025-06-01 13:46:36] [INFO ] Added : 21 causal constraints over 5 iterations in 211 ms. Result :sat
Minimization took 233 ms.
[2025-06-01 13:46:37] [INFO ] [Real]Absence check using 10 positive place invariants in 20 ms returned sat
[2025-06-01 13:46:37] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2025-06-01 13:46:37] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2025-06-01 13:46:37] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2025-06-01 13:46:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:46:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2025-06-01 13:46:37] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2025-06-01 13:46:37] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2025-06-01 13:46:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2025-06-01 13:46:37] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 3 ms to minimize.
[2025-06-01 13:46:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2025-06-01 13:46:37] [INFO ] Computed and/alt/rep : 224/255/224 causal constraints (skipped 58 transitions) in 42 ms.
[2025-06-01 13:46:37] [INFO ] Added : 13 causal constraints over 3 iterations in 162 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-07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-07-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 295/295 transitions.
Graph (trivial) has 233 edges and 155 vertex of which 14 / 155 are part of one of the 7 SCC in 6 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Graph (complete) has 639 edges and 148 vertex of which 114 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.3 ms
Discarding 34 places :
Also discarding 21 output transitions
Drop transitions (Output transitions of discarded places.) removed 21 transitions
Drop transitions (Empty/Sink Transition effects.) removed 105 transitions
Reduce isomorphic transitions removed 105 transitions.
Iterating post reduction 0 with 105 rules applied. Total rules applied 107 place count 114 transition count 142
Discarding 73 places :
Symmetric choice reduction at 1 with 73 rule applications. Total rules 180 place count 41 transition count 69
Iterating global reduction 1 with 73 rules applied. Total rules applied 253 place count 41 transition count 69
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 253 place count 41 transition count 66
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 259 place count 38 transition count 66
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 269 place count 28 transition count 56
Iterating global reduction 1 with 10 rules applied. Total rules applied 279 place count 28 transition count 56
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 288 place count 28 transition count 47
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 290 place count 26 transition count 44
Iterating global reduction 2 with 2 rules applied. Total rules applied 292 place count 26 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 293 place count 26 transition count 43
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 294 place count 25 transition count 42
Iterating global reduction 3 with 1 rules applied. Total rules applied 295 place count 25 transition count 42
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 298 place count 25 transition count 39
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 304 place count 22 transition count 36
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 305 place count 22 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 306 place count 21 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 307 place count 20 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 311 place count 20 transition count 30
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 313 place count 19 transition count 29
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 314 place count 18 transition count 28
Iterating global reduction 5 with 1 rules applied. Total rules applied 315 place count 18 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 318 place count 18 transition count 25
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 319 place count 18 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 17 transition count 24
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 321 place count 17 transition count 24
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 322 place count 17 transition count 23
Applied a total of 322 rules in 118 ms. Remains 17 /155 variables (removed 138) and now considering 23/295 (removed 272) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 17/155 places, 23/295 transitions.
[2025-06-01 13:46:38] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
// Phase 1: matrix 19 rows 17 cols
[2025-06-01 13:46:38] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (72968 resets) in 1252 ms. (798 steps per ms)
FORMULA HealthRecord-PT-07-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-07-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (22765 resets) in 484 ms. (2061 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:46:40] [INFO ] Flatten gal took : 32 ms
[2025-06-01 13:46:40] [INFO ] Flatten gal took : 11 ms
[2025-06-01 13:46:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2017934276565604371.gal : 9 ms
[2025-06-01 13:46:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16063727177074690728.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2017934276565604371.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16063727177074690728.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 9590 ms.

BK_STOP 1748785600546

--------------------
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-07"
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-07, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r111-smll-174867015900074"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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