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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 12 20:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 20:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Apr 12 20:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:47 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 46K 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-01-CTLFireability-2024-00
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2024-01
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2024-02
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2024-03
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2024-04
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2024-05
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2024-06
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2024-07
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2024-08
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2024-09
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2024-10
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2024-11
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2023-12
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2023-13
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2023-14
FORMULA_NAME HealthRecord-PT-01-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716518966208

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-24 02:49:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 02:49:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 02:49:27] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2024-05-24 02:49:27] [INFO ] Transformed 117 places.
[2024-05-24 02:49:27] [INFO ] Transformed 218 transitions.
[2024-05-24 02:49:27] [INFO ] Found NUPN structural information;
[2024-05-24 02:49:27] [INFO ] Parsed PT model containing 117 places and 218 transitions and 557 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 5 transitions
Reduce redundant transitions removed 5 transitions.
FORMULA HealthRecord-PT-01-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 85 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 213/213 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 107 transition count 195
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 107 transition count 195
Applied a total of 20 rules in 19 ms. Remains 107 /117 variables (removed 10) and now considering 195/213 (removed 18) transitions.
[2024-05-24 02:49:27] [INFO ] Flow matrix only has 189 transitions (discarded 6 similar events)
// Phase 1: matrix 189 rows 107 cols
[2024-05-24 02:49:27] [INFO ] Computed 12 invariants in 13 ms
[2024-05-24 02:49:27] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-24 02:49:27] [INFO ] Flow matrix only has 189 transitions (discarded 6 similar events)
[2024-05-24 02:49:27] [INFO ] Invariant cache hit.
[2024-05-24 02:49:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:49:27] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-05-24 02:49:27] [INFO ] Flow matrix only has 189 transitions (discarded 6 similar events)
[2024-05-24 02:49:27] [INFO ] Invariant cache hit.
[2024-05-24 02:49:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-24 02:49:29] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 11 ms to minimize.
[2024-05-24 02:49:29] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-24 02:49:29] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-05-24 02:49:29] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-24 02:49:29] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-24 02:49:29] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-24 02:49:29] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-24 02:49:29] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:49:29] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-24 02:49:29] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-05-24 02:49:29] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-24 02:49:29] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:49:29] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-24 02:49:29] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:49:30] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-24 02:49:30] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2024-05-24 02:49:30] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-05-24 02:49:30] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-05-24 02:49:30] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-24 02:49:30] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-24 02:49:30] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-24 02:49:30] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-24 02:49:30] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-24 02:49:30] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-24 02:49:30] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-05-24 02:49:30] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:49:31] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 0 ms to minimize.
[2024-05-24 02:49:31] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-24 02:49:31] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-05-24 02:49:31] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2024-05-24 02:49:31] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-24 02:49:31] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 2 ms to minimize.
[2024-05-24 02:49:31] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-24 02:49:31] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-24 02:49:31] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-24 02:49:31] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-24 02:49:31] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 0 ms to minimize.
[2024-05-24 02:49:32] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 0 ms to minimize.
[2024-05-24 02:49:32] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-24 02:49:32] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-24 02:49:32] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:49:32] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-24 02:49:32] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-24 02:49:33] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-24 02:49:33] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-24 02:49:34] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-24 02:49:34] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:49:34] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:49:34] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-05-24 02:49:34] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (OVERLAPS) 188/295 variables, 107/169 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/295 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 12 (OVERLAPS) 1/296 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/296 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 14 (OVERLAPS) 0/296 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 296/296 variables, and 170 constraints, problems are : Problem set: 0 solved, 194 unsolved in 11314 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 188/295 variables, 107/169 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 194/363 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 1/296 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-24 02:49:44] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 11 (OVERLAPS) 0/296 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 296/296 variables, and 365 constraints, problems are : Problem set: 0 solved, 194 unsolved in 11947 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 51/51 constraints]
After SMT, in 23378ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 23392ms
Starting structural reductions in LTL mode, iteration 1 : 107/117 places, 195/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23762 ms. Remains : 107/117 places, 195/213 transitions.
Support contains 85 out of 107 places after structural reductions.
[2024-05-24 02:49:51] [INFO ] Flatten gal took : 36 ms
[2024-05-24 02:49:51] [INFO ] Flatten gal took : 13 ms
[2024-05-24 02:49:51] [INFO ] Input system was already deterministic with 195 transitions.
Support contains 83 out of 107 places (down from 85) after GAL structural reductions.
RANDOM walk for 40000 steps (2102 resets) in 2135 ms. (18 steps per ms) remains 26/78 properties
BEST_FIRST walk for 4003 steps (31 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (27 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (28 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (28 resets) in 49 ms. (80 steps per ms) remains 23/26 properties
BEST_FIRST walk for 4004 steps (29 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (33 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (30 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (29 resets) in 10 ms. (363 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (28 resets) in 11 ms. (333 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4002 steps (36 resets) in 8 ms. (444 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (31 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (20 resets) in 9 ms. (400 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4004 steps (28 resets) in 21 ms. (182 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (30 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (31 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (32 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (31 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (29 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (32 resets) in 13 ms. (286 steps per ms) remains 17/21 properties
BEST_FIRST walk for 4004 steps (32 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
[2024-05-24 02:49:52] [INFO ] Flow matrix only has 189 transitions (discarded 6 similar events)
[2024-05-24 02:49:52] [INFO ] Invariant cache hit.
[2024-05-24 02:49:52] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 53/74 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-24 02:49:52] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:49:52] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:49:52] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-24 02:49:52] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-24 02:49:52] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-24 02:49:52] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 9 ms to minimize.
[2024-05-24 02:49:52] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-24 02:49:52] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 5 (OVERLAPS) 33/107 variables, 6/20 constraints. Problems are: Problem set: 1 solved, 16 unsolved
[2024-05-24 02:49:53] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-05-24 02:49:53] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-24 02:49:53] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-24 02:49:53] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-24 02:49:53] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 2 ms to minimize.
[2024-05-24 02:49:53] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-05-24 02:49:53] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-24 02:49:53] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-05-24 02:49:53] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-24 02:49:53] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:49:53] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-24 02:49:53] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-24 02:49:53] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:49:53] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 14/34 constraints. Problems are: Problem set: 1 solved, 16 unsolved
[2024-05-24 02:49:53] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-24 02:49:53] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-24 02:49:53] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 0 ms to minimize.
[2024-05-24 02:49:53] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 4/38 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 188/295 variables, 107/145 constraints. Problems are: Problem set: 1 solved, 16 unsolved
[2024-05-24 02:49:54] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-24 02:49:54] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/295 variables, 2/147 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/295 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 1/296 variables, 1/148 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/296 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 0/296 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 296/296 variables, and 148 constraints, problems are : Problem set: 1 solved, 16 unsolved in 2070 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 1 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 54/72 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 8/14 constraints. Problems are: Problem set: 1 solved, 16 unsolved
[2024-05-24 02:49:54] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-24 02:49:54] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
[2024-05-24 02:49:54] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-24 02:49:54] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 0 ms to minimize.
[2024-05-24 02:49:54] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
[2024-05-24 02:49:54] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 0 ms to minimize.
[2024-05-24 02:49:54] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 7/21 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 35/107 variables, 6/27 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 20/47 constraints. Problems are: Problem set: 1 solved, 16 unsolved
[2024-05-24 02:49:55] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-24 02:49:55] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 2/49 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 188/295 variables, 107/156 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/295 variables, 16/172 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/295 variables, 0/172 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 1/296 variables, 1/173 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/296 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 0/296 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 296/296 variables, and 173 constraints, problems are : Problem set: 1 solved, 16 unsolved in 1239 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/17 constraints, Known Traps: 37/37 constraints]
After SMT, in 3327ms problems are : Problem set: 1 solved, 16 unsolved
Fused 16 Parikh solutions to 14 different solutions.
Parikh walk visited 14 properties in 783 ms.
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 195/195 transitions.
Graph (trivial) has 152 edges and 107 vertex of which 14 / 107 are part of one of the 7 SCC in 2 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 361 edges and 100 vertex of which 95 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 95 transition count 168
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 89 transition count 162
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 23 place count 88 transition count 160
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 25 place count 87 transition count 159
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 25 place count 87 transition count 155
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 11 rules applied. Total rules applied 36 place count 80 transition count 155
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 75 place count 41 transition count 77
Iterating global reduction 4 with 39 rules applied. Total rules applied 114 place count 41 transition count 77
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 124 place count 31 transition count 57
Iterating global reduction 4 with 10 rules applied. Total rules applied 134 place count 31 transition count 57
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 138 place count 31 transition count 53
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 141 place count 28 transition count 44
Iterating global reduction 5 with 3 rules applied. Total rules applied 144 place count 28 transition count 44
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 147 place count 25 transition count 38
Iterating global reduction 5 with 3 rules applied. Total rules applied 150 place count 25 transition count 38
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 153 place count 25 transition count 35
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 161 place count 21 transition count 51
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 163 place count 21 transition count 49
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 172 place count 21 transition count 49
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 180 place count 21 transition count 49
Applied a total of 180 rules in 38 ms. Remains 21 /107 variables (removed 86) and now considering 49/195 (removed 146) transitions.
Running 41 sub problems to find dead transitions.
[2024-05-24 02:49:56] [INFO ] Flow matrix only has 48 transitions (discarded 1 similar events)
// Phase 1: matrix 48 rows 21 cols
[2024-05-24 02:49:56] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 02:49:56] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 2/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
At refinement iteration 4 (OVERLAPS) 48/69 variables, 21/25 constraints. Problems are: Problem set: 9 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 11/36 constraints. Problems are: Problem set: 9 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/36 constraints. Problems are: Problem set: 9 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/69 variables, 0/36 constraints. Problems are: Problem set: 9 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 36 constraints, problems are : Problem set: 9 solved, 32 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 2/20 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 9 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 1/21 variables, 3/4 constraints. Problems are: Problem set: 9 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 9 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 48/69 variables, 21/25 constraints. Problems are: Problem set: 9 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 11/36 constraints. Problems are: Problem set: 9 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 32/68 constraints. Problems are: Problem set: 9 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/68 constraints. Problems are: Problem set: 9 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/68 constraints. Problems are: Problem set: 9 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 68 constraints, problems are : Problem set: 9 solved, 32 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 21/21 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 32/41 constraints, Known Traps: 0/0 constraints]
After SMT, in 687ms problems are : Problem set: 9 solved, 32 unsolved
Search for dead transitions found 9 dead transitions in 688ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 9 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 21/107 places, 40/195 transitions.
Graph (complete) has 63 edges and 21 vertex of which 20 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 20 transition count 40
Applied a total of 3 rules in 8 ms. Remains 20 /21 variables (removed 1) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 735 ms. Remains : 20/107 places, 40/195 transitions.
RANDOM walk for 34462 steps (11381 resets) in 593 ms. (58 steps per ms) remains 0/2 properties
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
FORMULA HealthRecord-PT-01-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 02:49:57] [INFO ] Flatten gal took : 15 ms
[2024-05-24 02:49:57] [INFO ] Flatten gal took : 9 ms
[2024-05-24 02:49:57] [INFO ] Input system was already deterministic with 195 transitions.
Computed a total of 12 stabilizing places and 22 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 195/195 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 59 transition count 104
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 59 transition count 104
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 104 place count 51 transition count 88
Iterating global reduction 0 with 8 rules applied. Total rules applied 112 place count 51 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 115 place count 51 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 117 place count 49 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 119 place count 49 transition count 79
Applied a total of 119 rules in 5 ms. Remains 49 /107 variables (removed 58) and now considering 79/195 (removed 116) transitions.
[2024-05-24 02:49:57] [INFO ] Flow matrix only has 78 transitions (discarded 1 similar events)
// Phase 1: matrix 78 rows 49 cols
[2024-05-24 02:49:57] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:49:57] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 02:49:57] [INFO ] Flow matrix only has 78 transitions (discarded 1 similar events)
[2024-05-24 02:49:57] [INFO ] Invariant cache hit.
[2024-05-24 02:49:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:49:57] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-24 02:49:57] [INFO ] Flow matrix only has 78 transitions (discarded 1 similar events)
[2024-05-24 02:49:57] [INFO ] Invariant cache hit.
[2024-05-24 02:49:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-24 02:49:57] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-24 02:49:57] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-24 02:49:58] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 77/126 variables, 49/59 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 1/127 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/127 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 60 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1284 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-24 02:49:59] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-24 02:49:59] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 77/126 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 78/139 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 1/127 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 0/127 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 140 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1648 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 5/5 constraints]
After SMT, in 2946ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 2947ms
Starting structural reductions in LTL mode, iteration 1 : 49/107 places, 79/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3023 ms. Remains : 49/107 places, 79/195 transitions.
[2024-05-24 02:50:00] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:50:00] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:50:00] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-24 02:50:00] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:50:00] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:50:00] [INFO ] Time to serialize gal into /tmp/CTLFireability4217966703069681053.gal : 7 ms
[2024-05-24 02:50:00] [INFO ] Time to serialize properties into /tmp/CTLFireability3720062742562284630.ctl : 3 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/CTLFireability4217966703069681053.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3720062742562284630.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,51040,0.025307,3768,2,424,5,1821,6,0,273,1512,0


Converting to forward existential form...Done !
original formula: E((!((((p71==1)&&(p86==1)) + EG(((p102==1)||((p16==1)&&(p104==1)))))) * EX(!(AG(!(((p71==1)&&(p94==1))))))) U !(((p67!=1) * EX(E(EG((p61=...190
=> equivalent forward existential formula: ([(FwdU(Init,(!((((p71==1)&&(p86==1)) + EG(((p102==1)||((p16==1)&&(p104==1)))))) * EX(!(!(E(TRUE U !(!(((p71==1)...395
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t22, t...297
(forward)formula 0,1,0.146819,10188,1,0,255,32299,201,146,1858,34399,320
FORMULA HealthRecord-PT-01-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 195/195 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 66 transition count 118
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 66 transition count 118
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 56 transition count 98
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 56 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 103 place count 56 transition count 97
Applied a total of 103 rules in 4 ms. Remains 56 /107 variables (removed 51) and now considering 97/195 (removed 98) transitions.
[2024-05-24 02:50:00] [INFO ] Flow matrix only has 96 transitions (discarded 1 similar events)
// Phase 1: matrix 96 rows 56 cols
[2024-05-24 02:50:00] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:50:00] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 02:50:00] [INFO ] Flow matrix only has 96 transitions (discarded 1 similar events)
[2024-05-24 02:50:00] [INFO ] Invariant cache hit.
[2024-05-24 02:50:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:50:00] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-24 02:50:00] [INFO ] Flow matrix only has 96 transitions (discarded 1 similar events)
[2024-05-24 02:50:00] [INFO ] Invariant cache hit.
[2024-05-24 02:50:00] [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, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-24 02:50:01] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-24 02:50:01] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-05-24 02:50:01] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-24 02:50:01] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-24 02:50:01] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-24 02:50:01] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-24 02:50:01] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-24 02:50:01] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-24 02:50:01] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 95/151 variables, 56/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 1/152 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/152 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 73 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2333 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-24 02:50:03] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (OVERLAPS) 95/151 variables, 56/73 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 96/169 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 1/152 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/152 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 170 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2537 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 10/10 constraints]
After SMT, in 4896ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 4897ms
Starting structural reductions in LTL mode, iteration 1 : 56/107 places, 97/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4991 ms. Remains : 56/107 places, 97/195 transitions.
[2024-05-24 02:50:05] [INFO ] Flatten gal took : 6 ms
[2024-05-24 02:50:05] [INFO ] Flatten gal took : 5 ms
[2024-05-24 02:50:05] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-24 02:50:05] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:50:05] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:50:05] [INFO ] Time to serialize gal into /tmp/CTLFireability389590862457213447.gal : 2 ms
[2024-05-24 02:50:05] [INFO ] Time to serialize properties into /tmp/CTLFireability1700959645643848718.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/CTLFireability389590862457213447.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1700959645643848718.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,87004,0.034109,5028,2,1024,5,5953,6,0,319,6335,0


Converting to forward existential form...Done !
original formula: EF((((EF((p108==1)) * EX((((p97==1)&&(p10==0))&&(p116==0)))) * (!(A((p4==1) U (p15==1))) * (p93==0))) * (((p57==0)&&(p4==0)) * (AX((p2==0...216
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * ((E(TRUE U (p108==1)) * EX((((p97==1)&&(p10==0))&&(p116==0)))) * (!(!((E(!((p15==1)) U (!...805
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t9, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t...397
(forward)formula 0,1,1.05984,44724,1,0,369,252533,230,177,2170,217514,412
FORMULA HealthRecord-PT-01-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 195/195 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 68 transition count 122
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 68 transition count 122
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 83 place count 63 transition count 112
Iterating global reduction 0 with 5 rules applied. Total rules applied 88 place count 63 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 91 place count 63 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 62 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 62 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 61 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 61 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 96 place count 61 transition count 103
Applied a total of 96 rules in 11 ms. Remains 61 /107 variables (removed 46) and now considering 103/195 (removed 92) transitions.
[2024-05-24 02:50:06] [INFO ] Flow matrix only has 102 transitions (discarded 1 similar events)
// Phase 1: matrix 102 rows 61 cols
[2024-05-24 02:50:06] [INFO ] Computed 7 invariants in 3 ms
[2024-05-24 02:50:06] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 02:50:06] [INFO ] Flow matrix only has 102 transitions (discarded 1 similar events)
[2024-05-24 02:50:06] [INFO ] Invariant cache hit.
[2024-05-24 02:50:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:50:07] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-24 02:50:07] [INFO ] Flow matrix only has 102 transitions (discarded 1 similar events)
[2024-05-24 02:50:07] [INFO ] Invariant cache hit.
[2024-05-24 02:50:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-24 02:50:07] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-05-24 02:50:07] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-24 02:50:07] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-05-24 02:50:07] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-24 02:50:07] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 101/162 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-24 02:50:08] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 1/163 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/163 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 75 constraints, problems are : Problem set: 0 solved, 102 unsolved in 2479 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-24 02:50:09] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-24 02:50:09] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-24 02:50:10] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-24 02:50:10] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-24 02:50:10] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 0 ms to minimize.
[2024-05-24 02:50:10] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-24 02:50:10] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 101/162 variables, 61/81 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 102/183 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 1/163 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 13 (OVERLAPS) 0/163 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 184 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3621 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 13/13 constraints]
After SMT, in 6117ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 6119ms
Starting structural reductions in LTL mode, iteration 1 : 61/107 places, 103/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6209 ms. Remains : 61/107 places, 103/195 transitions.
[2024-05-24 02:50:13] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:50:13] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:50:13] [INFO ] Input system was already deterministic with 103 transitions.
[2024-05-24 02:50:13] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:50:13] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:50:13] [INFO ] Time to serialize gal into /tmp/CTLFireability10194810382727957752.gal : 1 ms
[2024-05-24 02:50:13] [INFO ] Time to serialize properties into /tmp/CTLFireability18073238508580530775.ctl : 4 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/CTLFireability10194810382727957752.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18073238508580530775.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,162658,0.043366,5316,2,937,5,7057,6,0,345,7830,0


Converting to forward existential form...Done !
original formula: E(((p71==1)&&(p96==1)) U (EG((((E(((((p17==1)&&(p23==1))&&((p28==1)&&(p33==1)))&&(((p38==1)&&(p45==1))&&((p71==1)&&(p115==1)))) U (p42==1...428
=> equivalent forward existential formula: ([FwdG(FwdU(Init,((p71==1)&&(p96==1))),(((E(((((p17==1)&&(p23==1))&&((p28==1)&&(p33==1)))&&(((p38==1)&&(p45==1))...794
Hit Full ! (commute/partial/dont) 84/18/19
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...423
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,2.90415,111700,1,0,843,731501,298,465,2479,599777,996
FORMULA HealthRecord-PT-01-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 195/195 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 66 transition count 117
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 66 transition count 117
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 90 place count 58 transition count 101
Iterating global reduction 0 with 8 rules applied. Total rules applied 98 place count 58 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 100 place count 58 transition count 99
Applied a total of 100 rules in 10 ms. Remains 58 /107 variables (removed 49) and now considering 99/195 (removed 96) transitions.
[2024-05-24 02:50:16] [INFO ] Flow matrix only has 97 transitions (discarded 2 similar events)
// Phase 1: matrix 97 rows 58 cols
[2024-05-24 02:50:16] [INFO ] Computed 8 invariants in 4 ms
[2024-05-24 02:50:16] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 02:50:16] [INFO ] Flow matrix only has 97 transitions (discarded 2 similar events)
[2024-05-24 02:50:16] [INFO ] Invariant cache hit.
[2024-05-24 02:50:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:50:16] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-24 02:50:16] [INFO ] Flow matrix only has 97 transitions (discarded 2 similar events)
[2024-05-24 02:50:16] [INFO ] Invariant cache hit.
[2024-05-24 02:50:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-24 02:50:16] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-24 02:50:16] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-24 02:50:16] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-24 02:50:16] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-24 02:50:16] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-24 02:50:16] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-24 02:50:17] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-24 02:50:17] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-24 02:50:17] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 96/154 variables, 58/75 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 1/155 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (OVERLAPS) 0/155 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 76 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2352 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 96/154 variables, 58/75 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 98/173 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 1/155 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/155 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 174 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2394 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 9/9 constraints]
After SMT, in 4769ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 4770ms
Starting structural reductions in LTL mode, iteration 1 : 58/107 places, 99/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4869 ms. Remains : 58/107 places, 99/195 transitions.
[2024-05-24 02:50:21] [INFO ] Flatten gal took : 8 ms
[2024-05-24 02:50:21] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:50:21] [INFO ] Input system was already deterministic with 99 transitions.
[2024-05-24 02:50:21] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:50:21] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:50:21] [INFO ] Time to serialize gal into /tmp/CTLFireability3816598573392752966.gal : 1 ms
[2024-05-24 02:50:21] [INFO ] Time to serialize properties into /tmp/CTLFireability2305591331716027297.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/CTLFireability3816598573392752966.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2305591331716027297.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,122157,0.0265,4508,2,733,5,4057,6,0,326,3925,0


Converting to forward existential form...Done !
original formula: E((EF(!(EG((p8==1)))) * AG((EG((p93==1)) + AG((p24==1))))) U (AX((p57==1)) + E((E(E((p5==1) U (p63==1)) U AG(((p16==1)&&(p104==1)))) + ((...231
=> equivalent forward existential formula: ([(FwdU(Init,(E(TRUE U !(EG((p8==1)))) * !(E(TRUE U !((EG((p93==1)) + !(E(TRUE U !((p24==1)))))))))) * !(EX(!((p...446
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...382
(forward)formula 0,1,0.389761,20936,1,0,330,78949,248,176,2328,98883,387
FORMULA HealthRecord-PT-01-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 195/195 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 60 transition count 106
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 60 transition count 106
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 104 place count 50 transition count 86
Iterating global reduction 0 with 10 rules applied. Total rules applied 114 place count 50 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 117 place count 50 transition count 83
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 120 place count 47 transition count 74
Iterating global reduction 1 with 3 rules applied. Total rules applied 123 place count 47 transition count 74
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 126 place count 44 transition count 68
Iterating global reduction 1 with 3 rules applied. Total rules applied 129 place count 44 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 131 place count 44 transition count 66
Applied a total of 131 rules in 5 ms. Remains 44 /107 variables (removed 63) and now considering 66/195 (removed 129) transitions.
[2024-05-24 02:50:21] [INFO ] Flow matrix only has 65 transitions (discarded 1 similar events)
// Phase 1: matrix 65 rows 44 cols
[2024-05-24 02:50:21] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:50:21] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 02:50:21] [INFO ] Flow matrix only has 65 transitions (discarded 1 similar events)
[2024-05-24 02:50:21] [INFO ] Invariant cache hit.
[2024-05-24 02:50:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:50:21] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-24 02:50:21] [INFO ] Flow matrix only has 65 transitions (discarded 1 similar events)
[2024-05-24 02:50:21] [INFO ] Invariant cache hit.
[2024-05-24 02:50:21] [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, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-24 02:50:21] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-24 02:50:21] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-24 02:50:21] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 64/108 variables, 44/54 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 1/109 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-24 02:50:22] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-24 02:50:22] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/109 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 57 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1324 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 44/44 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-24 02:50:22] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-24 02:50:23] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 64/108 variables, 44/58 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 65/123 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 1/109 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/109 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 11 (OVERLAPS) 0/109 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 124 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1449 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 44/44 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 7/7 constraints]
After SMT, in 2785ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 2787ms
Starting structural reductions in LTL mode, iteration 1 : 44/107 places, 66/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2865 ms. Remains : 44/107 places, 66/195 transitions.
[2024-05-24 02:50:24] [INFO ] Flatten gal took : 9 ms
[2024-05-24 02:50:24] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:50:24] [INFO ] Input system was already deterministic with 66 transitions.
[2024-05-24 02:50:24] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:50:24] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:50:24] [INFO ] Time to serialize gal into /tmp/CTLFireability15895052303494534871.gal : 0 ms
[2024-05-24 02:50:24] [INFO ] Time to serialize properties into /tmp/CTLFireability12954296844143751939.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/CTLFireability15895052303494534871.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12954296844143751939.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,49581,0.022942,4384,2,724,5,3835,6,0,240,3509,0


Converting to forward existential form...Done !
original formula: AX(E(!(((AG((p41==1)) * (p5==1)) * ((p44==1)&&(p114==1)))) U (p11==1)))
=> equivalent forward existential formula: [(EY(Init) * !(E(!(((!(E(TRUE U !((p41==1)))) * (p5==1)) * ((p44==1)&&(p114==1)))) U (p11==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, t17, t19, t21, t22, t23, t24, t...282
(forward)formula 0,1,0.137939,9136,1,0,142,27640,155,66,1593,23346,168
FORMULA HealthRecord-PT-01-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 107/107 places, 195/195 transitions.
Graph (trivial) has 148 edges and 107 vertex of which 12 / 107 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 45 place count 56 transition count 105
Iterating global reduction 0 with 44 rules applied. Total rules applied 89 place count 56 transition count 105
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 98 place count 47 transition count 87
Iterating global reduction 0 with 9 rules applied. Total rules applied 107 place count 47 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 110 place count 47 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 112 place count 45 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 114 place count 45 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 116 place count 43 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 118 place count 43 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 120 place count 43 transition count 72
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 126 place count 43 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 130 place count 41 transition count 64
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 133 place count 38 transition count 61
Applied a total of 133 rules in 25 ms. Remains 38 /107 variables (removed 69) and now considering 61/195 (removed 134) transitions.
[2024-05-24 02:50:24] [INFO ] Flow matrix only has 55 transitions (discarded 6 similar events)
// Phase 1: matrix 55 rows 38 cols
[2024-05-24 02:50:24] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 02:50:24] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-24 02:50:24] [INFO ] Flow matrix only has 55 transitions (discarded 6 similar events)
[2024-05-24 02:50:24] [INFO ] Invariant cache hit.
[2024-05-24 02:50:24] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-24 02:50:24] [INFO ] Redundant transitions in 0 ms returned []
Running 47 sub problems to find dead transitions.
[2024-05-24 02:50:24] [INFO ] Flow matrix only has 55 transitions (discarded 6 similar events)
[2024-05-24 02:50:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 7/38 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-24 02:50:24] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-24 02:50:24] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-05-24 02:50:24] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 54/92 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 0/92 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/93 variables, and 48 constraints, problems are : Problem set: 0 solved, 47 unsolved in 556 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 7/38 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-24 02:50:25] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 54/92 variables, 38/49 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 47/96 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/92 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/93 variables, and 96 constraints, problems are : Problem set: 0 solved, 47 unsolved in 620 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 4/4 constraints]
After SMT, in 1198ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1199ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/107 places, 61/195 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1295 ms. Remains : 38/107 places, 61/195 transitions.
[2024-05-24 02:50:25] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:50:25] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:50:25] [INFO ] Input system was already deterministic with 61 transitions.
[2024-05-24 02:50:25] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:50:25] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:50:25] [INFO ] Time to serialize gal into /tmp/CTLFireability17562411756599926012.gal : 1 ms
[2024-05-24 02:50:25] [INFO ] Time to serialize properties into /tmp/CTLFireability13491596663419778080.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/CTLFireability17562411756599926012.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13491596663419778080.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,16996,0.011146,3732,2,294,5,1495,6,0,202,1319,0


Converting to forward existential form...Done !
original formula: A((p36!=1) U E((p50!=1) U AG((p93!=1))))
=> equivalent forward existential formula: [((Init * !(EG(!(E((p50!=1) U !(E(TRUE U !((p93!=1))))))))) * !(E(!(E((p50!=1) U !(E(TRUE U !((p93!=1)))))) U (!...223
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, t17, t18, t19, t20, t38...270
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.077462,7216,1,0,160,19874,151,84,1424,16400,187
FORMULA HealthRecord-PT-01-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 107/107 places, 195/195 transitions.
Graph (trivial) has 149 edges and 107 vertex of which 14 / 107 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 44 place count 57 transition count 107
Iterating global reduction 0 with 43 rules applied. Total rules applied 87 place count 57 transition count 107
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 96 place count 48 transition count 89
Iterating global reduction 0 with 9 rules applied. Total rules applied 105 place count 48 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 108 place count 48 transition count 86
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 111 place count 45 transition count 77
Iterating global reduction 1 with 3 rules applied. Total rules applied 114 place count 45 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 116 place count 43 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 118 place count 43 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 120 place count 43 transition count 71
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 127 place count 43 transition count 64
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 139 place count 37 transition count 58
Applied a total of 139 rules in 13 ms. Remains 37 /107 variables (removed 70) and now considering 58/195 (removed 137) transitions.
[2024-05-24 02:50:25] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
// Phase 1: matrix 51 rows 37 cols
[2024-05-24 02:50:25] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:50:25] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-24 02:50:25] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
[2024-05-24 02:50:25] [INFO ] Invariant cache hit.
[2024-05-24 02:50:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:50:25] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2024-05-24 02:50:25] [INFO ] Redundant transitions in 1 ms returned []
Running 57 sub problems to find dead transitions.
[2024-05-24 02:50:25] [INFO ] Flow matrix only has 51 transitions (discarded 7 similar events)
[2024-05-24 02:50:25] [INFO ] Invariant cache hit.
[2024-05-24 02:50:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/37 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-24 02:50:26] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
[2024-05-24 02:50:26] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-24 02:50:26] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-24 02:50:26] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 50/87 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 1/88 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 0/88 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 49 constraints, problems are : Problem set: 0 solved, 57 unsolved in 863 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/37 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-24 02:50:26] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 50/87 variables, 37/49 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 57/106 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 1/88 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (OVERLAPS) 0/88 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 107 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1040 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 5/5 constraints]
After SMT, in 1913ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 1913ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/107 places, 58/195 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2040 ms. Remains : 37/107 places, 58/195 transitions.
[2024-05-24 02:50:27] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:50:27] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:50:27] [INFO ] Input system was already deterministic with 58 transitions.
[2024-05-24 02:50:27] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:50:27] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:50:27] [INFO ] Time to serialize gal into /tmp/CTLFireability10055375444680556247.gal : 1 ms
[2024-05-24 02:50:27] [INFO ] Time to serialize properties into /tmp/CTLFireability9031854424551167157.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/CTLFireability10055375444680556247.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9031854424551167157.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,8069,0.012625,3724,2,289,5,1545,6,0,198,1536,0


Converting to forward existential form...Done !
original formula: E(EF((A((p90==1) U (p80==1)) * AG((p14==1)))) U (p116==1))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U (!((E(!((p80==1)) U (!((p90==1)) * !((p80==1)))) + EG(!((p80==1))))) * !(E(TRUE U !((p14==1...185
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, t17, t18, t26, t27, t28...265
(forward)formula 0,0,0.045524,5360,1,0,116,9856,141,52,1322,7766,125
FORMULA HealthRecord-PT-01-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 107/107 places, 195/195 transitions.
Graph (trivial) has 153 edges and 107 vertex of which 14 / 107 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 45 place count 55 transition count 104
Iterating global reduction 0 with 44 rules applied. Total rules applied 89 place count 55 transition count 104
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 98 place count 46 transition count 86
Iterating global reduction 0 with 9 rules applied. Total rules applied 107 place count 46 transition count 86
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 111 place count 46 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 113 place count 44 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 115 place count 44 transition count 76
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 117 place count 42 transition count 72
Iterating global reduction 1 with 2 rules applied. Total rules applied 119 place count 42 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 121 place count 42 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 128 place count 42 transition count 63
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 132 place count 40 transition count 61
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 136 place count 36 transition count 57
Applied a total of 136 rules in 20 ms. Remains 36 /107 variables (removed 71) and now considering 57/195 (removed 138) transitions.
[2024-05-24 02:50:27] [INFO ] Flow matrix only has 50 transitions (discarded 7 similar events)
// Phase 1: matrix 50 rows 36 cols
[2024-05-24 02:50:27] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 02:50:28] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-24 02:50:28] [INFO ] Flow matrix only has 50 transitions (discarded 7 similar events)
[2024-05-24 02:50:28] [INFO ] Invariant cache hit.
[2024-05-24 02:50:28] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-05-24 02:50:28] [INFO ] Redundant transitions in 0 ms returned []
Running 43 sub problems to find dead transitions.
[2024-05-24 02:50:28] [INFO ] Flow matrix only has 50 transitions (discarded 7 similar events)
[2024-05-24 02:50:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 7/36 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-24 02:50:28] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-24 02:50:28] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-24 02:50:28] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 49/85 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/85 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/86 variables, and 46 constraints, problems are : Problem set: 0 solved, 43 unsolved in 513 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 7/36 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-24 02:50:28] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (OVERLAPS) 49/85 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 43/90 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (OVERLAPS) 0/85 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/86 variables, and 90 constraints, problems are : Problem set: 0 solved, 43 unsolved in 547 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 4/4 constraints]
After SMT, in 1067ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1067ms
Starting structural reductions in SI_CTL mode, iteration 1 : 36/107 places, 57/195 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1159 ms. Remains : 36/107 places, 57/195 transitions.
[2024-05-24 02:50:29] [INFO ] Flatten gal took : 5 ms
[2024-05-24 02:50:29] [INFO ] Flatten gal took : 5 ms
[2024-05-24 02:50:29] [INFO ] Input system was already deterministic with 57 transitions.
[2024-05-24 02:50:29] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:50:29] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:50:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3057787403540591495.gal : 1 ms
[2024-05-24 02:50:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6712897755081941860.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3057787403540591495.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6712897755081941860.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (4027 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (701 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties

Finished probabilistic random walk after 688 steps, run visited all 1 properties in 8 ms. (steps per millisecond=86 )
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality6712897755081941860.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :16 after 96
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :96 after 240
Probabilistic random walk after 688 steps, saw 261 distinct states, run finished after 13 ms. (steps per millisecond=52 ) properties seen :1
FORMULA HealthRecord-PT-01-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
SDD proceeding with computation,1 properties remain. new max is 32
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read1(BufferedInputStream.java:281)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:343)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 195/195 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 63 transition count 111
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 63 transition count 111
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 95 place count 56 transition count 97
Iterating global reduction 0 with 7 rules applied. Total rules applied 102 place count 56 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 104 place count 56 transition count 95
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 55 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 55 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 54 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 54 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 109 place count 54 transition count 89
Applied a total of 109 rules in 4 ms. Remains 54 /107 variables (removed 53) and now considering 89/195 (removed 106) transitions.
[2024-05-24 02:50:29] [INFO ] Flow matrix only has 87 transitions (discarded 2 similar events)
// Phase 1: matrix 87 rows 54 cols
[2024-05-24 02:50:29] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 02:50:29] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-24 02:50:29] [INFO ] Flow matrix only has 87 transitions (discarded 2 similar events)
[2024-05-24 02:50:29] [INFO ] Invariant cache hit.
[2024-05-24 02:50:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:50:29] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2024-05-24 02:50:29] [INFO ] Flow matrix only has 87 transitions (discarded 2 similar events)
[2024-05-24 02:50:29] [INFO ] Invariant cache hit.
[2024-05-24 02:50:29] [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, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-24 02:50:29] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-24 02:50:29] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-24 02:50:29] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-24 02:50:30] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-24 02:50:30] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-24 02:50:30] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 86/140 variables, 54/68 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 1/141 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (OVERLAPS) 0/141 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 69 constraints, problems are : Problem set: 0 solved, 88 unsolved in 1860 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-24 02:50:31] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 86/140 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 88/157 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 1/141 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (OVERLAPS) 0/141 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 158 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2071 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 7/7 constraints]
After SMT, in 3946ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 3948ms
Starting structural reductions in LTL mode, iteration 1 : 54/107 places, 89/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4058 ms. Remains : 54/107 places, 89/195 transitions.
[2024-05-24 02:50:33] [INFO ] Flatten gal took : 8 ms
[2024-05-24 02:50:33] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:50:33] [INFO ] Input system was already deterministic with 89 transitions.
[2024-05-24 02:50:33] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:50:33] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:50:33] [INFO ] Time to serialize gal into /tmp/CTLFireability10455415866804494197.gal : 1 ms
[2024-05-24 02:50:33] [INFO ] Time to serialize properties into /tmp/CTLFireability4751661079057302762.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/CTLFireability10455415866804494197.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4751661079057302762.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,83277,0.019572,4184,2,502,5,2772,6,0,300,2292,0


Converting to forward existential form...Done !
original formula: !(A(((p83==1) + (A((p40==1) U (p2!=1)) * E(((EG((p49==1)) * (p98==1)) * (p24==1)) U AF((p100==1))))) U !((EF(((((p16==1)&&(p114==1))&&(p7...209
=> equivalent forward existential formula: ([(EY(FwdU(((FwdU(Init,!(!((E(TRUE U ((((p16==1)&&(p114==1))&&(p77==1))||((p71==1)&&(p111==1)))) * E(TRUE U EX((...548
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...342
(forward)formula 0,1,0.630459,31884,1,0,487,177631,231,256,2163,157067,562
FORMULA HealthRecord-PT-01-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 195/195 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 61 transition count 108
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 61 transition count 108
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 99 place count 54 transition count 94
Iterating global reduction 0 with 7 rules applied. Total rules applied 106 place count 54 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 108 place count 54 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 110 place count 52 transition count 86
Iterating global reduction 1 with 2 rules applied. Total rules applied 112 place count 52 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 51 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 51 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 115 place count 51 transition count 83
Applied a total of 115 rules in 3 ms. Remains 51 /107 variables (removed 56) and now considering 83/195 (removed 112) transitions.
[2024-05-24 02:50:34] [INFO ] Flow matrix only has 82 transitions (discarded 1 similar events)
// Phase 1: matrix 82 rows 51 cols
[2024-05-24 02:50:34] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:50:34] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-24 02:50:34] [INFO ] Flow matrix only has 82 transitions (discarded 1 similar events)
[2024-05-24 02:50:34] [INFO ] Invariant cache hit.
[2024-05-24 02:50:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:50:34] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2024-05-24 02:50:34] [INFO ] Flow matrix only has 82 transitions (discarded 1 similar events)
[2024-05-24 02:50:34] [INFO ] Invariant cache hit.
[2024-05-24 02:50:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-24 02:50:34] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-24 02:50:34] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-24 02:50:34] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-24 02:50:34] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 81/132 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 1/133 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-24 02:50:35] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-24 02:50:35] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 65 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1829 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-24 02:50:36] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 81/132 variables, 51/65 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 82/147 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 1/133 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 148 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2051 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 7/7 constraints]
After SMT, in 3898ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 3900ms
Starting structural reductions in LTL mode, iteration 1 : 51/107 places, 83/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3983 ms. Remains : 51/107 places, 83/195 transitions.
[2024-05-24 02:50:37] [INFO ] Flatten gal took : 8 ms
[2024-05-24 02:50:38] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:50:38] [INFO ] Input system was already deterministic with 83 transitions.
[2024-05-24 02:50:38] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:50:38] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:50:38] [INFO ] Time to serialize gal into /tmp/CTLFireability14761282915410420495.gal : 1 ms
[2024-05-24 02:50:38] [INFO ] Time to serialize properties into /tmp/CTLFireability3955255807314262482.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/CTLFireability14761282915410420495.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3955255807314262482.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,68778,0.019212,4156,2,531,5,2703,6,0,285,2403,0


Converting to forward existential form...Done !
original formula: EX(EG(A(!((((p79==1)||(p60==1))||(p55==1))) U (!(EF(((p16==1)&&(p114==1)))) * (EX((p63==1)) + !(((p71==1)&&(p90==1))))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!((E(!((!(E(TRUE U ((p16==1)&&(p114==1)))) * (EX((p63==1)) + !(((p71==1)&&(p90==1)))))) U (!(!(((...376
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...327
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.13801,9436,1,0,248,32354,201,146,2020,23911,285
FORMULA HealthRecord-PT-01-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 195/195 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 58 transition count 102
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 58 transition count 102
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 106 place count 50 transition count 86
Iterating global reduction 0 with 8 rules applied. Total rules applied 114 place count 50 transition count 86
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 118 place count 50 transition count 82
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 49 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 49 transition count 79
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 48 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 48 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 123 place count 48 transition count 76
Applied a total of 123 rules in 2 ms. Remains 48 /107 variables (removed 59) and now considering 76/195 (removed 119) transitions.
[2024-05-24 02:50:38] [INFO ] Flow matrix only has 75 transitions (discarded 1 similar events)
// Phase 1: matrix 75 rows 48 cols
[2024-05-24 02:50:38] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:50:38] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 02:50:38] [INFO ] Flow matrix only has 75 transitions (discarded 1 similar events)
[2024-05-24 02:50:38] [INFO ] Invariant cache hit.
[2024-05-24 02:50:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:50:38] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2024-05-24 02:50:38] [INFO ] Flow matrix only has 75 transitions (discarded 1 similar events)
[2024-05-24 02:50:38] [INFO ] Invariant cache hit.
[2024-05-24 02:50:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-24 02:50:38] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-24 02:50:38] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-24 02:50:38] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 74/122 variables, 48/58 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 1/123 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-24 02:50:39] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/123 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/123 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 60 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1648 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-24 02:50:40] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (OVERLAPS) 74/122 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 75/135 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 1/123 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/123 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 136 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1623 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 5/5 constraints]
After SMT, in 3285ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 3286ms
Starting structural reductions in LTL mode, iteration 1 : 48/107 places, 76/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3367 ms. Remains : 48/107 places, 76/195 transitions.
[2024-05-24 02:50:41] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:50:41] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:50:41] [INFO ] Input system was already deterministic with 76 transitions.
[2024-05-24 02:50:41] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:50:41] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:50:41] [INFO ] Time to serialize gal into /tmp/CTLFireability16280780599686037377.gal : 1 ms
[2024-05-24 02:50:41] [INFO ] Time to serialize properties into /tmp/CTLFireability14223153579121082463.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/CTLFireability16280780599686037377.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14223153579121082463.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,45207,0.01458,3872,2,373,5,1769,6,0,266,1437,0


Converting to forward existential form...Done !
original formula: AX(EX(EF(AX(((p91==1)||((p71==1)&&(p84==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(E(TRUE U !(EX(!(((p91==1)||((p71==1)&&(p84==1))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...282
(forward)formula 0,1,0.079087,6828,1,0,150,16978,172,77,1807,13681,175
FORMULA HealthRecord-PT-01-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 107/107 places, 195/195 transitions.
Graph (trivial) has 120 edges and 107 vertex of which 12 / 107 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 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 38 place count 64 transition count 118
Iterating global reduction 0 with 37 rules applied. Total rules applied 75 place count 64 transition count 118
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 80 place count 59 transition count 108
Iterating global reduction 0 with 5 rules applied. Total rules applied 85 place count 59 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 86 place count 59 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 92 place count 59 transition count 101
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 102 place count 54 transition count 96
Applied a total of 102 rules in 10 ms. Remains 54 /107 variables (removed 53) and now considering 96/195 (removed 99) transitions.
[2024-05-24 02:50:41] [INFO ] Flow matrix only has 88 transitions (discarded 8 similar events)
// Phase 1: matrix 88 rows 54 cols
[2024-05-24 02:50:41] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 02:50:41] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-24 02:50:41] [INFO ] Flow matrix only has 88 transitions (discarded 8 similar events)
[2024-05-24 02:50:41] [INFO ] Invariant cache hit.
[2024-05-24 02:50:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:50:41] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-05-24 02:50:41] [INFO ] Redundant transitions in 1 ms returned []
Running 95 sub problems to find dead transitions.
[2024-05-24 02:50:41] [INFO ] Flow matrix only has 88 transitions (discarded 8 similar events)
[2024-05-24 02:50:41] [INFO ] Invariant cache hit.
[2024-05-24 02:50:41] [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, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-24 02:50:42] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-24 02:50:42] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-24 02:50:42] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-24 02:50:42] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-24 02:50:42] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-24 02:50:42] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 2 ms to minimize.
[2024-05-24 02:50:42] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 87/141 variables, 54/70 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 1/142 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 0/142 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 71 constraints, problems are : Problem set: 0 solved, 95 unsolved in 1984 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-24 02:50:44] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 0 ms to minimize.
[2024-05-24 02:50:44] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 87/141 variables, 54/72 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 95/167 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 1/142 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/142 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 168 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2256 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 9/9 constraints]
After SMT, in 4261ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 4262ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/107 places, 96/195 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4605 ms. Remains : 54/107 places, 96/195 transitions.
[2024-05-24 02:50:46] [INFO ] Flatten gal took : 10 ms
[2024-05-24 02:50:46] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:50:46] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-24 02:50:46] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:50:46] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:50:46] [INFO ] Time to serialize gal into /tmp/CTLFireability13233395174440864804.gal : 1 ms
[2024-05-24 02:50:46] [INFO ] Time to serialize properties into /tmp/CTLFireability18006075316606986152.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/CTLFireability13233395174440864804.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18006075316606986152.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,25133,0.021255,4212,2,499,5,2955,6,0,299,2748,0


Converting to forward existential form...Done !
original formula: E(EF((((p109==1)&&(p27==1)) * ((((p95==1)||(p5==1)) + (AF((p93==1)) * EF((p87==1)))) * ((EF(((p71==1)&&(p92==1))) + (p73==1)) + (p20==1))...222
=> equivalent forward existential formula: [FwdG(FwdU(FwdU(Init,E(TRUE U (((p109==1)&&(p27==1)) * ((((p95==1)||(p5==1)) + (!(EG(!((p93==1)))) * E(TRUE U (p...291
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...395
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.579534,29028,1,0,409,177745,245,199,2207,125373,452
FORMULA HealthRecord-PT-01-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 195/195 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 61 transition count 108
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 61 transition count 108
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 99 place count 54 transition count 94
Iterating global reduction 0 with 7 rules applied. Total rules applied 106 place count 54 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 108 place count 54 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 53 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 53 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 52 transition count 87
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 52 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 113 place count 52 transition count 86
Applied a total of 113 rules in 2 ms. Remains 52 /107 variables (removed 55) and now considering 86/195 (removed 109) transitions.
[2024-05-24 02:50:46] [INFO ] Flow matrix only has 85 transitions (discarded 1 similar events)
// Phase 1: matrix 85 rows 52 cols
[2024-05-24 02:50:46] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:50:46] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 02:50:46] [INFO ] Flow matrix only has 85 transitions (discarded 1 similar events)
[2024-05-24 02:50:46] [INFO ] Invariant cache hit.
[2024-05-24 02:50:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:50:46] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2024-05-24 02:50:46] [INFO ] Flow matrix only has 85 transitions (discarded 1 similar events)
[2024-05-24 02:50:46] [INFO ] Invariant cache hit.
[2024-05-24 02:50:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 02:50:47] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-24 02:50:47] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-24 02:50:47] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-24 02:50:47] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 84/136 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 1/137 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 02:50:48] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/137 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/137 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 65 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1997 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 02:50:49] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 84/136 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 85/150 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 1/137 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/137 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 151 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2119 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 6/6 constraints]
After SMT, in 4131ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 4132ms
Starting structural reductions in LTL mode, iteration 1 : 52/107 places, 86/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4215 ms. Remains : 52/107 places, 86/195 transitions.
[2024-05-24 02:50:51] [INFO ] Flatten gal took : 8 ms
[2024-05-24 02:50:51] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:50:51] [INFO ] Input system was already deterministic with 86 transitions.
[2024-05-24 02:50:51] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:50:51] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:50:51] [INFO ] Time to serialize gal into /tmp/CTLFireability9137181353216902758.gal : 1 ms
[2024-05-24 02:50:51] [INFO ] Time to serialize properties into /tmp/CTLFireability12718569331182437098.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/CTLFireability9137181353216902758.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12718569331182437098.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,63189,0.024708,4172,2,497,5,2396,6,0,292,2069,0


Converting to forward existential form...Done !
original formula: AX(AG(((p95==0) + (E((p52==1) U (p2==1)) * EG((p79==1))))))
=> equivalent forward existential formula: ([((FwdU(EY(Init),TRUE) * !((p95==0))) * !(E((p52==1) U (p2==1))))] = FALSE * [((FwdU(EY(Init),TRUE) * !((p95==0...187
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...332
(forward)formula 0,0,0.090496,7076,1,0,177,16146,195,86,2001,12417,205
FORMULA HealthRecord-PT-01-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 195/195 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 63 transition count 111
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 63 transition count 111
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 96 place count 55 transition count 95
Iterating global reduction 0 with 8 rules applied. Total rules applied 104 place count 55 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 107 place count 55 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 108 place count 54 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 109 place count 54 transition count 89
Applied a total of 109 rules in 6 ms. Remains 54 /107 variables (removed 53) and now considering 89/195 (removed 106) transitions.
[2024-05-24 02:50:51] [INFO ] Flow matrix only has 87 transitions (discarded 2 similar events)
// Phase 1: matrix 87 rows 54 cols
[2024-05-24 02:50:51] [INFO ] Computed 8 invariants in 0 ms
[2024-05-24 02:50:51] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 02:50:51] [INFO ] Flow matrix only has 87 transitions (discarded 2 similar events)
[2024-05-24 02:50:51] [INFO ] Invariant cache hit.
[2024-05-24 02:50:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:50:51] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2024-05-24 02:50:51] [INFO ] Flow matrix only has 87 transitions (discarded 2 similar events)
[2024-05-24 02:50:51] [INFO ] Invariant cache hit.
[2024-05-24 02:50:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-24 02:50:51] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-24 02:50:51] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-24 02:50:51] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-24 02:50:51] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 86/140 variables, 54/66 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 1/141 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/141 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 67 constraints, problems are : Problem set: 0 solved, 88 unsolved in 1820 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-24 02:50:53] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 86/140 variables, 54/67 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 88/155 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 1/141 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (OVERLAPS) 0/141 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 156 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2148 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 5/5 constraints]
After SMT, in 3987ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 3989ms
Starting structural reductions in LTL mode, iteration 1 : 54/107 places, 89/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4073 ms. Remains : 54/107 places, 89/195 transitions.
[2024-05-24 02:50:55] [INFO ] Flatten gal took : 6 ms
[2024-05-24 02:50:55] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:50:55] [INFO ] Input system was already deterministic with 89 transitions.
[2024-05-24 02:50:55] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:50:55] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:50:55] [INFO ] Time to serialize gal into /tmp/CTLFireability13622097690296271989.gal : 1 ms
[2024-05-24 02:50:55] [INFO ] Time to serialize properties into /tmp/CTLFireability10342593226132862471.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/CTLFireability13622097690296271989.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10342593226132862471.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,94618,0.021135,3872,2,462,5,2398,6,0,301,2018,0


Converting to forward existential form...Done !
original formula: EG(((A(AG((p47==1)) U EX(((p9==1)||(p106==1)))) + (p93==1)) + ((AG((p31==0)) * ((!(A(((p71==1)&&(p96==1)) U (p75==1))) + (p16==0)) + (p11...238
=> equivalent forward existential formula: [FwdG(Init,((!((E(!(EX(((p9==1)||(p106==1)))) U (!(!(E(TRUE U !((p47==1))))) * !(EX(((p9==1)||(p106==1)))))) + E...427
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, ...313
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.624877,32080,1,0,416,180647,226,246,2117,162953,480
FORMULA HealthRecord-PT-01-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-24 02:50:55] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:50:55] [INFO ] Flatten gal took : 4 ms
Total runtime 88618 ms.

BK_STOP 1716519056003

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-01"
export BK_EXAMINATION="CTLFireability"
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-01, examination is CTLFireability"
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-171640604000698"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-01.tgz
mv HealthRecord-PT-01 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;