About the Execution of ITS-Tools for HealthRecord-PT-07
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 350332.00 | 0.00 | 0.00 | FFTTTFTTTFTFTFTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r100-smll-174867008200585.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-07, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867008200585
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.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 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K 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 67K 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-07-CTLCardinality-2023-12
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2023-13
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2023-14
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2023-15
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2025-00
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2025-01
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2025-02
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2025-03
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2025-04
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2025-05
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2025-06
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2025-07
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2025-08
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2025-09
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2025-10
FORMULA_NAME HealthRecord-PT-07-CTLCardinality-2025-11
=== Now, execution of the tool begins
BK_START 1748999338082
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-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-04 01:09:00] [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 01:09:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 01:09:00] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2025-06-04 01:09:00] [INFO ] Transformed 155 places.
[2025-06-04 01:09:00] [INFO ] Transformed 320 transitions.
[2025-06-04 01:09:00] [INFO ] Found NUPN structural information;
[2025-06-04 01:09:00] [INFO ] Parsed PT model containing 155 places and 320 transitions and 839 arcs in 396 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 42 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
FORMULA HealthRecord-PT-07-CTLCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 91 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 295/295 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 125 transition count 240
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 125 transition count 240
Applied a total of 60 rules in 49 ms. Remains 125 /155 variables (removed 30) and now considering 240/295 (removed 55) transitions.
[2025-06-04 01:09:01] [INFO ] Flow matrix only has 233 transitions (discarded 7 similar events)
// Phase 1: matrix 233 rows 125 cols
[2025-06-04 01:09:01] [INFO ] Computed 13 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:09:01] [INFO ] Implicit Places using invariants in 475 ms returned []
[2025-06-04 01:09:01] [INFO ] Flow matrix only has 233 transitions (discarded 7 similar events)
[2025-06-04 01:09:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:09:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:09:02] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 970 ms to find 0 implicit places.
Running 239 sub problems to find dead transitions.
[2025-06-04 01:09:02] [INFO ] Flow matrix only has 233 transitions (discarded 7 similar events)
[2025-06-04 01:09:02] [INFO ] Invariant cache hit.
[2025-06-04 01:09:02] [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/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:06] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:06] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:07] [INFO ] Deduced a trap composed of 36 places in 147 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:07] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:07] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:07] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:08] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:08] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:08] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:08] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:08] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:08] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:08] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:08] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:09] [INFO ] Deduced a trap composed of 35 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 01:09:09] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:09] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:09] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:09] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:09] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:10] [INFO ] Deduced a trap composed of 34 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 01:09:10] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:11] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:11] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:11] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:11] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:11] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:11] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:11] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:12] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:12] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:12] [INFO ] Deduced a trap composed of 30 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 01:09:12] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:12] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:13] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:13] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:13] [INFO ] Deduced a trap composed of 24 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 01:09:13] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:14] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 19/52 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:14] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:15] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 21 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:16] [INFO ] Deduced a trap composed of 35 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 01:09:16] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:16] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:17] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:17] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:17] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:17] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:17] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:18] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:18] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:18] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:18] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:18] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:18] [INFO ] Deduced a trap composed of 34 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:19] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 15/69 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:21] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:22] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:22] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:22] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:22] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:22] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 19 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:24] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:24] [INFO ] Deduced a trap composed of 32 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 01:09:24] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:24] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:24] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 19 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:25] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:29] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:29] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 22 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/358 variables, and 83 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/125 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 70/70 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 70/83 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:34] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:34] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:36] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:38] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (OVERLAPS) 232/357 variables, 125/212 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 239/451 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:44] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:45] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:45] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:45] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:45] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:46] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:48] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:09:51] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 8/459 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 357/358 variables, and 459 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 125/125 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60364ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 60392ms
Starting structural reductions in LTL mode, iteration 1 : 125/155 places, 240/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61454 ms. Remains : 125/155 places, 240/295 transitions.
Support contains 91 out of 125 places after structural reductions.
[2025-06-04 01:10:02] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-04 01:10:02] [INFO ] Flatten gal took : 85 ms
FORMULA HealthRecord-PT-07-CTLCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-04 01:10:02] [INFO ] Flatten gal took : 42 ms
[2025-06-04 01:10:03] [INFO ] Input system was already deterministic with 240 transitions.
Support contains 81 out of 125 places (down from 91) after GAL structural reductions.
RANDOM walk for 40000 steps (2107 resets) in 2806 ms. (14 steps per ms) remains 20/63 properties
BEST_FIRST walk for 4004 steps (30 resets) in 44 ms. (88 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4003 steps (33 resets) in 44 ms. (88 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (30 resets) in 27 ms. (143 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (31 resets) in 42 ms. (93 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (31 resets) in 65 ms. (60 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4003 steps (31 resets) in 23 ms. (166 steps per ms) remains 16/18 properties
BEST_FIRST walk for 4004 steps (30 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (28 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (34 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (29 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (27 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (29 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (30 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (26 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (34 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (32 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
[2025-06-04 01:10:04] [INFO ] Flow matrix only has 233 transitions (discarded 7 similar events)
[2025-06-04 01:10:04] [INFO ] Invariant cache hit.
[2025-06-04 01:10:04] [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/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 52/78 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 47/125 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 232/357 variables, 125/138 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 1/358 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/358 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 139 constraints, problems are : Problem set: 0 solved, 16 unsolved in 893 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 125/125 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 52/78 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:05] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:05] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:05] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:05] [INFO ] Deduced a trap composed of 29 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 01:10:05] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:05] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:06] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 47/125 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:06] [INFO ] Deduced a trap composed of 23 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 01:10:06] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:06] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:06] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:06] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:06] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:06] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:06] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:06] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:07] [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 01:10:07] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:07] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:07] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:07] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 13 ms to minimize.
Problem AtomicPropp54 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:07] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:07] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 16/36 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:07] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:08] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:08] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:08] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:08] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:08] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 18 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 6/42 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:08] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 1/43 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 232/357 variables, 125/168 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 15/183 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:09] [INFO ] Deduced a trap composed of 30 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 01:10:09] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:09] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:09] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:10] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:10] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 12 ms to minimize.
SMT process timed out in 5977ms, After SMT, problems are : Problem set: 1 solved, 15 unsolved
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 24 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 240/240 transitions.
Graph (trivial) has 128 edges and 125 vertex of which 12 / 125 are part of one of the 6 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 498 edges and 119 vertex of which 115 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 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 115 transition count 219
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 114 transition count 215
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 13 place count 111 transition count 213
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 13 place count 111 transition count 211
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 18 place count 108 transition count 211
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 53 place count 73 transition count 141
Iterating global reduction 3 with 35 rules applied. Total rules applied 88 place count 73 transition count 141
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 92 place count 69 transition count 133
Iterating global reduction 3 with 4 rules applied. Total rules applied 96 place count 69 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 97 place count 69 transition count 132
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 105 place count 65 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 110 place count 65 transition count 153
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 110 place count 65 transition count 152
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 64 transition count 152
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 113 place count 64 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 114 place count 63 transition count 151
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 5 with 19 rules applied. Total rules applied 133 place count 63 transition count 151
Applied a total of 133 rules in 134 ms. Remains 63 /125 variables (removed 62) and now considering 151/240 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 63/125 places, 151/240 transitions.
RANDOM walk for 40000 steps (8 resets) in 1051 ms. (38 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (8 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (8 resets) in 39 ms. (100 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (8 resets) in 39 ms. (100 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (8 resets) in 42 ms. (93 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4000 steps (8 resets) in 61 ms. (64 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000 steps (8 resets) in 49 ms. (80 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4000 steps (8 resets) in 42 ms. (93 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4001 steps (8 resets) in 48 ms. (81 steps per ms) remains 12/14 properties
BEST_FIRST walk for 4000 steps (8 resets) in 49 ms. (80 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000 steps (8 resets) in 44 ms. (88 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000 steps (8 resets) in 44 ms. (88 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000 steps (8 resets) in 76 ms. (51 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000 steps (8 resets) in 50 ms. (78 steps per ms) remains 12/12 properties
// Phase 1: matrix 151 rows 63 cols
[2025-06-04 01:10:10] [INFO ] Computed 8 invariants in 4 ms
[2025-06-04 01:10:10] [INFO ] State equation strengthened by 18 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/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 4/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 38/63 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 151/214 variables, 63/71 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 18/89 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/214 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 89 constraints, problems are : Problem set: 0 solved, 12 unsolved in 509 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 63/63 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 4/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 38/63 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:11] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:11] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 151/214 variables, 63/73 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 18/91 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 12/103 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:12] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:12] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:12] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:12] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 4/107 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:12] [INFO ] Deduced a trap composed of 14 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 01:10:12] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:12] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:13] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 0/214 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 111 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2671 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 63/63 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3197ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 10 properties in 1708 ms.
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 151/151 transitions.
Graph (trivial) has 47 edges and 63 vertex of which 2 / 63 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 61 transition count 148
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 59 transition count 148
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 19 place count 45 transition count 120
Iterating global reduction 1 with 14 rules applied. Total rules applied 33 place count 45 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 45 transition count 119
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 42 transition count 110
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 42 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 43 place count 42 transition count 107
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 44 place count 41 transition count 103
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 41 transition count 103
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 46 place count 40 transition count 100
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 40 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 49 place count 40 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 51 place count 39 transition count 97
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
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 57 place count 36 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 59 place count 36 transition count 101
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 60 place count 35 transition count 96
Iterating global reduction 5 with 1 rules applied. Total rules applied 61 place count 35 transition count 96
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 62 place count 34 transition count 92
Iterating global reduction 5 with 1 rules applied. Total rules applied 63 place count 34 transition count 92
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 64 place count 33 transition count 89
Iterating global reduction 5 with 1 rules applied. Total rules applied 65 place count 33 transition count 89
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 69 place count 33 transition count 85
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 71 place count 33 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 73 place count 31 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 74 place count 31 transition count 82
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 86 place count 31 transition count 82
Applied a total of 86 rules in 38 ms. Remains 31 /63 variables (removed 32) and now considering 82/151 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 31/63 places, 82/151 transitions.
RANDOM walk for 40000 steps (12557 resets) in 490 ms. (81 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (2253 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2288 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 2559 steps, run visited all 2 properties in 21 ms. (steps per millisecond=121 )
Probabilistic random walk after 2559 steps, saw 809 distinct states, run finished after 26 ms. (steps per millisecond=98 ) properties seen :2
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2025-06-04 01:10:16] [INFO ] Flatten gal took : 17 ms
[2025-06-04 01:10:16] [INFO ] Flatten gal took : 17 ms
[2025-06-04 01:10:16] [INFO ] Input system was already deterministic with 240 transitions.
Computed a total of 12 stabilizing places and 20 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 240/240 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 70 transition count 133
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 70 transition count 133
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 118 place count 62 transition count 117
Iterating global reduction 0 with 8 rules applied. Total rules applied 126 place count 62 transition count 117
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 131 place count 62 transition count 112
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 133 place count 60 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 135 place count 60 transition count 106
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 137 place count 58 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 139 place count 58 transition count 102
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 145 place count 58 transition count 96
Applied a total of 145 rules in 10 ms. Remains 58 /125 variables (removed 67) and now considering 96/240 (removed 144) transitions.
[2025-06-04 01:10:16] [INFO ] Flow matrix only has 92 transitions (discarded 4 similar events)
// Phase 1: matrix 92 rows 58 cols
[2025-06-04 01:10:16] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:10:16] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-04 01:10:16] [INFO ] Flow matrix only has 92 transitions (discarded 4 similar events)
[2025-06-04 01:10:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:10:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:10:16] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2025-06-04 01:10:16] [INFO ] Flow matrix only has 92 transitions (discarded 4 similar events)
[2025-06-04 01:10:16] [INFO ] Invariant cache hit.
[2025-06-04 01:10:16] [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/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:17] [INFO ] Deduced a trap composed of 6 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 01:10:17] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 91/149 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 1/150 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 0/150 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 71 constraints, problems are : Problem set: 0 solved, 95 unsolved in 6362 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:23] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:23] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:23] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:23] [INFO ] Deduced a trap composed of 18 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 01:10:24] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 91/149 variables, 58/75 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 95/170 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 1/150 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/150 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (OVERLAPS) 0/150 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 171 constraints, problems are : Problem set: 0 solved, 95 unsolved in 9617 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16004ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 16004ms
Starting structural reductions in LTL mode, iteration 1 : 58/125 places, 96/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16157 ms. Remains : 58/125 places, 96/240 transitions.
[2025-06-04 01:10:32] [INFO ] Flatten gal took : 12 ms
[2025-06-04 01:10:32] [INFO ] Flatten gal took : 12 ms
[2025-06-04 01:10:32] [INFO ] Input system was already deterministic with 96 transitions.
[2025-06-04 01:10:32] [INFO ] Flatten gal took : 12 ms
[2025-06-04 01:10:32] [INFO ] Flatten gal took : 12 ms
[2025-06-04 01:10:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality6704886270641870432.gal : 5 ms
[2025-06-04 01:10:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality8371506003707601823.ctl : 6 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/CTLCardinality6704886270641870432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8371506003707601823.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,1.73892e+06,0.786531,20756,2,3585,5,76489,6,0,322,59114,0
Converting to forward existential form...Done !
original formula: EG(EF(AX((AG(((p4==0)||(p29==1))) * ((EF(((p87==0)||(p69==1))) + (p85==0)) + (p24==1))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(EX(!((!(E(TRUE U !(((p4==0)||(p29==1))))) * ((E(TRUE U ((p87==0)||(p69==1))) + (p85==0)) +...181
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, t19, t21, t23, t24, t...332
(forward)formula 0,1,3.96586,92864,1,0,214,500138,216,102,2458,385457,251
FORMULA HealthRecord-PT-07-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 240/240 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 68 transition count 130
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 68 transition count 130
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 122 place count 60 transition count 114
Iterating global reduction 0 with 8 rules applied. Total rules applied 130 place count 60 transition count 114
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 138 place count 60 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 59 transition count 103
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 59 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 58 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 58 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 145 place count 58 transition count 98
Applied a total of 145 rules in 9 ms. Remains 58 /125 variables (removed 67) and now considering 98/240 (removed 142) transitions.
[2025-06-04 01:10:36] [INFO ] Flow matrix only has 95 transitions (discarded 3 similar events)
// Phase 1: matrix 95 rows 58 cols
[2025-06-04 01:10:36] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:10:36] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-04 01:10:36] [INFO ] Flow matrix only has 95 transitions (discarded 3 similar events)
[2025-06-04 01:10:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:10:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:10:36] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2025-06-04 01:10:36] [INFO ] Flow matrix only has 95 transitions (discarded 3 similar events)
[2025-06-04 01:10:36] [INFO ] Invariant cache hit.
[2025-06-04 01:10: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/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:37] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:37] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 94/152 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 1/153 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 0/153 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 70 constraints, problems are : Problem set: 0 solved, 97 unsolved in 6304 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:43] [INFO ] Deduced a trap composed of 12 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 01:10:43] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 94/152 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 97/168 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 1/153 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/153 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 169 constraints, problems are : Problem set: 0 solved, 97 unsolved in 11890 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18229ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 18230ms
Starting structural reductions in LTL mode, iteration 1 : 58/125 places, 98/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18407 ms. Remains : 58/125 places, 98/240 transitions.
[2025-06-04 01:10:54] [INFO ] Flatten gal took : 7 ms
[2025-06-04 01:10:54] [INFO ] Flatten gal took : 7 ms
[2025-06-04 01:10:54] [INFO ] Input system was already deterministic with 98 transitions.
[2025-06-04 01:10:54] [INFO ] Flatten gal took : 7 ms
[2025-06-04 01:10:54] [INFO ] Flatten gal took : 8 ms
[2025-06-04 01:10:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality12417820033502249565.gal : 4 ms
[2025-06-04 01:10:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality6521936815650140657.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/CTLCardinality12417820033502249565.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6521936815650140657.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,958645,0.083262,6376,2,1245,5,10476,6,0,326,10272,0
Converting to forward existential form...Done !
original formula: AG((!(E(EX((((p46==0)||(p129==1))||(p105==1))) U AG((p18!=1)))) + (p43==1)))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !((p43==1))),EX((((p46==0)||(p129==1))||(p105==1)))) * !(E(TRUE U !((p18!=1)))))] = FA...158
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...307
(forward)formula 0,0,0.573877,20352,1,0,206,83451,221,106,2391,75975,245
FORMULA HealthRecord-PT-07-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 125/125 places, 240/240 transitions.
Graph (trivial) has 155 edges and 125 vertex of which 14 / 125 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 51 place count 68 transition count 137
Iterating global reduction 0 with 50 rules applied. Total rules applied 101 place count 68 transition count 137
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 108 place count 61 transition count 123
Iterating global reduction 0 with 7 rules applied. Total rules applied 115 place count 61 transition count 123
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 120 place count 61 transition count 118
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 122 place count 59 transition count 112
Iterating global reduction 1 with 2 rules applied. Total rules applied 124 place count 59 transition count 112
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 57 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 57 transition count 108
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 134 place count 57 transition count 102
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 140 place count 57 transition count 96
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 150 place count 52 transition count 91
Applied a total of 150 rules in 34 ms. Remains 52 /125 variables (removed 73) and now considering 91/240 (removed 149) transitions.
[2025-06-04 01:10:55] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
// Phase 1: matrix 82 rows 52 cols
[2025-06-04 01:10:55] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:10:55] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-04 01:10:55] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
[2025-06-04 01:10:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:10:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:10:55] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 01:10:55] [INFO ] Redundant transitions in 16 ms returned []
Running 90 sub problems to find dead transitions.
[2025-06-04 01:10:55] [INFO ] Flow matrix only has 82 transitions (discarded 9 similar events)
[2025-06-04 01:10:55] [INFO ] Invariant cache hit.
[2025-06-04 01:10:55] [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, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:56] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:56] [INFO ] Deduced a trap composed of 18 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 01:10:56] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:56] [INFO ] Deduced a trap composed of 13 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 01:10:56] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:56] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:56] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:57] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:57] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 81/133 variables, 52/70 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:10:58] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 1/134 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 72 constraints, problems are : Problem set: 0 solved, 90 unsolved in 6405 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 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, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:11:02] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 81/133 variables, 52/72 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 90/162 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (OVERLAPS) 1/134 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 163 constraints, problems are : Problem set: 0 solved, 90 unsolved in 10714 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17156ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 17157ms
Starting structural reductions in SI_CTL mode, iteration 1 : 52/125 places, 91/240 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17383 ms. Remains : 52/125 places, 91/240 transitions.
[2025-06-04 01:11:12] [INFO ] Flatten gal took : 9 ms
[2025-06-04 01:11:12] [INFO ] Flatten gal took : 10 ms
[2025-06-04 01:11:12] [INFO ] Input system was already deterministic with 91 transitions.
[2025-06-04 01:11:12] [INFO ] Flatten gal took : 8 ms
[2025-06-04 01:11:12] [INFO ] Flatten gal took : 8 ms
[2025-06-04 01:11:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality14478572165609072124.gal : 4 ms
[2025-06-04 01:11:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality8641129700541011990.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/CTLCardinality14478572165609072124.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8641129700541011990.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,336901,0.070713,5852,2,887,5,8268,6,0,289,9491,0
Converting to forward existential form...Done !
original formula: (AG((((p87==0) + EF(((p38==0)&&(p17==1)))) * AG(((p100!=0)&&(p39!=1))))) + EF(EG((((p127!=0)&&(p101!=1))&&(((p84==0)||(p150==0))||(p22==1...161
=> equivalent forward existential formula: ([((FwdU((Init * !(E(TRUE U EG((((p127!=0)&&(p101!=1))&&(((p84==0)||(p150==0))||(p22==1))))))),TRUE) * !((p87==0...354
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...375
(forward)formula 0,1,0.585631,21024,1,0,267,104696,204,113,2122,77327,281
FORMULA HealthRecord-PT-07-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 240/240 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 72 transition count 138
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 72 transition count 138
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 112 place count 66 transition count 126
Iterating global reduction 0 with 6 rules applied. Total rules applied 118 place count 66 transition count 126
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 124 place count 66 transition count 120
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 64 transition count 114
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 64 transition count 114
Applied a total of 128 rules in 12 ms. Remains 64 /125 variables (removed 61) and now considering 114/240 (removed 126) transitions.
[2025-06-04 01:11:13] [INFO ] Flow matrix only has 111 transitions (discarded 3 similar events)
// Phase 1: matrix 111 rows 64 cols
[2025-06-04 01:11:13] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:11:13] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-04 01:11:13] [INFO ] Flow matrix only has 111 transitions (discarded 3 similar events)
[2025-06-04 01:11:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:11:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:11:13] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2025-06-04 01:11:13] [INFO ] Flow matrix only has 111 transitions (discarded 3 similar events)
[2025-06-04 01:11:13] [INFO ] Invariant cache hit.
[2025-06-04 01:11:13] [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/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:11:14] [INFO ] Deduced a trap composed of 21 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 01:11:14] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:11:15] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:11:15] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:11:15] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 110/174 variables, 64/78 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:11:16] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:11:17] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:11:17] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:11:18] [INFO ] Deduced a trap composed of 11 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 01:11:18] [INFO ] Deduced a trap composed of 22 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 01:11:18] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 1/175 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/175 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 85 constraints, problems are : Problem set: 0 solved, 113 unsolved in 10048 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:11:24] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:11:24] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:11:24] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:11:25] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 110/174 variables, 64/88 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 113/201 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 1/175 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/175 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 202 constraints, problems are : Problem set: 0 solved, 113 unsolved in 18294 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28373ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 28374ms
Starting structural reductions in LTL mode, iteration 1 : 64/125 places, 114/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28566 ms. Remains : 64/125 places, 114/240 transitions.
[2025-06-04 01:11:42] [INFO ] Flatten gal took : 7 ms
[2025-06-04 01:11:42] [INFO ] Flatten gal took : 6 ms
[2025-06-04 01:11:42] [INFO ] Input system was already deterministic with 114 transitions.
[2025-06-04 01:11:42] [INFO ] Flatten gal took : 7 ms
[2025-06-04 01:11:42] [INFO ] Flatten gal took : 6 ms
[2025-06-04 01:11:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality15412369623293148030.gal : 3 ms
[2025-06-04 01:11:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality7024408927417101559.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/CTLCardinality15412369623293148030.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7024408927417101559.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,2.0988e+06,0.190378,9728,2,1591,5,17607,6,0,366,29427,0
Converting to forward existential form...Done !
original formula: ((EX(EX(EF((p66==1)))) * A((p135==0) U A(EX(A(((p111==0)||(p102==1)) U (p96==1))) U !(((p29==0)&&(p135==1)))))) * AX(((EF((((p133==0)||(p...275
=> equivalent forward existential formula: (([(Init * !(EX(EX(E(TRUE U (p66==1))))))] = FALSE * (([((FwdU((FwdU(Init,!(!((E(!(!(((p29==0)&&(p135==1)))) U (...1264
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...418
(forward)formula 0,1,5.81548,139824,1,0,523,865389,299,254,2718,763550,599
FORMULA HealthRecord-PT-07-CTLCardinality-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 125/125 places, 240/240 transitions.
Graph (trivial) has 178 edges and 125 vertex of which 14 / 125 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.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 57 place count 62 transition count 125
Iterating global reduction 0 with 56 rules applied. Total rules applied 113 place count 62 transition count 125
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 122 place count 53 transition count 107
Iterating global reduction 0 with 9 rules applied. Total rules applied 131 place count 53 transition count 107
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 140 place count 53 transition count 98
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 143 place count 50 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 146 place count 50 transition count 89
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 149 place count 47 transition count 83
Iterating global reduction 1 with 3 rules applied. Total rules applied 152 place count 47 transition count 83
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 160 place count 47 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 166 place count 47 transition count 69
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 174 place count 43 transition count 65
Applied a total of 174 rules in 39 ms. Remains 43 /125 variables (removed 82) and now considering 65/240 (removed 175) transitions.
[2025-06-04 01:11:48] [INFO ] Flow matrix only has 56 transitions (discarded 9 similar events)
// Phase 1: matrix 56 rows 43 cols
[2025-06-04 01:11:48] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:11:48] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-04 01:11:48] [INFO ] Flow matrix only has 56 transitions (discarded 9 similar events)
[2025-06-04 01:11:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:11:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:11:48] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 01:11:48] [INFO ] Redundant transitions in 16 ms returned []
Running 64 sub problems to find dead transitions.
[2025-06-04 01:11:48] [INFO ] Flow matrix only has 56 transitions (discarded 9 similar events)
[2025-06-04 01:11:48] [INFO ] Invariant cache hit.
[2025-06-04 01:11:48] [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/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:11:48] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:11:48] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 55/98 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 1/99 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/99 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 55 constraints, problems are : Problem set: 0 solved, 64 unsolved in 3287 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:11:51] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 55/98 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 64/119 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 1/99 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/99 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 120 constraints, problems are : Problem set: 0 solved, 64 unsolved in 4958 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8260ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 8260ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/125 places, 65/240 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8483 ms. Remains : 43/125 places, 65/240 transitions.
[2025-06-04 01:11:56] [INFO ] Flatten gal took : 5 ms
[2025-06-04 01:11:56] [INFO ] Flatten gal took : 5 ms
[2025-06-04 01:11:56] [INFO ] Input system was already deterministic with 65 transitions.
[2025-06-04 01:11:56] [INFO ] Flatten gal took : 4 ms
[2025-06-04 01:11:56] [INFO ] Flatten gal took : 4 ms
[2025-06-04 01:11:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality9647909891723830055.gal : 1 ms
[2025-06-04 01:11:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality11041514536170294837.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/CTLCardinality9647909891723830055.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11041514536170294837.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,178205,0.051128,4836,2,510,5,4774,6,0,227,5110,0
Converting to forward existential form...Done !
original formula: EF(AG(AF(((p11==0)&&(p72==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!(((p11==0)&&(p72==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t29, t30, Intersection with reac...230
(forward)formula 0,0,1.0098,29492,1,0,247,153567,148,120,1666,167900,284
FORMULA HealthRecord-PT-07-CTLCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 240/240 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 73 transition count 139
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 73 transition count 139
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 111 place count 66 transition count 125
Iterating global reduction 0 with 7 rules applied. Total rules applied 118 place count 66 transition count 125
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 124 place count 66 transition count 119
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 64 transition count 113
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 64 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 63 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 63 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 133 place count 63 transition count 108
Applied a total of 133 rules in 5 ms. Remains 63 /125 variables (removed 62) and now considering 108/240 (removed 132) transitions.
[2025-06-04 01:11:57] [INFO ] Flow matrix only has 104 transitions (discarded 4 similar events)
// Phase 1: matrix 104 rows 63 cols
[2025-06-04 01:11:57] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:11:57] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-04 01:11:57] [INFO ] Flow matrix only has 104 transitions (discarded 4 similar events)
[2025-06-04 01:11:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:11:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:11:57] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2025-06-04 01:11:57] [INFO ] Flow matrix only has 104 transitions (discarded 4 similar events)
[2025-06-04 01:11:57] [INFO ] Invariant cache hit.
[2025-06-04 01:11: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/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:11:58] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:11:58] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:11:59] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:11:59] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:11:59] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:11:59] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:11:59] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:12:00] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 103/166 variables, 63/81 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 1/167 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (OVERLAPS) 0/167 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 82 constraints, problems are : Problem set: 0 solved, 107 unsolved in 7361 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 103/166 variables, 63/81 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 107/188 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 1/167 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 0/167 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 189 constraints, problems are : Problem set: 0 solved, 107 unsolved in 13026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20409ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 20410ms
Starting structural reductions in LTL mode, iteration 1 : 63/125 places, 108/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20580 ms. Remains : 63/125 places, 108/240 transitions.
[2025-06-04 01:12:18] [INFO ] Flatten gal took : 5 ms
[2025-06-04 01:12:18] [INFO ] Flatten gal took : 5 ms
[2025-06-04 01:12:18] [INFO ] Input system was already deterministic with 108 transitions.
[2025-06-04 01:12:18] [INFO ] Flatten gal took : 6 ms
[2025-06-04 01:12:18] [INFO ] Flatten gal took : 5 ms
[2025-06-04 01:12:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality15822747238022589345.gal : 1 ms
[2025-06-04 01:12:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality13320627860433864776.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/CTLCardinality15822747238022589345.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13320627860433864776.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,1.7569e+06,0.105165,7124,2,1315,5,11635,6,0,353,15066,0
Converting to forward existential form...Done !
original formula: E((AX(EG((((p101!=1)&&((p137==0)||(p17==1)))&&((p84==0)||(p78==1))))) * AG(EX((((p115==0)||(p42==1))||((p80==1)||(p48==1)))))) U EG(A((p1...196
=> equivalent forward existential formula: [FwdG(FwdU(Init,(!(EX(!(EG((((p101!=1)&&((p137==0)||(p17==1)))&&((p84==0)||(p78==1))))))) * !(E(TRUE U !(EX((((p...399
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...438
(forward)formula 0,1,4.33122,131520,1,0,466,795888,254,221,2685,698084,519
FORMULA HealthRecord-PT-07-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 240/240 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 68 transition count 130
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 68 transition count 130
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 122 place count 60 transition count 114
Iterating global reduction 0 with 8 rules applied. Total rules applied 130 place count 60 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 133 place count 60 transition count 111
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 135 place count 58 transition count 105
Iterating global reduction 1 with 2 rules applied. Total rules applied 137 place count 58 transition count 105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 139 place count 56 transition count 101
Iterating global reduction 1 with 2 rules applied. Total rules applied 141 place count 56 transition count 101
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 147 place count 56 transition count 95
Applied a total of 147 rules in 10 ms. Remains 56 /125 variables (removed 69) and now considering 95/240 (removed 145) transitions.
[2025-06-04 01:12:22] [INFO ] Flow matrix only has 92 transitions (discarded 3 similar events)
// Phase 1: matrix 92 rows 56 cols
[2025-06-04 01:12:22] [INFO ] Computed 9 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:12:22] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-04 01:12:22] [INFO ] Flow matrix only has 92 transitions (discarded 3 similar events)
[2025-06-04 01:12:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:12:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:12:22] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2025-06-04 01:12:22] [INFO ] Flow matrix only has 92 transitions (discarded 3 similar events)
[2025-06-04 01:12:22] [INFO ] Invariant cache hit.
[2025-06-04 01:12:22] [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/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:12:23] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:12:23] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:12:23] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:12:23] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 91/147 variables, 56/69 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 1/148 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 0/148 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 70 constraints, problems are : Problem set: 0 solved, 94 unsolved in 5984 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:12:29] [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 01:12:29] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 91/147 variables, 56/71 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 94/165 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (OVERLAPS) 1/148 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (OVERLAPS) 0/148 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 166 constraints, problems are : Problem set: 0 solved, 94 unsolved in 11642 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17647ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 17649ms
Starting structural reductions in LTL mode, iteration 1 : 56/125 places, 95/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17837 ms. Remains : 56/125 places, 95/240 transitions.
[2025-06-04 01:12:40] [INFO ] Flatten gal took : 8 ms
[2025-06-04 01:12:40] [INFO ] Flatten gal took : 5 ms
[2025-06-04 01:12:40] [INFO ] Input system was already deterministic with 95 transitions.
[2025-06-04 01:12:40] [INFO ] Flatten gal took : 6 ms
[2025-06-04 01:12:40] [INFO ] Flatten gal took : 4 ms
[2025-06-04 01:12:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality5422710454117920879.gal : 1 ms
[2025-06-04 01:12:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality15061840086996661602.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/CTLCardinality5422710454117920879.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15061840086996661602.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,1.11635e+06,0.105698,6972,2,1607,5,13269,6,0,315,12074,0
Converting to forward existential form...Done !
original formula: (AG((((p13==1) + (EX((p114==0)) * EG((p118==0)))) + EG(((p37==0)||(p80==0))))) * EX(((p81==0)||(p127==1))))
=> equivalent forward existential formula: (([(((FwdU(Init,TRUE) * !(EG(((p37==0)||(p80==0))))) * !((p13==1))) * !(EX((p114==0))))] = FALSE * [(((FwdU(Init...288
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, t22, t...342
(forward)formula 0,0,3.24524,100212,1,0,477,596825,216,237,2216,595930,543
FORMULA HealthRecord-PT-07-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 125/125 places, 240/240 transitions.
Graph (trivial) has 161 edges and 125 vertex of which 12 / 125 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.
Reduce places removed 1 places and 1 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 51 place count 68 transition count 137
Iterating global reduction 0 with 50 rules applied. Total rules applied 101 place count 68 transition count 137
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 107 place count 62 transition count 125
Iterating global reduction 0 with 6 rules applied. Total rules applied 113 place count 62 transition count 125
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 118 place count 62 transition count 120
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 123 place count 62 transition count 115
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 1 with 4 rules applied. Total rules applied 127 place count 60 transition count 113
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 129 place count 58 transition count 111
Applied a total of 129 rules in 22 ms. Remains 58 /125 variables (removed 67) and now considering 111/240 (removed 129) transitions.
[2025-06-04 01:12:43] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
// Phase 1: matrix 103 rows 58 cols
[2025-06-04 01:12:43] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:12:43] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-04 01:12:43] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
[2025-06-04 01:12:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:12:43] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 01:12:43] [INFO ] Redundant transitions in 20 ms returned []
Running 97 sub problems to find dead transitions.
[2025-06-04 01:12:43] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
[2025-06-04 01:12:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 7/58 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:12:44] [INFO ] Deduced a trap composed of 7 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 01:12:44] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:12:44] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 0/160 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/161 variables, and 70 constraints, problems are : Problem set: 0 solved, 97 unsolved in 4549 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 7/58 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:12:49] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 102/160 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 97/168 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/160 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/161 variables, and 168 constraints, problems are : Problem set: 0 solved, 97 unsolved in 7056 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11629ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 11631ms
Starting structural reductions in SI_CTL mode, iteration 1 : 58/125 places, 111/240 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11907 ms. Remains : 58/125 places, 111/240 transitions.
[2025-06-04 01:12:55] [INFO ] Flatten gal took : 6 ms
[2025-06-04 01:12:55] [INFO ] Flatten gal took : 5 ms
[2025-06-04 01:12:55] [INFO ] Input system was already deterministic with 111 transitions.
[2025-06-04 01:12:55] [INFO ] Flatten gal took : 5 ms
[2025-06-04 01:12:55] [INFO ] Flatten gal took : 5 ms
[2025-06-04 01:12:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality18253001014174886078.gal : 1 ms
[2025-06-04 01:12:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality14941537083060784387.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/CTLCardinality18253001014174886078.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14941537083060784387.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,725404,0.176673,9060,2,1512,5,17923,6,0,329,26396,0
Converting to forward existential form...Done !
original formula: E(((p88==0)||(p131==1)) U !(E(((p50==1) + (E((p91==1) U ((p10==0)||(p90==1))) * AF((p35==0)))) U !((((p75==1)||(p34==0))||(p32==1))))))
=> equivalent forward existential formula: [(FwdU(Init,((p88==0)||(p131==1))) * !(E(((p50==1) + (E((p91==1) U ((p10==0)||(p90==1))) * !(EG(!((p35==0)))))) ...205
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...446
Hit Full ! (commute/partial/dont) 104/0/7
(forward)formula 0,1,1.35677,40564,1,0,423,207082,254,209,2539,212439,400
FORMULA HealthRecord-PT-07-CTLCardinality-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 240/240 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 72 transition count 138
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 72 transition count 138
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 111 place count 67 transition count 128
Iterating global reduction 0 with 5 rules applied. Total rules applied 116 place count 67 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 119 place count 67 transition count 125
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 120 place count 66 transition count 122
Iterating global reduction 1 with 1 rules applied. Total rules applied 121 place count 66 transition count 122
Applied a total of 121 rules in 9 ms. Remains 66 /125 variables (removed 59) and now considering 122/240 (removed 118) transitions.
[2025-06-04 01:12:57] [INFO ] Flow matrix only has 119 transitions (discarded 3 similar events)
// Phase 1: matrix 119 rows 66 cols
[2025-06-04 01:12:57] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:12:57] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-04 01:12:57] [INFO ] Flow matrix only has 119 transitions (discarded 3 similar events)
[2025-06-04 01:12:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:12:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:12:57] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2025-06-04 01:12:57] [INFO ] Flow matrix only has 119 transitions (discarded 3 similar events)
[2025-06-04 01:12:57] [INFO ] Invariant cache hit.
[2025-06-04 01:12: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/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:12:58] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:12:58] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 118/184 variables, 66/77 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 1/185 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:13:02] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 0/185 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 79 constraints, problems are : Problem set: 0 solved, 121 unsolved in 9744 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:13:07] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:13:07] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:13:07] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:13:07] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:13:07] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:13:08] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:13:08] [INFO ] Deduced a trap composed of 25 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 01:13:08] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:13:08] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 118/184 variables, 66/87 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 121/208 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 1/185 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 0/185 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 209 constraints, problems are : Problem set: 0 solved, 121 unsolved in 19296 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29058ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 29059ms
Starting structural reductions in LTL mode, iteration 1 : 66/125 places, 122/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29224 ms. Remains : 66/125 places, 122/240 transitions.
[2025-06-04 01:13:26] [INFO ] Flatten gal took : 5 ms
[2025-06-04 01:13:26] [INFO ] Flatten gal took : 5 ms
[2025-06-04 01:13:26] [INFO ] Input system was already deterministic with 122 transitions.
[2025-06-04 01:13:26] [INFO ] Flatten gal took : 4 ms
[2025-06-04 01:13:26] [INFO ] Flatten gal took : 5 ms
[2025-06-04 01:13:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality2457761567951588366.gal : 1 ms
[2025-06-04 01:13:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality607615023146015903.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/CTLCardinality2457761567951588366.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality607615023146015903.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 -...282
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,2.83315e+06,0.383522,11700,2,2598,5,28203,6,0,382,36899,0
Converting to forward existential form...Done !
original formula: EX((((p140==0)||(p54==1)) * (((p9==1)||(p118==1)) + (!(A(((p127==0)||(p126==1)) U ((p46==0)||(p66==1)))) * (!(A((p12==1) U ((p137==0)||(p...192
=> equivalent forward existential formula: ([((EY(Init) * ((p140==0)||(p54==1))) * ((p9==1)||(p118==1)))] != FALSE + (([(FwdU(((EY(Init) * ((p140==0)||(p54...770
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...426
(forward)formula 0,0,1.10039,28196,1,0,273,127229,287,121,2819,93904,310
FORMULA HealthRecord-PT-07-CTLCardinality-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 240/240 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 66 transition count 126
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 66 transition count 126
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 127 place count 57 transition count 108
Iterating global reduction 0 with 9 rules applied. Total rules applied 136 place count 57 transition count 108
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 144 place count 57 transition count 100
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 146 place count 55 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 148 place count 55 transition count 94
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 150 place count 53 transition count 90
Iterating global reduction 1 with 2 rules applied. Total rules applied 152 place count 53 transition count 90
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 158 place count 53 transition count 84
Applied a total of 158 rules in 5 ms. Remains 53 /125 variables (removed 72) and now considering 84/240 (removed 156) transitions.
[2025-06-04 01:13:27] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
// Phase 1: matrix 81 rows 53 cols
[2025-06-04 01:13:27] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:13:27] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-04 01:13:27] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
[2025-06-04 01:13:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:13:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:13:27] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2025-06-04 01:13:27] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
[2025-06-04 01:13:27] [INFO ] Invariant cache hit.
[2025-06-04 01:13: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/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:13:28] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:13:28] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 80/133 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 1/134 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:13:30] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:13:30] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 0/134 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 67 constraints, problems are : Problem set: 0 solved, 83 unsolved in 5827 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:13:33] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:13:34] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 80/133 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 83/151 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 1/134 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 152 constraints, problems are : Problem set: 0 solved, 83 unsolved in 8664 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14501ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 14503ms
Starting structural reductions in LTL mode, iteration 1 : 53/125 places, 84/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14645 ms. Remains : 53/125 places, 84/240 transitions.
[2025-06-04 01:13:42] [INFO ] Flatten gal took : 6 ms
[2025-06-04 01:13:42] [INFO ] Flatten gal took : 6 ms
[2025-06-04 01:13:42] [INFO ] Input system was already deterministic with 84 transitions.
[2025-06-04 01:13:42] [INFO ] Flatten gal took : 6 ms
[2025-06-04 01:13:42] [INFO ] Flatten gal took : 6 ms
[2025-06-04 01:13:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality15767745674207053503.gal : 1 ms
[2025-06-04 01:13:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality11614416580574625016.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/CTLCardinality15767745674207053503.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11614416580574625016.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,818676,0.123103,6224,2,1079,5,10177,6,0,292,10560,0
Converting to forward existential form...Done !
original formula: EF(EG(AF(AX(((p3==0)&&(p29==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EG(!(!(EX(!(((p3==0)&&(p29==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t18, t20, t22, t37, t38, t...272
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.493097,13520,1,0,170,46020,193,90,2139,43967,209
FORMULA HealthRecord-PT-07-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 240/240 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 70 transition count 133
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 70 transition count 133
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 118 place count 62 transition count 117
Iterating global reduction 0 with 8 rules applied. Total rules applied 126 place count 62 transition count 117
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 135 place count 62 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 137 place count 60 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 139 place count 60 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 141 place count 58 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 143 place count 58 transition count 98
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 149 place count 58 transition count 92
Applied a total of 149 rules in 6 ms. Remains 58 /125 variables (removed 67) and now considering 92/240 (removed 148) transitions.
[2025-06-04 01:13:42] [INFO ] Flow matrix only has 88 transitions (discarded 4 similar events)
// Phase 1: matrix 88 rows 58 cols
[2025-06-04 01:13:42] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:13:42] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-04 01:13:42] [INFO ] Flow matrix only has 88 transitions (discarded 4 similar events)
[2025-06-04 01:13:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:13:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:13:42] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2025-06-04 01:13:42] [INFO ] Flow matrix only has 88 transitions (discarded 4 similar events)
[2025-06-04 01:13:42] [INFO ] Invariant cache hit.
[2025-06-04 01:13:42] [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/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:13:43] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:13:44] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 87/145 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 1/146 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 0/146 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 71 constraints, problems are : Problem set: 0 solved, 91 unsolved in 6046 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:13:49] [INFO ] Deduced a trap composed of 10 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 01:13:49] [INFO ] Deduced a trap composed of 17 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 01:13:49] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:13:49] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:13:49] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 87/145 variables, 58/75 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 91/166 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 1/146 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/146 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (OVERLAPS) 0/146 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 167 constraints, problems are : Problem set: 0 solved, 91 unsolved in 9088 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15152ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 15152ms
Starting structural reductions in LTL mode, iteration 1 : 58/125 places, 92/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15378 ms. Remains : 58/125 places, 92/240 transitions.
[2025-06-04 01:13:57] [INFO ] Flatten gal took : 4 ms
[2025-06-04 01:13:57] [INFO ] Flatten gal took : 3 ms
[2025-06-04 01:13:57] [INFO ] Input system was already deterministic with 92 transitions.
[2025-06-04 01:13:57] [INFO ] Flatten gal took : 3 ms
[2025-06-04 01:13:58] [INFO ] Flatten gal took : 3 ms
[2025-06-04 01:13:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality1681405944760813156.gal : 1 ms
[2025-06-04 01:13:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality4211132987786534583.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/CTLCardinality1681405944760813156.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4211132987786534583.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,1.14405e+06,0.110229,7148,2,1544,5,14165,6,0,318,13401,0
Converting to forward existential form...Done !
original formula: EF((AG(AF(!(E((p25==1) U (p77==0))))) * (AX(((p112==0)||(p105==1))) + EX(((p51==0)&&(p125==0))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!(!(E((p25==1) U (p77==0)))))))))) * !(EX(!(((p112==0)||(p105==1))))))] ...279
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, t21, t23, t...302
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,3.62126,102996,1,0,329,598346,215,189,2381,621170,354
FORMULA HealthRecord-PT-07-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 125/125 places, 240/240 transitions.
Graph (trivial) has 165 edges and 125 vertex of which 14 / 125 are part of one of the 7 SCC in 0 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 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 56 place count 62 transition count 126
Iterating global reduction 0 with 55 rules applied. Total rules applied 111 place count 62 transition count 126
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 119 place count 54 transition count 110
Iterating global reduction 0 with 8 rules applied. Total rules applied 127 place count 54 transition count 110
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 132 place count 54 transition count 105
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 135 place count 51 transition count 96
Iterating global reduction 1 with 3 rules applied. Total rules applied 138 place count 51 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 141 place count 48 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 144 place count 48 transition count 90
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 153 place count 48 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 159 place count 48 transition count 75
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 2 with 4 rules applied. Total rules applied 163 place count 46 transition count 73
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 166 place count 43 transition count 70
Applied a total of 166 rules in 18 ms. Remains 43 /125 variables (removed 82) and now considering 70/240 (removed 170) transitions.
[2025-06-04 01:14:01] [INFO ] Flow matrix only has 61 transitions (discarded 9 similar events)
// Phase 1: matrix 61 rows 43 cols
[2025-06-04 01:14:01] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:14:01] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-04 01:14:01] [INFO ] Flow matrix only has 61 transitions (discarded 9 similar events)
[2025-06-04 01:14:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:14:01] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 01:14:01] [INFO ] Redundant transitions in 14 ms returned []
Running 56 sub problems to find dead transitions.
[2025-06-04 01:14:01] [INFO ] Flow matrix only has 61 transitions (discarded 9 similar events)
[2025-06-04 01:14:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 7/43 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:14:02] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:14:02] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:14:02] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:14:02] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 60/103 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/103 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/104 variables, and 56 constraints, problems are : Problem set: 0 solved, 56 unsolved in 2684 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 7/43 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 60/103 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 56/112 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/103 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/104 variables, and 112 constraints, problems are : Problem set: 0 solved, 56 unsolved in 3208 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5901ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 5901ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/125 places, 70/240 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6058 ms. Remains : 43/125 places, 70/240 transitions.
[2025-06-04 01:14:07] [INFO ] Flatten gal took : 4 ms
[2025-06-04 01:14:07] [INFO ] Flatten gal took : 4 ms
[2025-06-04 01:14:07] [INFO ] Input system was already deterministic with 70 transitions.
[2025-06-04 01:14:07] [INFO ] Flatten gal took : 6 ms
[2025-06-04 01:14:07] [INFO ] Flatten gal took : 4 ms
[2025-06-04 01:14:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality8138001700726357939.gal : 1 ms
[2025-06-04 01:14:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality5381057613552094164.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/CTLCardinality8138001700726357939.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5381057613552094164.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,159796,0.073057,5132,2,484,5,5192,6,0,226,6011,0
Converting to forward existential form...Done !
original formula: AG(E(((p36==1) * !(EG(AF((p87==0))))) U (p43==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((p36==1) * !(EG(!(EG(!((p87==0))))))) U (p43==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t14, t15, t16, t17, t25, t26, t36, t40...275
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.02627,28920,1,0,310,145893,164,175,1660,182666,318
FORMULA HealthRecord-PT-07-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 240/240 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 66 transition count 126
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 66 transition count 126
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 127 place count 57 transition count 108
Iterating global reduction 0 with 9 rules applied. Total rules applied 136 place count 57 transition count 108
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 145 place count 57 transition count 99
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 148 place count 54 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 151 place count 54 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 152 place count 53 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 153 place count 53 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 156 place count 53 transition count 85
Applied a total of 156 rules in 4 ms. Remains 53 /125 variables (removed 72) and now considering 85/240 (removed 155) transitions.
[2025-06-04 01:14:08] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
// Phase 1: matrix 82 rows 53 cols
[2025-06-04 01:14:08] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:14:08] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-04 01:14:08] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2025-06-04 01:14:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:14:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:14:08] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2025-06-04 01:14:08] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2025-06-04 01:14:08] [INFO ] Invariant cache hit.
[2025-06-04 01:14: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/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:14:09] [INFO ] Deduced a trap composed of 15 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 01:14:09] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 81/134 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 1/135 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 65 constraints, problems are : Problem set: 0 solved, 84 unsolved in 4502 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:14:13] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:14:14] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 81/134 variables, 53/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 84/150 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (OVERLAPS) 1/135 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (OVERLAPS) 0/135 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 151 constraints, problems are : Problem set: 0 solved, 84 unsolved in 10295 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14807ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 14808ms
Starting structural reductions in LTL mode, iteration 1 : 53/125 places, 85/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14950 ms. Remains : 53/125 places, 85/240 transitions.
[2025-06-04 01:14:23] [INFO ] Flatten gal took : 3 ms
[2025-06-04 01:14:23] [INFO ] Flatten gal took : 3 ms
[2025-06-04 01:14:23] [INFO ] Input system was already deterministic with 85 transitions.
[2025-06-04 01:14:23] [INFO ] Flatten gal took : 3 ms
[2025-06-04 01:14:23] [INFO ] Flatten gal took : 3 ms
[2025-06-04 01:14:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality15263332221964041466.gal : 1 ms
[2025-06-04 01:14:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality11478344175178601532.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/CTLCardinality15263332221964041466.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11478344175178601532.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,714430,0.043069,5076,2,669,5,5408,6,0,293,5023,0
Converting to forward existential form...Done !
original formula: (EF(EX(EF((p128==1)))) + EG(EX(((AG((p146==0)) * (p96==1)) * (p75==1)))))
=> equivalent forward existential formula: ([(FwdU(EY(FwdU(Init,TRUE)),TRUE) * (p128==1))] != FALSE + [FwdG(Init,EX(((!(E(TRUE U !((p146==0)))) * (p96==1))...180
(forward)formula 0,1,0.054014,5332,1,0,8,5408,9,1,570,5023,4
FORMULA HealthRecord-PT-07-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 240/240 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 73 transition count 139
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 73 transition count 139
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 111 place count 66 transition count 125
Iterating global reduction 0 with 7 rules applied. Total rules applied 118 place count 66 transition count 125
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 123 place count 66 transition count 120
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 125 place count 64 transition count 114
Iterating global reduction 1 with 2 rules applied. Total rules applied 127 place count 64 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 63 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 63 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 131 place count 63 transition count 110
Applied a total of 131 rules in 3 ms. Remains 63 /125 variables (removed 62) and now considering 110/240 (removed 130) transitions.
[2025-06-04 01:14:23] [INFO ] Flow matrix only has 106 transitions (discarded 4 similar events)
// Phase 1: matrix 106 rows 63 cols
[2025-06-04 01:14:23] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:14:23] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-04 01:14:23] [INFO ] Flow matrix only has 106 transitions (discarded 4 similar events)
[2025-06-04 01:14:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:14:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:14:24] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2025-06-04 01:14:24] [INFO ] Flow matrix only has 106 transitions (discarded 4 similar events)
[2025-06-04 01:14:24] [INFO ] Invariant cache hit.
[2025-06-04 01:14:24] [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/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:14:25] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:14:25] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:14:26] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 105/168 variables, 63/76 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 1/169 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/169 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 77 constraints, problems are : Problem set: 0 solved, 109 unsolved in 7134 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:14:31] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:14:32] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:14:32] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:14:33] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:14:33] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 105/168 variables, 63/81 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 109/190 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/168 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (OVERLAPS) 1/169 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/169 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 14 (OVERLAPS) 0/169 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 191 constraints, problems are : Problem set: 0 solved, 109 unsolved in 14899 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22057ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 22058ms
Starting structural reductions in LTL mode, iteration 1 : 63/125 places, 110/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22266 ms. Remains : 63/125 places, 110/240 transitions.
[2025-06-04 01:14:46] [INFO ] Flatten gal took : 6 ms
[2025-06-04 01:14:46] [INFO ] Flatten gal took : 6 ms
[2025-06-04 01:14:46] [INFO ] Input system was already deterministic with 110 transitions.
[2025-06-04 01:14:46] [INFO ] Flatten gal took : 6 ms
[2025-06-04 01:14:46] [INFO ] Flatten gal took : 5 ms
[2025-06-04 01:14:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality15993021727424122068.gal : 1 ms
[2025-06-04 01:14:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality8504907996090378668.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/CTLCardinality15993021727424122068.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8504907996090378668.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,2.47278e+06,0.694795,18148,2,3986,5,60067,6,0,355,67125,0
Converting to forward existential form...Done !
original formula: EF(((EF(((p36==0)||(p88==0))) * AX((p17==1))) * ((p74==1) * (((EF((p61==1)) + E(EX((p52==1)) U !(((p90==0)||(p42==1))))) + (((p128==0)&&(...224
=> equivalent forward existential formula: ((([(FwdU(((FwdU(Init,TRUE) * (E(TRUE U ((p36==0)||(p88==0))) * !(EX(!((p17==1)))))) * (p74==1)),TRUE) * (p61==1...602
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, t21, t23, t...408
(forward)formula 0,1,2.19704,51392,1,0,232,215885,241,97,2680,231014,237
FORMULA HealthRecord-PT-07-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2025-06-04 01:14:48] [INFO ] Flatten gal took : 10 ms
[2025-06-04 01:14:48] [INFO ] Flatten gal took : 10 ms
Total runtime 347838 ms.
BK_STOP 1748999688414
--------------------
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-07"
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-07, 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-174867008200585"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-07.tgz
mv HealthRecord-PT-07 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 '
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 ;