Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r180-tall-171640604200809.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is HealthRecord-PT-15, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640604200809
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 20:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 20:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 73K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-00
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-01
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-02
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-03
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-04
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-05
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-06
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-07
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-08
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-09
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-10
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-11
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2023-12
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2023-13
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2023-14
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716520958084

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-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-24 03:22:39] [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]
[2024-05-24 03:22:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:22:39] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-05-24 03:22:39] [INFO ] Transformed 163 places.
[2024-05-24 03:22:39] [INFO ] Transformed 348 transitions.
[2024-05-24 03:22:39] [INFO ] Found NUPN structural information;
[2024-05-24 03:22:39] [INFO ] Parsed PT model containing 163 places and 348 transitions and 919 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Ensure Unique test removed 29 transitions
Reduce redundant transitions removed 29 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA HealthRecord-PT-15-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-15-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 87 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 319/319 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 126 transition count 248
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 126 transition count 248
Applied a total of 74 rules in 29 ms. Remains 126 /163 variables (removed 37) and now considering 248/319 (removed 71) transitions.
[2024-05-24 03:22:39] [INFO ] Flow matrix only has 239 transitions (discarded 9 similar events)
// Phase 1: matrix 239 rows 126 cols
[2024-05-24 03:22:39] [INFO ] Computed 15 invariants in 16 ms
[2024-05-24 03:22:39] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-24 03:22:39] [INFO ] Flow matrix only has 239 transitions (discarded 9 similar events)
[2024-05-24 03:22:39] [INFO ] Invariant cache hit.
[2024-05-24 03:22:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:22:40] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2024-05-24 03:22:40] [INFO ] Flow matrix only has 239 transitions (discarded 9 similar events)
[2024-05-24 03:22:40] [INFO ] Invariant cache hit.
[2024-05-24 03:22:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-24 03:22:41] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 15 ms to minimize.
[2024-05-24 03:22:42] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 2 ms to minimize.
[2024-05-24 03:22:42] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:22:42] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:22:42] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:22:42] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:22:42] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:22:42] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:22:42] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:22:42] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:22:42] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:22:42] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:22:42] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:22:42] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:22:42] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:22:42] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:22:42] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:22:42] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:22:43] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:22:43] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-24 03:22:43] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:22:43] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:22:43] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:22:43] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:22:43] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:22:43] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:22:44] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:22:44] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2024-05-24 03:22:44] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:22:44] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:22:44] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:22:44] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:22:44] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:22:44] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:22:44] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 2 ms to minimize.
[2024-05-24 03:22:44] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:22:44] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:22:44] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:22:44] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:22:44] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-24 03:22:44] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:22:44] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:22:44] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:22:44] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:22:45] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:22:45] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:22:45] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:22:45] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:22:45] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-05-24 03:22:45] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:22:45] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:22:45] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 0 ms to minimize.
[2024-05-24 03:22:45] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:22:45] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:22:45] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:22:45] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:22:45] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:22:45] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:22:45] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:22:46] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-24 03:22:46] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:22:46] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:22:46] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:22:46] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:22:46] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
[2024-05-24 03:22:46] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:22:46] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:22:46] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:22:46] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:22:46] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 0 ms to minimize.
[2024-05-24 03:22:46] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:22:46] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:22:46] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:22:46] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-24 03:22:47] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:22:47] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 0 ms to minimize.
[2024-05-24 03:22:47] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:22:47] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:22:47] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:22:47] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-24 03:22:48] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:22:48] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:22:48] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 0 ms to minimize.
[2024-05-24 03:22:48] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:22:48] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:22:48] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:22:48] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:22:48] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:22:48] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:22:49] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:22:49] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:22:49] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:22:49] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:22:49] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:22:49] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:22:49] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:22:49] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:22:49] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:22:49] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:22:49] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-24 03:22:49] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:22:50] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:22:50] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:22:50] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:22:50] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:22:50] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 6/121 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-24 03:22:50] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:22:51] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 0 ms to minimize.
[2024-05-24 03:22:51] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-24 03:22:52] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:22:52] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-24 03:22:53] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:22:53] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-24 03:22:53] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:22:53] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:22:54] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:22:54] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:22:54] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:22:54] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:22:54] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/126 variables, 9/135 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-24 03:22:55] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:22:55] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:22:55] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:22:55] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:22:55] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/126 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-24 03:22:56] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:22:56] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:22:57] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/126 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-24 03:22:57] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:22:57] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:22:58] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/126 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/126 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 16 (OVERLAPS) 238/364 variables, 126/272 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-24 03:23:00] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:23:00] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:23:00] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:23:01] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:23:01] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:23:01] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:23:01] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:23:01] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:23:01] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/364 variables, 9/281 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/364 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 19 (OVERLAPS) 1/365 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-24 03:23:05] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/365 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/365 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/365 variables, and 283 constraints, problems are : Problem set: 0 solved, 247 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 141/141 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 141/156 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (OVERLAPS) 238/364 variables, 126/282 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 247/529 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-24 03:23:14] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:23:14] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 2/531 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-05-24 03:23:19] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:23:20] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 2/533 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 10 (OVERLAPS) 1/365 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/365 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/365 variables, and 534 constraints, problems are : Problem set: 0 solved, 247 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 145/145 constraints]
After SMT, in 60259ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 60277ms
Starting structural reductions in LTL mode, iteration 1 : 126/163 places, 248/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60811 ms. Remains : 126/163 places, 248/319 transitions.
Support contains 87 out of 126 places after structural reductions.
[2024-05-24 03:23:40] [INFO ] Flatten gal took : 44 ms
[2024-05-24 03:23:40] [INFO ] Flatten gal took : 38 ms
[2024-05-24 03:23:40] [INFO ] Input system was already deterministic with 248 transitions.
Support contains 77 out of 126 places (down from 87) after GAL structural reductions.
RANDOM walk for 40000 steps (3696 resets) in 1791 ms. (22 steps per ms) remains 31/55 properties
BEST_FIRST walk for 4003 steps (46 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (47 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (47 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (49 resets) in 29 ms. (133 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (44 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (50 resets) in 39 ms. (100 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (46 resets) in 34 ms. (114 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (44 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (47 resets) in 9 ms. (400 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (45 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (52 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (44 resets) in 21 ms. (182 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (48 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (48 resets) in 17 ms. (222 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4004 steps (47 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (46 resets) in 10 ms. (363 steps per ms) remains 28/30 properties
BEST_FIRST walk for 4004 steps (45 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (48 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (45 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (46 resets) in 20 ms. (190 steps per ms) remains 26/28 properties
BEST_FIRST walk for 4003 steps (46 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (46 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (45 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (47 resets) in 11 ms. (333 steps per ms) remains 23/26 properties
BEST_FIRST walk for 4003 steps (48 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (44 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (43 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (43 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
[2024-05-24 03:23:41] [INFO ] Flow matrix only has 239 transitions (discarded 9 similar events)
[2024-05-24 03:23:41] [INFO ] Invariant cache hit.
[2024-05-24 03:23:41] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 49/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 44/126 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-24 03:23:41] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
Problem AtomicPropp24 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/16 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 238/364 variables, 126/142 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/142 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 1/365 variables, 1/143 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 0/365 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 143 constraints, problems are : Problem set: 1 solved, 22 unsolved in 1014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 50/82 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-05-24 03:23:42] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:23:42] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:23:42] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:23:42] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:23:42] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:23:42] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:23:43] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:23:43] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:23:43] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 0 ms to minimize.
[2024-05-24 03:23:43] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 0 ms to minimize.
[2024-05-24 03:23:43] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:23:43] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:23:43] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 13/20 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-05-24 03:23:43] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-05-24 03:23:43] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 2/22 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-05-24 03:23:43] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 1/23 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 44/126 variables, 8/31 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 1/32 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-05-24 03:23:43] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2024-05-24 03:23:43] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:23:43] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:23:43] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:23:43] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:23:44] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-05-24 03:23:44] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:23:44] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:23:44] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:23:44] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:23:44] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:23:44] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:23:44] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:23:44] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-24 03:23:44] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:23:44] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:23:44] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2024-05-24 03:23:44] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:23:44] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 19/51 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 238/364 variables, 126/177 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/364 variables, 22/199 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-05-24 03:23:44] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 0 ms to minimize.
[2024-05-24 03:23:45] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:23:45] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:23:45] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:23:45] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:23:45] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:23:45] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/364 variables, 7/206 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/364 variables, 0/206 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 1/365 variables, 1/207 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-05-24 03:23:45] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 1/208 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/365 variables, 0/208 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 17 (OVERLAPS) 0/365 variables, 0/208 constraints. Problems are: Problem set: 1 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 208 constraints, problems are : Problem set: 1 solved, 22 unsolved in 3963 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 22/23 constraints, Known Traps: 44/44 constraints]
After SMT, in 4995ms problems are : Problem set: 1 solved, 22 unsolved
Fused 22 Parikh solutions to 17 different solutions.
Parikh walk visited 15 properties in 1731 ms.
Support contains 10 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 248/248 transitions.
Graph (trivial) has 162 edges and 126 vertex of which 4 / 126 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 541 edges and 124 vertex of which 121 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 121 transition count 233
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 120 transition count 232
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 55 place count 70 transition count 132
Iterating global reduction 2 with 50 rules applied. Total rules applied 105 place count 70 transition count 132
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 114 place count 61 transition count 114
Iterating global reduction 2 with 9 rules applied. Total rules applied 123 place count 61 transition count 114
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 131 place count 61 transition count 106
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 133 place count 59 transition count 100
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 59 transition count 100
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 137 place count 57 transition count 96
Iterating global reduction 3 with 2 rules applied. Total rules applied 139 place count 57 transition count 96
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 144 place count 57 transition count 91
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 146 place count 56 transition count 90
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 158 place count 50 transition count 128
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 164 place count 50 transition count 122
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 168 place count 50 transition count 118
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 172 place count 46 transition count 118
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 174 place count 46 transition count 116
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 175 place count 46 transition count 250
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 177 place count 45 transition count 249
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 180 place count 45 transition count 246
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 181 place count 44 transition count 199
Iterating global reduction 6 with 1 rules applied. Total rules applied 182 place count 44 transition count 199
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 183 place count 43 transition count 197
Iterating global reduction 6 with 1 rules applied. Total rules applied 184 place count 43 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 187 place count 43 transition count 194
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 199 place count 43 transition count 182
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 211 place count 43 transition count 182
Applied a total of 211 rules in 98 ms. Remains 43 /126 variables (removed 83) and now considering 182/248 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 43/126 places, 182/248 transitions.
RANDOM walk for 40000 steps (3880 resets) in 472 ms. (84 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (643 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (668 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
[2024-05-24 03:23:48] [INFO ] Flow matrix only has 137 transitions (discarded 45 similar events)
// Phase 1: matrix 137 rows 43 cols
[2024-05-24 03:23:48] [INFO ] Computed 12 invariants in 1 ms
[2024-05-24 03:23:48] [INFO ] State equation strengthened by 27 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/43 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 137/180 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 27/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/180 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 82 constraints, problems are : Problem set: 0 solved, 2 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 43/43 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/43 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 137/180 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 27/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/180 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 84 constraints, problems are : Problem set: 0 solved, 2 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 43/43 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 144ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 49 ms.
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 182/182 transitions.
Graph (complete) has 266 edges and 43 vertex of which 39 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
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 0 with 4 rules applied. Total rules applied 5 place count 37 transition count 180
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 0 with 4 rules applied. Total rules applied 9 place count 35 transition count 182
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 35 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 34 transition count 182
Applied a total of 11 rules in 17 ms. Remains 34 /43 variables (removed 9) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 34/43 places, 182/182 transitions.
RANDOM walk for 40000 steps (3920 resets) in 195 ms. (204 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (678 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (648 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 3711 steps, run visited all 2 properties in 24 ms. (steps per millisecond=154 )
Probabilistic random walk after 3711 steps, saw 1011 distinct states, run finished after 27 ms. (steps per millisecond=137 ) properties seen :2
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2024-05-24 03:23:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-24 03:23:49] [INFO ] Flatten gal took : 14 ms
FORMULA HealthRecord-PT-15-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 03:23:49] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:23:49] [INFO ] Input system was already deterministic with 248 transitions.
Support contains 65 out of 126 places (down from 69) after GAL structural reductions.
Computed a total of 13 stabilizing places and 22 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Graph (trivial) has 111 edges and 126 vertex of which 4 / 126 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 79 transition count 162
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 79 transition count 162
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 95 place count 75 transition count 154
Iterating global reduction 0 with 4 rules applied. Total rules applied 99 place count 75 transition count 154
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 102 place count 75 transition count 151
Applied a total of 102 rules in 15 ms. Remains 75 /126 variables (removed 51) and now considering 151/248 (removed 97) transitions.
[2024-05-24 03:23:49] [INFO ] Flow matrix only has 147 transitions (discarded 4 similar events)
// Phase 1: matrix 147 rows 75 cols
[2024-05-24 03:23:49] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:23:49] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-24 03:23:49] [INFO ] Flow matrix only has 147 transitions (discarded 4 similar events)
[2024-05-24 03:23:49] [INFO ] Invariant cache hit.
[2024-05-24 03:23:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:23:49] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-05-24 03:23:49] [INFO ] Redundant transitions in 15 ms returned []
Running 150 sub problems to find dead transitions.
[2024-05-24 03:23:49] [INFO ] Flow matrix only has 147 transitions (discarded 4 similar events)
[2024-05-24 03:23:49] [INFO ] Invariant cache hit.
[2024-05-24 03:23:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-24 03:23:49] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:23:49] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:23:49] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 146/221 variables, 75/87 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 1/222 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-24 03:23:51] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 0 ms to minimize.
[2024-05-24 03:23:51] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 90 constraints, problems are : Problem set: 0 solved, 150 unsolved in 4334 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-24 03:23:53] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-24 03:23:54] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:23:54] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:23:54] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:23:54] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-24 03:23:54] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-24 03:23:54] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:23:54] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:23:55] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 146/221 variables, 75/98 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 150/248 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (OVERLAPS) 1/222 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 12 (OVERLAPS) 0/222 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 249 constraints, problems are : Problem set: 0 solved, 150 unsolved in 8059 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 14/14 constraints]
After SMT, in 12467ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 12470ms
Starting structural reductions in SI_CTL mode, iteration 1 : 75/126 places, 151/248 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12609 ms. Remains : 75/126 places, 151/248 transitions.
[2024-05-24 03:24:01] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:24:01] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:24:01] [INFO ] Input system was already deterministic with 151 transitions.
[2024-05-24 03:24:01] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:24:01] [INFO ] Flatten gal took : 14 ms
[2024-05-24 03:24:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality8040143886317404068.gal : 3 ms
[2024-05-24 03:24:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality16968491311001116810.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8040143886317404068.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16968491311001116810.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,5.34393e+06,6.02787,174244,2,27216,5,601146,6,0,446,770148,0


Converting to forward existential form...Done !
original formula: AG(((((p150==0)||(p145==1)) * (AF(EG(((p149==0)||(p118==1)))) + ((AG((p150==0)) * !(A(((p75==0)||(p98==1)) U (p34==1)))) * ((p48==0)&&(p5...371
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !((((p150==0)||(p145==1)) * (!(EG(!(EG(((p149==0)||(p118==1)))))) + ((!(E(TRUE U !((p150=...1449
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t10, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t...576
Detected timeout of ITS tools.
[2024-05-24 03:24:31] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:24:31] [INFO ] Applying decomposition
[2024-05-24 03:24:31] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14899985505212266949.txt' '-o' '/tmp/graph14899985505212266949.bin' '-w' '/tmp/graph14899985505212266949.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14899985505212266949.bin' '-l' '-1' '-v' '-w' '/tmp/graph14899985505212266949.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:24:31] [INFO ] Decomposing Gal with order
[2024-05-24 03:24:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:24:31] [INFO ] Removed a total of 132 redundant transitions.
[2024-05-24 03:24:32] [INFO ] Flatten gal took : 47 ms
[2024-05-24 03:24:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 6 ms.
[2024-05-24 03:24:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality1780882318152791514.gal : 3 ms
[2024-05-24 03:24:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality9890907286035915741.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1780882318152791514.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9890907286035915741.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
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,5.34393e+06,0.373801,15152,404,280,16839,6225,302,42569,162,28939,0


Converting to forward existential form...Done !
original formula: AG(((((i1.u15.p150==0)||(i1.u2.p145==1)) * (AF(EG(((i1.u2.p149==0)||(i9.u11.p118==1)))) + ((AG((i1.u15.p150==0)) * !(A(((u7.p75==0)||(i9....509
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !((((i1.u15.p150==0)||(i1.u2.p145==1)) * (!(EG(!(EG(((i1.u2.p149==0)||(i9.u11.p118==1))))...1851
Reverse transition relation is NOT exact ! Due to transitions t10, t17, t77, t78, t97, t98, t99, t101, t110, t112, t124, t130, t141, u3.t76, u4.t67, u4.t68...785
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,0,1.54565,58448,1,0,96667,16366,1869,196469,833,78288,221384
FORMULA HealthRecord-PT-15-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 65 transition count 132
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 65 transition count 132
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 55 transition count 112
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 55 transition count 112
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 151 place count 55 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 154 place count 52 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 157 place count 52 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 160 place count 49 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 163 place count 49 transition count 88
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 172 place count 49 transition count 79
Applied a total of 172 rules in 13 ms. Remains 49 /126 variables (removed 77) and now considering 79/248 (removed 169) transitions.
[2024-05-24 03:24:33] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
// Phase 1: matrix 76 rows 49 cols
[2024-05-24 03:24:33] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:24:33] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-24 03:24:33] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2024-05-24 03:24:33] [INFO ] Invariant cache hit.
[2024-05-24 03:24:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:24:33] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-24 03:24:33] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2024-05-24 03:24:33] [INFO ] Invariant cache hit.
[2024-05-24 03:24:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-24 03:24:34] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 8 ms to minimize.
[2024-05-24 03:24:34] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 75/124 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 1/125 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 61 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1270 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-24 03:24:35] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 75/124 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 78/139 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 1/125 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 0/125 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 140 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1749 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 3/3 constraints]
After SMT, in 3038ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 3039ms
Starting structural reductions in LTL mode, iteration 1 : 49/126 places, 79/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3157 ms. Remains : 49/126 places, 79/248 transitions.
[2024-05-24 03:24:36] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:24:36] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:24:36] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-24 03:24:36] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:24:36] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:24:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality2650275773165321875.gal : 1 ms
[2024-05-24 03:24:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality8160401309377104579.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2650275773165321875.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8160401309377104579.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,484794,0.095452,7952,2,1824,5,21471,6,0,271,19214,0


Converting to forward existential form...Done !
original formula: AG(AF(AX(AG((p83==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(!(EX(!(!(E(TRUE U !((p83==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t15, t17, t19, Intersection with reachab...227
(forward)formula 0,0,0.410697,18484,1,0,143,73138,182,68,2037,63079,177
FORMULA HealthRecord-PT-15-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 69 transition count 140
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 69 transition count 140
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 123 place count 60 transition count 122
Iterating global reduction 0 with 9 rules applied. Total rules applied 132 place count 60 transition count 122
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 138 place count 60 transition count 116
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 59 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 59 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 58 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 58 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 145 place count 58 transition count 108
Applied a total of 145 rules in 7 ms. Remains 58 /126 variables (removed 68) and now considering 108/248 (removed 140) transitions.
[2024-05-24 03:24:37] [INFO ] Flow matrix only has 105 transitions (discarded 3 similar events)
// Phase 1: matrix 105 rows 58 cols
[2024-05-24 03:24:37] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:24:37] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 03:24:37] [INFO ] Flow matrix only has 105 transitions (discarded 3 similar events)
[2024-05-24 03:24:37] [INFO ] Invariant cache hit.
[2024-05-24 03:24:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:24:37] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2024-05-24 03:24:37] [INFO ] Flow matrix only has 105 transitions (discarded 3 similar events)
[2024-05-24 03:24:37] [INFO ] Invariant cache hit.
[2024-05-24 03:24:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-24 03:24:37] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:24:37] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-24 03:24:37] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 104/162 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 1/163 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/163 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 71 constraints, problems are : Problem set: 0 solved, 107 unsolved in 1841 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-24 03:24:39] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:24:39] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:24:39] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 104/162 variables, 58/73 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 107/180 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 1/163 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 0/163 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 181 constraints, problems are : Problem set: 0 solved, 107 unsolved in 3392 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 6/6 constraints]
After SMT, in 5273ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 5275ms
Starting structural reductions in LTL mode, iteration 1 : 58/126 places, 108/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5378 ms. Remains : 58/126 places, 108/248 transitions.
[2024-05-24 03:24:42] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:24:42] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:24:42] [INFO ] Input system was already deterministic with 108 transitions.
[2024-05-24 03:24:42] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:24:42] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:24:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality14958326633368044679.gal : 1 ms
[2024-05-24 03:24:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality13983642146445709262.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14958326633368044679.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13983642146445709262.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.21379e+06,0.183289,11052,2,1889,5,34896,6,0,336,34132,0


Converting to forward existential form...Done !
original formula: (AG(((p94==0)||(p149==1))) + AX(EF(((EX((p87==0)) * (AG((p91==0)) + E((p150==0) U (p139==1)))) * (p8==0)))))
=> equivalent forward existential formula: [(EY((Init * !(!(E(TRUE U !(((p94==0)||(p149==1)))))))) * !(E(TRUE U ((EX((p87==0)) * (!(E(TRUE U !((p91==0)))) ...206
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...353
(forward)formula 0,1,1.87516,68008,1,0,318,348872,243,146,2566,358132,352
FORMULA HealthRecord-PT-15-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 65 transition count 132
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 65 transition count 132
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 131 place count 56 transition count 114
Iterating global reduction 0 with 9 rules applied. Total rules applied 140 place count 56 transition count 114
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 146 place count 56 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 148 place count 54 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 150 place count 54 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 152 place count 52 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 154 place count 52 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 160 place count 52 transition count 92
Applied a total of 160 rules in 5 ms. Remains 52 /126 variables (removed 74) and now considering 92/248 (removed 156) transitions.
[2024-05-24 03:24:44] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
// Phase 1: matrix 89 rows 52 cols
[2024-05-24 03:24:44] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:24:44] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-24 03:24:44] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2024-05-24 03:24:44] [INFO ] Invariant cache hit.
[2024-05-24 03:24:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:24:44] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-05-24 03:24:44] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2024-05-24 03:24:44] [INFO ] Invariant cache hit.
[2024-05-24 03:24:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 03:24:44] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:24:45] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 88/140 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 1/141 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/141 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 64 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1590 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 03:24:46] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 88/140 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 91/155 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 1/141 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/141 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 156 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2308 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 3/3 constraints]
After SMT, in 3933ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 3936ms
Starting structural reductions in LTL mode, iteration 1 : 52/126 places, 92/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4041 ms. Remains : 52/126 places, 92/248 transitions.
[2024-05-24 03:24:48] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:24:48] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:24:48] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-24 03:24:48] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:24:48] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:24:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality2701547897132013604.gal : 1 ms
[2024-05-24 03:24:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality873134965041624876.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2701547897132013604.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality873134965041624876.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,622575,0.078305,6988,2,1399,5,16206,6,0,296,14703,0


Converting to forward existential form...Done !
original formula: EX(EG((AG((p124!=0)) + ((p155==0)&&(p139==1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),(!(E(TRUE U !((p124!=0)))) + ((p155==0)&&(p139==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, t17, t19, t21, t23, t86, ...252
(forward)formula 0,0,0.30765,14644,1,0,158,49297,209,71,2234,41014,198
FORMULA HealthRecord-PT-15-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Graph (trivial) has 177 edges and 126 vertex of which 6 / 126 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 60 place count 63 transition count 131
Iterating global reduction 0 with 59 rules applied. Total rules applied 119 place count 63 transition count 131
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 129 place count 53 transition count 111
Iterating global reduction 0 with 10 rules applied. Total rules applied 139 place count 53 transition count 111
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 148 place count 53 transition count 102
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 151 place count 50 transition count 93
Iterating global reduction 1 with 3 rules applied. Total rules applied 154 place count 50 transition count 93
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 157 place count 47 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 160 place count 47 transition count 87
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 169 place count 47 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 172 place count 47 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 176 place count 45 transition count 73
Applied a total of 176 rules in 17 ms. Remains 45 /126 variables (removed 81) and now considering 73/248 (removed 175) transitions.
[2024-05-24 03:24:48] [INFO ] Flow matrix only has 67 transitions (discarded 6 similar events)
// Phase 1: matrix 67 rows 45 cols
[2024-05-24 03:24:48] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:24:48] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-24 03:24:48] [INFO ] Flow matrix only has 67 transitions (discarded 6 similar events)
[2024-05-24 03:24:48] [INFO ] Invariant cache hit.
[2024-05-24 03:24:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:24:49] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-05-24 03:24:49] [INFO ] Redundant transitions in 10 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-24 03:24:49] [INFO ] Flow matrix only has 67 transitions (discarded 6 similar events)
[2024-05-24 03:24:49] [INFO ] Invariant cache hit.
[2024-05-24 03:24:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 2/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-24 03:24:49] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-24 03:24:49] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 5/45 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 66/111 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 1/112 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/112 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 58 constraints, problems are : Problem set: 0 solved, 59 unsolved in 995 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 2/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 5/45 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 66/111 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 59/116 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 1/112 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 12 (OVERLAPS) 0/112 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 117 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1168 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 2/2 constraints]
After SMT, in 2181ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 2181ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/126 places, 73/248 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2315 ms. Remains : 45/126 places, 73/248 transitions.
[2024-05-24 03:24:51] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:24:51] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:24:51] [INFO ] Input system was already deterministic with 73 transitions.
[2024-05-24 03:24:51] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:24:51] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:24:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality868891764265522824.gal : 1 ms
[2024-05-24 03:24:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality5325906379469271320.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality868891764265522824.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5325906379469271320.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,484789,0.141113,9532,2,2024,5,28546,6,0,242,23093,0


Converting to forward existential form...Done !
original formula: EG((p65==0))
=> equivalent forward existential formula: [FwdG(Init,(p65==0))] != FALSE
Hit Full ! (commute/partial/dont) 70/0/3
(forward)formula 0,1,0.447777,19640,1,0,8,87014,19,4,1332,51219,8
FORMULA HealthRecord-PT-15-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 67 transition count 135
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 67 transition count 135
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 127 place count 58 transition count 117
Iterating global reduction 0 with 9 rules applied. Total rules applied 136 place count 58 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 145 place count 58 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 147 place count 56 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 149 place count 56 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 151 place count 54 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 153 place count 54 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 159 place count 54 transition count 92
Applied a total of 159 rules in 8 ms. Remains 54 /126 variables (removed 72) and now considering 92/248 (removed 156) transitions.
[2024-05-24 03:24:51] [INFO ] Flow matrix only has 88 transitions (discarded 4 similar events)
// Phase 1: matrix 88 rows 54 cols
[2024-05-24 03:24:51] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:24:51] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-24 03:24:51] [INFO ] Flow matrix only has 88 transitions (discarded 4 similar events)
[2024-05-24 03:24:51] [INFO ] Invariant cache hit.
[2024-05-24 03:24:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:24:51] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-05-24 03:24:51] [INFO ] Flow matrix only has 88 transitions (discarded 4 similar events)
[2024-05-24 03:24:51] [INFO ] Invariant cache hit.
[2024-05-24 03:24:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 03:24:52] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:24:52] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-24 03:24:52] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 87/141 variables, 54/67 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 1/142 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 0/142 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 68 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1760 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 87/141 variables, 54/67 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 91/158 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 1/142 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/142 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 159 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2111 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 3/3 constraints]
After SMT, in 3895ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 3896ms
Starting structural reductions in LTL mode, iteration 1 : 54/126 places, 92/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4018 ms. Remains : 54/126 places, 92/248 transitions.
[2024-05-24 03:24:55] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:24:55] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:24:55] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-24 03:24:55] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:24:55] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:24:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality18198852968851661687.gal : 1 ms
[2024-05-24 03:24:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality2802120670459823733.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18198852968851661687.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2802120670459823733.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,648819,0.085098,7248,2,1514,5,18114,6,0,301,16075,0


Converting to forward existential form...Done !
original formula: EG(EF(EX(((p2!=0)&&(p99!=1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U EX(((p2!=0)&&(p99!=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, t17, t19, t21, t23, t24, t...282
(forward)formula 0,1,1.34284,49972,1,0,289,232056,206,153,2276,275355,288
FORMULA HealthRecord-PT-15-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 69 transition count 140
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 69 transition count 140
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 122 place count 61 transition count 124
Iterating global reduction 0 with 8 rules applied. Total rules applied 130 place count 61 transition count 124
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 139 place count 61 transition count 115
Applied a total of 139 rules in 6 ms. Remains 61 /126 variables (removed 65) and now considering 115/248 (removed 133) transitions.
[2024-05-24 03:24:57] [INFO ] Flow matrix only has 112 transitions (discarded 3 similar events)
// Phase 1: matrix 112 rows 61 cols
[2024-05-24 03:24:57] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:24:57] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 03:24:57] [INFO ] Flow matrix only has 112 transitions (discarded 3 similar events)
[2024-05-24 03:24:57] [INFO ] Invariant cache hit.
[2024-05-24 03:24:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:24:57] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2024-05-24 03:24:57] [INFO ] Flow matrix only has 112 transitions (discarded 3 similar events)
[2024-05-24 03:24:57] [INFO ] Invariant cache hit.
[2024-05-24 03:24:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-24 03:24:57] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:24:57] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:24:57] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:24:57] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-24 03:24:58] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 111/172 variables, 61/75 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 1/173 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 0/173 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 76 constraints, problems are : Problem set: 0 solved, 114 unsolved in 2734 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-24 03:25:00] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:25:00] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-24 03:25:00] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:25:00] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:25:00] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-24 03:25:00] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:25:00] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-24 03:25:00] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 111/172 variables, 61/83 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 114/197 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 1/173 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/173 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (OVERLAPS) 0/173 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 198 constraints, problems are : Problem set: 0 solved, 114 unsolved in 4295 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 13/13 constraints]
After SMT, in 7065ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 7067ms
Starting structural reductions in LTL mode, iteration 1 : 61/126 places, 115/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7215 ms. Remains : 61/126 places, 115/248 transitions.
[2024-05-24 03:25:04] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:25:04] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:25:04] [INFO ] Input system was already deterministic with 115 transitions.
[2024-05-24 03:25:04] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:25:04] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:25:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality18074630658596183206.gal : 1 ms
[2024-05-24 03:25:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality2576392706966146132.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18074630658596183206.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2576392706966146132.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.10153e+06,0.29201,15324,2,3801,5,55478,6,0,355,50269,0


Converting to forward existential form...Done !
original formula: EG(A((p26==1) U (EX(A(((p101==0)||(p9==1)) U (p153==1))) * !(AG((p127==0))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!((EX(!((E(!((p153==1)) U (!(((p101==0)||(p9==1))) * !((p153==1)))) + EG(!((p153==1)))))) * !(!(...465
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...348
(forward)formula 0,0,11.6182,346560,1,0,496,1.9562e+06,267,258,2774,1.97212e+06,660
FORMULA HealthRecord-PT-15-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 68 transition count 138
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 68 transition count 138
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 126 place count 58 transition count 118
Iterating global reduction 0 with 10 rules applied. Total rules applied 136 place count 58 transition count 118
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 58 transition count 110
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 146 place count 56 transition count 104
Iterating global reduction 1 with 2 rules applied. Total rules applied 148 place count 56 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 149 place count 55 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 150 place count 55 transition count 102
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 153 place count 55 transition count 99
Applied a total of 153 rules in 9 ms. Remains 55 /126 variables (removed 71) and now considering 99/248 (removed 149) transitions.
[2024-05-24 03:25:16] [INFO ] Flow matrix only has 96 transitions (discarded 3 similar events)
// Phase 1: matrix 96 rows 55 cols
[2024-05-24 03:25:16] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:25:16] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-24 03:25:16] [INFO ] Flow matrix only has 96 transitions (discarded 3 similar events)
[2024-05-24 03:25:16] [INFO ] Invariant cache hit.
[2024-05-24 03:25:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:25:16] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-24 03:25:16] [INFO ] Flow matrix only has 96 transitions (discarded 3 similar events)
[2024-05-24 03:25:16] [INFO ] Invariant cache hit.
[2024-05-24 03:25:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-24 03:25:16] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:25:16] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-24 03:25:16] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-24 03:25:16] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 95/150 variables, 55/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 1/151 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/151 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 69 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-24 03:25:18] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 95/150 variables, 55/69 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 98/167 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 1/151 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/151 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 168 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2706 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 5/5 constraints]
After SMT, in 4761ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 4763ms
Starting structural reductions in LTL mode, iteration 1 : 55/126 places, 99/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4885 ms. Remains : 55/126 places, 99/248 transitions.
[2024-05-24 03:25:20] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:25:20] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:25:20] [INFO ] Input system was already deterministic with 99 transitions.
[2024-05-24 03:25:20] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:25:20] [INFO ] Flatten gal took : 10 ms
[2024-05-24 03:25:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality17836709779920260744.gal : 1 ms
[2024-05-24 03:25:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality9982782610500218972.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17836709779920260744.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9982782610500218972.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.04661e+06,0.225193,13104,2,2942,5,46075,6,0,315,41936,0


Converting to forward existential form...Done !
original formula: AG(AX(AG(EF((((p102==0)||(p22==0))||(p26==1))))))
=> equivalent forward existential formula: [(FwdU(EY(FwdU(Init,TRUE)),TRUE) * !(E(TRUE U (((p102==0)||(p22==0))||(p26==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, t17, t18, t19, t21, t23, t...327
(forward)formula 0,1,0.823682,29304,1,0,192,124732,215,78,2358,114855,207
FORMULA HealthRecord-PT-15-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 69 transition count 140
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 69 transition count 140
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 123 place count 60 transition count 122
Iterating global reduction 0 with 9 rules applied. Total rules applied 132 place count 60 transition count 122
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 141 place count 60 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 142 place count 59 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 143 place count 59 transition count 110
Applied a total of 143 rules in 2 ms. Remains 59 /126 variables (removed 67) and now considering 110/248 (removed 138) transitions.
[2024-05-24 03:25:21] [INFO ] Flow matrix only has 107 transitions (discarded 3 similar events)
// Phase 1: matrix 107 rows 59 cols
[2024-05-24 03:25:21] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:25:21] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-24 03:25:21] [INFO ] Flow matrix only has 107 transitions (discarded 3 similar events)
[2024-05-24 03:25:21] [INFO ] Invariant cache hit.
[2024-05-24 03:25:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:25:21] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2024-05-24 03:25:21] [INFO ] Flow matrix only has 107 transitions (discarded 3 similar events)
[2024-05-24 03:25:21] [INFO ] Invariant cache hit.
[2024-05-24 03:25:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-24 03:25:22] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:25:22] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-24 03:25:22] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:25:22] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:25:22] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 106/165 variables, 59/73 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-24 03:25:23] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 1/166 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/166 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 75 constraints, problems are : Problem set: 0 solved, 109 unsolved in 2790 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-24 03:25:25] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:25:25] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:25:25] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 2 ms to minimize.
[2024-05-24 03:25:25] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 2 ms to minimize.
[2024-05-24 03:25:25] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:25:25] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-24 03:25:25] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:25:25] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:25:25] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 106/165 variables, 59/83 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 109/192 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 1/166 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (OVERLAPS) 0/166 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 193 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 15/15 constraints]
After SMT, in 6861ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 6862ms
Starting structural reductions in LTL mode, iteration 1 : 59/126 places, 110/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6972 ms. Remains : 59/126 places, 110/248 transitions.
[2024-05-24 03:25:28] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:25:28] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:25:28] [INFO ] Input system was already deterministic with 110 transitions.
[2024-05-24 03:25:28] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:25:28] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:25:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality16778511636956106132.gal : 1 ms
[2024-05-24 03:25:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality1365631029563937180.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16778511636956106132.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1365631029563937180.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.14227e+06,0.508838,23236,2,6167,5,81963,6,0,342,81088,0


Converting to forward existential form...Done !
original formula: !(A(((!((p119==0)&&((p143==0)||(p135==1))))||((p140==1)&&(!(((p36==0)||(p25==1))&&(p61==1))))) U EG(AX((p141!=1)))))
=> equivalent forward existential formula: ([((FwdU(Init,!(EG(!(EX(!((p141!=1))))))) * !(((!((p119==0)&&((p143==0)||(p135==1))))||((p140==1)&&(!(((p36==0)|...273
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...353
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,8.83186,275452,1,0,378,1.60041e+06,251,196,2623,1.58773e+06,387
FORMULA HealthRecord-PT-15-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Graph (trivial) has 170 edges and 126 vertex of which 6 / 126 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 65 transition count 136
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 65 transition count 136
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 124 place count 56 transition count 118
Iterating global reduction 0 with 9 rules applied. Total rules applied 133 place count 56 transition count 118
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 139 place count 56 transition count 112
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 142 place count 53 transition count 103
Iterating global reduction 1 with 3 rules applied. Total rules applied 145 place count 53 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 148 place count 50 transition count 97
Iterating global reduction 1 with 3 rules applied. Total rules applied 151 place count 50 transition count 97
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 160 place count 50 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 162 place count 50 transition count 86
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 2 with 2 rules applied. Total rules applied 164 place count 49 transition count 85
Applied a total of 164 rules in 13 ms. Remains 49 /126 variables (removed 77) and now considering 85/248 (removed 163) transitions.
[2024-05-24 03:25:37] [INFO ] Flow matrix only has 80 transitions (discarded 5 similar events)
// Phase 1: matrix 80 rows 49 cols
[2024-05-24 03:25:37] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:25:37] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-24 03:25:37] [INFO ] Flow matrix only has 80 transitions (discarded 5 similar events)
[2024-05-24 03:25:37] [INFO ] Invariant cache hit.
[2024-05-24 03:25:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:25:37] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-05-24 03:25:37] [INFO ] Redundant transitions in 11 ms returned []
Running 71 sub problems to find dead transitions.
[2024-05-24 03:25:37] [INFO ] Flow matrix only has 80 transitions (discarded 5 similar events)
[2024-05-24 03:25:37] [INFO ] Invariant cache hit.
[2024-05-24 03:25:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 7/49 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-24 03:25:38] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-24 03:25:38] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:25:38] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 4 ms to minimize.
[2024-05-24 03:25:38] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2024-05-24 03:25:38] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-24 03:25:38] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-24 03:25:38] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (OVERLAPS) 79/128 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 1/129 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 0/129 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 66 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1293 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 7/49 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-24 03:25:39] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 79/128 variables, 49/66 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 71/137 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 1/129 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 11 (OVERLAPS) 0/129 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 138 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1582 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 8/8 constraints]
After SMT, in 2899ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 2901ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/126 places, 85/248 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3049 ms. Remains : 49/126 places, 85/248 transitions.
[2024-05-24 03:25:40] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:25:40] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:25:40] [INFO ] Input system was already deterministic with 85 transitions.
[2024-05-24 03:25:40] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:25:40] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:25:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality5143865873234781266.gal : 0 ms
[2024-05-24 03:25:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality5168223274637778113.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5143865873234781266.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5168223274637778113.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,964229,0.277157,14588,2,2777,5,46817,6,0,273,47462,0


Converting to forward existential form...Done !
original formula: (EG((p116==0)) * A(((p35==0)||(p38==1)) U AF((p106==1))))
=> equivalent forward existential formula: [(((Init * EG((p116==0))) * !(EG(!(!(EG(!((p106==1)))))))) * !(E(!(!(EG(!((p106==1))))) U (!(((p35==0)||(p38==1)...196
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t15, t16, t17, t18, t33, t34, t35, t36...310
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,7.34528,241116,1,0,514,1.46798e+06,200,289,2072,1.43072e+06,597
FORMULA HealthRecord-PT-15-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 69 transition count 140
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 69 transition count 140
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 123 place count 60 transition count 122
Iterating global reduction 0 with 9 rules applied. Total rules applied 132 place count 60 transition count 122
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 137 place count 60 transition count 117
Applied a total of 137 rules in 8 ms. Remains 60 /126 variables (removed 66) and now considering 117/248 (removed 131) transitions.
[2024-05-24 03:25:48] [INFO ] Flow matrix only has 114 transitions (discarded 3 similar events)
// Phase 1: matrix 114 rows 60 cols
[2024-05-24 03:25:48] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:25:48] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 03:25:48] [INFO ] Flow matrix only has 114 transitions (discarded 3 similar events)
[2024-05-24 03:25:48] [INFO ] Invariant cache hit.
[2024-05-24 03:25:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:25:48] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-05-24 03:25:48] [INFO ] Flow matrix only has 114 transitions (discarded 3 similar events)
[2024-05-24 03:25:48] [INFO ] Invariant cache hit.
[2024-05-24 03:25:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-24 03:25:48] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:25:48] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 113/173 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 1/174 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 0/174 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 72 constraints, problems are : Problem set: 0 solved, 116 unsolved in 2053 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-24 03:25:50] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:25:50] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:25:50] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-24 03:25:51] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:25:51] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-24 03:25:51] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 1 ms to minimize.
[2024-05-24 03:25:51] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-24 03:25:51] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:25:51] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-24 03:25:51] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 113/173 variables, 60/81 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 116/197 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 1/174 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/174 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-24 03:25:53] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/174 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/174 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 14 (OVERLAPS) 0/174 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 199 constraints, problems are : Problem set: 0 solved, 116 unsolved in 5967 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 13/13 constraints]
After SMT, in 8061ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 8064ms
Starting structural reductions in LTL mode, iteration 1 : 60/126 places, 117/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8177 ms. Remains : 60/126 places, 117/248 transitions.
[2024-05-24 03:25:56] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:25:56] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:25:56] [INFO ] Input system was already deterministic with 117 transitions.
[2024-05-24 03:25:56] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:25:56] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:25:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality3066466560259751838.gal : 1 ms
[2024-05-24 03:25:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality12037014044236680471.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3066466560259751838.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12037014044236680471.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.52338e+06,0.316252,15612,2,2290,5,55648,6,0,353,55815,0


Converting to forward existential form...Done !
original formula: EF((E(!(((p9==0)||(p20==1))) U ((EG((p139==1)) * AG(((p46==0)||(p84==1)))) * (p17==0))) + EG(AG(AX(((p16==0)&&(p96==1)))))))
=> equivalent forward existential formula: ([(((FwdU(FwdU(Init,TRUE),!(((p9==0)||(p20==1)))) * (p17==0)) * EG((p139==1))) * !(E(TRUE U !(((p46==0)||(p84==1...254
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...383
Hit Full ! (commute/partial/dont) 112/5/5
(forward)formula 0,1,1.33495,44852,1,0,286,221050,268,118,2855,197147,320
FORMULA HealthRecord-PT-15-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 74 transition count 148
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 74 transition count 148
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 112 place count 66 transition count 132
Iterating global reduction 0 with 8 rules applied. Total rules applied 120 place count 66 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 122 place count 66 transition count 130
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 124 place count 64 transition count 124
Iterating global reduction 1 with 2 rules applied. Total rules applied 126 place count 64 transition count 124
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 128 place count 62 transition count 120
Iterating global reduction 1 with 2 rules applied. Total rules applied 130 place count 62 transition count 120
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 135 place count 62 transition count 115
Applied a total of 135 rules in 6 ms. Remains 62 /126 variables (removed 64) and now considering 115/248 (removed 133) transitions.
[2024-05-24 03:25:57] [INFO ] Flow matrix only has 110 transitions (discarded 5 similar events)
// Phase 1: matrix 110 rows 62 cols
[2024-05-24 03:25:57] [INFO ] Computed 11 invariants in 1 ms
[2024-05-24 03:25:57] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-24 03:25:57] [INFO ] Flow matrix only has 110 transitions (discarded 5 similar events)
[2024-05-24 03:25:57] [INFO ] Invariant cache hit.
[2024-05-24 03:25:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:25:57] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2024-05-24 03:25:57] [INFO ] Flow matrix only has 110 transitions (discarded 5 similar events)
[2024-05-24 03:25:57] [INFO ] Invariant cache hit.
[2024-05-24 03:25:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-24 03:25:58] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:25:58] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-05-24 03:25:58] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:25:58] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2024-05-24 03:25:58] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:25:58] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 109/171 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 1/172 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 0/172 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 80 constraints, problems are : Problem set: 0 solved, 114 unsolved in 2538 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 109/171 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 114/193 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 1/172 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 0/172 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 194 constraints, problems are : Problem set: 0 solved, 114 unsolved in 3131 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 6/6 constraints]
After SMT, in 5715ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 5717ms
Starting structural reductions in LTL mode, iteration 1 : 62/126 places, 115/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5827 ms. Remains : 62/126 places, 115/248 transitions.
[2024-05-24 03:26:03] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:26:03] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:26:03] [INFO ] Input system was already deterministic with 115 transitions.
[2024-05-24 03:26:03] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:26:03] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:26:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality12422046235388338998.gal : 1 ms
[2024-05-24 03:26:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality13857476270081679965.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12422046235388338998.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13857476270081679965.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,2.20159e+06,0.699091,27076,2,5922,5,104318,6,0,354,105308,0


Converting to forward existential form...Done !
original formula: AG((AG((A(EX(((p89==0)||(p123==1))) U !(((p24==0)||(p105==1)))) + ((AG(((p79==0)&&(p143==1))) * (p120==0)) * (p121==1)))) + AF(((p12==0)&...168
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(!(E(TRUE U !((!((E(!(!(((p24==0)||(p105==1)))) U (!(EX(((p89==0)||(p123==1)))) * !(!(...324
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...393
Hit Full ! (commute/partial/dont) 109/0/6
(forward)formula 0,0,12.9021,378792,1,0,397,2.04403e+06,265,176,2773,2.29574e+06,431
FORMULA HealthRecord-PT-15-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 70 transition count 142
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 70 transition count 142
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 121 place count 61 transition count 124
Iterating global reduction 0 with 9 rules applied. Total rules applied 130 place count 61 transition count 124
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 139 place count 61 transition count 115
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 141 place count 59 transition count 109
Iterating global reduction 1 with 2 rules applied. Total rules applied 143 place count 59 transition count 109
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 145 place count 57 transition count 105
Iterating global reduction 1 with 2 rules applied. Total rules applied 147 place count 57 transition count 105
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 153 place count 57 transition count 99
Applied a total of 153 rules in 2 ms. Remains 57 /126 variables (removed 69) and now considering 99/248 (removed 149) transitions.
[2024-05-24 03:26:16] [INFO ] Flow matrix only has 96 transitions (discarded 3 similar events)
// Phase 1: matrix 96 rows 57 cols
[2024-05-24 03:26:16] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:26:16] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 03:26:16] [INFO ] Flow matrix only has 96 transitions (discarded 3 similar events)
[2024-05-24 03:26:16] [INFO ] Invariant cache hit.
[2024-05-24 03:26:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:26:16] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-24 03:26:16] [INFO ] Flow matrix only has 96 transitions (discarded 3 similar events)
[2024-05-24 03:26:16] [INFO ] Invariant cache hit.
[2024-05-24 03:26:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-24 03:26:17] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:26:17] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 95/152 variables, 57/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-24 03:26:17] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:26:17] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:26:17] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 1/153 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/153 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 72 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2342 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 57/57 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-24 03:26:19] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:26:19] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-24 03:26:19] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-24 03:26:19] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-24 03:26:19] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 95/152 variables, 57/76 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 98/174 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 1/153 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (OVERLAPS) 0/153 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 175 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3251 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 57/57 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 10/10 constraints]
After SMT, in 5616ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 5617ms
Starting structural reductions in LTL mode, iteration 1 : 57/126 places, 99/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5707 ms. Remains : 57/126 places, 99/248 transitions.
[2024-05-24 03:26:22] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:26:22] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:26:22] [INFO ] Input system was already deterministic with 99 transitions.
[2024-05-24 03:26:22] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:26:22] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:26:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality10340197730754786195.gal : 1 ms
[2024-05-24 03:26:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality15579854393878988031.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10340197730754786195.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15579854393878988031.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.3958e+06,0.442961,20076,2,4259,5,71792,6,0,323,78339,0


Converting to forward existential form...Done !
original formula: AG(EX(((EG((p74==0)) + ((p75==0)&&(p53==1))) + ((p107==0)&&(p46==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(((EG((p74==0)) + ((p75==0)&&(p53==1))) + ((p107==0)&&(p46==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, t17, t19, t21, t23, t24, t...322
(forward)formula 0,0,7.02548,224508,1,0,348,1.29077e+06,218,157,2370,1.37187e+06,380
FORMULA HealthRecord-PT-15-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-24 03:26:29] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:26:29] [INFO ] Flatten gal took : 5 ms
Total runtime 230137 ms.

BK_STOP 1716521189497

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-15"
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-5568"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-15, 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 r180-tall-171640604200809"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-15.tgz
mv HealthRecord-PT-15 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;