Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r100-smll-174867008300662.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is HealthRecord-PT-16, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867008300662
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 125K May 29 14:32 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-16-ReachabilityCardinality-2025-00
FORMULA_NAME HealthRecord-PT-16-ReachabilityCardinality-2025-01
FORMULA_NAME HealthRecord-PT-16-ReachabilityCardinality-2025-02
FORMULA_NAME HealthRecord-PT-16-ReachabilityCardinality-2025-03
FORMULA_NAME HealthRecord-PT-16-ReachabilityCardinality-2025-04
FORMULA_NAME HealthRecord-PT-16-ReachabilityCardinality-2025-05
FORMULA_NAME HealthRecord-PT-16-ReachabilityCardinality-2025-06
FORMULA_NAME HealthRecord-PT-16-ReachabilityCardinality-2025-07
FORMULA_NAME HealthRecord-PT-16-ReachabilityCardinality-2025-08
FORMULA_NAME HealthRecord-PT-16-ReachabilityCardinality-2025-09
FORMULA_NAME HealthRecord-PT-16-ReachabilityCardinality-2025-10
FORMULA_NAME HealthRecord-PT-16-ReachabilityCardinality-2025-11
FORMULA_NAME HealthRecord-PT-16-ReachabilityCardinality-2025-12
FORMULA_NAME HealthRecord-PT-16-ReachabilityCardinality-2025-13
FORMULA_NAME HealthRecord-PT-16-ReachabilityCardinality-2025-14
FORMULA_NAME HealthRecord-PT-16-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749008901910

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-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-04 03:48:24] [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]
[2025-06-04 03:48:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 03:48:24] [INFO ] Load time of PNML (sax parser for PT used): 226 ms
[2025-06-04 03:48:24] [INFO ] Transformed 453 places.
[2025-06-04 03:48:24] [INFO ] Transformed 594 transitions.
[2025-06-04 03:48:24] [INFO ] Found NUPN structural information;
[2025-06-04 03:48:25] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 463 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 43 ms.
Working with output stream class java.io.PrintStream
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (283 resets) in 2360 ms. (16 steps per ms) remains 9/12 properties
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2025-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-04 03:48:26] [INFO ] Flatten gal took : 208 ms
BEST_FIRST walk for 40002 steps (19 resets) in 800 ms. (49 steps per ms) remains 9/9 properties
[2025-06-04 03:48:26] [INFO ] Flatten gal took : 213 ms
BEST_FIRST walk for 40004 steps (66 resets) in 464 ms. (86 steps per ms) remains 9/9 properties
[2025-06-04 03:48:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7567568105697958674.gal : 105 ms
BEST_FIRST walk for 40002 steps (69 resets) in 462 ms. (86 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (53 resets) in 485 ms. (82 steps per ms) remains 9/9 properties
[2025-06-04 03:48:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality947723021500758816.prop : 5 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7567568105697958674.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality947723021500758816.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (57 resets) in 124 ms. (320 steps per ms) remains 9/9 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
BEST_FIRST walk for 40004 steps (55 resets) in 338 ms. (118 steps per ms) remains 9/9 properties
Loading property file /tmp/ReachabilityCardinality947723021500758816.prop.
BEST_FIRST walk for 40004 steps (67 resets) in 178 ms. (223 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (82 resets) in 214 ms. (186 steps per ms) remains 6/9 properties
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :11 after 24
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :24 after 48
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :48 after 138
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :138 after 2550
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :2550 after 1.53612e+06
// Phase 1: matrix 594 rows 453 cols
[2025-06-04 03:48:26] [INFO ] Computed 14 invariants in 34 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 165/245 variables, 8/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 165/253 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 208/453 variables, 6/259 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/453 variables, 208/467 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/453 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 594/1047 variables, 453/920 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1047 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/1047 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1047/1047 variables, and 920 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2293 ms.
Refiners :[Domain max(s): 453/453 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 453/453 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 165/245 variables, 8/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 165/253 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:30] [INFO ] Deduced a trap composed of 86 places in 315 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:30] [INFO ] Deduced a trap composed of 88 places in 150 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:30] [INFO ] Deduced a trap composed of 88 places in 156 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:30] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:30] [INFO ] Deduced a trap composed of 88 places in 143 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:31] [INFO ] Deduced a trap composed of 88 places in 168 ms of which 29 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 6/259 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:31] [INFO ] Deduced a trap composed of 91 places in 208 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:31] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:31] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:32] [INFO ] Deduced a trap composed of 92 places in 72 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 4/263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem HealthRecord-PT-16-ReachabilityCardinality-2025-02 is UNSAT
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2025-02 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 208/453 variables, 6/269 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 208/477 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:33] [INFO ] Deduced a trap composed of 87 places in 370 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:33] [INFO ] Deduced a trap composed of 90 places in 225 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:33] [INFO ] Deduced a trap composed of 108 places in 122 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:33] [INFO ] Deduced a trap composed of 121 places in 132 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:34] [INFO ] Deduced a trap composed of 87 places in 272 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:34] [INFO ] Deduced a trap composed of 91 places in 268 ms of which 61 ms to minimize.
SMT process timed out in 7630ms, After SMT, problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 58 out of 453 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 453/453 places, 594/594 transitions.
Graph (trivial) has 421 edges and 453 vertex of which 33 / 453 are part of one of the 11 SCC in 7 ms
Free SCC test removed 22 places
Drop transitions (Empty/Sink Transition effects.) removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Graph (complete) has 837 edges and 431 vertex of which 421 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.5 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 152 transitions
Trivial Post-agglo rules discarded 152 transitions
Performed 152 trivial Post agglomeration. Transition count delta: 152
Iterating post reduction 0 with 152 rules applied. Total rules applied 154 place count 421 transition count 403
Reduce places removed 152 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 162 rules applied. Total rules applied 316 place count 269 transition count 393
Reduce places removed 2 places and 0 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 2 with 25 rules applied. Total rules applied 341 place count 267 transition count 370
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 364 place count 244 transition count 370
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 364 place count 244 transition count 364
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 376 place count 238 transition count 364
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 413 place count 201 transition count 292
Iterating global reduction 4 with 37 rules applied. Total rules applied 450 place count 201 transition count 292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 451 place count 201 transition count 291
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 451 place count 201 transition count 290
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 453 place count 200 transition count 290
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 456 place count 197 transition count 284
Iterating global reduction 5 with 3 rules applied. Total rules applied 459 place count 197 transition count 284
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 461 place count 195 transition count 282
Iterating global reduction 5 with 2 rules applied. Total rules applied 463 place count 195 transition count 282
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 464 place count 194 transition count 280
Iterating global reduction 5 with 1 rules applied. Total rules applied 465 place count 194 transition count 280
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 466 place count 193 transition count 278
Iterating global reduction 5 with 1 rules applied. Total rules applied 467 place count 193 transition count 278
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 523 place count 165 transition count 250
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 545 place count 154 transition count 290
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 549 place count 154 transition count 286
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 6 with 12 rules applied. Total rules applied 561 place count 154 transition count 274
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 562 place count 153 transition count 269
Iterating global reduction 6 with 1 rules applied. Total rules applied 563 place count 153 transition count 269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 565 place count 152 transition count 277
Free-agglomeration rule applied 15 times.
Iterating global reduction 6 with 15 rules applied. Total rules applied 580 place count 152 transition count 262
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 599 place count 137 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 601 place count 137 transition count 256
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 605 place count 137 transition count 256
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 612 place count 137 transition count 256
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 614 place count 135 transition count 254
Iterating global reduction 7 with 2 rules applied. Total rules applied 616 place count 135 transition count 254
Applied a total of 616 rules in 321 ms. Remains 135 /453 variables (removed 318) and now considering 254/594 (removed 340) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 335 ms. Remains : 135/453 places, 254/594 transitions.
RANDOM walk for 40000 steps (23 resets) in 347 ms. (114 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (14 resets) in 153 ms. (259 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (30 resets) in 307 ms. (129 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (28 resets) in 158 ms. (251 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (39 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (43 resets) in 154 ms. (258 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 596238 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :1 out of 5
Probabilistic random walk after 596238 steps, saw 102342 distinct states, run finished after 3008 ms. (steps per millisecond=198 ) properties seen :1
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2025-06-04 03:48:38] [INFO ] Flow matrix only has 251 transitions (discarded 3 similar events)
// Phase 1: matrix 251 rows 135 cols
[2025-06-04 03:48:38] [INFO ] Computed 8 invariants in 2 ms
[2025-06-04 03:48:38] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 78/134 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 250/384 variables, 134/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 14/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/386 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/386 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 157 constraints, problems are : Problem set: 0 solved, 4 unsolved in 481 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 135/135 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 78/134 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:39] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:39] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:39] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:39] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:39] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 250/384 variables, 134/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 14/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/386 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/386 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 166 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1779 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 135/135 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2290ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2025-09 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 3584 steps, including 123 resets, run visited all 3 properties in 19 ms. (steps per millisecond=188 )
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2025-14 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2025-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-16-ReachabilityCardinality-2025-10 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 309 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 16482 ms.

BK_STOP 1749008921004

--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-16"
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-5832"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-16, 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 r100-smll-174867008300662"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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