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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Apr 12 20:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 12 20:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 20:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 20:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 50K 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-04-CTLFireability-2024-00
FORMULA_NAME HealthRecord-PT-04-CTLFireability-2024-01
FORMULA_NAME HealthRecord-PT-04-CTLFireability-2024-02
FORMULA_NAME HealthRecord-PT-04-CTLFireability-2024-03
FORMULA_NAME HealthRecord-PT-04-CTLFireability-2024-04
FORMULA_NAME HealthRecord-PT-04-CTLFireability-2024-05
FORMULA_NAME HealthRecord-PT-04-CTLFireability-2024-06
FORMULA_NAME HealthRecord-PT-04-CTLFireability-2024-07
FORMULA_NAME HealthRecord-PT-04-CTLFireability-2024-08
FORMULA_NAME HealthRecord-PT-04-CTLFireability-2024-09
FORMULA_NAME HealthRecord-PT-04-CTLFireability-2024-10
FORMULA_NAME HealthRecord-PT-04-CTLFireability-2024-11
FORMULA_NAME HealthRecord-PT-04-CTLFireability-2023-12
FORMULA_NAME HealthRecord-PT-04-CTLFireability-2023-13
FORMULA_NAME HealthRecord-PT-04-CTLFireability-2023-14
FORMULA_NAME HealthRecord-PT-04-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716519333074

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-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-24 02:55:34] [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:55:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 02:55:34] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2024-05-24 02:55:34] [INFO ] Transformed 123 places.
[2024-05-24 02:55:34] [INFO ] Transformed 239 transitions.
[2024-05-24 02:55:34] [INFO ] Found NUPN structural information;
[2024-05-24 02:55:34] [INFO ] Parsed PT model containing 123 places and 239 transitions and 617 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
Support contains 79 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 231/231 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 107 transition count 203
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 107 transition count 203
Applied a total of 32 rules in 19 ms. Remains 107 /123 variables (removed 16) and now considering 203/231 (removed 28) transitions.
[2024-05-24 02:55:34] [INFO ] Flow matrix only has 199 transitions (discarded 4 similar events)
// Phase 1: matrix 199 rows 107 cols
[2024-05-24 02:55:34] [INFO ] Computed 10 invariants in 14 ms
[2024-05-24 02:55:34] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-24 02:55:34] [INFO ] Flow matrix only has 199 transitions (discarded 4 similar events)
[2024-05-24 02:55:34] [INFO ] Invariant cache hit.
[2024-05-24 02:55:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:55:34] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2024-05-24 02:55:34] [INFO ] Flow matrix only has 199 transitions (discarded 4 similar events)
[2024-05-24 02:55:34] [INFO ] Invariant cache hit.
[2024-05-24 02:55:34] [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, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-24 02:55:36] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 10 ms to minimize.
[2024-05-24 02:55:36] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-24 02:55:36] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-05-24 02:55:36] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-24 02:55:36] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:55:36] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-24 02:55:36] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-05-24 02:55:36] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-24 02:55:36] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-24 02:55:36] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-24 02:55:37] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:55:37] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-24 02:55:37] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:55:37] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-24 02:55:37] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-24 02:55:37] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:55:37] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-24 02:55:37] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-24 02:55:37] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:55:37] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-24 02:55:37] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-24 02:55:38] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-24 02:55:38] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-24 02:55:38] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-24 02:55:38] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-24 02:55:38] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-24 02:55:38] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:55:38] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 0 ms to minimize.
[2024-05-24 02:55:38] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-24 02:55:38] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-24 02:55:38] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-24 02:55:38] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-24 02:55:38] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-24 02:55:38] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:55:38] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 3 ms to minimize.
[2024-05-24 02:55:38] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-24 02:55:38] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 0 ms to minimize.
[2024-05-24 02:55:38] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-24 02:55:38] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-24 02:55:38] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-24 02:55:39] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-05-24 02:55:39] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-24 02:55:39] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:55:39] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-24 02:55:39] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-24 02:55:39] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:55:39] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-05-24 02:55:39] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:55:39] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-24 02:55:39] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-24 02:55:39] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-24 02:55:39] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-05-24 02:55:39] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-05-24 02:55:40] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-24 02:55:40] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-05-24 02:55:40] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-24 02:55:40] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 9 ms to minimize.
[2024-05-24 02:55:40] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:55:40] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-24 02:55:40] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:55:41] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 1 ms to minimize.
[2024-05-24 02:55:41] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-24 02:55:41] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-24 02:55:41] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-24 02:55:41] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:55:41] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 0 ms to minimize.
[2024-05-24 02:55:41] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-24 02:55:41] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 14/78 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-24 02:55:42] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (OVERLAPS) 198/305 variables, 107/186 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 11 (OVERLAPS) 1/306 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-24 02:55:45] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-24 02:55:45] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-24 02:55:47] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-24 02:55:47] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-24 02:55:47] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/306 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 15 (OVERLAPS) 0/306 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 192 constraints, problems are : Problem set: 0 solved, 202 unsolved in 15866 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 74/74 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 74/84 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-24 02:55:51] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-24 02:55:51] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 198/305 variables, 107/193 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 202/395 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-24 02:55:54] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 1 ms to minimize.
[2024-05-24 02:55:54] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (OVERLAPS) 1/306 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 12 (OVERLAPS) 0/306 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 398 constraints, problems are : Problem set: 0 solved, 202 unsolved in 18334 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 78/78 constraints]
After SMT, in 34327ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 34344ms
Starting structural reductions in LTL mode, iteration 1 : 107/123 places, 203/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34734 ms. Remains : 107/123 places, 203/231 transitions.
Support contains 79 out of 107 places after structural reductions.
[2024-05-24 02:56:09] [INFO ] Flatten gal took : 39 ms
[2024-05-24 02:56:09] [INFO ] Flatten gal took : 17 ms
[2024-05-24 02:56:09] [INFO ] Input system was already deterministic with 203 transitions.
Support contains 78 out of 107 places (down from 79) after GAL structural reductions.
RANDOM walk for 40000 steps (3112 resets) in 1584 ms. (25 steps per ms) remains 29/68 properties
BEST_FIRST walk for 4003 steps (45 resets) in 24 ms. (160 steps per ms) remains 27/29 properties
BEST_FIRST walk for 4004 steps (43 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (44 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (43 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (44 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (43 resets) in 14 ms. (266 steps per ms) remains 25/27 properties
BEST_FIRST walk for 4003 steps (44 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (43 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (43 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (46 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (40 resets) in 25 ms. (154 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (41 resets) in 10 ms. (363 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (45 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (43 resets) in 42 ms. (93 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (43 resets) in 25 ms. (153 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (45 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (43 resets) in 7 ms. (500 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4004 steps (42 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (43 resets) in 25 ms. (153 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4004 steps (44 resets) in 7 ms. (500 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (45 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (42 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (44 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (42 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (46 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
[2024-05-24 02:56:10] [INFO ] Flow matrix only has 199 transitions (discarded 4 similar events)
[2024-05-24 02:56:10] [INFO ] Invariant cache hit.
[2024-05-24 02:56:10] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 45/77 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 3 (OVERLAPS) 30/107 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 198/305 variables, 107/117 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-05-24 02:56:11] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-24 02:56:11] [INFO ] Deduced a trap composed of 38 places in 370 ms of which 1 ms to minimize.
[2024-05-24 02:56:11] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-24 02:56:11] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
Problem AtomicPropp45 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 4/121 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/121 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 1/306 variables, 1/122 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 0/122 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 0/306 variables, 0/122 constraints. Problems are: Problem set: 2 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 122 constraints, problems are : Problem set: 2 solved, 21 unsolved in 1341 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 2 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 47/76 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 1/5 constraints. Problems are: Problem set: 2 solved, 21 unsolved
[2024-05-24 02:56:11] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-24 02:56:12] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 0 ms to minimize.
[2024-05-24 02:56:12] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 0 ms to minimize.
Problem AtomicPropp14 is UNSAT
[2024-05-24 02:56:12] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-24 02:56:12] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-24 02:56:12] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:56:12] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-24 02:56:12] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:56:12] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-05-24 02:56:12] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 0 ms to minimize.
[2024-05-24 02:56:12] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 0 ms to minimize.
[2024-05-24 02:56:12] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-24 02:56:12] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 13/18 constraints. Problems are: Problem set: 3 solved, 20 unsolved
[2024-05-24 02:56:12] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-05-24 02:56:12] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 2/20 constraints. Problems are: Problem set: 3 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/20 constraints. Problems are: Problem set: 3 solved, 20 unsolved
Problem AtomicPropp61 is UNSAT
At refinement iteration 6 (OVERLAPS) 31/107 variables, 6/26 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 3/29 constraints. Problems are: Problem set: 4 solved, 19 unsolved
[2024-05-24 02:56:12] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-05-24 02:56:12] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-24 02:56:12] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 0 ms to minimize.
[2024-05-24 02:56:13] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-24 02:56:13] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-24 02:56:13] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2024-05-24 02:56:13] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-24 02:56:13] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-24 02:56:13] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-24 02:56:13] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-24 02:56:13] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 0 ms to minimize.
[2024-05-24 02:56:13] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
[2024-05-24 02:56:13] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 13/42 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/42 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 198/305 variables, 107/149 constraints. Problems are: Problem set: 4 solved, 19 unsolved
Problem AtomicPropp36 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/305 variables, 19/168 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/305 variables, 0/168 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 1/306 variables, 1/169 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/306 variables, 0/169 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 0/306 variables, 0/169 constraints. Problems are: Problem set: 5 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 169 constraints, problems are : Problem set: 5 solved, 18 unsolved in 2569 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/23 constraints, Known Traps: 32/32 constraints]
After SMT, in 3928ms problems are : Problem set: 5 solved, 18 unsolved
Fused 18 Parikh solutions to 15 different solutions.
Parikh walk visited 14 properties in 1051 ms.
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 203/203 transitions.
Graph (trivial) has 149 edges and 107 vertex of which 6 / 107 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 373 edges and 104 vertex of which 100 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 100 transition count 189
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 13 place count 97 transition count 184
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 16 place count 95 transition count 183
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 95 transition count 182
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 94 transition count 182
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 61 place count 51 transition count 96
Iterating global reduction 3 with 43 rules applied. Total rules applied 104 place count 51 transition count 96
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 114 place count 41 transition count 76
Iterating global reduction 3 with 10 rules applied. Total rules applied 124 place count 41 transition count 76
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 128 place count 41 transition count 72
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 131 place count 38 transition count 63
Iterating global reduction 4 with 3 rules applied. Total rules applied 134 place count 38 transition count 63
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 136 place count 36 transition count 59
Iterating global reduction 4 with 2 rules applied. Total rules applied 138 place count 36 transition count 59
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 140 place count 36 transition count 57
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 150 place count 31 transition count 81
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 151 place count 31 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 152 place count 30 transition count 80
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 154 place count 30 transition count 140
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 158 place count 28 transition count 138
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 159 place count 27 transition count 105
Iterating global reduction 7 with 1 rules applied. Total rules applied 160 place count 27 transition count 105
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 161 place count 26 transition count 103
Iterating global reduction 7 with 1 rules applied. Total rules applied 162 place count 26 transition count 103
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 166 place count 26 transition count 99
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 174 place count 26 transition count 99
Applied a total of 174 rules in 77 ms. Remains 26 /107 variables (removed 81) and now considering 99/203 (removed 104) transitions.
Running 83 sub problems to find dead transitions.
[2024-05-24 02:56:15] [INFO ] Flow matrix only has 79 transitions (discarded 20 similar events)
// Phase 1: matrix 79 rows 26 cols
[2024-05-24 02:56:15] [INFO ] Computed 6 invariants in 4 ms
[2024-05-24 02:56:15] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/26 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Problem TDEAD30 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
At refinement iteration 3 (OVERLAPS) 79/105 variables, 26/32 constraints. Problems are: Problem set: 9 solved, 74 unsolved
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 14/46 constraints. Problems are: Problem set: 11 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/46 constraints. Problems are: Problem set: 11 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/105 variables, 0/46 constraints. Problems are: Problem set: 11 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 46 constraints, problems are : Problem set: 11 solved, 72 unsolved in 977 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 26/26 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 2/26 variables, 6/6 constraints. Problems are: Problem set: 11 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 11 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 79/105 variables, 26/32 constraints. Problems are: Problem set: 11 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 14/46 constraints. Problems are: Problem set: 11 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 72/118 constraints. Problems are: Problem set: 11 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/118 constraints. Problems are: Problem set: 11 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/105 variables, 0/118 constraints. Problems are: Problem set: 11 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 118 constraints, problems are : Problem set: 11 solved, 72 unsolved in 1196 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 26/26 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 72/83 constraints, Known Traps: 0/0 constraints]
After SMT, in 2274ms problems are : Problem set: 11 solved, 72 unsolved
Search for dead transitions found 11 dead transitions in 2277ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 11 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 26/107 places, 88/203 transitions.
Graph (complete) has 79 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 25 /26 variables (removed 1) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2365 ms. Remains : 25/107 places, 88/203 transitions.
RANDOM walk for 4264 steps (708 resets) in 83 ms. (50 steps per ms) remains 0/4 properties
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-05-24 02:56:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-24 02:56:17] [INFO ] Flatten gal took : 12 ms
FORMULA HealthRecord-PT-04-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 02:56:17] [INFO ] Flatten gal took : 11 ms
[2024-05-24 02:56:18] [INFO ] Input system was already deterministic with 203 transitions.
Computed a total of 11 stabilizing places and 20 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 203/203 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 64 transition count 119
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 64 transition count 119
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 93 place count 57 transition count 105
Iterating global reduction 0 with 7 rules applied. Total rules applied 100 place count 57 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 102 place count 57 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 55 transition count 97
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 55 transition count 97
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 53 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 53 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 111 place count 53 transition count 92
Applied a total of 111 rules in 10 ms. Remains 53 /107 variables (removed 54) and now considering 92/203 (removed 111) transitions.
[2024-05-24 02:56:18] [INFO ] Flow matrix only has 90 transitions (discarded 2 similar events)
// Phase 1: matrix 90 rows 53 cols
[2024-05-24 02:56:18] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 02:56:18] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-24 02:56:18] [INFO ] Flow matrix only has 90 transitions (discarded 2 similar events)
[2024-05-24 02:56:18] [INFO ] Invariant cache hit.
[2024-05-24 02:56:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:56:18] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-05-24 02:56:18] [INFO ] Flow matrix only has 90 transitions (discarded 2 similar events)
[2024-05-24 02:56:18] [INFO ] Invariant cache hit.
[2024-05-24 02:56:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 02:56:18] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-24 02:56:18] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-24 02:56:18] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2024-05-24 02:56:18] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 02:56:18] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 02:56:19] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 89/142 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 1/143 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 68 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 02:56:20] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 89/142 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 91/159 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 1/143 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 160 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2218 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 7/7 constraints]
After SMT, in 4291ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4292ms
Starting structural reductions in LTL mode, iteration 1 : 53/107 places, 92/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4438 ms. Remains : 53/107 places, 92/203 transitions.
[2024-05-24 02:56:22] [INFO ] Flatten gal took : 8 ms
[2024-05-24 02:56:22] [INFO ] Flatten gal took : 6 ms
[2024-05-24 02:56:22] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-24 02:56:22] [INFO ] Flatten gal took : 5 ms
[2024-05-24 02:56:22] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:56:22] [INFO ] Time to serialize gal into /tmp/CTLFireability2088386405928484058.gal : 2 ms
[2024-05-24 02:56:22] [INFO ] Time to serialize properties into /tmp/CTLFireability2083995785107049601.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2088386405928484058.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2083995785107049601.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,121213,0.085964,7068,2,954,5,13945,6,0,299,18049,0


Converting to forward existential form...Done !
original formula: A(AG(!(EG(((p29==1)&&(p120==1))))) U (!(E(((!((p59==1)||((p77==1)&&(p84==1))))||(p31==1)) U ((AX((p113==1)) * ((p74==1)||((p77==1)&&(p86=...242
=> equivalent forward existential formula: [((Init * !(EG(!((!(E(((!((p59==1)||((p77==1)&&(p84==1))))||(p31==1)) U ((!(EX(!((p113==1)))) * ((p74==1)||((p77...1102
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t21, t23, t...352
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.75559,62656,1,0,369,334403,227,208,2232,365154,425
FORMULA HealthRecord-PT-04-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 203/203 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 63 transition count 117
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 63 transition count 117
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 96 place count 55 transition count 101
Iterating global reduction 0 with 8 rules applied. Total rules applied 104 place count 55 transition count 101
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 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 109 place count 53 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 111 place count 53 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 52 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 52 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 114 place count 52 transition count 89
Applied a total of 114 rules in 13 ms. Remains 52 /107 variables (removed 55) and now considering 89/203 (removed 114) transitions.
[2024-05-24 02:56:24] [INFO ] Flow matrix only has 87 transitions (discarded 2 similar events)
// Phase 1: matrix 87 rows 52 cols
[2024-05-24 02:56:24] [INFO ] Computed 8 invariants in 2 ms
[2024-05-24 02:56:24] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-24 02:56:24] [INFO ] Flow matrix only has 87 transitions (discarded 2 similar events)
[2024-05-24 02:56:24] [INFO ] Invariant cache hit.
[2024-05-24 02:56:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:56:24] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2024-05-24 02:56:24] [INFO ] Flow matrix only has 87 transitions (discarded 2 similar events)
[2024-05-24 02:56:24] [INFO ] Invariant cache hit.
[2024-05-24 02:56:24] [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, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-24 02:56:24] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-24 02:56:24] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-24 02:56:24] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-24 02:56:24] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-24 02:56:24] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:56:25] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-24 02:56:25] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-24 02:56:25] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 86/138 variables, 52/68 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-24 02:56:25] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 1/139 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 12 (OVERLAPS) 0/139 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 70 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2491 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 86/138 variables, 52/69 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 88/157 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 1/139 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/139 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 158 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2155 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 9/9 constraints]
After SMT, in 4670ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 4671ms
Starting structural reductions in LTL mode, iteration 1 : 52/107 places, 89/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4782 ms. Remains : 52/107 places, 89/203 transitions.
[2024-05-24 02:56:29] [INFO ] Flatten gal took : 7 ms
[2024-05-24 02:56:29] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:56:29] [INFO ] Input system was already deterministic with 89 transitions.
[2024-05-24 02:56:29] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:56:29] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:56:29] [INFO ] Time to serialize gal into /tmp/CTLFireability9404094989794592095.gal : 2 ms
[2024-05-24 02:56:29] [INFO ] Time to serialize properties into /tmp/CTLFireability9948773606247140008.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/CTLFireability9404094989794592095.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9948773606247140008.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,78822,0.030359,4732,2,849,5,5224,6,0,292,4529,0


Converting to forward existential form...Done !
original formula: E(((p64!=1) * ((p38==1) + (EF((p38==1)) * AX((p122==1))))) U A((p119==1) U E(AF(((p77==1)&&(p82==1))) U (((p68==1)&&(p109==1))||(((p46==1...183
=> equivalent forward existential formula: [((FwdU(Init,((p64!=1) * ((p38==1) + (E(TRUE U (p38==1)) * !(EX(!((p122==1)))))))) * !(EG(!(E(!(EG(!(((p77==1)&&...467
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...342
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.878128,37104,1,0,480,191016,223,271,2119,200529,538
FORMULA HealthRecord-PT-04-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 107/107 places, 203/203 transitions.
Graph (trivial) has 143 edges and 107 vertex of which 6 / 107 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 44 place count 61 transition count 117
Iterating global reduction 0 with 43 rules applied. Total rules applied 87 place count 61 transition count 117
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 97 place count 51 transition count 97
Iterating global reduction 0 with 10 rules applied. Total rules applied 107 place count 51 transition count 97
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 51 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 113 place count 49 transition count 87
Iterating global reduction 1 with 2 rules applied. Total rules applied 115 place count 49 transition count 87
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 117 place count 47 transition count 83
Iterating global reduction 1 with 2 rules applied. Total rules applied 119 place count 47 transition count 83
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 47 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 47 transition count 79
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 127 place count 45 transition count 77
Applied a total of 127 rules in 20 ms. Remains 45 /107 variables (removed 62) and now considering 77/203 (removed 126) transitions.
[2024-05-24 02:56:30] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
// Phase 1: matrix 74 rows 45 cols
[2024-05-24 02:56:30] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:56:30] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 02:56:30] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
[2024-05-24 02:56:30] [INFO ] Invariant cache hit.
[2024-05-24 02:56:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:56:30] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-05-24 02:56:30] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-24 02:56:30] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
[2024-05-24 02:56:30] [INFO ] Invariant cache hit.
[2024-05-24 02:56:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-24 02:56:30] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-24 02:56:30] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-24 02:56:30] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-24 02:56:30] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-24 02:56:30] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 73/118 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 1/119 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 58 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1287 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-24 02:56:31] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 73/118 variables, 45/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 76/134 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 1/119 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/119 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 135 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1716 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 6/6 constraints]
After SMT, in 3023ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 3025ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/107 places, 77/203 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3136 ms. Remains : 45/107 places, 77/203 transitions.
[2024-05-24 02:56:33] [INFO ] Flatten gal took : 6 ms
[2024-05-24 02:56:33] [INFO ] Flatten gal took : 5 ms
[2024-05-24 02:56:33] [INFO ] Input system was already deterministic with 77 transitions.
[2024-05-24 02:56:33] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:56:33] [INFO ] Flatten gal took : 7 ms
[2024-05-24 02:56:33] [INFO ] Time to serialize gal into /tmp/CTLFireability5207233565212148281.gal : 1 ms
[2024-05-24 02:56:33] [INFO ] Time to serialize properties into /tmp/CTLFireability12232854403471806271.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/CTLFireability5207233565212148281.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12232854403471806271.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,80033,0.032721,4712,2,987,5,5711,6,0,253,6074,0


Converting to forward existential form...Done !
original formula: EF((EF(EG((p49==1))) * ((AF((p122==0)) + !(A((p21==1) U AF((p4==1))))) + AG(EF((p97==0))))))
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * E(TRUE U EG((p49==1)))) * !(EG(!((p122==0)))))] != FALSE + ([FwdG((FwdU((FwdU(Init,TRUE) ...420
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t2...281
(forward)formula 0,1,0.361341,17852,1,0,225,83751,183,100,1795,68056,274
FORMULA HealthRecord-PT-04-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 203/203 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 63 transition count 118
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 63 transition count 118
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 96 place count 55 transition count 102
Iterating global reduction 0 with 8 rules applied. Total rules applied 104 place count 55 transition count 102
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 99
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 110 place count 52 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 113 place count 52 transition count 90
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 115 place count 50 transition count 86
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 50 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 119 place count 50 transition count 84
Applied a total of 119 rules in 6 ms. Remains 50 /107 variables (removed 57) and now considering 84/203 (removed 119) transitions.
[2024-05-24 02:56:33] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
// Phase 1: matrix 83 rows 50 cols
[2024-05-24 02:56:33] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:56:33] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 02:56:33] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2024-05-24 02:56:33] [INFO ] Invariant cache hit.
[2024-05-24 02:56:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:56:33] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2024-05-24 02:56:33] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2024-05-24 02:56:33] [INFO ] Invariant cache hit.
[2024-05-24 02:56:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-24 02:56:33] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-24 02:56:34] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-24 02:56:34] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-24 02:56:34] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 82/132 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-24 02:56:34] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 1/133 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 0/133 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 63 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1807 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-24 02:56:35] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-24 02:56:35] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 82/132 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 83/147 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 1/133 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 11 (OVERLAPS) 0/133 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 148 constraints, problems are : Problem set: 0 solved, 83 unsolved in 2308 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 7/7 constraints]
After SMT, in 4135ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 4136ms
Starting structural reductions in LTL mode, iteration 1 : 50/107 places, 84/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4222 ms. Remains : 50/107 places, 84/203 transitions.
[2024-05-24 02:56:37] [INFO ] Flatten gal took : 8 ms
[2024-05-24 02:56:37] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:56:37] [INFO ] Input system was already deterministic with 84 transitions.
[2024-05-24 02:56:37] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:56:37] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:56:37] [INFO ] Time to serialize gal into /tmp/CTLFireability10027441480241102058.gal : 2 ms
[2024-05-24 02:56:37] [INFO ] Time to serialize properties into /tmp/CTLFireability965460162406887277.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/CTLFireability10027441480241102058.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability965460162406887277.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,78499,0.046565,5232,2,1057,5,7306,6,0,282,8499,0


Converting to forward existential form...Done !
original formula: (AG(((E((p118==1) U (p66==1)) + EX((p65==1))) + EX((p114==0)))) + EX(AX((EF((p27==1)) * AF((p18==1))))))
=> equivalent forward existential formula: [(((FwdU((Init * !(EX(!(EX(!((E(TRUE U (p27==1)) * !(EG(!((p18==1))))))))))),TRUE) * !(EX((p114==0)))) * !(EX((p...203
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t10, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t...332
(forward)formula 0,0,1.08489,45804,1,0,337,236147,203,158,2072,269091,362
FORMULA HealthRecord-PT-04-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 203/203 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 60 transition count 112
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 60 transition count 112
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 103 place count 51 transition count 94
Iterating global reduction 0 with 9 rules applied. Total rules applied 112 place count 51 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 114 place count 51 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 117 place count 48 transition count 83
Iterating global reduction 1 with 3 rules applied. Total rules applied 120 place count 48 transition count 83
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 123 place count 45 transition count 77
Iterating global reduction 1 with 3 rules applied. Total rules applied 126 place count 45 transition count 77
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 129 place count 45 transition count 74
Applied a total of 129 rules in 5 ms. Remains 45 /107 variables (removed 62) and now considering 74/203 (removed 129) transitions.
[2024-05-24 02:56:38] [INFO ] Flow matrix only has 73 transitions (discarded 1 similar events)
// Phase 1: matrix 73 rows 45 cols
[2024-05-24 02:56:38] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:56:38] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-24 02:56:38] [INFO ] Flow matrix only has 73 transitions (discarded 1 similar events)
[2024-05-24 02:56:39] [INFO ] Invariant cache hit.
[2024-05-24 02:56:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:56:39] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-05-24 02:56:39] [INFO ] Flow matrix only has 73 transitions (discarded 1 similar events)
[2024-05-24 02:56:39] [INFO ] Invariant cache hit.
[2024-05-24 02:56:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-24 02:56:39] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-24 02:56:39] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-24 02:56:39] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 72/117 variables, 45/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 1/118 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/118 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 56 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1205 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-24 02:56:40] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 72/117 variables, 45/56 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 73/129 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 1/118 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/118 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 130 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1695 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 4/4 constraints]
After SMT, in 2917ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2918ms
Starting structural reductions in LTL mode, iteration 1 : 45/107 places, 74/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3031 ms. Remains : 45/107 places, 74/203 transitions.
[2024-05-24 02:56:41] [INFO ] Flatten gal took : 6 ms
[2024-05-24 02:56:41] [INFO ] Flatten gal took : 5 ms
[2024-05-24 02:56:41] [INFO ] Input system was already deterministic with 74 transitions.
[2024-05-24 02:56:41] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:56:42] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:56:42] [INFO ] Time to serialize gal into /tmp/CTLFireability9104969945316161900.gal : 1 ms
[2024-05-24 02:56:42] [INFO ] Time to serialize properties into /tmp/CTLFireability13125695151495262949.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/CTLFireability9104969945316161900.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13125695151495262949.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,37919,0.038656,4720,2,1046,5,5749,6,0,252,5746,0


Converting to forward existential form...Done !
original formula: AX((E((AX(((p5==1)||((p29==1)&&(p120==1)))) + EX(((p114==1)||(p73==1)))) U (p73==1)) + EX(EF((p82==1)))))
=> equivalent forward existential formula: [((EY(Init) * !(EX(E(TRUE U (p82==1))))) * !(E((!(EX(!(((p5==1)||((p29==1)&&(p120==1)))))) + EX(((p114==1)||(p73...185
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t9, t10, t11, t12, t13, t14, t15, t16, t18, t20, t22, t24, t36, t37, ...258
(forward)formula 0,1,0.237275,13696,1,0,154,51054,174,75,1802,47966,189
FORMULA HealthRecord-PT-04-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 107/107 places, 203/203 transitions.
Graph (trivial) has 117 edges and 107 vertex of which 6 / 107 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 58 transition count 112
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 58 transition count 112
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 101 place count 48 transition count 92
Iterating global reduction 0 with 10 rules applied. Total rules applied 111 place count 48 transition count 92
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 116 place count 48 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 47 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 47 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 46 transition count 82
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 46 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 121 place count 46 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 46 transition count 79
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 127 place count 44 transition count 77
Applied a total of 127 rules in 17 ms. Remains 44 /107 variables (removed 63) and now considering 77/203 (removed 126) transitions.
[2024-05-24 02:56:42] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
// Phase 1: matrix 74 rows 44 cols
[2024-05-24 02:56:42] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:56:42] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 02:56:42] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
[2024-05-24 02:56:42] [INFO ] Invariant cache hit.
[2024-05-24 02:56:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:56:42] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-24 02:56:42] [INFO ] Redundant transitions in 2 ms returned []
Running 63 sub problems to find dead transitions.
[2024-05-24 02:56:42] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
[2024-05-24 02:56:42] [INFO ] Invariant cache hit.
[2024-05-24 02:56:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 7/44 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-05-24 02:56:42] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-24 02:56:42] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-24 02:56:42] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-24 02:56:42] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 73/117 variables, 44/55 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 1/118 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 0/118 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 56 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1204 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 44/44 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 7/44 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-05-24 02:56:43] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 73/117 variables, 44/56 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 63/119 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 1/118 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 11 (OVERLAPS) 0/118 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 120 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1252 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 44/44 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 5/5 constraints]
After SMT, in 2476ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 2477ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/107 places, 77/203 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2579 ms. Remains : 44/107 places, 77/203 transitions.
[2024-05-24 02:56:44] [INFO ] Flatten gal took : 7 ms
[2024-05-24 02:56:44] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:56:44] [INFO ] Input system was already deterministic with 77 transitions.
[2024-05-24 02:56:44] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:56:44] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:56:44] [INFO ] Time to serialize gal into /tmp/CTLFireability10226348132982049270.gal : 1 ms
[2024-05-24 02:56:44] [INFO ] Time to serialize properties into /tmp/CTLFireability15974589838794087261.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/CTLFireability10226348132982049270.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15974589838794087261.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,69745,0.031079,4708,2,586,5,4993,6,0,249,5418,0


Converting to forward existential form...Done !
original formula: AF((A(!((AF((p58==1)) + (p47!=1))) U AG(!(((p16==1)&&(p120==1))))) + AF((((p8==1)&&(((p22==0)||(p16==0))||(p120==0)))&&(p91==0)))))
=> equivalent forward existential formula: [FwdG(Init,!((!((E(!(!(E(TRUE U !(!(((p16==1)&&(p120==1))))))) U (!(!((!(EG(!((p58==1)))) + (p47!=1)))) * !(!(E(...327
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, t20, t21...315
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.962635,39932,1,0,475,218564,196,259,1824,228861,528
FORMULA HealthRecord-PT-04-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 203/203 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 58 transition count 108
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 58 transition count 108
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 108 place count 48 transition count 88
Iterating global reduction 0 with 10 rules applied. Total rules applied 118 place count 48 transition count 88
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 122 place count 48 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 124 place count 46 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 126 place count 46 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 128 place count 44 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 130 place count 44 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 132 place count 44 transition count 72
Applied a total of 132 rules in 7 ms. Remains 44 /107 variables (removed 63) and now considering 72/203 (removed 131) transitions.
[2024-05-24 02:56:45] [INFO ] Flow matrix only has 71 transitions (discarded 1 similar events)
// Phase 1: matrix 71 rows 44 cols
[2024-05-24 02:56:45] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:56:45] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 02:56:45] [INFO ] Flow matrix only has 71 transitions (discarded 1 similar events)
[2024-05-24 02:56:45] [INFO ] Invariant cache hit.
[2024-05-24 02:56:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:56:45] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Running 71 sub problems to find dead transitions.
[2024-05-24 02:56:45] [INFO ] Flow matrix only has 71 transitions (discarded 1 similar events)
[2024-05-24 02:56:45] [INFO ] Invariant cache hit.
[2024-05-24 02:56:45] [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, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-24 02:56:46] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-24 02:56:46] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-24 02:56:46] [INFO ] Deduced a trap composed of 5 places in 27 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, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 70/114 variables, 44/54 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 1/115 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/115 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 55 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1077 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 44/44 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-24 02:56:47] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (OVERLAPS) 70/114 variables, 44/55 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 71/126 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 1/115 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 0/115 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 127 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1465 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 44/44 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 4/4 constraints]
After SMT, in 2557ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 2558ms
Starting structural reductions in LTL mode, iteration 1 : 44/107 places, 72/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2645 ms. Remains : 44/107 places, 72/203 transitions.
[2024-05-24 02:56:48] [INFO ] Flatten gal took : 6 ms
[2024-05-24 02:56:48] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:56:48] [INFO ] Input system was already deterministic with 72 transitions.
[2024-05-24 02:56:48] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:56:48] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:56:48] [INFO ] Time to serialize gal into /tmp/CTLFireability9563962959359960078.gal : 1 ms
[2024-05-24 02:56:48] [INFO ] Time to serialize properties into /tmp/CTLFireability9776550072515912447.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/CTLFireability9563962959359960078.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9776550072515912447.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,40104,0.04255,4980,2,1037,5,6262,6,0,246,6970,0


Converting to forward existential form...Done !
original formula: EG(EX(AG((p6==0))))
=> equivalent forward existential formula: [FwdG(Init,EX(!(E(TRUE U !((p6==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t18, t20, t22, t34, t35, ...252
(forward)formula 0,0,0.203996,12636,1,0,136,45957,170,63,1744,41133,162
FORMULA HealthRecord-PT-04-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 203/203 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 58 transition count 108
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 58 transition count 108
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 108 place count 48 transition count 88
Iterating global reduction 0 with 10 rules applied. Total rules applied 118 place count 48 transition count 88
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 122 place count 48 transition count 84
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 125 place count 45 transition count 75
Iterating global reduction 1 with 3 rules applied. Total rules applied 128 place count 45 transition count 75
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 131 place count 42 transition count 69
Iterating global reduction 1 with 3 rules applied. Total rules applied 134 place count 42 transition count 69
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 137 place count 42 transition count 66
Applied a total of 137 rules in 10 ms. Remains 42 /107 variables (removed 65) and now considering 66/203 (removed 137) transitions.
[2024-05-24 02:56:48] [INFO ] Flow matrix only has 65 transitions (discarded 1 similar events)
// Phase 1: matrix 65 rows 42 cols
[2024-05-24 02:56:48] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 02:56:48] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 02:56:48] [INFO ] Flow matrix only has 65 transitions (discarded 1 similar events)
[2024-05-24 02:56:48] [INFO ] Invariant cache hit.
[2024-05-24 02:56:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:56:48] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-24 02:56:48] [INFO ] Flow matrix only has 65 transitions (discarded 1 similar events)
[2024-05-24 02:56:48] [INFO ] Invariant cache hit.
[2024-05-24 02:56:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-24 02:56:49] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-24 02:56:49] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-24 02:56:49] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 64/106 variables, 42/52 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 1/107 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/107 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 53 constraints, problems are : Problem set: 0 solved, 65 unsolved in 997 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-24 02:56:49] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 64/106 variables, 42/53 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 65/118 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 1/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1314 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 4/4 constraints]
After SMT, in 2324ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 2325ms
Starting structural reductions in LTL mode, iteration 1 : 42/107 places, 66/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2406 ms. Remains : 42/107 places, 66/203 transitions.
[2024-05-24 02:56:51] [INFO ] Flatten gal took : 5 ms
[2024-05-24 02:56:51] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:56:51] [INFO ] Input system was already deterministic with 66 transitions.
[2024-05-24 02:56:51] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:56:51] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:56:51] [INFO ] Time to serialize gal into /tmp/CTLFireability6248759368790045457.gal : 1 ms
[2024-05-24 02:56:51] [INFO ] Time to serialize properties into /tmp/CTLFireability7851995788033253457.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/CTLFireability6248759368790045457.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7851995788033253457.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,29899,0.028966,4408,2,968,5,4158,6,0,232,3551,0


Converting to forward existential form...Done !
original formula: EF(((AX(!(A(((p16==1)&&(p120==1)) U (p115==1)))) * (p76==0)) * (p116==1)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (p116==1)) * (p76==0)) * !(EX(!(!(!((E(!((p115==1)) U (!(((p16==1)&&(p120==1))) * !((p115=...197
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t15, t17, t19, t21, Intersection with re...232
(forward)formula 0,1,0.585575,28292,1,0,245,147049,159,122,1587,130503,293
FORMULA HealthRecord-PT-04-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 203/203 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 59 transition count 110
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 59 transition count 110
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 105 place count 50 transition count 92
Iterating global reduction 0 with 9 rules applied. Total rules applied 114 place count 50 transition count 92
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 89
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 120 place count 47 transition count 80
Iterating global reduction 1 with 3 rules applied. Total rules applied 123 place count 47 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 125 place count 45 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 127 place count 45 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 129 place count 45 transition count 74
Applied a total of 129 rules in 7 ms. Remains 45 /107 variables (removed 62) and now considering 74/203 (removed 129) transitions.
[2024-05-24 02:56:51] [INFO ] Flow matrix only has 73 transitions (discarded 1 similar events)
// Phase 1: matrix 73 rows 45 cols
[2024-05-24 02:56:51] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 02:56:51] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 02:56:51] [INFO ] Flow matrix only has 73 transitions (discarded 1 similar events)
[2024-05-24 02:56:51] [INFO ] Invariant cache hit.
[2024-05-24 02:56:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:56:51] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-05-24 02:56:51] [INFO ] Flow matrix only has 73 transitions (discarded 1 similar events)
[2024-05-24 02:56:51] [INFO ] Invariant cache hit.
[2024-05-24 02:56:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-24 02:56:52] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-24 02:56:52] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 72/117 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 1/118 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/118 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 55 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-24 02:56:53] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-24 02:56:53] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 72/117 variables, 45/56 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 73/129 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-24 02:56:53] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 1/118 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (OVERLAPS) 0/118 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 131 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1885 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 5/5 constraints]
After SMT, in 2919ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2919ms
Starting structural reductions in LTL mode, iteration 1 : 45/107 places, 74/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3004 ms. Remains : 45/107 places, 74/203 transitions.
[2024-05-24 02:56:54] [INFO ] Flatten gal took : 6 ms
[2024-05-24 02:56:54] [INFO ] Flatten gal took : 8 ms
[2024-05-24 02:56:54] [INFO ] Input system was already deterministic with 74 transitions.
[2024-05-24 02:56:54] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:56:54] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:56:54] [INFO ] Time to serialize gal into /tmp/CTLFireability17776236045036427847.gal : 0 ms
[2024-05-24 02:56:54] [INFO ] Time to serialize properties into /tmp/CTLFireability7747884533009458602.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/CTLFireability17776236045036427847.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7747884533009458602.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,43020,0.020523,4200,2,735,5,3279,6,0,252,2709,0


Converting to forward existential form...Done !
original formula: AG((EX(AX((p87==1))) + AF(AX(EF((p62==0))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(EX(!(EX(!((p87==1))))))),!(!(EX(!(E(TRUE U (p62==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t21, t23, t...267
(forward)formula 0,1,0.131113,9216,1,0,150,26189,175,69,1810,23795,171
FORMULA HealthRecord-PT-04-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 203/203 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 62 transition count 116
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 62 transition count 116
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 98 place count 54 transition count 100
Iterating global reduction 0 with 8 rules applied. Total rules applied 106 place count 54 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 107 place count 54 transition count 99
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 110 place count 51 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 113 place count 51 transition count 90
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 115 place count 49 transition count 86
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 49 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 119 place count 49 transition count 84
Applied a total of 119 rules in 9 ms. Remains 49 /107 variables (removed 58) and now considering 84/203 (removed 119) transitions.
[2024-05-24 02:56:54] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
// Phase 1: matrix 83 rows 49 cols
[2024-05-24 02:56:54] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:56:54] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 02:56:54] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2024-05-24 02:56:54] [INFO ] Invariant cache hit.
[2024-05-24 02:56:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:56:54] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2024-05-24 02:56:54] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
[2024-05-24 02:56:54] [INFO ] Invariant cache hit.
[2024-05-24 02:56:54] [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, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-24 02:56:55] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-24 02:56:55] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-24 02:56:55] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-24 02:56:55] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 82/131 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 1/132 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 61 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1443 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-05-24 02:56:56] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-24 02:56:56] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 82/131 variables, 49/62 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 83/145 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 1/132 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 146 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1944 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 6/6 constraints]
After SMT, in 3405ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 3406ms
Starting structural reductions in LTL mode, iteration 1 : 49/107 places, 84/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3494 ms. Remains : 49/107 places, 84/203 transitions.
[2024-05-24 02:56:58] [INFO ] Flatten gal took : 6 ms
[2024-05-24 02:56:58] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:56:58] [INFO ] Input system was already deterministic with 84 transitions.
[2024-05-24 02:56:58] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:56:58] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:56:58] [INFO ] Time to serialize gal into /tmp/CTLFireability13539069769615813754.gal : 1 ms
[2024-05-24 02:56:58] [INFO ] Time to serialize properties into /tmp/CTLFireability9825945761915481709.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/CTLFireability13539069769615813754.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9825945761915481709.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,69670,0.03521,4972,2,1041,5,5949,6,0,278,5902,0


Converting to forward existential form...Done !
original formula: AG(E((!(((A((p114==1) U (p15==1)) * (p112!=1)) * (p56==1))) + EF(((p77==1)&&(p82==1)))) U (EG(AX((p81==1))) * ((EG((p16==1)) + AX((p24==1...187
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((!(((!((E(!((p15==1)) U (!((p114==1)) * !((p15==1)))) + EG(!((p15==1))))) * (p112!=1)) *...304
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t20, t21, t22, t24, ...313
Using saturation style SCC detection
(forward)formula 0,0,1.36101,53360,1,0,366,281867,220,209,2085,315479,431
FORMULA HealthRecord-PT-04-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 107/107 places, 203/203 transitions.
Graph (trivial) has 148 edges and 107 vertex of which 8 / 107 are part of one of the 4 SCC in 2 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 58 transition count 113
Iterating global reduction 0 with 44 rules applied. Total rules applied 89 place count 58 transition count 113
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 98 place count 49 transition count 95
Iterating global reduction 0 with 9 rules applied. Total rules applied 107 place count 49 transition count 95
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 49 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 48 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 48 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 47 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 47 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 116 place count 47 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 119 place count 47 transition count 82
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 123 place count 45 transition count 80
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 44 transition count 79
Applied a total of 124 rules in 21 ms. Remains 44 /107 variables (removed 63) and now considering 79/203 (removed 124) transitions.
[2024-05-24 02:56:59] [INFO ] Flow matrix only has 75 transitions (discarded 4 similar events)
// Phase 1: matrix 75 rows 44 cols
[2024-05-24 02:56:59] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:56:59] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 02:56:59] [INFO ] Flow matrix only has 75 transitions (discarded 4 similar events)
[2024-05-24 02:56:59] [INFO ] Invariant cache hit.
[2024-05-24 02:56:59] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-24 02:56:59] [INFO ] Redundant transitions in 1 ms returned []
Running 65 sub problems to find dead transitions.
[2024-05-24 02:56:59] [INFO ] Flow matrix only has 75 transitions (discarded 4 similar events)
[2024-05-24 02:56:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 7/44 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-24 02:57:00] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-24 02:57:00] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 74/118 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/118 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/119 variables, and 53 constraints, problems are : Problem set: 0 solved, 65 unsolved in 811 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 7/44 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 74/118 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 65/118 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/118 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/119 variables, and 118 constraints, problems are : Problem set: 0 solved, 65 unsolved in 853 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 2/2 constraints]
After SMT, in 1680ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 1681ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/107 places, 79/203 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1789 ms. Remains : 44/107 places, 79/203 transitions.
[2024-05-24 02:57:01] [INFO ] Flatten gal took : 6 ms
[2024-05-24 02:57:01] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:57:01] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-24 02:57:01] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:57:01] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:57:01] [INFO ] Time to serialize gal into /tmp/CTLFireability8014047712493123178.gal : 1 ms
[2024-05-24 02:57:01] [INFO ] Time to serialize properties into /tmp/CTLFireability17303137102098840890.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/CTLFireability8014047712493123178.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17303137102098840890.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,35482,0.020525,4192,2,629,5,3326,6,0,249,2675,0


Converting to forward existential form...Done !
original formula: EG((EF((p5==1)) * EF((AG((p89==1)) + (p93!=1)))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U (p5==1)) * E(TRUE U (!(E(TRUE U !((p89==1)))) + (p93!=1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...290
(forward)formula 0,1,0.162525,10264,1,0,198,34064,183,115,1772,34572,230
FORMULA HealthRecord-PT-04-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 107/107 places, 203/203 transitions.
Graph (trivial) has 147 edges and 107 vertex of which 8 / 107 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 58 transition count 113
Iterating global reduction 0 with 44 rules applied. Total rules applied 89 place count 58 transition count 113
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 98 place count 49 transition count 95
Iterating global reduction 0 with 9 rules applied. Total rules applied 107 place count 49 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 110 place count 49 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 112 place count 47 transition count 86
Iterating global reduction 1 with 2 rules applied. Total rules applied 114 place count 47 transition count 86
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 116 place count 45 transition count 82
Iterating global reduction 1 with 2 rules applied. Total rules applied 118 place count 45 transition count 82
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 45 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 123 place count 45 transition count 77
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 127 place count 43 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 42 transition count 74
Applied a total of 128 rules in 10 ms. Remains 42 /107 variables (removed 65) and now considering 74/203 (removed 129) transitions.
[2024-05-24 02:57:01] [INFO ] Flow matrix only has 70 transitions (discarded 4 similar events)
// Phase 1: matrix 70 rows 42 cols
[2024-05-24 02:57:01] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 02:57:01] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-24 02:57:01] [INFO ] Flow matrix only has 70 transitions (discarded 4 similar events)
[2024-05-24 02:57:01] [INFO ] Invariant cache hit.
[2024-05-24 02:57:01] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-24 02:57:01] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-24 02:57:01] [INFO ] Flow matrix only has 70 transitions (discarded 4 similar events)
[2024-05-24 02:57:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 7/42 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-24 02:57:02] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-24 02:57:02] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-24 02:57:02] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-24 02:57:02] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 69/111 variables, 42/53 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/111 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/112 variables, and 53 constraints, problems are : Problem set: 0 solved, 60 unsolved in 910 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 7/42 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-24 02:57:02] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-24 02:57:03] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-24 02:57:03] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-24 02:57:03] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 69/111 variables, 42/57 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 60/117 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/111 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/112 variables, and 117 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 8/8 constraints]
After SMT, in 1944ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 1944ms
Starting structural reductions in SI_CTL mode, iteration 1 : 42/107 places, 74/203 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2058 ms. Remains : 42/107 places, 74/203 transitions.
[2024-05-24 02:57:03] [INFO ] Flatten gal took : 5 ms
[2024-05-24 02:57:03] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:57:03] [INFO ] Input system was already deterministic with 74 transitions.
[2024-05-24 02:57:03] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:57:03] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:57:03] [INFO ] Time to serialize gal into /tmp/CTLFireability18149748639952130278.gal : 0 ms
[2024-05-24 02:57:03] [INFO ] Time to serialize properties into /tmp/CTLFireability17615331892657050487.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/CTLFireability18149748639952130278.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17615331892657050487.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,40666,0.034766,4692,2,759,5,4854,6,0,236,5492,0


Converting to forward existential form...Done !
original formula: AF(E(AG((p4!=1)) U !(((!(EF((p84==1))) + AG((p34==1))) + (p97==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(!(E(TRUE U !((p4!=1)))) U !(((!(E(TRUE U (p84==1))) + !(E(TRUE U !((p34==1))))) + (p97==1))))))] ...162
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, t20, t21...300
(forward)formula 0,1,0.171096,10500,1,0,177,36006,178,83,1711,33699,193
FORMULA HealthRecord-PT-04-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 203/203 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 62 transition count 116
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 62 transition count 116
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 99 place count 53 transition count 98
Iterating global reduction 0 with 9 rules applied. Total rules applied 108 place count 53 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 111 place count 53 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 114 place count 50 transition count 86
Iterating global reduction 1 with 3 rules applied. Total rules applied 117 place count 50 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 118 place count 49 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 119 place count 49 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 120 place count 49 transition count 83
Applied a total of 120 rules in 5 ms. Remains 49 /107 variables (removed 58) and now considering 83/203 (removed 120) transitions.
[2024-05-24 02:57:04] [INFO ] Flow matrix only has 82 transitions (discarded 1 similar events)
// Phase 1: matrix 82 rows 49 cols
[2024-05-24 02:57:04] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:57:04] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 02:57:04] [INFO ] Flow matrix only has 82 transitions (discarded 1 similar events)
[2024-05-24 02:57:04] [INFO ] Invariant cache hit.
[2024-05-24 02:57:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:57:04] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2024-05-24 02:57:04] [INFO ] Flow matrix only has 82 transitions (discarded 1 similar events)
[2024-05-24 02:57:04] [INFO ] Invariant cache hit.
[2024-05-24 02:57:04] [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, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-24 02:57:04] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-24 02:57:04] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-24 02:57:04] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-24 02:57:04] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 81/130 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 1/131 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 0/131 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 61 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1615 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-24 02:57:05] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 81/130 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 82/143 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 1/131 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 144 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1861 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 5/5 constraints]
After SMT, in 3490ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 3491ms
Starting structural reductions in LTL mode, iteration 1 : 49/107 places, 83/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3576 ms. Remains : 49/107 places, 83/203 transitions.
[2024-05-24 02:57:07] [INFO ] Flatten gal took : 6 ms
[2024-05-24 02:57:07] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:57:07] [INFO ] Input system was already deterministic with 83 transitions.
[2024-05-24 02:57:07] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:57:07] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:57:07] [INFO ] Time to serialize gal into /tmp/CTLFireability4096501436875096058.gal : 1 ms
[2024-05-24 02:57:07] [INFO ] Time to serialize properties into /tmp/CTLFireability9076288812949278829.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/CTLFireability4096501436875096058.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9076288812949278829.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,102069,0.029122,4436,2,579,5,3780,6,0,277,3986,0


Converting to forward existential form...Done !
original formula: AX(((A(((p22==1) * AG(AX((p33==1)))) U AG(!(EG((p63==1))))) + AX((EG((p21==1)) * (p62==1)))) + A(!(AG(((p16==1)&&(p120==1)))) U AX(E((p96...175
=> equivalent forward existential formula: ([(EY(((EY(Init) * !(!((E(!(!(EX(!(E((p96==1) U (p56==1)))))) U (!(!(!(E(TRUE U !(((p16==1)&&(p120==1))))))) * !...852
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, t20, t22, t23, t...317
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.290795,16712,1,0,281,72981,212,141,2046,71305,337
FORMULA HealthRecord-PT-04-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 203/203 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 57 transition count 106
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 57 transition count 106
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 110 place count 47 transition count 86
Iterating global reduction 0 with 10 rules applied. Total rules applied 120 place count 47 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 124 place count 47 transition count 82
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 127 place count 44 transition count 73
Iterating global reduction 1 with 3 rules applied. Total rules applied 130 place count 44 transition count 73
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 133 place count 41 transition count 67
Iterating global reduction 1 with 3 rules applied. Total rules applied 136 place count 41 transition count 67
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 139 place count 41 transition count 64
Applied a total of 139 rules in 5 ms. Remains 41 /107 variables (removed 66) and now considering 64/203 (removed 139) transitions.
[2024-05-24 02:57:07] [INFO ] Flow matrix only has 63 transitions (discarded 1 similar events)
// Phase 1: matrix 63 rows 41 cols
[2024-05-24 02:57:07] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:57:07] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 02:57:07] [INFO ] Flow matrix only has 63 transitions (discarded 1 similar events)
[2024-05-24 02:57:07] [INFO ] Invariant cache hit.
[2024-05-24 02:57:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:57:08] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2024-05-24 02:57:08] [INFO ] Flow matrix only has 63 transitions (discarded 1 similar events)
[2024-05-24 02:57:08] [INFO ] Invariant cache hit.
[2024-05-24 02:57:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-05-24 02:57:08] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-24 02:57:08] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-24 02:57:08] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 62/103 variables, 41/51 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 1/104 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/104 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 52 constraints, problems are : Problem set: 0 solved, 63 unsolved in 932 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-05-24 02:57:09] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-05-24 02:57:09] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 62/103 variables, 41/53 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 63/116 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 1/104 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 11 (OVERLAPS) 0/104 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 117 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1336 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 5/5 constraints]
After SMT, in 2281ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 2281ms
Starting structural reductions in LTL mode, iteration 1 : 41/107 places, 64/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2365 ms. Remains : 41/107 places, 64/203 transitions.
[2024-05-24 02:57:10] [INFO ] Flatten gal took : 6 ms
[2024-05-24 02:57:10] [INFO ] Flatten gal took : 1 ms
[2024-05-24 02:57:10] [INFO ] Input system was already deterministic with 64 transitions.
[2024-05-24 02:57:10] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:57:10] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:57:10] [INFO ] Time to serialize gal into /tmp/CTLFireability13105412794328120990.gal : 0 ms
[2024-05-24 02:57:10] [INFO ] Time to serialize properties into /tmp/CTLFireability254625277370957926.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/CTLFireability13105412794328120990.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability254625277370957926.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,29898,0.03149,4380,2,864,5,3755,6,0,226,3300,0


Converting to forward existential form...Done !
original formula: AG(EF(EG(AX(((p16==1)&&(p120==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EG(!(EX(!(((p16==1)&&(p120==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t15, t17, t19, Intersection with reachab...227
Using saturation style SCC detection
(forward)formula 0,0,0.193637,11508,1,0,130,40627,156,64,1674,34282,159
FORMULA HealthRecord-PT-04-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 203/203 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 64 transition count 120
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 64 transition count 120
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 95 place count 55 transition count 102
Iterating global reduction 0 with 9 rules applied. Total rules applied 104 place count 55 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 106 place count 55 transition count 100
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 53 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 53 transition count 94
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 52 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 52 transition count 92
Applied a total of 112 rules in 5 ms. Remains 52 /107 variables (removed 55) and now considering 92/203 (removed 111) transitions.
[2024-05-24 02:57:10] [INFO ] Flow matrix only has 91 transitions (discarded 1 similar events)
// Phase 1: matrix 91 rows 52 cols
[2024-05-24 02:57:10] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:57:10] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 02:57:10] [INFO ] Flow matrix only has 91 transitions (discarded 1 similar events)
[2024-05-24 02:57:10] [INFO ] Invariant cache hit.
[2024-05-24 02:57:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:57:10] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-05-24 02:57:10] [INFO ] Flow matrix only has 91 transitions (discarded 1 similar events)
[2024-05-24 02:57:10] [INFO ] Invariant cache hit.
[2024-05-24 02:57:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 02:57:10] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-24 02:57:10] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-24 02:57:11] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-24 02:57:11] [INFO ] Deduced a trap composed of 7 places in 36 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, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 90/142 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 02:57:11] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 1/143 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 0/143 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 65 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1987 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 02:57:12] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-24 02:57:12] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-24 02:57:12] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 90/142 variables, 52/67 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 91/158 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 1/143 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/143 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 159 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2352 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 8/8 constraints]
After SMT, in 4360ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4361ms
Starting structural reductions in LTL mode, iteration 1 : 52/107 places, 92/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4445 ms. Remains : 52/107 places, 92/203 transitions.
[2024-05-24 02:57:14] [INFO ] Flatten gal took : 7 ms
[2024-05-24 02:57:14] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:57:14] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-24 02:57:14] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:57:14] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:57:14] [INFO ] Time to serialize gal into /tmp/CTLFireability1942548880514554408.gal : 0 ms
[2024-05-24 02:57:14] [INFO ] Time to serialize properties into /tmp/CTLFireability5452375822710197301.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/CTLFireability1942548880514554408.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5452375822710197301.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,130149,0.088284,7408,2,1261,5,14628,6,0,298,20390,0


Converting to forward existential form...Done !
original formula: EX(((EF((p27==1)) + (p66==1)) * (AX(((AG((p4==0)) * EX(((((p17==1)&&(p23==1))&&((p30==1)&&(p37==1)))&&(((p44==1)&&(p51==1))&&((p77==1)&&(...236
=> equivalent forward existential formula: ([((EY(Init) * (E(TRUE U (p27==1)) + (p66==1))) * !(EX(!(((!(E(TRUE U !((p4==0)))) * EX(((((p17==1)&&(p23==1))&&...372
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...367
(forward)formula 0,1,0.619686,26816,1,0,237,121635,212,104,2244,108096,243
FORMULA HealthRecord-PT-04-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-24 02:57:15] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:57:15] [INFO ] Flatten gal took : 4 ms
Total runtime 101297 ms.

BK_STOP 1716519435683

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

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