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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 8.0K Mar 7 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 7 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 7 13:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 7 13:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 10:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Mar 7 13:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Mar 7 13:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 7 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 7 13:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:44 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 71K 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-13-UpperBounds-00
FORMULA_NAME HealthRecord-PT-13-UpperBounds-01
FORMULA_NAME HealthRecord-PT-13-UpperBounds-02
FORMULA_NAME HealthRecord-PT-13-UpperBounds-03
FORMULA_NAME HealthRecord-PT-13-UpperBounds-04
FORMULA_NAME HealthRecord-PT-13-UpperBounds-05
FORMULA_NAME HealthRecord-PT-13-UpperBounds-06
FORMULA_NAME HealthRecord-PT-13-UpperBounds-07
FORMULA_NAME HealthRecord-PT-13-UpperBounds-08
FORMULA_NAME HealthRecord-PT-13-UpperBounds-09
FORMULA_NAME HealthRecord-PT-13-UpperBounds-10
FORMULA_NAME HealthRecord-PT-13-UpperBounds-11
FORMULA_NAME HealthRecord-PT-13-UpperBounds-12
FORMULA_NAME HealthRecord-PT-13-UpperBounds-13
FORMULA_NAME HealthRecord-PT-13-UpperBounds-14
FORMULA_NAME HealthRecord-PT-13-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779737212191

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-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 19:26:53] [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:26:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 19:26:53] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2026-05-25 19:26:53] [INFO ] Transformed 161 places.
[2026-05-25 19:26:53] [INFO ] Transformed 341 transitions.
[2026-05-25 19:26:53] [INFO ] Found NUPN structural information;
[2026-05-25 19:26:53] [INFO ] Parsed PT model containing 161 places and 341 transitions and 899 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 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-15086238324862458820.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4392085682313167235.kers'
[2026-05-25 19:26:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15086238324862458820.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4392085682313167235.kers]
Normalized transition count is 300 out of 313 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 300 rows 154 cols 796 entries
Finished phase 1 with 141 SingleSign rule and 2 generalized
[2026-05-25 19:26:53] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4392085682313167235.kers
Total runtime 3 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 (776 resets) in 43 ms. (227 steps per ms)
FORMULA HealthRecord-PT-13-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80008 steps (866 resets) in 70 ms. (1126 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-25 19:26:53] [INFO ] Flow matrix only has 301 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-10716927257060646569.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5915110534344718783.kers'
[2026-05-25 19:26:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10716927257060646569.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5915110534344718783.kers]
Normalized transition count is 300 out of 301 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 300 rows 154 cols 796 entries
Finished phase 1 with 141 SingleSign rule and 2 generalized
[2026-05-25 19:26:53] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5915110534344718783.kers
Total runtime 5 ms.
[2026-05-25 19:26:53] [INFO ] [Real]Absence check using 9 positive place invariants in 13 ms returned sat
[2026-05-25 19:26:53] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 13 ms returned sat
[2026-05-25 19:26:54] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2026-05-25 19:26:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:26:54] [INFO ] [Real]Added 1 Read/Feed constraints in 6 ms returned sat
[2026-05-25 19:26:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:26:54] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-25 19:26:54] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:26:54] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2026-05-25 19:26:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:26:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 182 ms
[2026-05-25 19:26:54] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 24 ms.
[2026-05-25 19:26:54] [INFO ] Added : 19 causal constraints over 5 iterations in 121 ms. Result :sat
Minimization took 61 ms.
[2026-05-25 19:26:54] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:26:54] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 4 ms returned sat
[2026-05-25 19:26:54] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-25 19:26:54] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:26:54] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 16 ms.
[2026-05-25 19:26:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:26:54] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:26:54] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:26:55] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2026-05-25 19:26:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:26:55] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 19 ms.
[2026-05-25 19:26:55] [INFO ] Added : 26 causal constraints over 6 iterations in 137 ms. Result :sat
Minimization took 58 ms.
[2026-05-25 19:26:55] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2026-05-25 19:26:55] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:26:55] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2026-05-25 19:26:55] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:26:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:26:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:26:55] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:26:55] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2026-05-25 19:26:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:26:55] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 18 ms.
[2026-05-25 19:26:55] [INFO ] Added : 20 causal constraints over 5 iterations in 113 ms. Result :sat
Minimization took 54 ms.
[2026-05-25 19:26:55] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:26:55] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:26:55] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2026-05-25 19:26:55] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:26:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:26:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:26:55] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:26:55] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2026-05-25 19:26:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:26:55] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 16 ms.
[2026-05-25 19:26:56] [INFO ] Added : 16 causal constraints over 4 iterations in 103 ms. Result :sat
Minimization took 56 ms.
[2026-05-25 19:26:56] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2026-05-25 19:26:56] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:26:56] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2026-05-25 19:26:56] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:26:56] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 21 ms.
[2026-05-25 19:26:56] [INFO ] Added : 19 causal constraints over 4 iterations in 100 ms. Result :sat
Minimization took 54 ms.
[2026-05-25 19:26:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:26:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:26:56] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:26:56] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2026-05-25 19:26:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:26:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2026-05-25 19:26:56] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 18 ms.
[2026-05-25 19:26:56] [INFO ] Added : 18 causal constraints over 4 iterations in 86 ms. Result :sat
Minimization took 56 ms.
[2026-05-25 19:26:56] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2026-05-25 19:26:56] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 5 ms returned sat
[2026-05-25 19:26:56] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2026-05-25 19:26:56] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:26:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:26:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:26:56] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:26:56] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2026-05-25 19:26:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:26:57] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 19 ms.
[2026-05-25 19:26:57] [INFO ] Added : 20 causal constraints over 5 iterations in 111 ms. Result :sat
Minimization took 49 ms.
[2026-05-25 19:26:57] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:26:57] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:26:57] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2026-05-25 19:26:57] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:26:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:26:57] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:26:57] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:26:57] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2026-05-25 19:26:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:26:57] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 25 ms.
[2026-05-25 19:26:57] [INFO ] Added : 13 causal constraints over 3 iterations in 98 ms. Result :sat
Minimization took 51 ms.
[2026-05-25 19:26:57] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2026-05-25 19:26:57] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:26:57] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2026-05-25 19:26:57] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:26:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:26:57] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:26:57] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:26:57] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2026-05-25 19:26:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:26:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2026-05-25 19:26:57] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 19 ms.
[2026-05-25 19:26:57] [INFO ] Added : 12 causal constraints over 4 iterations in 94 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA HealthRecord-PT-13-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-13-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 313/313 transitions.
Graph (trivial) has 240 edges and 161 vertex of which 8 / 161 are part of one of the 4 SCC in 5 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 681 edges and 157 vertex of which 149 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 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 149 transition count 289
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 146 transition count 285
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 145 transition count 284
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14 place count 145 transition count 283
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 144 transition count 283
Discarding 82 places :
Symmetric choice reduction at 3 with 82 rule applications. Total rules 98 place count 62 transition count 119
Iterating global reduction 3 with 82 rules applied. Total rules applied 180 place count 62 transition count 119
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 189 place count 53 transition count 101
Iterating global reduction 3 with 9 rules applied. Total rules applied 198 place count 53 transition count 101
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 204 place count 53 transition count 95
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 207 place count 50 transition count 86
Iterating global reduction 4 with 3 rules applied. Total rules applied 210 place count 50 transition count 86
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 213 place count 47 transition count 80
Iterating global reduction 4 with 3 rules applied. Total rules applied 216 place count 47 transition count 80
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 225 place count 47 transition count 71
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 229 place count 45 transition count 69
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -35
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 241 place count 39 transition count 104
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 243 place count 39 transition count 102
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 246 place count 39 transition count 99
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 249 place count 36 transition count 99
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 251 place count 36 transition count 97
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 262 place count 36 transition count 97
Applied a total of 262 rules in 87 ms. Remains 36 /161 variables (removed 125) and now considering 97/313 (removed 216) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 36/161 places, 97/313 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18210124558303571207.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8820906107609147809.kers'
[2026-05-25 19:26:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18210124558303571207.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8820906107609147809.kers]
Normalized transition count is 81 out of 97 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 81 rows 35 cols 510 entries
Finished phase 1 with 26 SingleSign rule and 0 generalized
[2026-05-25 19:26:58] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8820906107609147809.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (100550 resets) in 1640 ms. (609 steps per ms)
FORMULA HealthRecord-PT-13-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-13-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (17501 resets) in 513 ms. (1945 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 7194 ms.

BK_STOP 1779737220532

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

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