fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r100-smll-174867008200599
Last Updated
June 24, 2025

About the Execution of ITS-Tools for HealthRecord-PT-08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 23883.00 0.00 0.00 TTTFTTFTTFTTTFTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r100-smll-174867008200599.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-08, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867008200599
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K 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 68K 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-08-ReachabilityFireability-2025-00
FORMULA_NAME HealthRecord-PT-08-ReachabilityFireability-2025-01
FORMULA_NAME HealthRecord-PT-08-ReachabilityFireability-2025-02
FORMULA_NAME HealthRecord-PT-08-ReachabilityFireability-2025-03
FORMULA_NAME HealthRecord-PT-08-ReachabilityFireability-2025-04
FORMULA_NAME HealthRecord-PT-08-ReachabilityFireability-2025-05
FORMULA_NAME HealthRecord-PT-08-ReachabilityFireability-2025-06
FORMULA_NAME HealthRecord-PT-08-ReachabilityFireability-2025-07
FORMULA_NAME HealthRecord-PT-08-ReachabilityFireability-2025-08
FORMULA_NAME HealthRecord-PT-08-ReachabilityFireability-2025-09
FORMULA_NAME HealthRecord-PT-08-ReachabilityFireability-2025-10
FORMULA_NAME HealthRecord-PT-08-ReachabilityFireability-2025-11
FORMULA_NAME HealthRecord-PT-08-ReachabilityFireability-2025-12
FORMULA_NAME HealthRecord-PT-08-ReachabilityFireability-2025-13
FORMULA_NAME HealthRecord-PT-08-ReachabilityFireability-2025-14
FORMULA_NAME HealthRecord-PT-08-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749000567004

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-04 01:29:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 01:29:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 01:29:30] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2025-06-04 01:29:30] [INFO ] Transformed 156 places.
[2025-06-04 01:29:30] [INFO ] Transformed 326 transitions.
[2025-06-04 01:29:30] [INFO ] Found NUPN structural information;
[2025-06-04 01:29:30] [INFO ] Parsed PT model containing 156 places and 326 transitions and 855 arcs in 460 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 34 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
[2025-06-04 01:29:31] [INFO ] Flatten gal took : 203 ms
[2025-06-04 01:29:31] [INFO ] Flatten gal took : 122 ms
[2025-06-04 01:29:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2937644935473262129.gal : 53 ms
RANDOM walk for 40000 steps (2231 resets) in 3736 ms. (10 steps per ms) remains 12/16 properties
FORMULA HealthRecord-PT-08-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-08-ReachabilityFireability-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-08-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-08-ReachabilityFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-04 01:29:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15355727737833238631.prop : 15 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/ReachabilityCardinality2937644935473262129.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15355727737833238631.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40003 steps (301 resets) in 969 ms. (41 steps per ms) remains 12/12 properties
Loading property file /tmp/ReachabilityCardinality15355727737833238631.prop.
BEST_FIRST walk for 40003 steps (298 resets) in 280 ms. (142 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (306 resets) in 267 ms. (149 steps per ms) remains 11/12 properties
FORMULA HealthRecord-PT-08-ReachabilityFireability-2025-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :4 after 13
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :13 after 49
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :49 after 5185
BEST_FIRST walk for 40002 steps (303 resets) in 156 ms. (254 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (308 resets) in 138 ms. (287 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (315 resets) in 327 ms. (121 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (313 resets) in 230 ms. (173 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (145 resets) in 83 ms. (476 steps per ms) remains 11/11 properties
SDD proceeding with computation,12 properties remain. new max is 128
BEST_FIRST walk for 40003 steps (299 resets) in 1868 ms. (21 steps per ms) remains 11/11 properties
SDD size :5185 after 27649
BEST_FIRST walk for 40004 steps (293 resets) in 154 ms. (258 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (293 resets) in 68 ms. (579 steps per ms) remains 11/11 properties
[2025-06-04 01:29:32] [INFO ] Flow matrix only has 288 transitions (discarded 12 similar events)
// Phase 1: matrix 288 rows 156 cols
[2025-06-04 01:29:32] [INFO ] Computed 18 invariants in 22 ms
[2025-06-04 01:29:33] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :27649 after 34561
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :34561 after 44929
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :44929 after 96769
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :96769 after 261505
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem HealthRecord-PT-08-ReachabilityFireability-2025-06 is UNSAT
FORMULA HealthRecord-PT-08-ReachabilityFireability-2025-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 23/133 variables, 10/120 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 23/143 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Reachability property HealthRecord-PT-08-ReachabilityFireability-2025-14 is true.
At refinement iteration 5 (OVERLAPS) 23/156 variables, 8/151 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 23/174 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Problem HealthRecord-PT-08-ReachabilityFireability-2025-09 is UNSAT
FORMULA HealthRecord-PT-08-ReachabilityFireability-2025-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 287/443 variables, 156/330 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/330 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 1/444 variables, 1/331 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 0/331 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/444 variables, 0/331 constraints. Problems are: Problem set: 2 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 331 constraints, problems are : Problem set: 2 solved, 9 unsolved in 3562 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 156/156 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/94 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Problem HealthRecord-PT-08-ReachabilityFireability-2025-10 is UNSAT
FORMULA HealthRecord-PT-08-ReachabilityFireability-2025-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 34/128 variables, 10/104 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 34/138 constraints. Problems are: Problem set: 3 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:37] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:37] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:37] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 3/141 constraints. Problems are: Problem set: 3 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:37] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 1/142 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/142 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 28/156 variables, 8/150 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 28/178 constraints. Problems are: Problem set: 3 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:38] [INFO ] Deduced a trap composed of 37 places in 204 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:38] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:38] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:38] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:39] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:39] [INFO ] Deduced a trap composed of 38 places in 207 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:39] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:39] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:39] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:39] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:40] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:40] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:40] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:40] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:40] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:40] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:41] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:41] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:41] [INFO ] Deduced a trap composed of 42 places in 164 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:41] [INFO ] Deduced a trap composed of 42 places in 178 ms of which 22 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 20/198 constraints. Problems are: Problem set: 3 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 156/444 variables, and 198 constraints, problems are : Problem set: 3 solved, 8 unsolved in 5018 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/156 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8749ms problems are : Problem set: 3 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 79 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 300/300 transitions.
Graph (trivial) has 65 edges and 156 vertex of which 2 / 156 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 660 edges and 155 vertex of which 149 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 149 transition count 284
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 148 transition count 283
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 38 place count 115 transition count 217
Iterating global reduction 2 with 33 rules applied. Total rules applied 71 place count 115 transition count 217
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 73 place count 113 transition count 213
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 113 transition count 213
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 81 place count 110 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 110 transition count 209
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 110 transition count 209
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 110 transition count 209
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 110 transition count 208
Applied a total of 85 rules in 211 ms. Remains 110 /156 variables (removed 46) and now considering 208/300 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 110/156 places, 208/300 transitions.
RANDOM walk for 40000 steps (2346 resets) in 977 ms. (40 steps per ms) remains 7/8 properties
FORMULA HealthRecord-PT-08-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (352 resets) in 220 ms. (181 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (351 resets) in 76 ms. (519 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (351 resets) in 156 ms. (254 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (352 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (362 resets) in 106 ms. (373 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (366 resets) in 287 ms. (138 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (348 resets) in 135 ms. (294 steps per ms) remains 7/7 properties
// Phase 1: matrix 208 rows 110 cols
[2025-06-04 01:29:42] [INFO ] Computed 12 invariants in 4 ms
[2025-06-04 01:29:42] [INFO ] State equation strengthened by 1 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/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 23/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 23/110 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 208/318 variables, 110/122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/318 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 123 constraints, problems are : Problem set: 0 solved, 7 unsolved in 625 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 23/87 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:43] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:43] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 23/110 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :261505 after 1.17773e+06
[2025-06-04 01:29:43] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:43] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:44] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:44] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:44] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:44] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:44] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:44] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:44] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:44] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:45] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:45] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:45] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:45] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:45] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:45] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:45] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:45] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:46] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:46] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:46] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:46] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:46] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:46] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:46] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:46] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:46] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:46] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:46] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:47] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:47] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:47] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 208/318 variables, 110/156 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 5/162 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:47] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 8 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:48] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 6 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/318 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/318 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:29:48] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 5 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/318 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/318 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 0/318 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 165 constraints, problems are : Problem set: 0 solved, 7 unsolved in 6421 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7082ms problems are : Problem set: 0 solved, 7 unsolved
FORMULA HealthRecord-PT-08-ReachabilityFireability-2025-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-08-ReachabilityFireability-2025-03 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-08-ReachabilityFireability-2025-02 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-08-ReachabilityFireability-2025-00 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-08-ReachabilityFireability-2025-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-08-ReachabilityFireability-2025-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 6 properties in 378 ms.
Support contains 37 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 208/208 transitions.
Graph (trivial) has 59 edges and 110 vertex of which 8 / 110 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 466 edges and 106 vertex of which 103 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 103 transition count 199
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 102 transition count 199
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 30 place count 76 transition count 148
Iterating global reduction 2 with 26 rules applied. Total rules applied 56 place count 76 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 76 transition count 147
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 75 transition count 145
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 75 transition count 145
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 65 place count 72 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 66 place count 72 transition count 141
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 81 place count 72 transition count 141
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 82 place count 71 transition count 139
Iterating global reduction 4 with 1 rules applied. Total rules applied 83 place count 71 transition count 139
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 84 place count 70 transition count 137
Iterating global reduction 4 with 1 rules applied. Total rules applied 85 place count 70 transition count 137
Applied a total of 85 rules in 48 ms. Remains 70 /110 variables (removed 40) and now considering 137/208 (removed 71) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 70/110 places, 137/208 transitions.
RANDOM walk for 40000 steps (2160 resets) in 117 ms. (338 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (323 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 307304 steps, run visited all 1 properties in 589 ms. (steps per millisecond=521 )
Probabilistic random walk after 307304 steps, saw 49875 distinct states, run finished after 596 ms. (steps per millisecond=515 ) properties seen :1
FORMULA HealthRecord-PT-08-ReachabilityFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
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 21138 ms.

BK_STOP 1749000590887

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

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