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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.1K Mar 7 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 7 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 7 13:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 7 13:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 10:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 10:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 13:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Mar 7 13:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 7 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Mar 7 13:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:46 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 175K 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 HealthRecord-PT-17-ReachabilityCardinality-2024-00
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-01
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-02
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-03
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-04
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-05
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-06
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-07
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-08
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-09
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-10
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-11
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-12
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-13
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-14
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779738445077

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-25 19:47:26] [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 19:47:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 19:47:26] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2026-05-25 19:47:26] [INFO ] Transformed 624 places.
[2026-05-25 19:47:26] [INFO ] Transformed 828 transitions.
[2026-05-25 19:47:26] [INFO ] Found NUPN structural information;
[2026-05-25 19:47:26] [INFO ] Parsed PT model containing 624 places and 828 transitions and 1879 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (345 resets) in 1852 ms. (21 steps per ms) remains 11/15 properties
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (65 resets) in 273 ms. (145 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (56 resets) in 148 ms. (268 steps per ms) remains 11/11 properties
[2026-05-25 19:47:27] [INFO ] Flatten gal took : 169 ms
BEST_FIRST walk for 40004 steps (56 resets) in 113 ms. (350 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (55 resets) in 133 ms. (298 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (56 resets) in 112 ms. (354 steps per ms) remains 11/11 properties
[2026-05-25 19:47:27] [INFO ] Flatten gal took : 90 ms
BEST_FIRST walk for 40004 steps (56 resets) in 227 ms. (175 steps per ms) remains 11/11 properties
[2026-05-25 19:47:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15690356247283152147.gal : 85 ms
[2026-05-25 19:47:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9064903005184765231.prop : 2 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/ReachabilityCardinality15690356247283152147.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9064903005184765231.prop' '--nowitness' '--gen-order' 'FOLLOW'

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 ...329
Loading property file /tmp/ReachabilityCardinality9064903005184765231.prop.
BEST_FIRST walk for 40004 steps (61 resets) in 1181 ms. (33 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (69 resets) in 119 ms. (333 steps per ms) remains 9/11 properties
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :5 after 11
BEST_FIRST walk for 40003 steps (54 resets) in 139 ms. (285 steps per ms) remains 9/9 properties
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :11 after 12
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :12 after 16
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :16 after 27
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :27 after 55
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :55 after 363
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :363 after 4.29006e+07
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6384229667620065574.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14065195926568917086.kers'
[2026-05-25 19:47:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6384229667620065574.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14065195926568917086.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 828 rows 624 cols 1879 entries
Finished phase 1 with 604 SingleSign rule and 2 generalized
[2026-05-25 19:47:27] [INFO ] Computed 18 invariants in 4 ms
Computed 18 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14065195926568917086.kers
Total runtime 5 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 92/92 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 436/528 variables, 9/101 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 436/537 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 96/624 variables, 9/546 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/624 variables, 96/642 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/624 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 828/1452 variables, 624/1266 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1452 variables, 2/1268 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SMT process timed out in 5316ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 92 out of 624 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 624/624 places, 828/828 transitions.
Graph (trivial) has 535 edges and 624 vertex of which 36 / 624 are part of one of the 15 SCC in 7 ms
Free SCC test removed 21 places
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (complete) has 1260 edges and 603 vertex of which 593 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 189 transitions
Trivial Post-agglo rules discarded 189 transitions
Performed 189 trivial Post agglomeration. Transition count delta: 189
Iterating post reduction 0 with 189 rules applied. Total rules applied 191 place count 593 transition count 599
Reduce places removed 189 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 201 rules applied. Total rules applied 392 place count 404 transition count 587
Reduce places removed 2 places and 0 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 2 with 44 rules applied. Total rules applied 436 place count 402 transition count 545
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 478 place count 360 transition count 545
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 478 place count 360 transition count 535
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 498 place count 350 transition count 535
Discarding 71 places :
Symmetric choice reduction at 4 with 71 rule applications. Total rules 569 place count 279 transition count 412
Iterating global reduction 4 with 71 rules applied. Total rules applied 640 place count 279 transition count 412
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 645 place count 279 transition count 407
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 651 place count 273 transition count 395
Iterating global reduction 5 with 6 rules applied. Total rules applied 657 place count 273 transition count 395
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 5 with 70 rules applied. Total rules applied 727 place count 238 transition count 360
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 728 place count 238 transition count 359
Performed 11 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 750 place count 227 transition count 416
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 769 place count 227 transition count 397
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 776 place count 227 transition count 390
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 776 place count 227 transition count 389
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 778 place count 226 transition count 389
Free-agglomeration rule applied 28 times.
Iterating global reduction 7 with 28 rules applied. Total rules applied 806 place count 226 transition count 361
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 7 with 28 rules applied. Total rules applied 834 place count 198 transition count 361
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 835 place count 198 transition count 360
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 836 place count 198 transition count 360
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 841 place count 198 transition count 360
Applied a total of 841 rules in 222 ms. Remains 198 /624 variables (removed 426) and now considering 360/828 (removed 468) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 230 ms. Remains : 198/624 places, 360/828 transitions.
RANDOM walk for 40000 steps (999 resets) in 715 ms. (55 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (182 resets) in 109 ms. (363 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (170 resets) in 63 ms. (625 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (171 resets) in 68 ms. (579 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (178 resets) in 64 ms. (615 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (171 resets) in 45 ms. (869 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (174 resets) in 139 ms. (285 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (179 resets) in 246 ms. (161 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (177 resets) in 104 ms. (380 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (174 resets) in 117 ms. (339 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 701336 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :2 out of 9
Probabilistic random walk after 701336 steps, saw 121742 distinct states, run finished after 3011 ms. (steps per millisecond=232 ) properties seen :2
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2026-05-25 19:47:37] [INFO ] Flow matrix only has 359 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5551824295723680836.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13355813896739914062.kers'
[2026-05-25 19:47:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5551824295723680836.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13355813896739914062.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 359 rows 198 cols 1176 entries
Finished phase 1 with 184 SingleSign rule and 2 generalized
[2026-05-25 19:47:37] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13355813896739914062.kers
Total runtime 2 ms.
[2026-05-25 19:47:37] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 26/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 135/198 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 359/557 variables, 198/210 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 6/216 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/557 variables, 3/219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/557 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/557 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/557 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 221 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2231 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 198/198 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 26/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 135/198 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem HealthRecord-PT-17-ReachabilityCardinality-2024-02 is UNSAT
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 9/26 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/26 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 359/557 variables, 198/224 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 6/230 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 6/236 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/557 variables, 3/239 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/557 variables, 0/239 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/557 variables, 0/239 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 239 constraints, problems are : Problem set: 1 solved, 6 unsolved in 3123 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 198/198 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5400ms problems are : Problem set: 1 solved, 6 unsolved
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-11 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-14 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-07 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-04 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 611 ms.
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 360/360 transitions.
Graph (trivial) has 205 edges and 198 vertex of which 26 / 198 are part of one of the 7 SCC in 1 ms
Free SCC test removed 19 places
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Graph (complete) has 557 edges and 179 vertex of which 175 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 175 transition count 281
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 129 transition count 279
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 96 place count 129 transition count 267
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 120 place count 117 transition count 267
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 145 place count 92 transition count 218
Iterating global reduction 2 with 25 rules applied. Total rules applied 170 place count 92 transition count 218
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 174 place count 92 transition count 214
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 181 place count 85 transition count 193
Iterating global reduction 3 with 7 rules applied. Total rules applied 188 place count 85 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 189 place count 85 transition count 192
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 193 place count 81 transition count 187
Iterating global reduction 4 with 4 rules applied. Total rules applied 197 place count 81 transition count 187
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 199 place count 81 transition count 185
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 200 place count 80 transition count 181
Iterating global reduction 5 with 1 rules applied. Total rules applied 201 place count 80 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 204 place count 80 transition count 178
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 228 place count 68 transition count 166
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 242 place count 68 transition count 152
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 243 place count 67 transition count 149
Iterating global reduction 7 with 1 rules applied. Total rules applied 244 place count 67 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 245 place count 67 transition count 148
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 247 place count 65 transition count 146
Iterating global reduction 8 with 2 rules applied. Total rules applied 249 place count 65 transition count 146
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 251 place count 65 transition count 144
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 9 with 10 rules applied. Total rules applied 261 place count 60 transition count 183
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 278 place count 60 transition count 166
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 279 place count 59 transition count 164
Iterating global reduction 10 with 1 rules applied. Total rules applied 280 place count 59 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 281 place count 59 transition count 163
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 286 place count 59 transition count 158
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 288 place count 58 transition count 157
Free-agglomeration rule applied 13 times.
Iterating global reduction 11 with 13 rules applied. Total rules applied 301 place count 58 transition count 144
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 14 rules applied. Total rules applied 315 place count 45 transition count 143
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 12 with 11 rules applied. Total rules applied 326 place count 45 transition count 132
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 12 with 8 rules applied. Total rules applied 334 place count 45 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 335 place count 45 transition count 131
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 336 place count 45 transition count 131
Applied a total of 336 rules in 49 ms. Remains 45 /198 variables (removed 153) and now considering 131/360 (removed 229) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 45/198 places, 131/360 transitions.
RANDOM walk for 40000 steps (1703 resets) in 535 ms. (74 steps per ms) remains 1/2 properties
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (529 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
[2026-05-25 19:47:43] [INFO ] Flow matrix only has 118 transitions (discarded 13 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8574425508448789489.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5208390784273085739.kers'
[2026-05-25 19:47:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8574425508448789489.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5208390784273085739.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 118 rows 44 cols 581 entries
Finished phase 1 with 35 SingleSign rule and 1 generalized
[2026-05-25 19:47:43] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5208390784273085739.kers
Total runtime 1 ms.
[2026-05-25 19:47:43] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/29 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/44 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/45 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/45 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 118/163 variables, 45/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 36/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/163 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/29 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/44 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/45 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/45 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 118/163 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 36/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/163 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/163 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/163 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 465ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2024-03 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 4 ms.
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 17633 ms.

BK_STOP 1779738463966

--------------------
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="HealthRecord-PT-17"
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 HealthRecord-PT-17, 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 r146-tall-177961074300670"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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