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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.2K Mar 7 13:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Mar 7 13:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 7 13:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 13:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 10:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 13:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Mar 7 13:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 7 13:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 7 13:19 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-12-UpperBounds-00
FORMULA_NAME HealthRecord-PT-12-UpperBounds-01
FORMULA_NAME HealthRecord-PT-12-UpperBounds-02
FORMULA_NAME HealthRecord-PT-12-UpperBounds-03
FORMULA_NAME HealthRecord-PT-12-UpperBounds-04
FORMULA_NAME HealthRecord-PT-12-UpperBounds-05
FORMULA_NAME HealthRecord-PT-12-UpperBounds-06
FORMULA_NAME HealthRecord-PT-12-UpperBounds-07
FORMULA_NAME HealthRecord-PT-12-UpperBounds-08
FORMULA_NAME HealthRecord-PT-12-UpperBounds-09
FORMULA_NAME HealthRecord-PT-12-UpperBounds-10
FORMULA_NAME HealthRecord-PT-12-UpperBounds-11
FORMULA_NAME HealthRecord-PT-12-UpperBounds-12
FORMULA_NAME HealthRecord-PT-12-UpperBounds-13
FORMULA_NAME HealthRecord-PT-12-UpperBounds-14
FORMULA_NAME HealthRecord-PT-12-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779736946133

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-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 19:22:27] [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:22:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 19:22:27] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2026-05-25 19:22:27] [INFO ] Transformed 160 places.
[2026-05-25 19:22:27] [INFO ] Transformed 340 transitions.
[2026-05-25 19:22:27] [INFO ] Found NUPN structural information;
[2026-05-25 19:22:27] [INFO ] Parsed PT model containing 160 places and 340 transitions and 895 arcs in 507 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-11614177728563983747.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8934962283636285743.kers'
[2026-05-25 19:22:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11614177728563983747.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8934962283636285743.kers]
Normalized transition count is 299 out of 312 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 299 rows 153 cols 792 entries
Finished phase 1 with 140 SingleSign rule and 2 generalized
[2026-05-25 19:22:27] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8934962283636285743.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 (717 resets) in 44 ms. (222 steps per ms)
FORMULA HealthRecord-PT-12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90008 steps (800 resets) in 84 ms. (1058 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:22:28] [INFO ] Flow matrix only has 300 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-14870380330776607417.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-712330884879069820.kers'
[2026-05-25 19:22:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14870380330776607417.kers, --Pflows, --basisKERS=/tmp/petrispot-output-712330884879069820.kers]
Normalized transition count is 299 out of 300 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 299 rows 153 cols 792 entries
Finished phase 1 with 140 SingleSign rule and 2 generalized
[2026-05-25 19:22:28] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-712330884879069820.kers
Total runtime 2 ms.
[2026-05-25 19:22:28] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2026-05-25 19:22:28] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 6 ms returned sat
[2026-05-25 19:22:28] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2026-05-25 19:22:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:22:28] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2026-05-25 19:22:28] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 28 ms.
[2026-05-25 19:22:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:22:28] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2026-05-25 19:22:28] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 3 ms returned sat
[2026-05-25 19:22:28] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2026-05-25 19:22:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2026-05-25 19:22:28] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 22 ms.
[2026-05-25 19:22:28] [INFO ] Added : 24 causal constraints over 6 iterations in 127 ms. Result :sat
Minimization took 79 ms.
[2026-05-25 19:22:28] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:22:28] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 8 ms returned sat
[2026-05-25 19:22:29] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2026-05-25 19:22:29] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:22:29] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 20 ms.
[2026-05-25 19:22:29] [INFO ] Added : 14 causal constraints over 3 iterations in 79 ms. Result :sat
Minimization took 43 ms.
[2026-05-25 19:22:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:22:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-25 19:22:29] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 3 ms returned sat
[2026-05-25 19:22:29] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2026-05-25 19:22:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2026-05-25 19:22:29] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 22 ms.
[2026-05-25 19:22:29] [INFO ] Added : 14 causal constraints over 3 iterations in 81 ms. Result :sat
Minimization took 46 ms.
[2026-05-25 19:22:29] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:22:29] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:22:29] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2026-05-25 19:22:29] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:22:29] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 21 ms.
[2026-05-25 19:22:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:22:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:22:29] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:22:29] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2026-05-25 19:22:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:22:29] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 16 ms.
[2026-05-25 19:22:29] [INFO ] Added : 23 causal constraints over 5 iterations in 111 ms. Result :sat
Minimization took 45 ms.
[2026-05-25 19:22:30] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:22:30] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:22:30] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2026-05-25 19:22:30] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2026-05-25 19:22:30] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 25 ms.
[2026-05-25 19:22:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:22:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:22:30] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:22:30] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2026-05-25 19:22:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2026-05-25 19:22:30] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 20 ms.
[2026-05-25 19:22:30] [INFO ] Added : 31 causal constraints over 7 iterations in 128 ms. Result :sat
Minimization took 51 ms.
[2026-05-25 19:22:30] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:22:30] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:22:30] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2026-05-25 19:22:30] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:22:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:22:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-25 19:22:30] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:22:30] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2026-05-25 19:22:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:22:30] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 15 ms.
[2026-05-25 19:22:30] [INFO ] Added : 17 causal constraints over 5 iterations in 103 ms. Result :sat
Minimization took 44 ms.
[2026-05-25 19:22:31] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2026-05-25 19:22:31] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:22:31] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2026-05-25 19:22:31] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:22:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:22:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-25 19:22:31] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 3 ms returned sat
[2026-05-25 19:22:31] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2026-05-25 19:22:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:22:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 256 ms
[2026-05-25 19:22:31] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 22 ms.
[2026-05-25 19:22:31] [INFO ] Added : 14 causal constraints over 3 iterations in 84 ms. Result :sat
Minimization took 54 ms.
[2026-05-25 19:22:31] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:22:31] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:22:31] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2026-05-25 19:22:31] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2026-05-25 19:22:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:22:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:22:31] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:22:32] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2026-05-25 19:22:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:22:32] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 16 ms.
[2026-05-25 19:22:32] [INFO ] Added : 14 causal constraints over 3 iterations in 71 ms. Result :sat
Minimization took 45 ms.
[2026-05-25 19:22:32] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:22:32] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:22:32] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2026-05-25 19:22:32] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 19:22:32] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 25 ms.
[2026-05-25 19:22:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:22:32] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:22:32] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:22:32] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2026-05-25 19:22:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:22:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2026-05-25 19:22:32] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 18 ms.
[2026-05-25 19:22:32] [INFO ] Added : 27 causal constraints over 6 iterations in 116 ms. Result :sat
Minimization took 51 ms.
[2026-05-25 19:22:32] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2026-05-25 19:22:32] [INFO ] [Real]Absence check using 9 positive and 9 generalized place invariants in 2 ms returned sat
[2026-05-25 19:22:32] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2026-05-25 19:22:32] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:22:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 19:22:32] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 19:22:32] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 1 ms returned sat
[2026-05-25 19:22:32] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2026-05-25 19:22:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 19:22:32] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 15 ms.
[2026-05-25 19:22:33] [INFO ] Added : 14 causal constraints over 3 iterations in 70 ms. Result :sat
Minimization took 46 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-12-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-12-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-12-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-12-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 312/312 transitions.
Graph (trivial) has 238 edges and 160 vertex of which 8 / 160 are part of one of the 4 SCC in 6 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 678 edges and 156 vertex of which 147 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 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 147 transition count 288
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 13 place count 144 transition count 283
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 17 place count 142 transition count 281
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 19 place count 141 transition count 280
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 19 place count 141 transition count 279
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 21 place count 140 transition count 279
Discarding 81 places :
Symmetric choice reduction at 4 with 81 rule applications. Total rules 102 place count 59 transition count 117
Iterating global reduction 4 with 81 rules applied. Total rules applied 183 place count 59 transition count 117
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 192 place count 50 transition count 99
Iterating global reduction 4 with 9 rules applied. Total rules applied 201 place count 50 transition count 99
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 210 place count 50 transition count 90
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 211 place count 49 transition count 87
Iterating global reduction 5 with 1 rules applied. Total rules applied 212 place count 49 transition count 87
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 213 place count 48 transition count 85
Iterating global reduction 5 with 1 rules applied. Total rules applied 214 place count 48 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 217 place count 48 transition count 82
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 227 place count 43 transition count 121
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 228 place count 43 transition count 120
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 232 place count 43 transition count 116
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 236 place count 39 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 238 place count 39 transition count 114
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 239 place count 39 transition count 289
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 241 place count 38 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 245 place count 38 transition count 284
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 246 place count 37 transition count 238
Iterating global reduction 8 with 1 rules applied. Total rules applied 247 place count 37 transition count 238
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 248 place count 36 transition count 236
Iterating global reduction 8 with 1 rules applied. Total rules applied 249 place count 36 transition count 236
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 269 place count 36 transition count 216
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 282 place count 36 transition count 216
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 9 with 11 rules applied. Total rules applied 293 place count 36 transition count 216
Applied a total of 293 rules in 107 ms. Remains 36 /160 variables (removed 124) and now considering 216/312 (removed 96) transitions.
Running 200 sub problems to find dead transitions.
[2026-05-25 19:22:33] [INFO ] Flow matrix only has 152 transitions (discarded 64 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12778356737704630108.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13710593550267462377.kers'
[2026-05-25 19:22:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12778356737704630108.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13710593550267462377.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 152 rows 35 cols 767 entries
Finished phase 1 with 26 SingleSign rule and 1 generalized
[2026-05-25 19:22:33] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13710593550267462377.kers
Total runtime 1 ms.
[2026-05-25 19:22:33] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 2/36 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
At refinement iteration 5 (OVERLAPS) 152/188 variables, 36/45 constraints. Problems are: Problem set: 12 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 37/82 constraints. Problems are: Problem set: 12 solved, 188 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 3/85 constraints. Problems are: Problem set: 16 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/85 constraints. Problems are: Problem set: 16 solved, 184 unsolved
At refinement iteration 9 (OVERLAPS) 0/188 variables, 0/85 constraints. Problems are: Problem set: 16 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 85 constraints, problems are : Problem set: 16 solved, 184 unsolved in 6675 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 36/36 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 16 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 7/7 constraints. Problems are: Problem set: 16 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 16 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 3/35 variables, 1/8 constraints. Problems are: Problem set: 16 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 3/11 constraints. Problems are: Problem set: 16 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/11 constraints. Problems are: Problem set: 16 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 1/36 variables, 1/12 constraints. Problems are: Problem set: 16 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/12 constraints. Problems are: Problem set: 16 solved, 184 unsolved
At refinement iteration 7 (OVERLAPS) 152/188 variables, 36/48 constraints. Problems are: Problem set: 16 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 37/85 constraints. Problems are: Problem set: 16 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 184/269 constraints. Problems are: Problem set: 16 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 0/269 constraints. Problems are: Problem set: 16 solved, 184 unsolved
At refinement iteration 11 (OVERLAPS) 0/188 variables, 0/269 constraints. Problems are: Problem set: 16 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 269 constraints, problems are : Problem set: 16 solved, 184 unsolved in 12751 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 36/36 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 184/200 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19642ms problems are : Problem set: 16 solved, 184 unsolved
Search for dead transitions found 16 dead transitions in 19658ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 16 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 36/160 places, 200/312 transitions.
Graph (complete) has 161 edges and 36 vertex of which 34 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 34 /36 variables (removed 2) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 19796 ms. Remains : 34/160 places, 200/312 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7581951708684315359.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17547259565335420611.kers'
[2026-05-25 19:22:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7581951708684315359.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17547259565335420611.kers]
Normalized transition count is 136 out of 200 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 136 rows 33 cols 598 entries
Finished phase 1 with 26 SingleSign rule and 0 generalized
[2026-05-25 19:22:53] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17547259565335420611.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (92437 resets) in 1598 ms. (625 steps per ms)
FORMULA HealthRecord-PT-12-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-12-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (16299 resets) in 466 ms. (2141 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 27785 ms.

BK_STOP 1779736975149

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

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