Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r146-tall-177961074300645.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is HealthRecord-PT-14, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074300645
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.7K Mar 7 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 7 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 7 13:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 7 13:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 10:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 10:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Mar 7 13:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 7 13:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Mar 7 13:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Mar 7 13:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 72K Mar 3 18:30 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-14-UpperBounds-00
FORMULA_NAME HealthRecord-PT-14-UpperBounds-01
FORMULA_NAME HealthRecord-PT-14-UpperBounds-02
FORMULA_NAME HealthRecord-PT-14-UpperBounds-03
FORMULA_NAME HealthRecord-PT-14-UpperBounds-04
FORMULA_NAME HealthRecord-PT-14-UpperBounds-05
FORMULA_NAME HealthRecord-PT-14-UpperBounds-06
FORMULA_NAME HealthRecord-PT-14-UpperBounds-07
FORMULA_NAME HealthRecord-PT-14-UpperBounds-08
FORMULA_NAME HealthRecord-PT-14-UpperBounds-09
FORMULA_NAME HealthRecord-PT-14-UpperBounds-10
FORMULA_NAME HealthRecord-PT-14-UpperBounds-11
FORMULA_NAME HealthRecord-PT-14-UpperBounds-12
FORMULA_NAME HealthRecord-PT-14-UpperBounds-13
FORMULA_NAME HealthRecord-PT-14-UpperBounds-14
FORMULA_NAME HealthRecord-PT-14-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779737396107

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-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 19:29:57] [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]
[2026-05-25 19:29:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 19:29:57] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2026-05-25 19:29:57] [INFO ] Transformed 162 places.
[2026-05-25 19:29:57] [INFO ] Transformed 347 transitions.
[2026-05-25 19:29:57] [INFO ] Found NUPN structural information;
[2026-05-25 19:29:57] [INFO ] Parsed PT model containing 162 places and 347 transitions and 915 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 29 transitions
Reduce redundant transitions removed 29 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]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1921719337973197703.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8144717854655291797.kers'
[2026-05-25 19:29:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1921719337973197703.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8144717854655291797.kers]
Normalized transition count is 305 out of 318 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 305 rows 155 cols 810 entries
Finished phase 1 with 142 SingleSign rule and 2 generalized
[2026-05-25 19:29:57] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8144717854655291797.kers
Total runtime 2 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 (845 resets) in 46 ms. (212 steps per ms)
FORMULA HealthRecord-PT-14-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-14-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-14-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-14-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-14-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-14-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-14-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-14-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-14-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70006 steps (667 resets) in 61 ms. (1129 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2026-05-25 19:29:57] [INFO ] Flow matrix only has 306 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9615004338151632340.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11233793534540221379.kers'
[2026-05-25 19:29:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9615004338151632340.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11233793534540221379.kers]
Normalized transition count is 305 out of 306 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 305 rows 155 cols 810 entries
Finished phase 1 with 142 SingleSign rule and 2 generalized
[2026-05-25 19:29:57] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11233793534540221379.kers
Total runtime 2 ms.
[2026-05-25 19:29:57] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2026-05-25 19:29:57] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 9 ms returned sat
[2026-05-25 19:29:57] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2026-05-25 19:29:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:29:58] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2026-05-25 19:29:58] [INFO ] Computed and/alt/rep : 236/274/236 causal constraints (skipped 69 transitions) in 31 ms.
[2026-05-25 19:29:58] [INFO ] Added : 9 causal constraints over 2 iterations in 103 ms. Result :sat
Minimization took 51 ms.
[2026-05-25 19:29:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:29:58] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2026-05-25 19:29:58] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:29:58] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2026-05-25 19:29:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:29:58] [INFO ] Computed and/alt/rep : 236/274/236 causal constraints (skipped 69 transitions) in 26 ms.
[2026-05-25 19:29:58] [INFO ] Added : 13 causal constraints over 3 iterations in 106 ms. Result :sat
Minimization took 48 ms.
[2026-05-25 19:29:58] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2026-05-25 19:29:58] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 3 ms returned sat
[2026-05-25 19:29:58] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2026-05-25 19:29:58] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:29:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:29:58] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:29:58] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:29:58] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2026-05-25 19:29:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:29:58] [INFO ] Computed and/alt/rep : 236/274/236 causal constraints (skipped 69 transitions) in 19 ms.
[2026-05-25 19:29:59] [INFO ] Added : 15 causal constraints over 3 iterations in 79 ms. Result :sat
Minimization took 50 ms.
[2026-05-25 19:29:59] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:29:59] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 4 ms returned sat
[2026-05-25 19:29:59] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2026-05-25 19:29:59] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:29:59] [INFO ] Computed and/alt/rep : 236/274/236 causal constraints (skipped 69 transitions) in 22 ms.
[2026-05-25 19:29:59] [INFO ] Added : 14 causal constraints over 3 iterations in 84 ms. Result :sat
Minimization took 43 ms.
[2026-05-25 19:29:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:29:59] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:29:59] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:29:59] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2026-05-25 19:29:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:29:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2026-05-25 19:29:59] [INFO ] Computed and/alt/rep : 236/274/236 causal constraints (skipped 69 transitions) in 21 ms.
[2026-05-25 19:29:59] [INFO ] Added : 18 causal constraints over 4 iterations in 88 ms. Result :sat
Minimization took 47 ms.
[2026-05-25 19:29:59] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-25 19:29:59] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:29:59] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2026-05-25 19:29:59] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2026-05-25 19:29:59] [INFO ] Computed and/alt/rep : 236/274/236 causal constraints (skipped 69 transitions) in 24 ms.
[2026-05-25 19:29:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:29:59] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:29:59] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:30:00] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2026-05-25 19:30:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:30:00] [INFO ] Computed and/alt/rep : 236/274/236 causal constraints (skipped 69 transitions) in 18 ms.
[2026-05-25 19:30:00] [INFO ] Added : 12 causal constraints over 3 iterations in 78 ms. Result :sat
Minimization took 46 ms.
[2026-05-25 19:30:00] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2026-05-25 19:30:00] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:30:00] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2026-05-25 19:30:00] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:30:00] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:30:00] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:30:00] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:30:00] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2026-05-25 19:30:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:30:00] [INFO ] Computed and/alt/rep : 236/274/236 causal constraints (skipped 69 transitions) in 18 ms.
[2026-05-25 19:30:00] [INFO ] Added : 15 causal constraints over 3 iterations in 100 ms. Result :sat
Minimization took 44 ms.
[2026-05-25 19:30:00] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2026-05-25 19:30:00] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:30:00] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2026-05-25 19:30:00] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:30:00] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:30:00] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:30:00] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:30:00] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2026-05-25 19:30:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:30:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 311 ms
[2026-05-25 19:30:01] [INFO ] Computed and/alt/rep : 236/274/236 causal constraints (skipped 69 transitions) in 18 ms.
[2026-05-25 19:30:01] [INFO ] Added : 13 causal constraints over 3 iterations in 84 ms. Result :sat
Minimization took 54 ms.
[2026-05-25 19:30:01] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:30:01] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:30:01] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2026-05-25 19:30:01] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2026-05-25 19:30:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:30:01] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:30:01] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:30:01] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2026-05-25 19:30:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:30:01] [INFO ] Computed and/alt/rep : 236/274/236 causal constraints (skipped 69 transitions) in 18 ms.
[2026-05-25 19:30:01] [INFO ] Added : 12 causal constraints over 3 iterations in 79 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-14-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-14-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-14-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-14-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-14-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0] Max Struct:[1, 1]
FORMULA HealthRecord-PT-14-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_GUIDED_WALK
Support contains 1 out of 162 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p140) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 316/316 transitions.
Graph (trivial) has 247 edges and 162 vertex of which 6 / 162 are part of one of the 3 SCC in 6 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 690 edges and 159 vertex of which 133 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.1 ms
Discarding 26 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Iterating post reduction 0 with 122 rules applied. Total rules applied 124 place count 133 transition count 166
Discarding 86 places :
Symmetric choice reduction at 1 with 86 rule applications. Total rules 210 place count 47 transition count 80
Iterating global reduction 1 with 86 rules applied. Total rules applied 296 place count 47 transition count 80
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 296 place count 47 transition count 71
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 314 place count 38 transition count 71
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 328 place count 24 transition count 49
Iterating global reduction 1 with 14 rules applied. Total rules applied 342 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 351 place count 24 transition count 40
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 354 place count 21 transition count 35
Iterating global reduction 2 with 3 rules applied. Total rules applied 357 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 358 place count 21 transition count 34
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 360 place count 19 transition count 32
Iterating global reduction 3 with 2 rules applied. Total rules applied 362 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 368 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 370 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 371 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 372 place count 17 transition count 23
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 10 edges and 14 vertex of which 6 / 14 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 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 6 rules applied. Total rules applied 378 place count 9 transition count 21
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 394 place count 8 transition count 6
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 395 place count 8 transition count 5
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 6 with 2 rules applied. Total rules applied 397 place count 7 transition count 4
Applied a total of 397 rules in 43 ms. Remains 7 /162 variables (removed 155) and now considering 4/316 (removed 312) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 7/162 places, 4/316 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7377822208017343331.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-196440250402006196.kers'
[2026-05-25 19:30:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7377822208017343331.kers, --Pflows, --basisKERS=/tmp/petrispot-output-196440250402006196.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 4 rows 5 cols 6 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-25 19:30:01] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-196440250402006196.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (200000 resets) in 308 ms. (3236 steps per ms)
FORMULA HealthRecord-PT-14-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (142857 resets) in 202 ms. (4926 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 5236 ms.

BK_STOP 1779737402486

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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-14"
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-5973"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-14, 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 r146-tall-177961074300645"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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