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-177969019800014.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-04, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969019800014
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 9.0K Mar 7 18:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Mar 7 18:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 7 18:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 7 18:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 15 11:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 11:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 18:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Mar 7 18:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 7 18:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Mar 7 18:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:22 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 booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Medical-PT-04-ReachabilityCardinality-2024-00
FORMULA_NAME Medical-PT-04-ReachabilityCardinality-2024-01
FORMULA_NAME Medical-PT-04-ReachabilityCardinality-2024-02
FORMULA_NAME Medical-PT-04-ReachabilityCardinality-2024-03
FORMULA_NAME Medical-PT-04-ReachabilityCardinality-2024-04
FORMULA_NAME Medical-PT-04-ReachabilityCardinality-2024-05
FORMULA_NAME Medical-PT-04-ReachabilityCardinality-2024-06
FORMULA_NAME Medical-PT-04-ReachabilityCardinality-2024-07
FORMULA_NAME Medical-PT-04-ReachabilityCardinality-2024-08
FORMULA_NAME Medical-PT-04-ReachabilityCardinality-2024-09
FORMULA_NAME Medical-PT-04-ReachabilityCardinality-2024-10
FORMULA_NAME Medical-PT-04-ReachabilityCardinality-2024-11
FORMULA_NAME Medical-PT-04-ReachabilityCardinality-2024-12
FORMULA_NAME Medical-PT-04-ReachabilityCardinality-2024-13
FORMULA_NAME Medical-PT-04-ReachabilityCardinality-2024-14
FORMULA_NAME Medical-PT-04-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779691551242

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Medical-PT-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-25 06:45:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 06:45:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 06:45:53] [INFO ] Load time of PNML (sax parser for PT used): 378 ms
[2026-05-25 06:45:53] [INFO ] Transformed 312 places.
[2026-05-25 06:45:53] [INFO ] Transformed 5431 transitions.
[2026-05-25 06:45:53] [INFO ] Parsed PT model containing 312 places and 5431 transitions and 28790 arcs in 686 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 242 places in 22 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA Medical-PT-04-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-04-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-04-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-04-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-04-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-04-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-04-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-04-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-04-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-04-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-04-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-04-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-04-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-04-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 06:45:54] [INFO ] Flatten gal took : 111 ms
[2026-05-25 06:45:54] [INFO ] Flatten gal took : 61 ms
RANDOM walk for 40000 steps (302 resets) in 1785 ms. (22 steps per ms) remains 2/2 properties
[2026-05-25 06:45:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2010894368207371940.gal : 39 ms
BEST_FIRST walk for 40004 steps (59 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
[2026-05-25 06:45:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7023987439708711646.prop : 18 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2010894368207371940.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7023987439708711646.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (24 resets) in 201 ms. (198 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality7023987439708711646.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 35
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :35 after 140
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :140 after 1215
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1215 after 10315
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :10315 after 28375
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :28375 after 64355
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :64355 after 136175
Interrupted probabilistic random walk after 375033 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :0 out of 2
Probabilistic random walk after 375033 steps, saw 206195 distinct states, run finished after 3009 ms. (steps per millisecond=124 ) properties seen :0
[2026-05-25 06:45:57] [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-6728160512471602041.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7308481498657494250.kers'
[2026-05-25 06:45:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6728160512471602041.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7308481498657494250.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 06:45:57] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7308481498657494250.kers
Total runtime 2 ms.
[2026-05-25 06:45:57] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem Medical-PT-04-ReachabilityCardinality-2024-00 is UNSAT
FORMULA Medical-PT-04-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 10/13 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 125/138 variables, 13/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 41/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 102/240 variables, 45/101 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 5/106 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 15/121 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/245 variables, 2/123 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 5/128 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/128 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/251 variables, 6/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 1/135 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/251 variables, 0/135 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/251 variables, 0/135 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 135 constraints, problems are : Problem set: 1 solved, 1 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 69/69 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 91/100 variables, 9/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 28/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 114/214 variables, 35/73 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 3/76 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 19/95 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 2/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/219 variables, 2/99 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 5/104 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 28/247 variables, 16/120 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 3/123 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 9/132 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/247 variables, 1/133 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/247 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/251 variables, 4/137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/251 variables, 1/138 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/251 variables, 0/138 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/251 variables, 0/138 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 138 constraints, problems are : Problem set: 1 solved, 1 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 69/69 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 738ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
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.2 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 0 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
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 10 place count 64 transition count 221
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 61 transition count 221
Applied a total of 13 rules in 65 ms. Remains 61 /69 variables (removed 8) and now considering 221/227 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 61/69 places, 221/227 transitions.
RANDOM walk for 40003 steps (8 resets) in 318 ms. (125 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1263971 steps, run timeout after 3001 ms. (steps per millisecond=421 ) properties seen :0 out of 1
Probabilistic random walk after 1263971 steps, saw 709271 distinct states, run finished after 3001 ms. (steps per millisecond=421 ) properties seen :0
[2026-05-25 06:46:01] [INFO ] Flow matrix only has 176 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-14793302523673398242.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12084944970183699839.kers'
[2026-05-25 06:46:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14793302523673398242.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12084944970183699839.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 06:46:01] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12084944970183699839.kers
Total runtime 2 ms.
[2026-05-25 06:46:01] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 113/146 variables, 25/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 35/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 66/212 variables, 21/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 9/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 21/233 variables, 9/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/233 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/233 variables, 10/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/233 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/237 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/237 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/237 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/237 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 113/146 variables, 25/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 35/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 66/212 variables, 21/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 9/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :136175 after 279675
At refinement iteration 13 (INCLUDED_ONLY) 0/212 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 21/233 variables, 9/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/233 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/233 variables, 10/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/233 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/237 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/237 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/237 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/237 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 128 constraints, problems are : Problem set: 0 solved, 1 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 390ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 221/221 transitions.
Applied a total of 0 rules in 7 ms. Remains 61 /61 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 61/61 places, 221/221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 221/221 transitions.
Applied a total of 0 rules in 6 ms. Remains 61 /61 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2026-05-25 06:46:01] [INFO ] Flow matrix only has 176 transitions (discarded 45 similar events)
[2026-05-25 06:46:01] [INFO ] Invariant cache hit.
[2026-05-25 06:46:01] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-25 06:46:01] [INFO ] Flow matrix only has 176 transitions (discarded 45 similar events)
[2026-05-25 06:46:01] [INFO ] Invariant cache hit.
[2026-05-25 06:46:01] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-25 06:46:01] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2026-05-25 06:46:01] [INFO ] Redundant transitions in 5 ms returned []
Running 220 sub problems to find dead transitions.
[2026-05-25 06:46:02] [INFO ] Flow matrix only has 176 transitions (discarded 45 similar events)
[2026-05-25 06:46:02] [INFO ] Invariant cache hit.
[2026-05-25 06:46:02] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 176/237 variables, 61/70 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 56/126 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 220 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/237 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 126 constraints, problems are : Problem set: 0 solved, 220 unsolved in 7653 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 176/237 variables, 61/70 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 56/126 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 220/346 constraints. Problems are: Problem set: 18 solved, 202 unsolved
Problem TDEAD38 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD52 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 3/349 constraints. Problems are: Problem set: 21 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 3/352 constraints. Problems are: Problem set: 21 solved, 199 unsolved
Problem TDEAD24 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD144 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 3/355 constraints. Problems are: Problem set: 30 solved, 190 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 4/359 constraints. Problems are: Problem set: 30 solved, 190 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :279675 after 566535
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 2/361 constraints. Problems are: Problem set: 30 solved, 190 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 237/237 variables, and 361 constraints, problems are : Problem set: 30 solved, 190 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 37823ms problems are : Problem set: 30 solved, 190 unsolved
Search for dead transitions found 30 dead transitions in 37826ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/61 places, 191/221 transitions.
Reduce places removed 9 places and 61 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 52 transition count 130
Reduce places removed 7 places and 39 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 16 place count 45 transition count 91
Reduce places removed 2 places and 10 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 43 transition count 81
Reduce places removed 2 places and 11 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 20 place count 41 transition count 70
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 20 rules in 13 ms. Remains 41 /61 variables (removed 20) and now considering 70/191 (removed 121) transitions.
[2026-05-25 06:46:39] [INFO ] Flow matrix only has 63 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5342603178943769871.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9795289704936727248.kers'
[2026-05-25 06:46:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5342603178943769871.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9795289704936727248.kers]
Culling trivial invariants: removing 1 columns.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 63 rows 37 cols 204 entries
Finished phase 1 with 32 SingleSign rule and 0 generalized
[2026-05-25 06:46:39] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9795289704936727248.kers
Total runtime 0 ms.
[2026-05-25 06:46:39] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-25 06:46:39] [INFO ] Flow matrix only has 63 transitions (discarded 7 similar events)
[2026-05-25 06:46:39] [INFO ] Invariant cache hit.
[2026-05-25 06:46:39] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-25 06:46:40] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 41/61 places, 70/221 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 38328 ms. Remains : 41/61 places, 70/221 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA Medical-PT-04-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 47344 ms.

BK_STOP 1779691600183

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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-04"
export BK_EXAMINATION="ReachabilityCardinality"
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-04, examination is ReachabilityCardinality"
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-177969019800014"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Medical-PT-04.tgz
mv Medical-PT-04 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;