Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969019800093.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 Medical-PT-24, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969019800093
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 7.1K Mar 7 18:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 7 18:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 7 18:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Mar 7 18:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 15 11:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 11:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Mar 7 18:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 7 18:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 7 18:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 18:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:25 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 3.1M 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 Medical-PT-24-UpperBounds-00
FORMULA_NAME Medical-PT-24-UpperBounds-01
FORMULA_NAME Medical-PT-24-UpperBounds-02
FORMULA_NAME Medical-PT-24-UpperBounds-03
FORMULA_NAME Medical-PT-24-UpperBounds-04
FORMULA_NAME Medical-PT-24-UpperBounds-05
FORMULA_NAME Medical-PT-24-UpperBounds-06
FORMULA_NAME Medical-PT-24-UpperBounds-07
FORMULA_NAME Medical-PT-24-UpperBounds-08
FORMULA_NAME Medical-PT-24-UpperBounds-09
FORMULA_NAME Medical-PT-24-UpperBounds-10
FORMULA_NAME Medical-PT-24-UpperBounds-11
FORMULA_NAME Medical-PT-24-UpperBounds-12
FORMULA_NAME Medical-PT-24-UpperBounds-13
FORMULA_NAME Medical-PT-24-UpperBounds-14
FORMULA_NAME Medical-PT-24-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779695826982

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Medical-PT-24
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 07:57:08] [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 07:57:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 07:57:08] [INFO ] Load time of PNML (sax parser for PT used): 269 ms
[2026-05-25 07:57:08] [INFO ] Transformed 312 places.
[2026-05-25 07:57:08] [INFO ] Transformed 5431 transitions.
[2026-05-25 07:57:08] [INFO ] Parsed PT model containing 312 places and 5431 transitions and 28790 arcs in 408 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 242 places in 46 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA Medical-PT-24-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 1, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 1, 0] Max Struct:[+inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-106713737061059603.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12761800739032762916.kers'
[2026-05-25 07:57:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-106713737061059603.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12761800739032762916.kers]
Normalized transition count is 182 out of 227 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 182 rows 69 cols 762 entries
Finished phase 1 with 59 SingleSign rule and 0 generalized
[2026-05-25 07:57:09] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12761800739032762916.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0] Max Struct:[1, 1, +inf]
FORMULA Medical-PT-24-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (41 resets) in 30 ms. (322 steps per ms)
BEST_FIRST walk for 20001 steps (11 resets) in 22 ms. (869 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 23] Max Struct:[1, +inf]
[2026-05-25 07:57:09] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2780523726207041633.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17819145052649442222.kers'
[2026-05-25 07:57:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2780523726207041633.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17819145052649442222.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 182 rows 69 cols 762 entries
Finished phase 1 with 59 SingleSign rule and 0 generalized
[2026-05-25 07:57:09] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17819145052649442222.kers
Total runtime 1 ms.
[2026-05-25 07:57:09] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-25 07:57:09] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2026-05-25 07:57:09] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-25 07:57:09] [INFO ] [Real]Added 56 Read/Feed constraints in 14 ms returned sat
[2026-05-25 07:57:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 07:57:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-25 07:57:09] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2026-05-25 07:57:09] [INFO ] [Nat]Added 56 Read/Feed constraints in 11 ms returned sat
[2026-05-25 07:57:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 493 ms
[2026-05-25 07:57:10] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 15 ms.
[2026-05-25 07:57:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2026-05-25 07:57:10] [INFO ] Added : 46 causal constraints over 12 iterations in 435 ms. Result :sat
Minimization took 50 ms.
[2026-05-25 07:57:10] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2026-05-25 07:57:10] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2026-05-25 07:57:10] [INFO ] [Real]Added 56 Read/Feed constraints in 17 ms returned sat
[2026-05-25 07:57:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 07:57:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2026-05-25 07:57:10] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2026-05-25 07:57:10] [INFO ] [Nat]Added 56 Read/Feed constraints in 8 ms returned sat
[2026-05-25 07:57:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2026-05-25 07:57:10] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 18 ms.
[2026-05-25 07:57:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2026-05-25 07:57:11] [INFO ] Added : 36 causal constraints over 9 iterations in 283 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 23] Max Struct:[1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 23] Max Struct:[1, +inf]
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 227/227 transitions.
Graph (complete) has 347 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 67 transition count 224
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 64 transition count 224
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 63 transition count 224
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 63 transition count 222
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 13 place count 61 transition count 222
Applied a total of 13 rules in 37 ms. Remains 61 /69 variables (removed 8) and now considering 222/227 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 61/69 places, 222/227 transitions.
[2026-05-25 07:57:11] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
findPositiveTsemiflow completed in 40 ms - Found solution {1=1, 151=1} and attempted to minimize in 0 ms success -> {3=1, 151=1}
FORMULA Medical-PT-24-UpperBounds-13 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7156610317254031244.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9886604885800231704.kers'
[2026-05-25 07:57:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7156610317254031244.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9886604885800231704.kers]
Normalized transition count is 176 out of 222 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 176 rows 60 cols 690 entries
Finished phase 1 with 53 SingleSign rule and 0 generalized
[2026-05-25 07:57:21] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9886604885800231704.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000013 steps (2 resets) in 368 ms. (2710 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 533 ms. (1872 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-25 07:57:22] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15337552905113288189.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9292281784182968109.kers'
[2026-05-25 07:57:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15337552905113288189.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9292281784182968109.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 176 rows 60 cols 690 entries
Finished phase 1 with 53 SingleSign rule and 0 generalized
[2026-05-25 07:57:22] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-9292281784182968109.kers
Total runtime 16 ms.
[2026-05-25 07:57:22] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-25 07:57:22] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2026-05-25 07:57:22] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-25 07:57:22] [INFO ] [Real]Added 57 Read/Feed constraints in 24 ms returned sat
[2026-05-25 07:57:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 07:57:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-25 07:57:22] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2026-05-25 07:57:22] [INFO ] [Nat]Added 57 Read/Feed constraints in 13 ms returned sat
[2026-05-25 07:57:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2026-05-25 07:57:22] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 18 ms.
[2026-05-25 07:57:22] [INFO ] Added : 24 causal constraints over 5 iterations in 128 ms. Result :sat
Minimization took 84 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 61 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place x0_AA_q5) removed 6 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 216/216 transitions.
Reduce places removed 1 places and 12 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 60 transition count 204
Reduce places removed 1 places and 5 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 59 transition count 199
Applied a total of 2 rules in 19 ms. Remains 59 /61 variables (removed 2) and now considering 199/216 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 59/61 places, 199/216 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14756025435878415212.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6362289736106941013.kers'
[2026-05-25 07:57:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14756025435878415212.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6362289736106941013.kers]
Normalized transition count is 155 out of 199 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 155 rows 58 cols 604 entries
Finished phase 1 with 51 SingleSign rule and 0 generalized
[2026-05-25 07:57:23] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6362289736106941013.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000015 steps (2 resets) in 320 ms. (3115 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 445 ms. (2242 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-25 07:57:23] [INFO ] Flow matrix only has 155 transitions (discarded 44 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-181827461602367899.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14082770784490061888.kers'
[2026-05-25 07:57:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-181827461602367899.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14082770784490061888.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 155 rows 58 cols 604 entries
Finished phase 1 with 51 SingleSign rule and 0 generalized
[2026-05-25 07:57:23] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14082770784490061888.kers
Total runtime 0 ms.
[2026-05-25 07:57:23] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-25 07:57:23] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2026-05-25 07:57:23] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-25 07:57:23] [INFO ] [Real]Added 53 Read/Feed constraints in 13 ms returned sat
[2026-05-25 07:57:23] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 07:57:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-25 07:57:23] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2026-05-25 07:57:23] [INFO ] [Nat]Added 53 Read/Feed constraints in 22 ms returned sat
[2026-05-25 07:57:23] [INFO ] Computed and/alt/rep : 110/536/109 causal constraints (skipped 45 transitions) in 16 ms.
[2026-05-25 07:57:24] [INFO ] Added : 6 causal constraints over 2 iterations in 61 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 199/199 transitions.
Applied a total of 0 rules in 7 ms. Remains 59 /59 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 59/59 places, 199/199 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 199/199 transitions.
Applied a total of 0 rules in 5 ms. Remains 59 /59 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2026-05-25 07:57:24] [INFO ] Flow matrix only has 155 transitions (discarded 44 similar events)
[2026-05-25 07:57:24] [INFO ] Invariant cache hit.
[2026-05-25 07:57:24] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-25 07:57:24] [INFO ] Flow matrix only has 155 transitions (discarded 44 similar events)
[2026-05-25 07:57:24] [INFO ] Invariant cache hit.
[2026-05-25 07:57:24] [INFO ] State equation strengthened by 53 read => feed constraints.
[2026-05-25 07:57:24] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2026-05-25 07:57:24] [INFO ] Redundant transitions in 9 ms returned []
Running 198 sub problems to find dead transitions.
[2026-05-25 07:57:24] [INFO ] Flow matrix only has 155 transitions (discarded 44 similar events)
[2026-05-25 07:57:24] [INFO ] Invariant cache hit.
[2026-05-25 07:57:24] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 155/214 variables, 59/68 constraints. Problems are: Problem set: 0 solved, 198 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 53/121 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 0/214 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 121 constraints, problems are : Problem set: 0 solved, 198 unsolved in 5047 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 59/59 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 155/214 variables, 59/68 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 53/121 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD85 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 198/319 constraints. Problems are: Problem set: 42 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 4/323 constraints. Problems are: Problem set: 42 solved, 156 unsolved
Problem TDEAD61 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD130 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 3/326 constraints. Problems are: Problem set: 47 solved, 151 unsolved
Problem TDEAD86 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 6/332 constraints. Problems are: Problem set: 48 solved, 150 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 5/337 constraints. Problems are: Problem set: 48 solved, 150 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 3/340 constraints. Problems are: Problem set: 48 solved, 150 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/214 variables, 1/341 constraints. Problems are: Problem set: 48 solved, 150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 214/214 variables, and 342 constraints, problems are : Problem set: 48 solved, 150 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 59/59 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 35201ms problems are : Problem set: 48 solved, 150 unsolved
Search for dead transitions found 48 dead transitions in 35212ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 59/59 places, 151/199 transitions.
Reduce places removed 11 places and 58 transitions.
Graph (complete) has 167 edges and 48 vertex of which 1 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.0 ms
Discarding 47 places :
Also discarding 93 output transitions
Drop transitions (Output transitions of discarded places.) removed 93 transitions
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1 transition count 0
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 12 rules in 3 ms. Remains 1 /59 variables (removed 58) and now considering 0/151 (removed 151) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9539908031788460162.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1032578639713633087.kers'
[2026-05-25 07:57:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9539908031788460162.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1032578639713633087.kers]
[2026-05-25 07:57:59] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1032578639713633087.kers
Total runtime 1 ms.
[2026-05-25 07:57:59] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-25 07:57:59] [INFO ] Invariant cache hit.
[2026-05-25 07:57:59] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1/59 places, 0/199 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 35552 ms. Remains : 1/59 places, 0/199 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA Medical-PT-24-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (after structural reductions) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 51242 ms.

BK_STOP 1779695879697

--------------------
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="Medical-PT-24"
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 Medical-PT-24, 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 r178-oct2-177969019800093"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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