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

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

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

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K 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 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K 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 46K 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-01-CTLCardinality-2023-12
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2023-13
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2023-14
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2023-15
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2025-00
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2025-01
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2025-02
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2025-03
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2025-04
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2025-05
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2025-06
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2025-07
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2025-08
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2025-09
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2025-10
FORMULA_NAME HealthRecord-PT-01-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748995616903

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-04 00:06:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 00:06:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 00:06:59] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2025-06-04 00:06:59] [INFO ] Transformed 117 places.
[2025-06-04 00:06:59] [INFO ] Transformed 218 transitions.
[2025-06-04 00:06:59] [INFO ] Found NUPN structural information;
[2025-06-04 00:06:59] [INFO ] Parsed PT model containing 117 places and 218 transitions and 557 arcs in 365 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 35 ms.
Ensure Unique test removed 5 transitions
Reduce redundant transitions removed 5 transitions.
FORMULA HealthRecord-PT-01-CTLCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-01-CTLCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 213/213 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 93 transition count 168
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 93 transition count 168
Applied a total of 48 rules in 44 ms. Remains 93 /117 variables (removed 24) and now considering 168/213 (removed 45) transitions.
[2025-06-04 00:07:00] [INFO ] Flow matrix only has 163 transitions (discarded 5 similar events)
// Phase 1: matrix 163 rows 93 cols
[2025-06-04 00:07:00] [INFO ] Computed 11 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:07:00] [INFO ] Implicit Places using invariants in 422 ms returned []
[2025-06-04 00:07:00] [INFO ] Flow matrix only has 163 transitions (discarded 5 similar events)
[2025-06-04 00:07:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:07:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:07:00] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 814 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2025-06-04 00:07:00] [INFO ] Flow matrix only has 163 transitions (discarded 5 similar events)
[2025-06-04 00:07:00] [INFO ] Invariant cache hit.
[2025-06-04 00:07:00] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:03] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:03] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:04] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:04] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:04] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:04] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:04] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:04] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:04] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:04] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:05] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:05] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:05] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:05] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:05] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:06] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:06] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:06] [INFO ] Deduced a trap composed of 26 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 00:07:06] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:06] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:07] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:07] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:07] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:07] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:07] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:07] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:07] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:08] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:08] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:08] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:08] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:08] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:08] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:09] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:09] [INFO ] Deduced a trap composed of 26 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 00:07:09] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:09] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:09] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:10] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:10] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:10] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 162/255 variables, 93/145 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (OVERLAPS) 1/256 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 11 (OVERLAPS) 0/256 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 146 constraints, problems are : Problem set: 0 solved, 167 unsolved in 22127 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 41/52 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 162/255 variables, 93/145 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 167/312 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:27] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:28] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:29] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:29] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 4/316 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:34] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:34] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:34] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:35] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 4/320 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 167 unsolved
SMT process timed out in 52344ms, After SMT, problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 52366ms
Starting structural reductions in LTL mode, iteration 1 : 93/117 places, 168/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53264 ms. Remains : 93/117 places, 168/213 transitions.
Support contains 60 out of 93 places after structural reductions.
[2025-06-04 00:07:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-04 00:07:53] [INFO ] Flatten gal took : 72 ms
FORMULA HealthRecord-PT-01-CTLCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-04 00:07:53] [INFO ] Flatten gal took : 29 ms
[2025-06-04 00:07:53] [INFO ] Input system was already deterministic with 168 transitions.
Support contains 58 out of 93 places (down from 60) after GAL structural reductions.
RANDOM walk for 40000 steps (2107 resets) in 2542 ms. (15 steps per ms) remains 18/47 properties
BEST_FIRST walk for 4003 steps (32 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (32 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (31 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (32 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (26 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (27 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (29 resets) in 24 ms. (160 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4003 steps (29 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (31 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (33 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (34 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (32 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (34 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (31 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (33 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (32 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (32 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
[2025-06-04 00:07:54] [INFO ] Flow matrix only has 163 transitions (discarded 5 similar events)
[2025-06-04 00:07:54] [INFO ] Invariant cache hit.
[2025-06-04 00:07:54] [INFO ] State equation strengthened by 1 read => feed constraints.
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/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 42/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 26/93 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 162/255 variables, 93/104 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:55] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:55] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/256 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:55] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:56] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:56] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:56] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 9 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/256 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:57] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 5 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/256 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/256 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 0/256 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 112 constraints, problems are : Problem set: 0 solved, 17 unsolved in 3291 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 42/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp28 is UNSAT
At refinement iteration 4 (OVERLAPS) 26/93 variables, 6/13 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 5/18 constraints. Problems are: Problem set: 1 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:58] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:58] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:58] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:58] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:58] [INFO ] Deduced a trap composed of 32 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 00:07:58] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:59] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:59] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 8/26 constraints. Problems are: Problem set: 1 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:59] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:59] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:59] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 3/29 constraints. Problems are: Problem set: 1 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:07:59] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 1/30 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 162/255 variables, 93/123 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/255 variables, 16/139 constraints. Problems are: Problem set: 1 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:08:00] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/255 variables, 1/140 constraints. Problems are: Problem set: 1 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:08:00] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:08:00] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/255 variables, 2/142 constraints. Problems are: Problem set: 1 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:08:01] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 7 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/255 variables, 1/143 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/255 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 16 (OVERLAPS) 1/256 variables, 1/144 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/256 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 0/256 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 144 constraints, problems are : Problem set: 1 solved, 16 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/17 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8317ms problems are : Problem set: 1 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 168/168 transitions.
Graph (trivial) has 87 edges and 93 vertex of which 12 / 93 are part of one of the 6 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (complete) has 317 edges and 87 vertex of which 82 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 82 transition count 149
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 81 transition count 146
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 10 place count 79 transition count 145
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 10 place count 79 transition count 141
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 21 place count 72 transition count 141
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 42 place count 51 transition count 99
Iterating global reduction 3 with 21 rules applied. Total rules applied 63 place count 51 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 51 transition count 98
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 67 place count 48 transition count 92
Iterating global reduction 4 with 3 rules applied. Total rules applied 70 place count 48 transition count 92
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 76 place count 45 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 77 place count 45 transition count 106
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 93 place count 45 transition count 106
Applied a total of 93 rules in 78 ms. Remains 45 /93 variables (removed 48) and now considering 106/168 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 45/93 places, 106/168 transitions.
RANDOM walk for 40000 steps (7725 resets) in 1177 ms. (33 steps per ms) remains 3/16 properties
BEST_FIRST walk for 40002 steps (2308 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (2458 resets) in 135 ms. (294 steps per ms) remains 1/3 properties
[2025-06-04 00:08:03] [INFO ] Flow matrix only has 105 transitions (discarded 1 similar events)
// Phase 1: matrix 105 rows 45 cols
[2025-06-04 00:08:03] [INFO ] Computed 3 invariants in 3 ms
[2025-06-04 00:08:03] [INFO ] State equation strengthened by 12 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/45 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 105/150 variables, 45/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/150 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 60 constraints, problems are : Problem set: 0 solved, 1 unsolved in 97 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 45/45 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/45 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 105/150 variables, 45/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/150 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 61 constraints, problems are : Problem set: 0 solved, 1 unsolved in 132 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 45/45 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 239ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 806 steps, including 114 resets, run visited all 1 properties in 5 ms. (steps per millisecond=161 )
Parikh walk visited 1 properties in 12 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2025-06-04 00:08:03] [INFO ] Flatten gal took : 20 ms
[2025-06-04 00:08:03] [INFO ] Flatten gal took : 20 ms
[2025-06-04 00:08:03] [INFO ] Input system was already deterministic with 168 transitions.
Computed a total of 7 stabilizing places and 12 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 168/168 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 65 transition count 115
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 65 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 65 transition count 114
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 63 transition count 110
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 63 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 63 transition count 109
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 62 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 62 transition count 106
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 61 transition count 104
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 61 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 61 transition count 103
Applied a total of 67 rules in 17 ms. Remains 61 /93 variables (removed 32) and now considering 103/168 (removed 65) transitions.
[2025-06-04 00:08:04] [INFO ] Flow matrix only has 101 transitions (discarded 2 similar events)
// Phase 1: matrix 101 rows 61 cols
[2025-06-04 00:08:04] [INFO ] Computed 8 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:08:04] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-04 00:08:04] [INFO ] Flow matrix only has 101 transitions (discarded 2 similar events)
[2025-06-04 00:08:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:08:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:08:04] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2025-06-04 00:08:04] [INFO ] Flow matrix only has 101 transitions (discarded 2 similar events)
[2025-06-04 00:08:04] [INFO ] Invariant cache hit.
[2025-06-04 00:08:04] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:08:05] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:08:05] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:08:05] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:08:05] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 100/161 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:08:06] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:08:07] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 1/162 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/162 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 76 constraints, problems are : Problem set: 0 solved, 102 unsolved in 7265 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:08:12] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:08:12] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:08:13] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:08:13] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 100/161 variables, 61/79 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 102/181 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 1/162 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 0/162 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 182 constraints, problems are : Problem set: 0 solved, 102 unsolved in 13563 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20867ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 20869ms
Starting structural reductions in LTL mode, iteration 1 : 61/93 places, 103/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21087 ms. Remains : 61/93 places, 103/168 transitions.
[2025-06-04 00:08:25] [INFO ] Flatten gal took : 14 ms
[2025-06-04 00:08:25] [INFO ] Flatten gal took : 9 ms
[2025-06-04 00:08:25] [INFO ] Input system was already deterministic with 103 transitions.
[2025-06-04 00:08:25] [INFO ] Flatten gal took : 8 ms
[2025-06-04 00:08:25] [INFO ] Flatten gal took : 8 ms
[2025-06-04 00:08:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality15512704097317836631.gal : 4 ms
[2025-06-04 00:08:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality14999663121658497296.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15512704097317836631.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14999663121658497296.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,100856,0.069142,4880,2,805,5,4467,6,0,343,4447,0


Converting to forward existential form...Done !
original formula: A(E(((p61==0)||(p58==1)) U A(EX(((p92==0)||(p108==1))) U (EG((p70==1)) * ((p77==0)||(p42==0))))) U AF(EX((AG((p75==0)) + ((AF(((p109==0)|...207
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(EX((!(E(TRUE U !((p75==0)))) + ((!(EG(!(((p109==0)||(p71==1))))) * (p74==1)) * ((p112==0...637
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t10, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t...408
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,1.99478,61964,1,0,486,392930,258,296,2429,284356,561
FORMULA HealthRecord-PT-01-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 168/168 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 60 transition count 106
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 60 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 60 transition count 105
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 72 place count 55 transition count 95
Iterating global reduction 1 with 5 rules applied. Total rules applied 77 place count 55 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 79 place count 55 transition count 93
Applied a total of 79 rules in 7 ms. Remains 55 /93 variables (removed 38) and now considering 93/168 (removed 75) transitions.
[2025-06-04 00:08:27] [INFO ] Flow matrix only has 92 transitions (discarded 1 similar events)
// Phase 1: matrix 92 rows 55 cols
[2025-06-04 00:08:27] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:08:27] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-04 00:08:27] [INFO ] Flow matrix only has 92 transitions (discarded 1 similar events)
[2025-06-04 00:08:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:08:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:08:27] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2025-06-04 00:08:27] [INFO ] Flow matrix only has 92 transitions (discarded 1 similar events)
[2025-06-04 00:08:27] [INFO ] Invariant cache hit.
[2025-06-04 00:08:27] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:08:28] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:08:28] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:08:28] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:08:28] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 91/146 variables, 55/66 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 1/147 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 0/147 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 67 constraints, problems are : Problem set: 0 solved, 92 unsolved in 5284 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:08:33] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:08:33] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:08:33] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 91/146 variables, 55/69 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 92/161 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 1/147 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 162 constraints, problems are : Problem set: 0 solved, 92 unsolved in 11484 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16789ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 16790ms
Starting structural reductions in LTL mode, iteration 1 : 55/93 places, 93/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16941 ms. Remains : 55/93 places, 93/168 transitions.
[2025-06-04 00:08:44] [INFO ] Flatten gal took : 5 ms
[2025-06-04 00:08:44] [INFO ] Flatten gal took : 6 ms
[2025-06-04 00:08:44] [INFO ] Input system was already deterministic with 93 transitions.
[2025-06-04 00:08:44] [INFO ] Flatten gal took : 7 ms
[2025-06-04 00:08:44] [INFO ] Flatten gal took : 6 ms
[2025-06-04 00:08:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality15741794209923415634.gal : 2 ms
[2025-06-04 00:08:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality305707696466398943.ctl : 0 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15741794209923415634.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality305707696466398943.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,67806,0.040908,4796,2,688,5,3660,6,0,311,3577,0


Converting to forward existential form...Done !
original formula: AX(E(((p91==1) + (!(((p88==1)||(p97==0))) * A((p113==1) U (p81==1)))) U ((EG((p82==0)) * EX(((p17==1)||(p11==1)))) * ((p5==1)||(p98==0)))...157
=> equivalent forward existential formula: [(EY(Init) * !(E(((p91==1) + (!(((p88==1)||(p97==0))) * !((E(!((p81==1)) U (!((p113==1)) * !((p81==1)))) + EG(!(...249
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...352
(forward)formula 0,0,1.17833,37292,1,0,420,215918,224,223,2065,183626,502
FORMULA HealthRecord-PT-01-CTLCardinality-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 93/93 places, 168/168 transitions.
Graph (trivial) has 75 edges and 93 vertex of which 8 / 93 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 35 place count 55 transition count 100
Iterating global reduction 0 with 34 rules applied. Total rules applied 69 place count 55 transition count 100
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 77 place count 47 transition count 84
Iterating global reduction 0 with 8 rules applied. Total rules applied 85 place count 47 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 88 place count 47 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 46 transition count 78
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 46 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 45 transition count 76
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 45 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 93 place count 45 transition count 75
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 45 transition count 75
Applied a total of 94 rules in 24 ms. Remains 45 /93 variables (removed 48) and now considering 75/168 (removed 93) transitions.
[2025-06-04 00:08:45] [INFO ] Flow matrix only has 70 transitions (discarded 5 similar events)
// Phase 1: matrix 70 rows 45 cols
[2025-06-04 00:08:45] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:08:45] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-04 00:08:45] [INFO ] Flow matrix only has 70 transitions (discarded 5 similar events)
[2025-06-04 00:08:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:08:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:08:45] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:08:45] [INFO ] Redundant transitions in 1 ms returned []
Running 74 sub problems to find dead transitions.
[2025-06-04 00:08:45] [INFO ] Flow matrix only has 70 transitions (discarded 5 similar events)
[2025-06-04 00:08:45] [INFO ] Invariant cache hit.
[2025-06-04 00:08:45] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:08:46] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:08:46] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:08:46] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 69/114 variables, 45/55 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 1/115 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/115 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 56 constraints, problems are : Problem set: 0 solved, 74 unsolved in 4229 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:08:50] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 69/114 variables, 45/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 74/130 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 1/115 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/115 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 131 constraints, problems are : Problem set: 0 solved, 74 unsolved in 6947 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11188ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 11189ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/93 places, 75/168 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11328 ms. Remains : 45/93 places, 75/168 transitions.
[2025-06-04 00:08:56] [INFO ] Flatten gal took : 7 ms
[2025-06-04 00:08:56] [INFO ] Flatten gal took : 7 ms
[2025-06-04 00:08:56] [INFO ] Input system was already deterministic with 75 transitions.
[2025-06-04 00:08:56] [INFO ] Flatten gal took : 9 ms
[2025-06-04 00:08:56] [INFO ] Flatten gal took : 6 ms
[2025-06-04 00:08:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality10857137140727639939.gal : 2 ms
[2025-06-04 00:08:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality10423054035545512622.ctl : 0 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10857137140727639939.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10423054035545512622.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,15129,0.03521,4516,2,550,5,2373,6,0,249,2194,0


Converting to forward existential form...Done !
original formula: !(E(((p69==0) * (!(A((((p97==0)||(p116==1))&&(p32==0)) U !(((p44==0)||(p15==1))))) + (p18!=1))) U E(AG((p106==1)) U EF(!(((p89==0)||(p115...165
=> equivalent forward existential formula: [(FwdU(FwdU(FwdU(Init,((p69==0) * (!(!((E(!(!(((p44==0)||(p15==1)))) U (!((((p97==0)||(p116==1))&&(p32==0))) * !...302
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...292
(forward)formula 0,0,0.750014,25048,1,0,366,119014,190,196,1839,124339,433
FORMULA HealthRecord-PT-01-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 168/168 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 58 transition count 102
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 58 transition count 102
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 51 transition count 88
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 51 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 87 place count 51 transition count 85
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 90 place count 48 transition count 76
Iterating global reduction 1 with 3 rules applied. Total rules applied 93 place count 48 transition count 76
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 96 place count 45 transition count 70
Iterating global reduction 1 with 3 rules applied. Total rules applied 99 place count 45 transition count 70
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 102 place count 45 transition count 67
Applied a total of 102 rules in 10 ms. Remains 45 /93 variables (removed 48) and now considering 67/168 (removed 101) transitions.
[2025-06-04 00:08:57] [INFO ] Flow matrix only has 66 transitions (discarded 1 similar events)
// Phase 1: matrix 66 rows 45 cols
[2025-06-04 00:08:57] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:08:57] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-04 00:08:57] [INFO ] Flow matrix only has 66 transitions (discarded 1 similar events)
[2025-06-04 00:08:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:08:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:08:57] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2025-06-04 00:08:57] [INFO ] Flow matrix only has 66 transitions (discarded 1 similar events)
[2025-06-04 00:08:57] [INFO ] Invariant cache hit.
[2025-06-04 00:08:57] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:08:58] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:08:58] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:08:58] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:08:58] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 65/110 variables, 45/56 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:08:59] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 1/111 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 0/111 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 58 constraints, problems are : Problem set: 0 solved, 66 unsolved in 4135 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:02] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 65/110 variables, 45/58 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 66/124 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 1/111 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/111 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 125 constraints, problems are : Problem set: 0 solved, 66 unsolved in 6263 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10408ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 10409ms
Starting structural reductions in LTL mode, iteration 1 : 45/93 places, 67/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10521 ms. Remains : 45/93 places, 67/168 transitions.
[2025-06-04 00:09:08] [INFO ] Flatten gal took : 5 ms
[2025-06-04 00:09:08] [INFO ] Flatten gal took : 5 ms
[2025-06-04 00:09:08] [INFO ] Input system was already deterministic with 67 transitions.
[2025-06-04 00:09:08] [INFO ] Flatten gal took : 5 ms
[2025-06-04 00:09:08] [INFO ] Flatten gal took : 5 ms
[2025-06-04 00:09:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality5793612801261060665.gal : 1 ms
[2025-06-04 00:09:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality17819429717105894144.ctl : 0 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5793612801261060665.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17819429717105894144.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,49338,0.030146,4532,2,518,5,2585,6,0,245,2550,0


Converting to forward existential form...Done !
original formula: (EG(AG(((p15==0)||(p61==1)))) + EX((AX(EG(EX(((p44==0)||(p41==1))))) * AX(FALSE))))
=> equivalent forward existential formula: ([FwdG(Init,!(E(TRUE U !(((p15==0)||(p61==1))))))] != FALSE + [((EY(Init) * !(EX(!(EG(EX(((p44==0)||(p41==1)))))...188
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t16, t18, t20, t21, t22, t24, t25, t...287
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.238829,10420,1,0,186,35232,167,93,1699,31742,198
FORMULA HealthRecord-PT-01-CTLCardinality-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 168/168 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 58 transition count 102
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 58 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 71 place count 58 transition count 101
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 77 place count 52 transition count 89
Iterating global reduction 1 with 6 rules applied. Total rules applied 83 place count 52 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 85 place count 52 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 51 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 51 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 50 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 50 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 50 transition count 81
Applied a total of 90 rules in 9 ms. Remains 50 /93 variables (removed 43) and now considering 81/168 (removed 87) transitions.
[2025-06-04 00:09:08] [INFO ] Flow matrix only has 80 transitions (discarded 1 similar events)
// Phase 1: matrix 80 rows 50 cols
[2025-06-04 00:09:08] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:09:08] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-04 00:09:08] [INFO ] Flow matrix only has 80 transitions (discarded 1 similar events)
[2025-06-04 00:09:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:09:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:09:08] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2025-06-04 00:09:08] [INFO ] Flow matrix only has 80 transitions (discarded 1 similar events)
[2025-06-04 00:09:08] [INFO ] Invariant cache hit.
[2025-06-04 00:09:08] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:09] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:09] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:09] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 79/129 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 1/130 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 61 constraints, problems are : Problem set: 0 solved, 80 unsolved in 4532 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:13] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:13] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:13] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:13] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:13] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 79/129 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 80/145 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 1/130 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 146 constraints, problems are : Problem set: 0 solved, 80 unsolved in 8058 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12605ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 12605ms
Starting structural reductions in LTL mode, iteration 1 : 50/93 places, 81/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12750 ms. Remains : 50/93 places, 81/168 transitions.
[2025-06-04 00:09:21] [INFO ] Flatten gal took : 6 ms
[2025-06-04 00:09:21] [INFO ] Flatten gal took : 6 ms
[2025-06-04 00:09:21] [INFO ] Input system was already deterministic with 81 transitions.
[2025-06-04 00:09:21] [INFO ] Flatten gal took : 6 ms
[2025-06-04 00:09:21] [INFO ] Flatten gal took : 6 ms
[2025-06-04 00:09:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality2285914966496447745.gal : 2 ms
[2025-06-04 00:09:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality6583493318510207937.ctl : 1 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2285914966496447745.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6583493318510207937.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,57114,0.031809,4424,2,443,5,2198,6,0,279,1995,0


Converting to forward existential form...Done !
original formula: E((p77==0) U ((p93==1) + (AX((AF(((p41==0)||(p78==1))) * (p107==1))) * (EG(AX((p100==0))) + EF(EX((p88==1)))))))
=> equivalent forward existential formula: ([(FwdU(Init,(p77==0)) * (p93==1))] != FALSE + ([FwdG((FwdU(Init,(p77==0)) * !(EX(!((!(EG(!(((p41==0)||(p78==1))...328
Hit Full ! (commute/partial/dont) 78/0/3
(forward)formula 0,1,0.043965,4680,1,0,8,2199,15,1,509,1995,4
FORMULA HealthRecord-PT-01-CTLCardinality-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 93/93 places, 168/168 transitions.
Graph (trivial) has 120 edges and 93 vertex of which 12 / 93 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 35 place count 53 transition count 98
Iterating global reduction 0 with 34 rules applied. Total rules applied 69 place count 53 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 70 place count 53 transition count 97
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 77 place count 46 transition count 83
Iterating global reduction 1 with 7 rules applied. Total rules applied 84 place count 46 transition count 83
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 87 place count 46 transition count 80
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 90 place count 43 transition count 71
Iterating global reduction 2 with 3 rules applied. Total rules applied 93 place count 43 transition count 71
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 96 place count 40 transition count 65
Iterating global reduction 2 with 3 rules applied. Total rules applied 99 place count 40 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 40 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 104 place count 40 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 108 place count 38 transition count 58
Applied a total of 108 rules in 29 ms. Remains 38 /93 variables (removed 55) and now considering 58/168 (removed 110) transitions.
[2025-06-04 00:09:21] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
// Phase 1: matrix 52 rows 38 cols
[2025-06-04 00:09:21] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:09:21] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-04 00:09:21] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2025-06-04 00:09:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:09:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:09:21] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:09:21] [INFO ] Redundant transitions in 1 ms returned []
Running 57 sub problems to find dead transitions.
[2025-06-04 00:09:21] [INFO ] Flow matrix only has 52 transitions (discarded 6 similar events)
[2025-06-04 00:09:21] [INFO ] Invariant cache hit.
[2025-06-04 00:09:21] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:21] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:21] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:21] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:21] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 51/89 variables, 38/49 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 1/90 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 0/90 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 50 constraints, problems are : Problem set: 0 solved, 57 unsolved in 2880 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 38/38 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:24] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 51/89 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 57/107 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 1/90 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/90 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 108 constraints, problems are : Problem set: 0 solved, 57 unsolved in 4362 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 38/38 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7251ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 7252ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/93 places, 58/168 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7400 ms. Remains : 38/93 places, 58/168 transitions.
[2025-06-04 00:09:28] [INFO ] Flatten gal took : 8 ms
[2025-06-04 00:09:28] [INFO ] Flatten gal took : 5 ms
[2025-06-04 00:09:28] [INFO ] Input system was already deterministic with 58 transitions.
[2025-06-04 00:09:28] [INFO ] Flatten gal took : 5 ms
[2025-06-04 00:09:28] [INFO ] Flatten gal took : 5 ms
[2025-06-04 00:09:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality10160995733509882089.gal : 2 ms
[2025-06-04 00:09:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality14471059849008951393.ctl : 1 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10160995733509882089.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14471059849008951393.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,16013,0.033671,4348,2,417,5,2120,6,0,203,2286,0


Converting to forward existential form...Done !
original formula: EF(AG((AG((((p64==0)||(p46==1))&&(p12!=1))) * (p22==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(E(TRUE U !((((p64==0)||(p46==1))&&(p12!=1))))) * (p22==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t2...296
(forward)formula 0,0,0.19938,7932,1,0,150,22632,132,64,1322,19158,150
FORMULA HealthRecord-PT-01-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 168/168 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 55 transition count 96
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 55 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 77 place count 55 transition count 95
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 85 place count 47 transition count 79
Iterating global reduction 1 with 8 rules applied. Total rules applied 93 place count 47 transition count 79
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 96 place count 47 transition count 76
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 99 place count 44 transition count 67
Iterating global reduction 2 with 3 rules applied. Total rules applied 102 place count 44 transition count 67
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 105 place count 41 transition count 61
Iterating global reduction 2 with 3 rules applied. Total rules applied 108 place count 41 transition count 61
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 111 place count 41 transition count 58
Applied a total of 111 rules in 12 ms. Remains 41 /93 variables (removed 52) and now considering 58/168 (removed 110) transitions.
[2025-06-04 00:09:28] [INFO ] Flow matrix only has 57 transitions (discarded 1 similar events)
// Phase 1: matrix 57 rows 41 cols
[2025-06-04 00:09:28] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:09:28] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-04 00:09:28] [INFO ] Flow matrix only has 57 transitions (discarded 1 similar events)
[2025-06-04 00:09:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:09:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:09:29] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2025-06-04 00:09:29] [INFO ] Flow matrix only has 57 transitions (discarded 1 similar events)
[2025-06-04 00:09:29] [INFO ] Invariant cache hit.
[2025-06-04 00:09:29] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:29] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:29] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 56/97 variables, 41/50 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 1/98 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 0/98 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 51 constraints, problems are : Problem set: 0 solved, 57 unsolved in 2636 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:31] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:32] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 56/97 variables, 41/52 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 57/109 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 1/98 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/98 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 110 constraints, problems are : Problem set: 0 solved, 57 unsolved in 4082 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6730ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 6731ms
Starting structural reductions in LTL mode, iteration 1 : 41/93 places, 58/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6897 ms. Remains : 41/93 places, 58/168 transitions.
[2025-06-04 00:09:35] [INFO ] Flatten gal took : 4 ms
[2025-06-04 00:09:35] [INFO ] Flatten gal took : 4 ms
[2025-06-04 00:09:35] [INFO ] Input system was already deterministic with 58 transitions.
[2025-06-04 00:09:35] [INFO ] Flatten gal took : 4 ms
[2025-06-04 00:09:35] [INFO ] Flatten gal took : 4 ms
[2025-06-04 00:09:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality10807230057602745543.gal : 1 ms
[2025-06-04 00:09:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality9732705234599286414.ctl : 0 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10807230057602745543.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9732705234599286414.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,29898,0.022407,4116,2,354,5,1444,6,0,220,1190,0


Converting to forward existential form...Done !
original formula: AX(EX(TRUE))
=> equivalent forward existential formula: [(EY(Init) * !(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t15, t17, t19, Intersection with reachab...227
(forward)formula 0,1,0.088099,5652,1,0,101,8059,129,53,1406,7015,121
FORMULA HealthRecord-PT-01-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 168/168 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 59 transition count 104
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 59 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 69 place count 59 transition count 103
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 76 place count 52 transition count 89
Iterating global reduction 1 with 7 rules applied. Total rules applied 83 place count 52 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 86 place count 52 transition count 86
Applied a total of 86 rules in 6 ms. Remains 52 /93 variables (removed 41) and now considering 86/168 (removed 82) transitions.
[2025-06-04 00:09:35] [INFO ] Flow matrix only has 85 transitions (discarded 1 similar events)
// Phase 1: matrix 85 rows 52 cols
[2025-06-04 00:09:35] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:09:35] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-04 00:09:35] [INFO ] Flow matrix only has 85 transitions (discarded 1 similar events)
[2025-06-04 00:09:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:09:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:09:36] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2025-06-04 00:09:36] [INFO ] Flow matrix only has 85 transitions (discarded 1 similar events)
[2025-06-04 00:09:36] [INFO ] Invariant cache hit.
[2025-06-04 00:09:36] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:36] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:36] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:36] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:37] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:37] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:37] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 84/136 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:38] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 1/137 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 0/137 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 67 constraints, problems are : Problem set: 0 solved, 85 unsolved in 6108 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:42] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:42] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 84/136 variables, 52/68 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 85/153 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 1/137 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/137 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 154 constraints, problems are : Problem set: 0 solved, 85 unsolved in 9221 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15347ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 15347ms
Starting structural reductions in LTL mode, iteration 1 : 52/93 places, 86/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15523 ms. Remains : 52/93 places, 86/168 transitions.
[2025-06-04 00:09:51] [INFO ] Flatten gal took : 4 ms
[2025-06-04 00:09:51] [INFO ] Flatten gal took : 5 ms
[2025-06-04 00:09:51] [INFO ] Input system was already deterministic with 86 transitions.
[2025-06-04 00:09:51] [INFO ] Flatten gal took : 5 ms
[2025-06-04 00:09:51] [INFO ] Flatten gal took : 4 ms
[2025-06-04 00:09:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality5830367711678638993.gal : 1 ms
[2025-06-04 00:09:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality3400956721661574002.ctl : 1 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5830367711678638993.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3400956721661574002.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,65862,0.037195,4680,2,698,5,3620,6,0,292,3315,0


Converting to forward existential form...Done !
original formula: EX((!(A(EX((p56==0)) U AG(((p83==0)||(p85==1))))) * !(A(EG(((p6==0)||(p12==1))) U EX((p97==1))))))
=> equivalent forward existential formula: ([((FwdU((EY(Init) * !(!((E(!(!(E(TRUE U !(((p83==0)||(p85==1)))))) U (!(EX((p56==0))) * !(!(E(TRUE U !(((p83==0...507
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...352
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,1.14218,37052,1,0,404,193441,211,230,2053,195988,487
FORMULA HealthRecord-PT-01-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 93/93 places, 168/168 transitions.
Graph (trivial) has 126 edges and 93 vertex of which 14 / 93 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 37 place count 49 transition count 92
Iterating global reduction 0 with 36 rules applied. Total rules applied 73 place count 49 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 74 place count 49 transition count 91
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 81 place count 42 transition count 77
Iterating global reduction 1 with 7 rules applied. Total rules applied 88 place count 42 transition count 77
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 91 place count 42 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 40 transition count 68
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 40 transition count 68
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 97 place count 38 transition count 64
Iterating global reduction 2 with 2 rules applied. Total rules applied 99 place count 38 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 38 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 104 place count 38 transition count 59
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 108 place count 36 transition count 57
Applied a total of 108 rules in 19 ms. Remains 36 /93 variables (removed 57) and now considering 57/168 (removed 111) transitions.
[2025-06-04 00:09:52] [INFO ] Flow matrix only has 50 transitions (discarded 7 similar events)
// Phase 1: matrix 50 rows 36 cols
[2025-06-04 00:09:52] [INFO ] Computed 7 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:09:52] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-04 00:09:52] [INFO ] Flow matrix only has 50 transitions (discarded 7 similar events)
[2025-06-04 00:09:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:09:52] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:09:52] [INFO ] Redundant transitions in 1 ms returned []
Running 43 sub problems to find dead transitions.
[2025-06-04 00:09:52] [INFO ] Flow matrix only has 50 transitions (discarded 7 similar events)
[2025-06-04 00:09:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 7/36 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:52] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:53] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:53] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 49/85 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/85 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/86 variables, and 46 constraints, problems are : Problem set: 0 solved, 43 unsolved in 1519 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 7/36 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:54] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (OVERLAPS) 49/85 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 43/90 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (OVERLAPS) 0/85 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/86 variables, and 90 constraints, problems are : Problem set: 0 solved, 43 unsolved in 2082 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3609ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 3610ms
Starting structural reductions in SI_CTL mode, iteration 1 : 36/93 places, 57/168 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3740 ms. Remains : 36/93 places, 57/168 transitions.
[2025-06-04 00:09:56] [INFO ] Flatten gal took : 5 ms
[2025-06-04 00:09:56] [INFO ] Flatten gal took : 4 ms
[2025-06-04 00:09:56] [INFO ] Input system was already deterministic with 57 transitions.
[2025-06-04 00:09:56] [INFO ] Flatten gal took : 13 ms
[2025-06-04 00:09:56] [INFO ] Flatten gal took : 17 ms
[2025-06-04 00:09:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5113114256607885433.gal : 1 ms
[2025-06-04 00:09:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12453558920800838769.prop : 1 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/ReachabilityCardinality5113114256607885433.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12453558920800838769.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 40000 steps (4019 resets) in 329 ms. (121 steps per ms) remains 1/1 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 ...329
Loading property file /tmp/ReachabilityCardinality12453558920800838769.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :16 after 96
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :96 after 240
BEST_FIRST walk for 40002 steps (687 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :240 after 2096
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2096 after 3024
Reachability property HealthRecord-PT-01-CTLCardinality-2025-11 is true.
FORMULA HealthRecord-PT-01-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,5328,0.043509,4024,2,238,11,1101,6,0,189,911,0
Total reachable state count : 5328

Verifying 1 reachability properties.
Reachability property HealthRecord-PT-01-CTLCardinality-2025-11 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
HealthRecord-PT-01-CTLCardinality-2025-11,16,0.044149,4280,2,74,11,1101,7,0,192,911,0
Finished probabilistic random walk after 688 steps, run visited all 1 properties in 21 ms. (steps per millisecond=32 )
Probabilistic random walk after 688 steps, saw 261 distinct states, run finished after 28 ms. (steps per millisecond=24 ) properties seen :1
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 168/168 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 56 transition count 98
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 56 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 75 place count 56 transition count 97
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 83 place count 48 transition count 81
Iterating global reduction 1 with 8 rules applied. Total rules applied 91 place count 48 transition count 81
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 94 place count 48 transition count 78
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 97 place count 45 transition count 69
Iterating global reduction 2 with 3 rules applied. Total rules applied 100 place count 45 transition count 69
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 103 place count 42 transition count 63
Iterating global reduction 2 with 3 rules applied. Total rules applied 106 place count 42 transition count 63
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 109 place count 42 transition count 60
Applied a total of 109 rules in 9 ms. Remains 42 /93 variables (removed 51) and now considering 60/168 (removed 108) transitions.
[2025-06-04 00:09:56] [INFO ] Flow matrix only has 59 transitions (discarded 1 similar events)
// Phase 1: matrix 59 rows 42 cols
[2025-06-04 00:09:56] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:09:56] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-04 00:09:56] [INFO ] Flow matrix only has 59 transitions (discarded 1 similar events)
[2025-06-04 00:09:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:09:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:09:56] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2025-06-04 00:09:56] [INFO ] Flow matrix only has 59 transitions (discarded 1 similar events)
[2025-06-04 00:09:56] [INFO ] Invariant cache hit.
[2025-06-04 00:09:56] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:57] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:57] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:09:57] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 58/100 variables, 42/52 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 1/101 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 0/101 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 53 constraints, problems are : Problem set: 0 solved, 59 unsolved in 3042 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:00] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:00] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:00] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 58/100 variables, 42/55 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 59/114 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 1/101 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/101 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 115 constraints, problems are : Problem set: 0 solved, 59 unsolved in 5599 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8653ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 8654ms
Starting structural reductions in LTL mode, iteration 1 : 42/93 places, 60/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8827 ms. Remains : 42/93 places, 60/168 transitions.
[2025-06-04 00:10:05] [INFO ] Flatten gal took : 4 ms
[2025-06-04 00:10:05] [INFO ] Flatten gal took : 5 ms
[2025-06-04 00:10:05] [INFO ] Input system was already deterministic with 60 transitions.
[2025-06-04 00:10:05] [INFO ] Flatten gal took : 5 ms
[2025-06-04 00:10:05] [INFO ] Flatten gal took : 4 ms
[2025-06-04 00:10:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality11130572920908920873.gal : 1 ms
[2025-06-04 00:10:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality15377813444094802596.ctl : 0 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11130572920908920873.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15377813444094802596.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,35730,0.032704,4396,2,450,5,2453,6,0,226,2375,0


Converting to forward existential form...Done !
original formula: EF((AX(FALSE) + EF(EX(((p14==1)||(p0==1))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(!(FALSE))))] != FALSE + [(EY(FwdU(FwdU(Init,TRUE),TRUE)) * ((p14==1)||(p0==1)))] != FA...159
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t15, t17, t19, t31, t32, t33, t34, Inter...247
(forward)formula 0,1,0.112044,6316,1,0,109,10955,133,54,1412,10077,124
FORMULA HealthRecord-PT-01-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 168/168 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 62 transition count 109
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 62 transition count 109
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 59 transition count 103
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 59 transition count 103
Applied a total of 68 rules in 4 ms. Remains 59 /93 variables (removed 34) and now considering 103/168 (removed 65) transitions.
[2025-06-04 00:10:05] [INFO ] Flow matrix only has 101 transitions (discarded 2 similar events)
// Phase 1: matrix 101 rows 59 cols
[2025-06-04 00:10:05] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:10:05] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-04 00:10:05] [INFO ] Flow matrix only has 101 transitions (discarded 2 similar events)
[2025-06-04 00:10:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:10:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:10:05] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2025-06-04 00:10:05] [INFO ] Flow matrix only has 101 transitions (discarded 2 similar events)
[2025-06-04 00:10:05] [INFO ] Invariant cache hit.
[2025-06-04 00:10:05] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:06] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:06] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:07] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:07] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:08] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 100/159 variables, 59/72 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:09] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 1/160 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/160 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 13 (OVERLAPS) 0/160 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 74 constraints, problems are : Problem set: 0 solved, 102 unsolved in 8693 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 100/159 variables, 59/73 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 102/175 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 1/160 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/160 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 176 constraints, problems are : Problem set: 0 solved, 102 unsolved in 10336 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19050ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 19051ms
Starting structural reductions in LTL mode, iteration 1 : 59/93 places, 103/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19239 ms. Remains : 59/93 places, 103/168 transitions.
[2025-06-04 00:10:24] [INFO ] Flatten gal took : 5 ms
[2025-06-04 00:10:24] [INFO ] Flatten gal took : 5 ms
[2025-06-04 00:10:24] [INFO ] Input system was already deterministic with 103 transitions.
[2025-06-04 00:10:24] [INFO ] Flatten gal took : 5 ms
[2025-06-04 00:10:24] [INFO ] Flatten gal took : 5 ms
[2025-06-04 00:10:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality18105014979174101093.gal : 1 ms
[2025-06-04 00:10:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality4345001879843772148.ctl : 1 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18105014979174101093.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4345001879843772148.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,83844,0.041459,4980,2,868,5,4871,6,0,334,4202,0


Converting to forward existential form...Done !
original formula: E(((p0==0)||(p3==1)) U (!(AG((AX((p9==0)) * ((p78==1) + EX((p35==0)))))) * (EG(E(AF(((p2==0)||(p92==1))) U (((p83==0)||(p81==1))&&(p15==0...178
=> equivalent forward existential formula: ([FwdG((FwdU(Init,((p0==0)||(p3==1))) * !(!(E(TRUE U !((!(EX(!((p9==0)))) * ((p78==1) + EX((p35==0))))))))),E(!(...374
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...383
Hit Full ! (commute/partial/dont) 99/0/4
(forward)formula 0,1,0.423518,16696,1,0,252,69265,248,126,2426,58242,300
FORMULA HealthRecord-PT-01-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 93/93 places, 168/168 transitions.
Graph (trivial) has 123 edges and 93 vertex of which 14 / 93 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 35 place count 51 transition count 95
Iterating global reduction 0 with 34 rules applied. Total rules applied 69 place count 51 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 70 place count 51 transition count 94
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 77 place count 44 transition count 80
Iterating global reduction 1 with 7 rules applied. Total rules applied 84 place count 44 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 87 place count 44 transition count 77
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 90 place count 41 transition count 68
Iterating global reduction 2 with 3 rules applied. Total rules applied 93 place count 41 transition count 68
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 95 place count 39 transition count 64
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 39 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 99 place count 39 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 102 place count 39 transition count 59
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 37 transition count 57
Applied a total of 106 rules in 26 ms. Remains 37 /93 variables (removed 56) and now considering 57/168 (removed 111) transitions.
[2025-06-04 00:10:25] [INFO ] Flow matrix only has 49 transitions (discarded 8 similar events)
// Phase 1: matrix 49 rows 37 cols
[2025-06-04 00:10:25] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:10:25] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-04 00:10:25] [INFO ] Flow matrix only has 49 transitions (discarded 8 similar events)
[2025-06-04 00:10:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:10:25] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:10:25] [INFO ] Redundant transitions in 2 ms returned []
Running 43 sub problems to find dead transitions.
[2025-06-04 00:10:25] [INFO ] Flow matrix only has 49 transitions (discarded 8 similar events)
[2025-06-04 00:10:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 2/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:25] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:25] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:25] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:26] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:26] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:26] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 5/37 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (OVERLAPS) 48/85 variables, 37/51 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/85 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (OVERLAPS) 0/85 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/86 variables, and 51 constraints, problems are : Problem set: 0 solved, 43 unsolved in 2357 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 2/32 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (OVERLAPS) 5/37 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 48/85 variables, 37/51 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 43/94 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:28] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/85 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/85 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 12 (OVERLAPS) 0/85 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/86 variables, and 95 constraints, problems are : Problem set: 0 solved, 43 unsolved in 2807 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5174ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 5174ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/93 places, 57/168 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5366 ms. Remains : 37/93 places, 57/168 transitions.
[2025-06-04 00:10:30] [INFO ] Flatten gal took : 4 ms
[2025-06-04 00:10:30] [INFO ] Flatten gal took : 4 ms
[2025-06-04 00:10:30] [INFO ] Input system was already deterministic with 57 transitions.
[2025-06-04 00:10:30] [INFO ] Flatten gal took : 4 ms
[2025-06-04 00:10:30] [INFO ] Flatten gal took : 3 ms
[2025-06-04 00:10:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality17696989943242463181.gal : 1 ms
[2025-06-04 00:10:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality10146427869315681059.ctl : 1 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17696989943242463181.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10146427869315681059.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9652,0.02767,4204,2,307,5,1699,6,0,190,1570,0


Converting to forward existential form...Done !
original formula: E((p57!=1) U !(EF(((p64==0)||(p20==1)))))
=> equivalent forward existential formula: [(FwdU(Init,(p57!=1)) * !(E(TRUE U ((p64==0)||(p20==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...275
(forward)formula 0,0,0.103858,5740,1,0,123,9921,126,51,1252,7932,118
FORMULA HealthRecord-PT-01-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 93/93 places, 168/168 transitions.
Graph (trivial) has 127 edges and 93 vertex of which 14 / 93 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 37 place count 49 transition count 91
Iterating global reduction 0 with 36 rules applied. Total rules applied 73 place count 49 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 74 place count 49 transition count 90
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 82 place count 41 transition count 74
Iterating global reduction 1 with 8 rules applied. Total rules applied 90 place count 41 transition count 74
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 93 place count 41 transition count 71
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 96 place count 38 transition count 62
Iterating global reduction 2 with 3 rules applied. Total rules applied 99 place count 38 transition count 62
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 102 place count 35 transition count 56
Iterating global reduction 2 with 3 rules applied. Total rules applied 105 place count 35 transition count 56
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 108 place count 35 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 111 place count 35 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 115 place count 33 transition count 48
Applied a total of 115 rules in 20 ms. Remains 33 /93 variables (removed 60) and now considering 48/168 (removed 120) transitions.
[2025-06-04 00:10:30] [INFO ] Flow matrix only has 40 transitions (discarded 8 similar events)
// Phase 1: matrix 40 rows 33 cols
[2025-06-04 00:10:30] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:10:30] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-04 00:10:30] [INFO ] Flow matrix only has 40 transitions (discarded 8 similar events)
[2025-06-04 00:10:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:10:30] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:10:30] [INFO ] Redundant transitions in 0 ms returned []
Running 34 sub problems to find dead transitions.
[2025-06-04 00:10:30] [INFO ] Flow matrix only has 40 transitions (discarded 8 similar events)
[2025-06-04 00:10:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 2/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:31] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:31] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 5/33 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 39/72 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/73 variables, and 43 constraints, problems are : Problem set: 0 solved, 34 unsolved in 1309 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 2/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:32] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:10:32] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 5/33 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 39/72 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 34/79 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (OVERLAPS) 0/72 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/73 variables, and 79 constraints, problems are : Problem set: 0 solved, 34 unsolved in 1594 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2909ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 2909ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/93 places, 48/168 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3072 ms. Remains : 33/93 places, 48/168 transitions.
[2025-06-04 00:10:33] [INFO ] Flatten gal took : 3 ms
[2025-06-04 00:10:33] [INFO ] Flatten gal took : 2 ms
[2025-06-04 00:10:33] [INFO ] Input system was already deterministic with 48 transitions.
[2025-06-04 00:10:33] [INFO ] Flatten gal took : 2 ms
[2025-06-04 00:10:33] [INFO ] Flatten gal took : 2 ms
[2025-06-04 00:10:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality1824613851859316962.gal : 0 ms
[2025-06-04 00:10:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality4215175301626168682.ctl : 0 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1824613851859316962.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4215175301626168682.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5908,0.014093,4108,2,247,5,1106,6,0,166,990,0


Converting to forward existential form...Done !
original formula: AG(AF(EG((p74==0))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG((p74==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, Intersection with reachable at e...220
(forward)formula 0,0,0.165422,9868,1,0,173,36692,113,97,1083,35324,216
FORMULA HealthRecord-PT-01-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-04 00:10:34] [INFO ] Flatten gal took : 6 ms
[2025-06-04 00:10:34] [INFO ] Flatten gal took : 5 ms
Total runtime 214646 ms.

BK_STOP 1748995834070

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

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