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-171640604100761.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-09, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640604100761
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K 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.7K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 21:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 230K Apr 12 21:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 21:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 21: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 68K 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-09-CTLCardinality-2024-00
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-2024-01
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-2024-02
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-2024-03
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-2024-04
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-2024-05
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-2024-06
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-2024-07
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-2024-08
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-2024-09
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-2024-10
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-2024-11
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-2023-12
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-2023-13
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-2023-14
FORMULA_NAME HealthRecord-PT-09-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716520030179

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-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-24 03:07:11] [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:07:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:07:11] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-05-24 03:07:11] [INFO ] Transformed 157 places.
[2024-05-24 03:07:11] [INFO ] Transformed 327 transitions.
[2024-05-24 03:07:11] [INFO ] Found NUPN structural information;
[2024-05-24 03:07:11] [INFO ] Parsed PT model containing 157 places and 327 transitions and 859 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA HealthRecord-PT-09-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-09-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 77 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 301/301 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 117 transition count 226
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 117 transition count 226
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 115 transition count 222
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 115 transition count 222
Applied a total of 84 rules in 26 ms. Remains 115 /157 variables (removed 42) and now considering 222/301 (removed 79) transitions.
[2024-05-24 03:07:11] [INFO ] Flow matrix only has 215 transitions (discarded 7 similar events)
// Phase 1: matrix 215 rows 115 cols
[2024-05-24 03:07:11] [INFO ] Computed 13 invariants in 16 ms
[2024-05-24 03:07:11] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-24 03:07:11] [INFO ] Flow matrix only has 215 transitions (discarded 7 similar events)
[2024-05-24 03:07:11] [INFO ] Invariant cache hit.
[2024-05-24 03:07:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:07:12] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-05-24 03:07:12] [INFO ] Flow matrix only has 215 transitions (discarded 7 similar events)
[2024-05-24 03:07:12] [INFO ] Invariant cache hit.
[2024-05-24 03:07:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-24 03:07:13] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 12 ms to minimize.
[2024-05-24 03:07:13] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 2 ms to minimize.
[2024-05-24 03:07:13] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:07:13] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:07:13] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:07:13] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:07:13] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:07:13] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:07:13] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:07:13] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:07:14] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:07:14] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:07:14] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:07:14] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:07:14] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:07:14] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:07:14] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:07:14] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:07:14] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:07:14] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-24 03:07:15] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:07:15] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:07:15] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:07:15] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:07:15] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:07:15] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:07:15] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:07:15] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:07:15] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:07:15] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:07:15] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:07:15] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:07:15] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:07:16] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:07:16] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 15/48 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-24 03:07:16] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:07:16] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:07:16] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:07:16] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:07:16] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 2 ms to minimize.
[2024-05-24 03:07:16] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:07:16] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:07:16] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:07:16] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:07:16] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:07:16] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:07:16] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:07:17] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:07:17] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:07:17] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:07:17] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:07:17] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:07:17] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:07:17] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:07:17] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-24 03:07:17] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 8 ms to minimize.
[2024-05-24 03:07:17] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:07:17] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:07:17] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:07:17] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:07:17] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:07:18] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 7/75 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-24 03:07:19] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:07:19] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 2 ms to minimize.
[2024-05-24 03:07:19] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:07:19] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:07:19] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:07:19] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:07:19] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:07:19] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:07:19] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:07:19] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:07:19] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:07:19] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:07:19] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:07:20] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:07:20] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:07:20] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 16/91 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-24 03:07:20] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:07:20] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:07:20] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:07:20] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:07:20] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:07:20] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:07:20] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:07:20] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 8/99 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-24 03:07:21] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:07:21] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2024-05-24 03:07:21] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:07:21] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:07:21] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 0 ms to minimize.
[2024-05-24 03:07:21] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (OVERLAPS) 214/329 variables, 115/220 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-24 03:07:23] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:07:23] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:07:24] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:07:24] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/329 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 14 (OVERLAPS) 1/330 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-24 03:07:27] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 0 ms to minimize.
[2024-05-24 03:07:27] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:07:27] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/330 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/330 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 17 (OVERLAPS) 0/330 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 228 constraints, problems are : Problem set: 0 solved, 221 unsolved in 19686 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 99/99 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 99/112 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-24 03:07:32] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 214/329 variables, 115/228 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 221/449 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 1/330 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (OVERLAPS) 0/330 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 450 constraints, problems are : Problem set: 0 solved, 221 unsolved in 22339 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 115/115 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 100/100 constraints]
After SMT, in 42185ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 42210ms
Starting structural reductions in LTL mode, iteration 1 : 115/157 places, 222/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42619 ms. Remains : 115/157 places, 222/301 transitions.
Support contains 77 out of 115 places after structural reductions.
[2024-05-24 03:07:54] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-24 03:07:54] [INFO ] Flatten gal took : 84 ms
FORMULA HealthRecord-PT-09-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 03:07:54] [INFO ] Flatten gal took : 41 ms
[2024-05-24 03:07:54] [INFO ] Input system was already deterministic with 222 transitions.
Support contains 65 out of 115 places (down from 77) after GAL structural reductions.
FORMULA HealthRecord-PT-09-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (2369 resets) in 2314 ms. (17 steps per ms) remains 23/50 properties
BEST_FIRST walk for 4004 steps (31 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (34 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (30 resets) in 65 ms. (60 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (34 resets) in 107 ms. (37 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (36 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (30 resets) in 30 ms. (129 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (36 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (33 resets) in 21 ms. (182 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (31 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (33 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (35 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (32 resets) in 50 ms. (78 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (32 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (34 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (35 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (35 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (30 resets) in 48 ms. (81 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (30 resets) in 39 ms. (100 steps per ms) remains 19/22 properties
BEST_FIRST walk for 4004 steps (35 resets) in 29 ms. (133 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (33 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (30 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
[2024-05-24 03:07:55] [INFO ] Flow matrix only has 215 transitions (discarded 7 similar events)
[2024-05-24 03:07:55] [INFO ] Invariant cache hit.
[2024-05-24 03:07:55] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 36/65 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 50/115 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-24 03:07:56] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
Problem AtomicPropp21 is UNSAT
[2024-05-24 03:07:56] [INFO ] Deduced a trap composed of 41 places in 302 ms of which 1 ms to minimize.
[2024-05-24 03:07:56] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 1 ms to minimize.
[2024-05-24 03:07:56] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 1 ms to minimize.
[2024-05-24 03:07:57] [INFO ] Deduced a trap composed of 43 places in 189 ms of which 1 ms to minimize.
[2024-05-24 03:07:57] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 6/19 constraints. Problems are: Problem set: 1 solved, 18 unsolved
[2024-05-24 03:07:57] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 1 ms to minimize.
[2024-05-24 03:07:57] [INFO ] Deduced a trap composed of 35 places in 279 ms of which 32 ms to minimize.
[2024-05-24 03:07:57] [INFO ] Deduced a trap composed of 39 places in 204 ms of which 1 ms to minimize.
[2024-05-24 03:07:58] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-24 03:07:58] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:07:58] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2024-05-24 03:07:58] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 7/26 constraints. Problems are: Problem set: 1 solved, 18 unsolved
[2024-05-24 03:07:58] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:07:58] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:07:58] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:07:58] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:07:58] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:07:58] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 6/32 constraints. Problems are: Problem set: 1 solved, 18 unsolved
[2024-05-24 03:07:58] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-24 03:07:58] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
Problem AtomicPropp15 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/34 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-05-24 03:07:58] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 0 ms to minimize.
[2024-05-24 03:07:59] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 2 ms to minimize.
[2024-05-24 03:07:59] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:07:59] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-24 03:07:59] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:07:59] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2024-05-24 03:07:59] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:07:59] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:07:59] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:07:59] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 0 ms to minimize.
[2024-05-24 03:07:59] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:07:59] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 12/46 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-05-24 03:07:59] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 0 ms to minimize.
[2024-05-24 03:07:59] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:08:00] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 4 ms to minimize.
[2024-05-24 03:08:00] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:08:00] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 5/51 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-05-24 03:08:00] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 0 ms to minimize.
[2024-05-24 03:08:00] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 0 ms to minimize.
[2024-05-24 03:08:00] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 3/54 constraints. Problems are: Problem set: 2 solved, 17 unsolved
[2024-05-24 03:08:00] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 0 ms to minimize.
[2024-05-24 03:08:00] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 2 ms to minimize.
[2024-05-24 03:08:00] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 0 ms to minimize.
[2024-05-24 03:08:00] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/115 variables, 4/58 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/115 variables, 0/58 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 214/329 variables, 115/173 constraints. Problems are: Problem set: 2 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/329 variables, 0/173 constraints. Problems are: Problem set: 2 solved, 17 unsolved
SMT process timed out in 5030ms, After SMT, problems are : Problem set: 2 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 222/222 transitions.
Graph (trivial) has 119 edges and 115 vertex of which 10 / 115 are part of one of the 5 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (complete) has 470 edges and 110 vertex of which 108 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 108 transition count 201
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 105 transition count 198
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 11 place count 105 transition count 195
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 19 place count 100 transition count 195
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 50 place count 69 transition count 133
Iterating global reduction 2 with 31 rules applied. Total rules applied 81 place count 69 transition count 133
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 84 place count 66 transition count 127
Iterating global reduction 2 with 3 rules applied. Total rules applied 87 place count 66 transition count 127
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 94 place count 66 transition count 120
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 98 place count 64 transition count 118
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 112 place count 57 transition count 161
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 118 place count 57 transition count 155
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 131 place count 57 transition count 155
Applied a total of 131 rules in 104 ms. Remains 57 /115 variables (removed 58) and now considering 155/222 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 57/115 places, 155/222 transitions.
RANDOM walk for 40000 steps (5728 resets) in 732 ms. (54 steps per ms) remains 11/17 properties
BEST_FIRST walk for 40001 steps (1197 resets) in 148 ms. (268 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (971 resets) in 183 ms. (217 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (1643 resets) in 57 ms. (689 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1666 resets) in 82 ms. (481 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1602 resets) in 55 ms. (714 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (1658 resets) in 51 ms. (769 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1293 resets) in 60 ms. (655 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1291 resets) in 72 ms. (547 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1642 resets) in 43 ms. (909 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (965 resets) in 69 ms. (571 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1418 resets) in 53 ms. (740 steps per ms) remains 11/11 properties
[2024-05-24 03:08:01] [INFO ] Flow matrix only has 146 transitions (discarded 9 similar events)
// Phase 1: matrix 146 rows 57 cols
[2024-05-24 03:08:01] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:08:01] [INFO ] State equation strengthened by 33 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 33/57 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 146/203 variables, 57/66 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 33/99 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/203 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 99 constraints, problems are : Problem set: 0 solved, 11 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 33/57 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-24 03:08:02] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:08:02] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 0 ms to minimize.
[2024-05-24 03:08:02] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2024-05-24 03:08:02] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:08:02] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2024-05-24 03:08:02] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:08:02] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:08:02] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:08:02] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
Problem AtomicPropp24 is UNSAT
[2024-05-24 03:08:02] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:08:02] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-24 03:08:02] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:08:02] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:08:02] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:08:02] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:08:02] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:08:02] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 17/26 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/26 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 146/203 variables, 57/83 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 33/116 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 10/126 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/126 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/126 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 126 constraints, problems are : Problem set: 1 solved, 10 unsolved in 1253 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 10/11 constraints, Known Traps: 17/17 constraints]
After SMT, in 1487ms problems are : Problem set: 1 solved, 10 unsolved
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 9 properties in 229 ms.
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 155/155 transitions.
Graph (trivial) has 45 edges and 57 vertex of which 2 / 57 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 292 edges and 56 vertex of which 54 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 15 place count 41 transition count 128
Iterating global reduction 0 with 13 rules applied. Total rules applied 28 place count 41 transition count 128
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 38 place count 36 transition count 174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 35 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 35 transition count 164
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 45 place count 35 transition count 159
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 61 place count 35 transition count 159
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 65 place count 35 transition count 159
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 67 place count 33 transition count 152
Iterating global reduction 0 with 2 rules applied. Total rules applied 69 place count 33 transition count 152
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 75 place count 33 transition count 146
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 32 transition count 136
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 32 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 31 transition count 133
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 31 transition count 133
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 85 place count 31 transition count 127
Applied a total of 85 rules in 38 ms. Remains 31 /57 variables (removed 26) and now considering 127/155 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 31/57 places, 127/155 transitions.
RANDOM walk for 40000 steps (13303 resets) in 1477 ms. (27 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1467 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3183 steps, run visited all 1 properties in 20 ms. (steps per millisecond=159 )
Probabilistic random walk after 3183 steps, saw 1162 distinct states, run finished after 23 ms. (steps per millisecond=138 ) properties seen :1
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA HealthRecord-PT-09-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 03:08:03] [INFO ] Flatten gal took : 17 ms
[2024-05-24 03:08:04] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:08:04] [INFO ] Input system was already deterministic with 222 transitions.
Computed a total of 12 stabilizing places and 20 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 222/222 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 69 transition count 133
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 69 transition count 133
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 97 place count 64 transition count 122
Iterating global reduction 0 with 5 rules applied. Total rules applied 102 place count 64 transition count 122
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 109 place count 64 transition count 115
Applied a total of 109 rules in 10 ms. Remains 64 /115 variables (removed 51) and now considering 115/222 (removed 107) transitions.
[2024-05-24 03:08:04] [INFO ] Flow matrix only has 111 transitions (discarded 4 similar events)
// Phase 1: matrix 111 rows 64 cols
[2024-05-24 03:08:04] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:08:04] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 03:08:04] [INFO ] Flow matrix only has 111 transitions (discarded 4 similar events)
[2024-05-24 03:08:04] [INFO ] Invariant cache hit.
[2024-05-24 03:08:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:08:04] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2024-05-24 03:08:04] [INFO ] Flow matrix only has 111 transitions (discarded 4 similar events)
[2024-05-24 03:08:04] [INFO ] Invariant cache hit.
[2024-05-24 03:08:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-24 03:08:04] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:08:04] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:08:04] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:08:05] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 110/174 variables, 64/78 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 1/175 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 0/175 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 79 constraints, problems are : Problem set: 0 solved, 114 unsolved in 3266 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-24 03:08:07] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-05-24 03:08:07] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:08:08] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 110/174 variables, 64/81 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 114/195 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 1/175 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/175 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 12 (OVERLAPS) 0/175 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 196 constraints, problems are : Problem set: 0 solved, 114 unsolved in 3654 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 7/7 constraints]
After SMT, in 6962ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 6965ms
Starting structural reductions in LTL mode, iteration 1 : 64/115 places, 115/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7089 ms. Remains : 64/115 places, 115/222 transitions.
[2024-05-24 03:08:11] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:08:11] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:08:11] [INFO ] Input system was already deterministic with 115 transitions.
[2024-05-24 03:08:11] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:08:11] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:08:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality4107935070536359677.gal : 2 ms
[2024-05-24 03:08:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality8254315585251276791.ctl : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4107935070536359677.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8254315585251276791.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,2.63607e+06,0.876882,30936,2,5263,5,108843,6,0,364,127146,0


Converting to forward existential form...Done !
original formula: AG(!(E((((EG((p17==0)) + (p74==0)) + (p144==1)) * !((((p51==0)&&(p128==0))&&(((p24==0)||(p126==1))&&(p15==1))))) U (EX(((p93==0)&&(p21==1...220
=> equivalent forward existential formula: ([(EY(FwdU(FwdU(Init,TRUE),(((EG((p17==0)) + (p74==0)) + (p144==1)) * !((((p51==0)&&(p128==0))&&(((p24==0)||(p12...487
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...465
(forward)formula 0,0,8.47071,247968,1,0,464,1.46759e+06,268,209,2749,1.35587e+06,484
FORMULA HealthRecord-PT-09-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 222/222 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 62 transition count 120
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 62 transition count 120
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 111 place count 57 transition count 110
Iterating global reduction 0 with 5 rules applied. Total rules applied 116 place count 57 transition count 110
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 124 place count 57 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 55 transition count 96
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 55 transition count 96
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 130 place count 53 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 53 transition count 92
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 138 place count 53 transition count 86
Applied a total of 138 rules in 5 ms. Remains 53 /115 variables (removed 62) and now considering 86/222 (removed 136) transitions.
[2024-05-24 03:08:19] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
// Phase 1: matrix 83 rows 53 cols
[2024-05-24 03:08:19] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:08:19] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 03:08:19] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2024-05-24 03:08:19] [INFO ] Invariant cache hit.
[2024-05-24 03:08:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:08:19] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2024-05-24 03:08:19] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2024-05-24 03:08:19] [INFO ] Invariant cache hit.
[2024-05-24 03:08:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:08:20] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-24 03:08:20] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 82/135 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 1/136 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 65 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1984 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:08:22] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:08:22] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:08:22] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:08:22] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:08:22] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 82/135 variables, 53/69 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 85/154 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 1/136 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/136 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (OVERLAPS) 0/136 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 155 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2566 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 7/7 constraints]
After SMT, in 4613ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 4617ms
Starting structural reductions in LTL mode, iteration 1 : 53/115 places, 86/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4748 ms. Remains : 53/115 places, 86/222 transitions.
[2024-05-24 03:08:24] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:08:24] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:08:24] [INFO ] Input system was already deterministic with 86 transitions.
[2024-05-24 03:08:24] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:08:24] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:08:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality16268925218075560207.gal : 18 ms
[2024-05-24 03:08:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality989373745488904752.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/CTLCardinality16268925218075560207.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality989373745488904752.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,818676,0.135413,7424,2,1740,5,17744,6,0,294,15272,0


Converting to forward existential form...Done !
original formula: (AF((AG((p29==0)) + AX((p78==1)))) * EF(AG((p42==0))))
=> equivalent forward existential formula: ([FwdG(Init,!((!(E(TRUE U !((p29==0)))) + !(EX(!((p78==1)))))))] = FALSE * [(Init * !(E(TRUE U !(E(TRUE U !((p42...175
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t18, t20, t22, t34, t35, t...272
(forward)formula 0,0,1.49164,56332,1,0,308,270752,200,177,2176,292836,311
FORMULA HealthRecord-PT-09-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 115/115 places, 222/222 transitions.
Graph (trivial) has 159 edges and 115 vertex of which 10 / 115 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 52 place count 58 transition count 118
Iterating global reduction 0 with 51 rules applied. Total rules applied 103 place count 58 transition count 118
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 109 place count 52 transition count 105
Iterating global reduction 0 with 6 rules applied. Total rules applied 115 place count 52 transition count 105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 124 place count 52 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 127 place count 49 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 130 place count 49 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 132 place count 49 transition count 86
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 134 place count 47 transition count 82
Iterating global reduction 2 with 2 rules applied. Total rules applied 136 place count 47 transition count 82
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 142 place count 47 transition count 76
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 145 place count 47 transition count 73
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 3 with 2 rules applied. Total rules applied 147 place count 46 transition count 72
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 149 place count 44 transition count 70
Applied a total of 149 rules in 27 ms. Remains 44 /115 variables (removed 71) and now considering 70/222 (removed 152) transitions.
[2024-05-24 03:08:26] [INFO ] Flow matrix only has 62 transitions (discarded 8 similar events)
// Phase 1: matrix 62 rows 44 cols
[2024-05-24 03:08:26] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:08:26] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 03:08:26] [INFO ] Flow matrix only has 62 transitions (discarded 8 similar events)
[2024-05-24 03:08:26] [INFO ] Invariant cache hit.
[2024-05-24 03:08:26] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-24 03:08:26] [INFO ] Redundant transitions in 13 ms returned []
Running 56 sub problems to find dead transitions.
[2024-05-24 03:08:26] [INFO ] Flow matrix only has 62 transitions (discarded 8 similar events)
[2024-05-24 03:08:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 7/44 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-24 03:08:26] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-24 03:08:26] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:08:26] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:08:26] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-24 03:08:26] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 61/105 variables, 44/58 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/105 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/106 variables, and 58 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1000 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 7/44 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 61/105 variables, 44/58 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 56/114 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/105 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/106 variables, and 114 constraints, problems are : Problem set: 0 solved, 56 unsolved in 803 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 5/5 constraints]
After SMT, in 1861ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 1863ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/115 places, 70/222 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2009 ms. Remains : 44/115 places, 70/222 transitions.
[2024-05-24 03:08:28] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:08:28] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:08:28] [INFO ] Input system was already deterministic with 70 transitions.
[2024-05-24 03:08:28] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:08:28] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:08:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality11698949609545572733.gal : 1 ms
[2024-05-24 03:08:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality2086899404676800633.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/CTLCardinality11698949609545572733.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2086899404676800633.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,178206,0.048769,5528,2,854,5,8603,6,0,232,8497,0


Converting to forward existential form...Done !
original formula: EF(AG(((p109==0)||(p14==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p109==0)||(p14==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t15, t16, t31, t32, Intersection with...235
(forward)formula 0,1,0.313954,15560,1,0,131,65377,153,62,1668,50274,154
FORMULA HealthRecord-PT-09-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 115/115 places, 222/222 transitions.
Graph (trivial) has 153 edges and 115 vertex of which 10 / 115 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 50 place count 60 transition count 122
Iterating global reduction 0 with 49 rules applied. Total rules applied 99 place count 60 transition count 122
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 103 place count 56 transition count 114
Iterating global reduction 0 with 4 rules applied. Total rules applied 107 place count 56 transition count 114
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 112 place count 56 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 55 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 55 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 54 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 54 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 119 place count 54 transition count 101
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 123 place count 54 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 125 place count 53 transition count 96
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 127 place count 51 transition count 94
Applied a total of 127 rules in 27 ms. Remains 51 /115 variables (removed 64) and now considering 94/222 (removed 128) transitions.
[2024-05-24 03:08:28] [INFO ] Flow matrix only has 87 transitions (discarded 7 similar events)
// Phase 1: matrix 87 rows 51 cols
[2024-05-24 03:08:28] [INFO ] Computed 9 invariants in 3 ms
[2024-05-24 03:08:28] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-24 03:08:28] [INFO ] Flow matrix only has 87 transitions (discarded 7 similar events)
[2024-05-24 03:08:28] [INFO ] Invariant cache hit.
[2024-05-24 03:08:28] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-05-24 03:08:28] [INFO ] Redundant transitions in 13 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-24 03:08:28] [INFO ] Flow matrix only has 87 transitions (discarded 7 similar events)
[2024-05-24 03:08:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 7/51 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-24 03:08:28] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:08:28] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:08:29] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 86/137 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/137 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/138 variables, and 63 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1159 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 7/51 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-24 03:08:30] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:08:30] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:08:30] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-24 03:08:30] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:08:30] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-24 03:08:30] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:08:30] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 86/137 variables, 51/70 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 80/150 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/137 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/138 variables, and 150 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2003 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 10/10 constraints]
After SMT, in 3186ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 3187ms
Starting structural reductions in SI_CTL mode, iteration 1 : 51/115 places, 94/222 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3337 ms. Remains : 51/115 places, 94/222 transitions.
[2024-05-24 03:08:31] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:08:31] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:08:31] [INFO ] Input system was already deterministic with 94 transitions.
[2024-05-24 03:08:31] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:08:31] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:08:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality4145313555948573206.gal : 1 ms
[2024-05-24 03:08:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality2890213422592207409.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/CTLCardinality4145313555948573206.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2890213422592207409.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,327461,0.07892,6936,2,926,5,14322,6,0,285,14139,0


Converting to forward existential form...Done !
original formula: (AG((EG((p35==0)) + AG(((p147==1)||((p48==0)&&(p144==1)))))) + AG((EG((p118==0)) * EF((p93==1)))))
=> equivalent forward existential formula: ([(FwdU((Init * !(!(E(TRUE U !((EG((p35==0)) + !(E(TRUE U !(((p147==1)||((p48==0)&&(p144==1)))))))))))),TRUE) * ...327
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t2...341
(forward)formula 0,0,2.37019,77816,1,0,354,475638,211,164,2241,436235,390
FORMULA HealthRecord-PT-09-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 222/222 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 64 transition count 123
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 64 transition count 123
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 107 place count 59 transition count 113
Iterating global reduction 0 with 5 rules applied. Total rules applied 112 place count 59 transition count 113
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 120 place count 59 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 58 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 58 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 57 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 57 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 127 place count 57 transition count 97
Applied a total of 127 rules in 5 ms. Remains 57 /115 variables (removed 58) and now considering 97/222 (removed 125) transitions.
[2024-05-24 03:08:34] [INFO ] Flow matrix only has 93 transitions (discarded 4 similar events)
// Phase 1: matrix 93 rows 57 cols
[2024-05-24 03:08:34] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:08:34] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 03:08:34] [INFO ] Flow matrix only has 93 transitions (discarded 4 similar events)
[2024-05-24 03:08:34] [INFO ] Invariant cache hit.
[2024-05-24 03:08:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:08:34] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-24 03:08:34] [INFO ] Flow matrix only has 93 transitions (discarded 4 similar events)
[2024-05-24 03:08:34] [INFO ] Invariant cache hit.
[2024-05-24 03:08:34] [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, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-24 03:08:34] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:08:34] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (OVERLAPS) 92/149 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 1/150 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 0/150 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 70 constraints, problems are : Problem set: 0 solved, 96 unsolved in 1904 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-24 03:08:36] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:08:36] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:08:36] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:08:36] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 92/149 variables, 57/73 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 96/169 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-24 03:08:37] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 1/150 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/150 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (OVERLAPS) 0/150 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 171 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3134 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 7/7 constraints]
After SMT, in 5063ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 5065ms
Starting structural reductions in LTL mode, iteration 1 : 57/115 places, 97/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5163 ms. Remains : 57/115 places, 97/222 transitions.
[2024-05-24 03:08:39] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:08:39] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:08:39] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-24 03:08:39] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:08:39] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:08:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality5392287491780516849.gal : 1 ms
[2024-05-24 03:08:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality7947151024610327080.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/CTLCardinality5392287491780516849.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7947151024610327080.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,1.04175e+06,0.084742,7232,2,1292,5,16418,6,0,318,16194,0


Converting to forward existential form...Done !
original formula: AG(((EX(EG(EF(((p68==0)||(p27==1))))) + (p5==1)) + AX(((p7==0)||(p145==1)))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !((EX(EG(E(TRUE U ((p68==0)||(p27==1))))) + (p5==1))))) * !(((p7==0)||(p145==1))))] = FA...158
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t21, t23, t...302
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,2.57573,82496,1,0,307,489606,221,185,2468,471681,353
FORMULA HealthRecord-PT-09-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 222/222 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 64 transition count 123
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 64 transition count 123
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 106 place count 60 transition count 115
Iterating global reduction 0 with 4 rules applied. Total rules applied 110 place count 60 transition count 115
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 116 place count 60 transition count 109
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 118 place count 58 transition count 103
Iterating global reduction 1 with 2 rules applied. Total rules applied 120 place count 58 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 122 place count 56 transition count 99
Iterating global reduction 1 with 2 rules applied. Total rules applied 124 place count 56 transition count 99
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 130 place count 56 transition count 93
Applied a total of 130 rules in 5 ms. Remains 56 /115 variables (removed 59) and now considering 93/222 (removed 129) transitions.
[2024-05-24 03:08:42] [INFO ] Flow matrix only has 89 transitions (discarded 4 similar events)
// Phase 1: matrix 89 rows 56 cols
[2024-05-24 03:08:42] [INFO ] Computed 10 invariants in 2 ms
[2024-05-24 03:08:42] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 03:08:42] [INFO ] Flow matrix only has 89 transitions (discarded 4 similar events)
[2024-05-24 03:08:42] [INFO ] Invariant cache hit.
[2024-05-24 03:08:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:08:42] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-05-24 03:08:42] [INFO ] Flow matrix only has 89 transitions (discarded 4 similar events)
[2024-05-24 03:08:42] [INFO ] Invariant cache hit.
[2024-05-24 03:08:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-24 03:08:42] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:08:42] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-05-24 03:08:42] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:08:42] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:08:42] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:08:42] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:08:42] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:08:42] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:08:42] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 88/144 variables, 56/75 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-24 03:08:43] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 1/145 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 77 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2190 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 88/144 variables, 56/76 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 92/168 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 1/145 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-24 03:08:45] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 11 (OVERLAPS) 0/145 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 170 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2909 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 11/11 constraints]
After SMT, in 5126ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 5128ms
Starting structural reductions in LTL mode, iteration 1 : 56/115 places, 93/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5226 ms. Remains : 56/115 places, 93/222 transitions.
[2024-05-24 03:08:47] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:08:47] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:08:47] [INFO ] Input system was already deterministic with 93 transitions.
[2024-05-24 03:08:47] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:08:47] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:08:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality16112672679895352760.gal : 1 ms
[2024-05-24 03:08:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality11081081433026630051.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/CTLCardinality16112672679895352760.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11081081433026630051.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,766188,0.092979,7728,2,1528,5,16778,6,0,310,17465,0


Converting to forward existential form...Done !
original formula: EF(((EG(!(E((p154==1) U ((p17==0)||(p113==1))))) * AX(AF((p149==1)))) * A((p21==1) U ((p115!=1) + AX((p48==1))))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (EG(!(E((p154==1) U ((p17==0)||(p113==1))))) * !(EX(!(!(EG(!((p149==1))))))))) * !(EG(!(((...298
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t18, t19, t20, t21, t22, t...312
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,3.09614,108456,1,0,373,669063,223,189,2312,590739,417
FORMULA HealthRecord-PT-09-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 222/222 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 72 transition count 139
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 72 transition count 139
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 91 place count 67 transition count 129
Iterating global reduction 0 with 5 rules applied. Total rules applied 96 place count 67 transition count 129
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 104 place count 67 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 66 transition count 118
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 66 transition count 118
Applied a total of 106 rules in 3 ms. Remains 66 /115 variables (removed 49) and now considering 118/222 (removed 104) transitions.
[2024-05-24 03:08:50] [INFO ] Flow matrix only has 114 transitions (discarded 4 similar events)
// Phase 1: matrix 114 rows 66 cols
[2024-05-24 03:08:50] [INFO ] Computed 10 invariants in 3 ms
[2024-05-24 03:08:50] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 03:08:50] [INFO ] Flow matrix only has 114 transitions (discarded 4 similar events)
[2024-05-24 03:08:50] [INFO ] Invariant cache hit.
[2024-05-24 03:08:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:08:50] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-05-24 03:08:50] [INFO ] Flow matrix only has 114 transitions (discarded 4 similar events)
[2024-05-24 03:08:50] [INFO ] Invariant cache hit.
[2024-05-24 03:08:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-24 03:08:50] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:08:51] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:08:51] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:08:51] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:08:51] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:08:51] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 113/179 variables, 66/82 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 1/180 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 0/180 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 83 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2942 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-24 03:08:53] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:08:53] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:08:53] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-24 03:08:54] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:08:54] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-24 03:08:54] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:08:54] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:08:54] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 113/179 variables, 66/90 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 117/207 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-24 03:08:55] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 12 (OVERLAPS) 1/180 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/180 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 14 (OVERLAPS) 0/180 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 209 constraints, problems are : Problem set: 0 solved, 117 unsolved in 5719 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 15/15 constraints]
After SMT, in 8693ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 8695ms
Starting structural reductions in LTL mode, iteration 1 : 66/115 places, 118/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8804 ms. Remains : 66/115 places, 118/222 transitions.
[2024-05-24 03:08:59] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:08:59] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:08:59] [INFO ] Input system was already deterministic with 118 transitions.
[2024-05-24 03:08:59] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:08:59] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:08:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality15832597201118106029.gal : 2 ms
[2024-05-24 03:08:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality15530577993309272673.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/CTLCardinality15832597201118106029.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15530577993309272673.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,4.97341e+06,0.554854,24064,2,4439,5,80486,6,0,376,98055,0


Converting to forward existential form...Done !
original formula: (EF(EX((((p48!=0)&&(p18!=1))||((p49!=0)&&(p124!=1))))) * E(((p98==0)||(p11==1)) U ((!(((((p74!=0) + AG((p87==1))) * (((p84==0)&&(p4==1)) ...240
=> equivalent forward existential formula: [(((FwdU((Init * E(TRUE U EX((((p48!=0)&&(p18!=1))||((p49!=0)&&(p124!=1)))))),((p98==0)||(p11==1))) * (!(((((p74...384
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...454
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 112/0/6
(forward)formula 0,1,8.02219,243492,1,0,492,1.4434e+06,283,235,2950,1.32205e+06,523
FORMULA HealthRecord-PT-09-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 222/222 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 62 transition count 120
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 62 transition count 120
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 111 place count 57 transition count 110
Iterating global reduction 0 with 5 rules applied. Total rules applied 116 place count 57 transition count 110
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 125 place count 57 transition count 101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 127 place count 55 transition count 95
Iterating global reduction 1 with 2 rules applied. Total rules applied 129 place count 55 transition count 95
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 131 place count 53 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 133 place count 53 transition count 91
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 139 place count 53 transition count 85
Applied a total of 139 rules in 6 ms. Remains 53 /115 variables (removed 62) and now considering 85/222 (removed 137) transitions.
[2024-05-24 03:09:07] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
// Phase 1: matrix 82 rows 53 cols
[2024-05-24 03:09:07] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:09:07] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-24 03:09:07] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2024-05-24 03:09:07] [INFO ] Invariant cache hit.
[2024-05-24 03:09:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:09:07] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-05-24 03:09:07] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2024-05-24 03:09:07] [INFO ] Invariant cache hit.
[2024-05-24 03:09:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-24 03:09:07] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:09:07] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 81/134 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 1/135 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 65 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1403 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-24 03:09:09] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:09:09] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:09:09] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 81/134 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 84/151 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 1/135 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/135 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 152 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2334 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 5/5 constraints]
After SMT, in 3755ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 3756ms
Starting structural reductions in LTL mode, iteration 1 : 53/115 places, 85/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3856 ms. Remains : 53/115 places, 85/222 transitions.
[2024-05-24 03:09:11] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:09:11] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:09:11] [INFO ] Input system was already deterministic with 85 transitions.
[2024-05-24 03:09:11] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:09:11] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:09:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality5314199028746119833.gal : 1 ms
[2024-05-24 03:09:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality4949377448567133492.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/CTLCardinality5314199028746119833.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4949377448567133492.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,793890,0.065327,6096,2,1273,5,11956,6,0,293,11651,0


Converting to forward existential form...Done !
original formula: EF(AX((EX(((p10==1)||(p74==1))) * (p17==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((EX(((p10==1)||(p74==1))) * (p17==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t18, t20, t22, t28, t29, t...282
(forward)formula 0,1,0.352073,15948,1,0,160,66255,183,74,2077,59165,178
FORMULA HealthRecord-PT-09-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 115/115 places, 222/222 transitions.
Graph (trivial) has 159 edges and 115 vertex of which 12 / 115 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 52 place count 58 transition count 118
Iterating global reduction 0 with 51 rules applied. Total rules applied 103 place count 58 transition count 118
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 109 place count 52 transition count 105
Iterating global reduction 0 with 6 rules applied. Total rules applied 115 place count 52 transition count 105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 124 place count 52 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 127 place count 49 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 130 place count 49 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 133 place count 49 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 135 place count 47 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 47 transition count 81
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 143 place count 47 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 147 place count 47 transition count 71
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 153 place count 44 transition count 68
Applied a total of 153 rules in 19 ms. Remains 44 /115 variables (removed 71) and now considering 68/222 (removed 154) transitions.
[2024-05-24 03:09:11] [INFO ] Flow matrix only has 60 transitions (discarded 8 similar events)
// Phase 1: matrix 60 rows 44 cols
[2024-05-24 03:09:11] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:09:11] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 03:09:11] [INFO ] Flow matrix only has 60 transitions (discarded 8 similar events)
[2024-05-24 03:09:11] [INFO ] Invariant cache hit.
[2024-05-24 03:09:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:09:11] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-24 03:09:11] [INFO ] Redundant transitions in 13 ms returned []
Running 67 sub problems to find dead transitions.
[2024-05-24 03:09:11] [INFO ] Flow matrix only has 60 transitions (discarded 8 similar events)
[2024-05-24 03:09:11] [INFO ] Invariant cache hit.
[2024-05-24 03:09:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-24 03:09:11] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-24 03:09:11] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-24 03:09:12] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:09:12] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:09:12] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-24 03:09:12] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-24 03:09:12] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:09:12] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (OVERLAPS) 59/103 variables, 44/61 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 1/104 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 10 (OVERLAPS) 0/104 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 62 constraints, problems are : Problem set: 0 solved, 67 unsolved in 1400 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-24 03:09:13] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:09:13] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:09:13] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (OVERLAPS) 59/103 variables, 44/64 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 67/131 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 1/104 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 10 (OVERLAPS) 0/104 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 132 constraints, problems are : Problem set: 0 solved, 67 unsolved in 1639 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 11/11 constraints]
After SMT, in 3054ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 3055ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/115 places, 68/222 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3173 ms. Remains : 44/115 places, 68/222 transitions.
[2024-05-24 03:09:14] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:09:14] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:09:14] [INFO ] Input system was already deterministic with 68 transitions.
[2024-05-24 03:09:14] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:09:14] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:09:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality13851200089432254663.gal : 2 ms
[2024-05-24 03:09:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality12578139146696052972.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/CTLCardinality13851200089432254663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12578139146696052972.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,164813,0.049196,5220,2,652,5,7800,6,0,235,7615,0


Converting to forward existential form...Done !
original formula: EG(((p25==0)||(p113==1)))
=> equivalent forward existential formula: [FwdG(Init,((p25==0)||(p113==1)))] != FALSE
Hit Full ! (commute/partial/dont) 62/0/6
(forward)formula 0,1,0.1236,8388,1,0,10,24402,19,4,1307,15212,9
FORMULA HealthRecord-PT-09-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 222/222 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 65 transition count 126
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 65 transition count 126
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 106 place count 59 transition count 113
Iterating global reduction 0 with 6 rules applied. Total rules applied 112 place count 59 transition count 113
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 119 place count 59 transition count 106
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 122 place count 56 transition count 98
Iterating global reduction 1 with 3 rules applied. Total rules applied 125 place count 56 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 128 place count 56 transition count 95
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 130 place count 54 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 54 transition count 91
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 137 place count 54 transition count 86
Applied a total of 137 rules in 9 ms. Remains 54 /115 variables (removed 61) and now considering 86/222 (removed 136) transitions.
[2024-05-24 03:09:14] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
// Phase 1: matrix 83 rows 54 cols
[2024-05-24 03:09:14] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:09:14] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 03:09:14] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2024-05-24 03:09:14] [INFO ] Invariant cache hit.
[2024-05-24 03:09:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:09:15] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2024-05-24 03:09:15] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2024-05-24 03:09:15] [INFO ] Invariant cache hit.
[2024-05-24 03:09:15] [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, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:09:15] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:09:15] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-24 03:09:15] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:09:15] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:09:15] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:09:15] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 82/136 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:09:15] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:09:16] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:09:16] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:09:16] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:09:16] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 1/137 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/137 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 75 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2222 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:09:17] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:09:17] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 82/136 variables, 54/76 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 85/161 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:09:18] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 1/137 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 0/137 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 163 constraints, problems are : Problem set: 0 solved, 85 unsolved in 3041 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 14/14 constraints]
After SMT, in 5283ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 5284ms
Starting structural reductions in LTL mode, iteration 1 : 54/115 places, 86/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5380 ms. Remains : 54/115 places, 86/222 transitions.
[2024-05-24 03:09:20] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:09:20] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:09:20] [INFO ] Input system was already deterministic with 86 transitions.
[2024-05-24 03:09:20] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:09:20] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:09:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality3258481748601513546.gal : 3 ms
[2024-05-24 03:09:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality10834340810569626182.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/CTLCardinality3258481748601513546.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10834340810569626182.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.04685e+06,0.217276,12696,2,3088,5,45935,6,0,298,34982,0


Converting to forward existential form...Done !
original formula: (EG((p140==0)) * E((p24==0) U !(((AG((p13==0)) * EX((p16==1))) * AX(EG((p102==1)))))))
=> equivalent forward existential formula: (([(FwdU(FwdU((Init * EG((p140==0))),(p24==0)),TRUE) * !((p13==0)))] != FALSE + [(FwdU((Init * EG((p140==0))),(p...269
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t16, t18, t20, t21, t22, t23, t37, t...327
Hit Full ! (commute/partial/dont) 83/0/3
(forward)formula 0,1,4.45721,149836,1,0,334,917243,200,153,2269,788945,354
FORMULA HealthRecord-PT-09-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 115/115 places, 222/222 transitions.
Graph (trivial) has 157 edges and 115 vertex of which 12 / 115 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 51 place count 59 transition count 120
Iterating global reduction 0 with 50 rules applied. Total rules applied 101 place count 59 transition count 120
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 107 place count 53 transition count 107
Iterating global reduction 0 with 6 rules applied. Total rules applied 113 place count 53 transition count 107
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 122 place count 53 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 124 place count 51 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 126 place count 51 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 129 place count 51 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 130 place count 50 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 131 place count 50 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 134 place count 50 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 138 place count 50 transition count 81
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 144 place count 47 transition count 78
Applied a total of 144 rules in 10 ms. Remains 47 /115 variables (removed 68) and now considering 78/222 (removed 144) transitions.
[2024-05-24 03:09:24] [INFO ] Flow matrix only has 70 transitions (discarded 8 similar events)
// Phase 1: matrix 70 rows 47 cols
[2024-05-24 03:09:24] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:09:24] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-24 03:09:24] [INFO ] Flow matrix only has 70 transitions (discarded 8 similar events)
[2024-05-24 03:09:24] [INFO ] Invariant cache hit.
[2024-05-24 03:09:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:09:24] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-05-24 03:09:24] [INFO ] Redundant transitions in 18 ms returned []
Running 77 sub problems to find dead transitions.
[2024-05-24 03:09:24] [INFO ] Flow matrix only has 70 transitions (discarded 8 similar events)
[2024-05-24 03:09:24] [INFO ] Invariant cache hit.
[2024-05-24 03:09:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-24 03:09:25] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:09:25] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 69/116 variables, 47/58 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 1/117 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 59 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1125 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-24 03:09:26] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:09:26] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 69/116 variables, 47/60 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 77/137 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 1/117 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/117 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 138 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1909 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 4/4 constraints]
After SMT, in 3054ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 3055ms
Starting structural reductions in SI_CTL mode, iteration 1 : 47/115 places, 78/222 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3183 ms. Remains : 47/115 places, 78/222 transitions.
[2024-05-24 03:09:28] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:09:28] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:09:28] [INFO ] Input system was already deterministic with 78 transitions.
[2024-05-24 03:09:28] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:09:28] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:09:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality124919929211807915.gal : 1 ms
[2024-05-24 03:09:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality10354530395516074755.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/CTLCardinality124919929211807915.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10354530395516074755.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,266693,0.04803,5228,2,754,5,7363,6,0,257,7294,0


Converting to forward existential form...Done !
original formula: AF(AG(A(((p79==0)||(p7==1)) U (p143==0))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!((E(!((p143==0)) U (!(((p79==0)||(p7==1))) * !((p143==0)))) + EG(!((p143==0))))))))))...164
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t18, t19, t36, t37...265
(forward)formula 0,0,0.470972,22436,1,0,294,94240,183,166,1938,113030,297
FORMULA HealthRecord-PT-09-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-24 03:09:28] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:09:28] [INFO ] Flatten gal took : 5 ms
Total runtime 137196 ms.

BK_STOP 1716520168618

--------------------
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-09"
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-09, 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-171640604100761"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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