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-177961074300653.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-15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074300653
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.8K Mar 7 13:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 7 13:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 7 13:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Mar 7 13:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 18K Mar 15 10:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 13:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Mar 7 13:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Mar 7 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Mar 7 13:09 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 73K 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-15-UpperBounds-00
FORMULA_NAME HealthRecord-PT-15-UpperBounds-01
FORMULA_NAME HealthRecord-PT-15-UpperBounds-02
FORMULA_NAME HealthRecord-PT-15-UpperBounds-03
FORMULA_NAME HealthRecord-PT-15-UpperBounds-04
FORMULA_NAME HealthRecord-PT-15-UpperBounds-05
FORMULA_NAME HealthRecord-PT-15-UpperBounds-06
FORMULA_NAME HealthRecord-PT-15-UpperBounds-07
FORMULA_NAME HealthRecord-PT-15-UpperBounds-08
FORMULA_NAME HealthRecord-PT-15-UpperBounds-09
FORMULA_NAME HealthRecord-PT-15-UpperBounds-10
FORMULA_NAME HealthRecord-PT-15-UpperBounds-11
FORMULA_NAME HealthRecord-PT-15-UpperBounds-12
FORMULA_NAME HealthRecord-PT-15-UpperBounds-13
FORMULA_NAME HealthRecord-PT-15-UpperBounds-14
FORMULA_NAME HealthRecord-PT-15-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779737615045

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-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 19:33:36] [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:33:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 19:33:36] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2026-05-25 19:33:36] [INFO ] Transformed 163 places.
[2026-05-25 19:33:36] [INFO ] Transformed 348 transitions.
[2026-05-25 19:33:36] [INFO ] Found NUPN structural information;
[2026-05-25 19:33:36] [INFO ] Parsed PT model containing 163 places and 348 transitions and 919 arcs in 160 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-16490612925558712297.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9601259866640931453.kers'
[2026-05-25 19:33:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16490612925558712297.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9601259866640931453.kers]
Normalized transition count is 306 out of 319 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 306 rows 156 cols 814 entries
Finished phase 1 with 143 SingleSign rule and 2 generalized
[2026-05-25 19:33:36] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9601259866640931453.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 (923 resets) in 40 ms. (243 steps per ms)
FORMULA HealthRecord-PT-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-15-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-15-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-15-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90008 steps (1078 resets) in 82 ms. (1084 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-25 19:33:36] [INFO ] Flow matrix only has 307 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-16344511168468836944.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12931478314562142794.kers'
[2026-05-25 19:33:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16344511168468836944.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12931478314562142794.kers]
Normalized transition count is 306 out of 307 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 306 rows 156 cols 814 entries
Finished phase 1 with 143 SingleSign rule and 2 generalized
[2026-05-25 19:33:36] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12931478314562142794.kers
Total runtime 1 ms.
[2026-05-25 19:33:36] [INFO ] [Real]Absence check using 9 positive place invariants in 11 ms returned sat
[2026-05-25 19:33:36] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 4 ms returned sat
[2026-05-25 19:33:36] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2026-05-25 19:33:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:33:36] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2026-05-25 19:33:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:33:37] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-25 19:33:37] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:33:37] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2026-05-25 19:33:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:33:37] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 26 ms.
[2026-05-25 19:33:37] [INFO ] Added : 24 causal constraints over 5 iterations in 150 ms. Result :sat
Minimization took 62 ms.
[2026-05-25 19:33:37] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-25 19:33:37] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:33:37] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-25 19:33:37] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:33:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:33:37] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:33:37] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:33:37] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2026-05-25 19:33:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:33:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 221 ms
[2026-05-25 19:33:37] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 21 ms.
[2026-05-25 19:33:38] [INFO ] Added : 19 causal constraints over 4 iterations in 109 ms. Result :sat
Minimization took 60 ms.
[2026-05-25 19:33:38] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:33:38] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:33:38] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2026-05-25 19:33:38] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:33:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:33:38] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-25 19:33:38] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:33:38] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2026-05-25 19:33:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:33:38] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 22 ms.
[2026-05-25 19:33:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2026-05-25 19:33:38] [INFO ] Added : 26 causal constraints over 6 iterations in 217 ms. Result :sat
Minimization took 59 ms.
[2026-05-25 19:33:38] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:33:38] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:33:38] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2026-05-25 19:33:38] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2026-05-25 19:33:38] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 19 ms.
[2026-05-25 19:33:38] [INFO ] Added : 18 causal constraints over 4 iterations in 100 ms. Result :sat
Minimization took 50 ms.
[2026-05-25 19:33:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:33:39] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:33:39] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:33:39] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2026-05-25 19:33:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:33:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2026-05-25 19:33:39] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 19 ms.
[2026-05-25 19:33:39] [INFO ] Added : 18 causal constraints over 4 iterations in 92 ms. Result :sat
Minimization took 53 ms.
[2026-05-25 19:33:39] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:33:39] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:33:39] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2026-05-25 19:33:39] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:33:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:33:39] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-25 19:33:39] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:33:39] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2026-05-25 19:33:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:33:39] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 19 ms.
[2026-05-25 19:33:39] [INFO ] Added : 26 causal constraints over 6 iterations in 127 ms. Result :sat
Minimization took 52 ms.
[2026-05-25 19:33:39] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2026-05-25 19:33:39] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:33:39] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2026-05-25 19:33:39] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:33:39] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 18 ms.
[2026-05-25 19:33:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:33:40] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:33:40] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 3 ms returned sat
[2026-05-25 19:33:40] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2026-05-25 19:33:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:33:40] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 18 ms.
[2026-05-25 19:33:40] [INFO ] Added : 31 causal constraints over 7 iterations in 136 ms. Result :sat
Minimization took 57 ms.
[2026-05-25 19:33:40] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:33:40] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:33:40] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2026-05-25 19:33:40] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:33:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:33:40] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:33:40] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:33:40] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2026-05-25 19:33:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:33:40] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 21 ms.
[2026-05-25 19:33:40] [INFO ] Added : 24 causal constraints over 5 iterations in 100 ms. Result :sat
Minimization took 53 ms.
[2026-05-25 19:33:40] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2026-05-25 19:33:40] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:33:40] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2026-05-25 19:33:40] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:33:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:33:41] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:33:41] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:33:41] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2026-05-25 19:33:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:33:41] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 15 ms.
[2026-05-25 19:33:41] [INFO ] Added : 16 causal constraints over 4 iterations in 80 ms. Result :sat
Minimization took 55 ms.
[2026-05-25 19:33:41] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2026-05-25 19:33:41] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:33:41] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2026-05-25 19:33:41] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:33:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:33:41] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:33:41] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:33:41] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2026-05-25 19:33:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:33:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 163 ms
[2026-05-25 19:33:41] [INFO ] Computed and/alt/rep : 236/275/236 causal constraints (skipped 70 transitions) in 18 ms.
[2026-05-25 19:33:41] [INFO ] Added : 24 causal constraints over 5 iterations in 102 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-15-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-15-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-15-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 319/319 transitions.
Graph (trivial) has 240 edges and 163 vertex of which 6 / 163 are part of one of the 3 SCC in 5 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 695 edges and 160 vertex of which 153 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 153 transition count 297
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 150 transition count 294
Discarding 84 places :
Symmetric choice reduction at 2 with 84 rule applications. Total rules 95 place count 66 transition count 127
Iterating global reduction 2 with 84 rules applied. Total rules applied 179 place count 66 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 180 place count 66 transition count 126
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 189 place count 57 transition count 108
Iterating global reduction 3 with 9 rules applied. Total rules applied 198 place count 57 transition count 108
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 207 place count 57 transition count 99
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 209 place count 55 transition count 93
Iterating global reduction 4 with 2 rules applied. Total rules applied 211 place count 55 transition count 93
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 213 place count 53 transition count 89
Iterating global reduction 4 with 2 rules applied. Total rules applied 215 place count 53 transition count 89
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 221 place count 53 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 225 place count 51 transition count 81
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 237 place count 45 transition count 117
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 45 transition count 116
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 240 place count 45 transition count 114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 242 place count 43 transition count 114
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 243 place count 43 transition count 260
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 247 place count 42 transition count 257
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 248 place count 42 transition count 256
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 249 place count 41 transition count 205
Iterating global reduction 7 with 1 rules applied. Total rules applied 250 place count 41 transition count 205
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 251 place count 40 transition count 203
Iterating global reduction 7 with 1 rules applied. Total rules applied 252 place count 40 transition count 203
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 267 place count 40 transition count 188
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 278 place count 40 transition count 188
Applied a total of 278 rules in 88 ms. Remains 40 /163 variables (removed 123) and now considering 188/319 (removed 131) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 40/163 places, 188/319 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10560434651303294034.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14965043262551726625.kers'
[2026-05-25 19:33:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10560434651303294034.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14965043262551726625.kers]
Normalized transition count is 143 out of 188 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 143 rows 39 cols 794 entries
Finished phase 1 with 29 SingleSign rule and 0 generalized
[2026-05-25 19:33:42] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14965043262551726625.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (95814 resets) in 1749 ms. (571 steps per ms)
FORMULA HealthRecord-PT-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-15-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-15-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-15-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (16052 resets) in 494 ms. (2020 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 8236 ms.

BK_STOP 1779737624500

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ 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-15"
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-15, 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-177961074300653"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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