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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 20:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Apr 12 20:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 20:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 20:11 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 49K 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-03-CTLFireability-2024-00
FORMULA_NAME HealthRecord-PT-03-CTLFireability-2024-01
FORMULA_NAME HealthRecord-PT-03-CTLFireability-2024-02
FORMULA_NAME HealthRecord-PT-03-CTLFireability-2024-03
FORMULA_NAME HealthRecord-PT-03-CTLFireability-2024-04
FORMULA_NAME HealthRecord-PT-03-CTLFireability-2024-05
FORMULA_NAME HealthRecord-PT-03-CTLFireability-2024-06
FORMULA_NAME HealthRecord-PT-03-CTLFireability-2024-07
FORMULA_NAME HealthRecord-PT-03-CTLFireability-2024-08
FORMULA_NAME HealthRecord-PT-03-CTLFireability-2024-09
FORMULA_NAME HealthRecord-PT-03-CTLFireability-2024-10
FORMULA_NAME HealthRecord-PT-03-CTLFireability-2024-11
FORMULA_NAME HealthRecord-PT-03-CTLFireability-2023-12
FORMULA_NAME HealthRecord-PT-03-CTLFireability-2023-13
FORMULA_NAME HealthRecord-PT-03-CTLFireability-2023-14
FORMULA_NAME HealthRecord-PT-03-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716519225181

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-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-24 02:53:46] [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:53:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 02:53:46] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2024-05-24 02:53:46] [INFO ] Transformed 121 places.
[2024-05-24 02:53:46] [INFO ] Transformed 232 transitions.
[2024-05-24 02:53:46] [INFO ] Found NUPN structural information;
[2024-05-24 02:53:46] [INFO ] Parsed PT model containing 121 places and 232 transitions and 597 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
Support contains 66 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 225/225 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 97 transition count 184
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 97 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 96 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 96 transition count 182
Applied a total of 50 rules in 23 ms. Remains 96 /121 variables (removed 25) and now considering 182/225 (removed 43) transitions.
[2024-05-24 02:53:46] [INFO ] Flow matrix only has 181 transitions (discarded 1 similar events)
// Phase 1: matrix 181 rows 96 cols
[2024-05-24 02:53:46] [INFO ] Computed 7 invariants in 7 ms
[2024-05-24 02:53:46] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-24 02:53:46] [INFO ] Flow matrix only has 181 transitions (discarded 1 similar events)
[2024-05-24 02:53:46] [INFO ] Invariant cache hit.
[2024-05-24 02:53:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:53:46] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-24 02:53:46] [INFO ] Flow matrix only has 181 transitions (discarded 1 similar events)
[2024-05-24 02:53:46] [INFO ] Invariant cache hit.
[2024-05-24 02:53:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-24 02:53:48] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 11 ms to minimize.
[2024-05-24 02:53:48] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
[2024-05-24 02:53:48] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 1 ms to minimize.
[2024-05-24 02:53:48] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-24 02:53:48] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-24 02:53:48] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:53:48] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-24 02:53:48] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:53:48] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-24 02:53:48] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-24 02:53:48] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
[2024-05-24 02:53:48] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-24 02:53:48] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-24 02:53:48] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-24 02:53:49] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-24 02:53:49] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-24 02:53:49] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-24 02:53:49] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-24 02:53:49] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-24 02:53:49] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-24 02:53:49] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-24 02:53:49] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
[2024-05-24 02:53:49] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-05-24 02:53:49] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 4 ms to minimize.
[2024-05-24 02:53:49] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-05-24 02:53:49] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
[2024-05-24 02:53:49] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-05-24 02:53:49] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-24 02:53:49] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-24 02:53:49] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-24 02:53:49] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-24 02:53:49] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-05-24 02:53:49] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-24 02:53:49] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-24 02:53:50] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 5 ms to minimize.
[2024-05-24 02:53:50] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-24 02:53:50] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-24 02:53:51] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-24 02:53:51] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2024-05-24 02:53:51] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-24 02:53:51] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-24 02:53:51] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-24 02:53:52] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-24 02:53:52] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 0 ms to minimize.
[2024-05-24 02:53:53] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-05-24 02:53:53] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-05-24 02:53:53] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-05-24 02:53:53] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-24 02:53:53] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (OVERLAPS) 180/276 variables, 96/152 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (OVERLAPS) 1/277 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/277 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 13 (OVERLAPS) 0/277 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 153 constraints, problems are : Problem set: 0 solved, 181 unsolved in 10612 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-24 02:53:58] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-24 02:53:59] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-05-24 02:53:59] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-24 02:53:59] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-24 02:53:59] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-24 02:53:59] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-05-24 02:53:59] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-05-24 02:54:00] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-24 02:54:00] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-05-24 02:54:00] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-05-24 02:54:00] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 0 ms to minimize.
[2024-05-24 02:54:00] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 11/68 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-24 02:54:00] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:54:00] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-24 02:54:00] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-24 02:54:00] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:54:00] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:54:01] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-24 02:54:01] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:54:01] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-24 02:54:01] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 9/77 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-24 02:54:02] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-24 02:54:02] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-24 02:54:02] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-24 02:54:03] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (OVERLAPS) 180/276 variables, 96/177 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 181/358 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/276 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 12 (OVERLAPS) 1/277 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-24 02:54:12] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/277 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/277 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 15 (OVERLAPS) 0/277 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 360 constraints, problems are : Problem set: 0 solved, 181 unsolved in 24050 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 75/75 constraints]
After SMT, in 34766ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 34789ms
Starting structural reductions in LTL mode, iteration 1 : 96/121 places, 182/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35151 ms. Remains : 96/121 places, 182/225 transitions.
Support contains 66 out of 96 places after structural reductions.
[2024-05-24 02:54:21] [INFO ] Flatten gal took : 34 ms
[2024-05-24 02:54:21] [INFO ] Flatten gal took : 15 ms
[2024-05-24 02:54:22] [INFO ] Input system was already deterministic with 182 transitions.
Support contains 61 out of 96 places (down from 66) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 68 to 67
RANDOM walk for 40000 steps (2640 resets) in 2116 ms. (18 steps per ms) remains 26/67 properties
BEST_FIRST walk for 4004 steps (38 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (36 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (39 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (40 resets) in 34 ms. (114 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (37 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (42 resets) in 27 ms. (143 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (39 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (38 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (36 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (39 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (38 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (35 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (37 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (40 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (38 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (41 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (39 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (36 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (39 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (35 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (40 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (34 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (38 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (43 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (32 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
[2024-05-24 02:54:22] [INFO ] Flow matrix only has 181 transitions (discarded 1 similar events)
[2024-05-24 02:54:22] [INFO ] Invariant cache hit.
[2024-05-24 02:54:22] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp63 is UNSAT
At refinement iteration 1 (OVERLAPS) 52/86 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 10/96 variables, 2/7 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 24 unsolved
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 5 (OVERLAPS) 180/276 variables, 96/103 constraints. Problems are: Problem set: 4 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/103 constraints. Problems are: Problem set: 4 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 1/277 variables, 1/104 constraints. Problems are: Problem set: 4 solved, 22 unsolved
[2024-05-24 02:54:23] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-24 02:54:23] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-24 02:54:23] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-24 02:54:23] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
Problem AtomicPropp46 is UNSAT
[2024-05-24 02:54:23] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 5/109 constraints. Problems are: Problem set: 5 solved, 21 unsolved
[2024-05-24 02:54:23] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:54:23] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-24 02:54:23] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 0 ms to minimize.
Problem AtomicPropp50 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 3/112 constraints. Problems are: Problem set: 6 solved, 20 unsolved
[2024-05-24 02:54:23] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 1/113 constraints. Problems are: Problem set: 6 solved, 20 unsolved
[2024-05-24 02:54:24] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/277 variables, 1/114 constraints. Problems are: Problem set: 6 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/277 variables, 0/114 constraints. Problems are: Problem set: 6 solved, 20 unsolved
[2024-05-24 02:54:24] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/277 variables, 1/115 constraints. Problems are: Problem set: 6 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 6 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 0/277 variables, 0/115 constraints. Problems are: Problem set: 6 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 115 constraints, problems are : Problem set: 6 solved, 20 unsolved in 1782 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 6 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 63/86 variables, 5/5 constraints. Problems are: Problem set: 6 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 11/16 constraints. Problems are: Problem set: 6 solved, 20 unsolved
[2024-05-24 02:54:24] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-24 02:54:24] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 0 ms to minimize.
[2024-05-24 02:54:24] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-05-24 02:54:24] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-24 02:54:24] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-24 02:54:25] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2024-05-24 02:54:25] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-24 02:54:25] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-24 02:54:25] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-24 02:54:25] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-24 02:54:25] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-24 02:54:25] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2024-05-24 02:54:25] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 13/29 constraints. Problems are: Problem set: 6 solved, 20 unsolved
[2024-05-24 02:54:25] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-24 02:54:25] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-24 02:54:25] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-24 02:54:25] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-24 02:54:25] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 5/34 constraints. Problems are: Problem set: 6 solved, 20 unsolved
[2024-05-24 02:54:25] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-24 02:54:25] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 2/36 constraints. Problems are: Problem set: 6 solved, 20 unsolved
[2024-05-24 02:54:25] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 1/37 constraints. Problems are: Problem set: 6 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/37 constraints. Problems are: Problem set: 6 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 10/96 variables, 2/39 constraints. Problems are: Problem set: 6 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/39 constraints. Problems are: Problem set: 6 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 180/276 variables, 96/135 constraints. Problems are: Problem set: 6 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/276 variables, 20/155 constraints. Problems are: Problem set: 6 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 0/155 constraints. Problems are: Problem set: 6 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 1/277 variables, 1/156 constraints. Problems are: Problem set: 6 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/277 variables, 0/156 constraints. Problems are: Problem set: 6 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 0/277 variables, 0/156 constraints. Problems are: Problem set: 6 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 156 constraints, problems are : Problem set: 6 solved, 20 unsolved in 2517 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/26 constraints, Known Traps: 32/32 constraints]
After SMT, in 4311ms problems are : Problem set: 6 solved, 20 unsolved
Fused 20 Parikh solutions to 19 different solutions.
Parikh walk visited 19 properties in 402 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 182/182 transitions.
Graph (trivial) has 135 edges and 96 vertex of which 10 / 96 are part of one of the 5 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 310 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 90 transition count 166
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 14 place count 86 transition count 162
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 85 transition count 160
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 19 place count 84 transition count 159
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 19 place count 84 transition count 157
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 24 place count 81 transition count 157
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 60 place count 45 transition count 85
Iterating global reduction 4 with 36 rules applied. Total rules applied 96 place count 45 transition count 85
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 105 place count 36 transition count 67
Iterating global reduction 4 with 9 rules applied. Total rules applied 114 place count 36 transition count 67
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 118 place count 36 transition count 63
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 121 place count 33 transition count 54
Iterating global reduction 5 with 3 rules applied. Total rules applied 124 place count 33 transition count 54
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 127 place count 30 transition count 48
Iterating global reduction 5 with 3 rules applied. Total rules applied 130 place count 30 transition count 48
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 133 place count 30 transition count 45
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 6 with 10 rules applied. Total rules applied 143 place count 25 transition count 69
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 144 place count 25 transition count 114
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 147 place count 24 transition count 112
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 148 place count 23 transition count 87
Iterating global reduction 7 with 1 rules applied. Total rules applied 149 place count 23 transition count 87
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 150 place count 22 transition count 84
Iterating global reduction 7 with 1 rules applied. Total rules applied 151 place count 22 transition count 84
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 155 place count 22 transition count 80
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 163 place count 22 transition count 80
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 170 place count 22 transition count 80
Applied a total of 170 rules in 53 ms. Remains 22 /96 variables (removed 74) and now considering 80/182 (removed 102) transitions.
Running 64 sub problems to find dead transitions.
[2024-05-24 02:54:27] [INFO ] Flow matrix only has 66 transitions (discarded 14 similar events)
// Phase 1: matrix 66 rows 22 cols
[2024-05-24 02:54:27] [INFO ] Computed 5 invariants in 3 ms
[2024-05-24 02:54:27] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/22 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
At refinement iteration 3 (OVERLAPS) 66/88 variables, 22/27 constraints. Problems are: Problem set: 8 solved, 56 unsolved
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 11/38 constraints. Problems are: Problem set: 10 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/38 constraints. Problems are: Problem set: 10 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 0/88 variables, 0/38 constraints. Problems are: Problem set: 10 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 38 constraints, problems are : Problem set: 10 solved, 54 unsolved in 537 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 22/22 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 2/22 variables, 5/5 constraints. Problems are: Problem set: 10 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 10 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 66/88 variables, 22/27 constraints. Problems are: Problem set: 10 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 11/38 constraints. Problems are: Problem set: 10 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 54/92 constraints. Problems are: Problem set: 10 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/92 constraints. Problems are: Problem set: 10 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 0/88 variables, 0/92 constraints. Problems are: Problem set: 10 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 92 constraints, problems are : Problem set: 10 solved, 54 unsolved in 833 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 22/22 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 54/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 1437ms problems are : Problem set: 10 solved, 54 unsolved
Search for dead transitions found 10 dead transitions in 1439ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 10 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 22/96 places, 70/182 transitions.
Graph (complete) has 67 edges and 22 vertex of which 21 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 7 ms. Remains 21 /22 variables (removed 1) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1500 ms. Remains : 21/96 places, 70/182 transitions.
RANDOM walk for 25156 steps (6277 resets) in 194 ms. (129 steps per ms) remains 0/1 properties
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2024-05-24 02:54:29] [INFO ] Flatten gal took : 8 ms
[2024-05-24 02:54:29] [INFO ] Flatten gal took : 9 ms
[2024-05-24 02:54:29] [INFO ] Input system was already deterministic with 182 transitions.
Computed a total of 10 stabilizing places and 18 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Graph (trivial) has 112 edges and 96 vertex of which 10 / 96 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 35 place count 56 transition count 108
Iterating global reduction 0 with 34 rules applied. Total rules applied 69 place count 56 transition count 108
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 77 place count 48 transition count 92
Iterating global reduction 0 with 8 rules applied. Total rules applied 85 place count 48 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 88 place count 48 transition count 89
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 90 place count 46 transition count 83
Iterating global reduction 1 with 2 rules applied. Total rules applied 92 place count 46 transition count 83
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 94 place count 44 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 96 place count 44 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 97 place count 44 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 102 place count 44 transition count 73
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 106 place count 42 transition count 71
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 40 transition count 69
Applied a total of 108 rules in 24 ms. Remains 40 /96 variables (removed 56) and now considering 69/182 (removed 113) transitions.
[2024-05-24 02:54:29] [INFO ] Flow matrix only has 64 transitions (discarded 5 similar events)
// Phase 1: matrix 64 rows 40 cols
[2024-05-24 02:54:29] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:54:29] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-24 02:54:29] [INFO ] Flow matrix only has 64 transitions (discarded 5 similar events)
[2024-05-24 02:54:29] [INFO ] Invariant cache hit.
[2024-05-24 02:54:29] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-05-24 02:54:29] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
[2024-05-24 02:54:29] [INFO ] Flow matrix only has 64 transitions (discarded 5 similar events)
[2024-05-24 02:54:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 7/40 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-24 02:54:29] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-24 02:54:29] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-24 02:54:29] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-24 02:54:29] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 63/103 variables, 40/51 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 0/103 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/104 variables, and 51 constraints, problems are : Problem set: 0 solved, 55 unsolved in 793 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 7/40 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-24 02:54:30] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-05-24 02:54:30] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-24 02:54:30] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 63/103 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 55/109 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/104 variables, and 109 constraints, problems are : Problem set: 0 solved, 55 unsolved in 804 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 7/7 constraints]
After SMT, in 1611ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 1612ms
Starting structural reductions in SI_CTL mode, iteration 1 : 40/96 places, 69/182 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1722 ms. Remains : 40/96 places, 69/182 transitions.
[2024-05-24 02:54:30] [INFO ] Flatten gal took : 5 ms
[2024-05-24 02:54:30] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:54:30] [INFO ] Input system was already deterministic with 69 transitions.
[2024-05-24 02:54:31] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:54:31] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:54:31] [INFO ] Time to serialize gal into /tmp/CTLFireability16989299314516932274.gal : 2 ms
[2024-05-24 02:54:31] [INFO ] Time to serialize properties into /tmp/CTLFireability13983852222771935722.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/CTLFireability16989299314516932274.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13983852222771935722.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,24736,0.032561,4272,2,730,5,4077,6,0,221,4816,0


Converting to forward existential form...Done !
original formula: EF((A((p10==1) U !(EF((p2==1)))) * A((p61==1) U AF((EF((p92==1)) + ((p34==1)&&(p118==1)))))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !((E(!(!(E(TRUE U (p2==1)))) U (!((p10==1)) * !(!(E(TRUE U (p2==1)))))) + EG(!(!(E(TRUE U ...390
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...310
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,1,0.627756,27920,1,0,329,153078,170,184,1601,152101,346
FORMULA HealthRecord-PT-03-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 65 transition count 120
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 65 transition count 120
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 69 place count 58 transition count 106
Iterating global reduction 0 with 7 rules applied. Total rules applied 76 place count 58 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 78 place count 58 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 80 place count 56 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 82 place count 56 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 84 place count 54 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 86 place count 54 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 88 place count 54 transition count 92
Applied a total of 88 rules in 6 ms. Remains 54 /96 variables (removed 42) and now considering 92/182 (removed 90) transitions.
[2024-05-24 02:54:31] [INFO ] Flow matrix only has 91 transitions (discarded 1 similar events)
// Phase 1: matrix 91 rows 54 cols
[2024-05-24 02:54:31] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:54:31] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 02:54:31] [INFO ] Flow matrix only has 91 transitions (discarded 1 similar events)
[2024-05-24 02:54:31] [INFO ] Invariant cache hit.
[2024-05-24 02:54:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:54:31] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-05-24 02:54:31] [INFO ] Flow matrix only has 91 transitions (discarded 1 similar events)
[2024-05-24 02:54:31] [INFO ] Invariant cache hit.
[2024-05-24 02:54:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 02:54:32] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-24 02:54:32] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-24 02:54:32] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-24 02:54:32] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-24 02:54:32] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-24 02:54:32] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-24 02:54:32] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 90/144 variables, 54/68 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 02:54:32] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 1/145 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 70 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2161 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 02:54:34] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-24 02:54:34] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 02:54:34] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-24 02:54:34] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-24 02:54:34] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 90/144 variables, 54/74 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 91/165 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 1/145 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 02:54:36] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/145 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 02:54:37] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/145 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/145 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 14 (OVERLAPS) 0/145 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 168 constraints, problems are : Problem set: 0 solved, 91 unsolved in 4559 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 15/15 constraints]
After SMT, in 6748ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 6749ms
Starting structural reductions in LTL mode, iteration 1 : 54/96 places, 92/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6844 ms. Remains : 54/96 places, 92/182 transitions.
[2024-05-24 02:54:38] [INFO ] Flatten gal took : 9 ms
[2024-05-24 02:54:38] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:54:38] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-24 02:54:38] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:54:38] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:54:38] [INFO ] Time to serialize gal into /tmp/CTLFireability13224092973835360324.gal : 2 ms
[2024-05-24 02:54:38] [INFO ] Time to serialize properties into /tmp/CTLFireability16900995905578506956.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/CTLFireability13224092973835360324.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16900995905578506956.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,161433,0.049112,5528,2,694,5,8479,6,0,306,9825,0


Converting to forward existential form...Done !
original formula: (AG(((AX((p36==0)) + ((EG((p63==1)) * (p75==1)) * (p86==1))) + ((p22==0)||(p26==0)))) + !(E(E(((AF((p45==1)) * EF((p107==1))) * !(((p16==...309
=> equivalent forward existential formula: [(FwdU((FwdU((Init * !(!(E(TRUE U !(((!(EX(!((p36==0)))) + ((EG((p63==1)) * (p75==1)) * (p86==1))) + ((p22==0)||...403
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...387
Hit Full ! (commute/partial/dont) 89/0/3
(forward)formula 0,0,1.77672,70380,1,0,533,363645,246,280,2175,408380,601
FORMULA HealthRecord-PT-03-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Graph (trivial) has 103 edges and 96 vertex of which 10 / 96 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 32 place count 60 transition count 115
Iterating global reduction 0 with 31 rules applied. Total rules applied 63 place count 60 transition count 115
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 69 place count 54 transition count 103
Iterating global reduction 0 with 6 rules applied. Total rules applied 75 place count 54 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 76 place count 54 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 53 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 53 transition count 99
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 83 place count 53 transition count 94
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 91 place count 49 transition count 90
Applied a total of 91 rules in 14 ms. Remains 49 /96 variables (removed 47) and now considering 90/182 (removed 92) transitions.
[2024-05-24 02:54:40] [INFO ] Flow matrix only has 85 transitions (discarded 5 similar events)
// Phase 1: matrix 85 rows 49 cols
[2024-05-24 02:54:40] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 02:54:40] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-24 02:54:40] [INFO ] Flow matrix only has 85 transitions (discarded 5 similar events)
[2024-05-24 02:54:40] [INFO ] Invariant cache hit.
[2024-05-24 02:54:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:54:40] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-24 02:54:40] [INFO ] Redundant transitions in 1 ms returned []
Running 89 sub problems to find dead transitions.
[2024-05-24 02:54:40] [INFO ] Flow matrix only has 85 transitions (discarded 5 similar events)
[2024-05-24 02:54:40] [INFO ] Invariant cache hit.
[2024-05-24 02:54:40] [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, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 02:54:40] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-05-24 02:54:40] [INFO ] Deduced a trap composed of 22 places in 27 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, 89 unsolved
[2024-05-24 02:54:40] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-24 02:54:40] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 02:54:41] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 84/133 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 1/134 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 62 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1843 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 02:54:42] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-24 02:54:42] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 02:54:42] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 84/133 variables, 49/64 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 89/153 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 1/134 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 0/134 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 154 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2355 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 8/8 constraints]
After SMT, in 4219ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 4220ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/96 places, 90/182 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4317 ms. Remains : 49/96 places, 90/182 transitions.
[2024-05-24 02:54:44] [INFO ] Flatten gal took : 9 ms
[2024-05-24 02:54:44] [INFO ] Flatten gal took : 6 ms
[2024-05-24 02:54:44] [INFO ] Input system was already deterministic with 90 transitions.
[2024-05-24 02:54:44] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:54:44] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:54:44] [INFO ] Time to serialize gal into /tmp/CTLFireability17381017717053963879.gal : 1 ms
[2024-05-24 02:54:44] [INFO ] Time to serialize properties into /tmp/CTLFireability11396796585899856804.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/CTLFireability17381017717053963879.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11396796585899856804.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,49253,0.023118,4196,2,403,5,3547,6,0,280,3329,0


Converting to forward existential form...Done !
original formula: A(AF(((p36==1) * (A(AG((p57==1)) U (p105!=1)) + AG(((p75==1)&&(p102==1)))))) U E((!(AG((p62==1))) + EG(EF((p3==1)))) U A(!(AF(((p16==1)&&...206
=> equivalent forward existential formula: [((Init * !(EG(!(E((!(!(E(TRUE U !((p62==1))))) + EG(E(TRUE U (p3==1)))) U !((E(!(((p55==1)||((p75==1)&&(p102==1...933
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...360
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
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,1.18113,52632,1,0,691,329256,234,404,2056,273044,794
FORMULA HealthRecord-PT-03-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 60 transition count 110
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 60 transition count 110
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 80 place count 52 transition count 94
Iterating global reduction 0 with 8 rules applied. Total rules applied 88 place count 52 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 92 place count 52 transition count 90
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 94 place count 50 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 96 place count 50 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 49 transition count 82
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 49 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 99 place count 49 transition count 81
Applied a total of 99 rules in 10 ms. Remains 49 /96 variables (removed 47) and now considering 81/182 (removed 101) transitions.
[2024-05-24 02:54:45] [INFO ] Flow matrix only has 80 transitions (discarded 1 similar events)
// Phase 1: matrix 80 rows 49 cols
[2024-05-24 02:54:45] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:54:45] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-24 02:54:45] [INFO ] Flow matrix only has 80 transitions (discarded 1 similar events)
[2024-05-24 02:54:45] [INFO ] Invariant cache hit.
[2024-05-24 02:54:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:54:45] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-24 02:54:45] [INFO ] Flow matrix only has 80 transitions (discarded 1 similar events)
[2024-05-24 02:54:45] [INFO ] Invariant cache hit.
[2024-05-24 02:54:45] [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, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-24 02:54:46] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-24 02:54:46] [INFO ] Deduced a trap composed of 6 places in 20 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, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 79/128 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 1/129 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/129 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 59 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1197 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-24 02:54:47] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-24 02:54:47] [INFO ] Deduced a trap composed of 13 places in 29 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, 80 unsolved
[2024-05-24 02:54:47] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 79/128 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 80/141 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 1/129 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/129 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 142 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2062 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 5/5 constraints]
After SMT, in 3276ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 3277ms
Starting structural reductions in LTL mode, iteration 1 : 49/96 places, 81/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3366 ms. Remains : 49/96 places, 81/182 transitions.
[2024-05-24 02:54:49] [INFO ] Flatten gal took : 8 ms
[2024-05-24 02:54:49] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:54:49] [INFO ] Input system was already deterministic with 81 transitions.
[2024-05-24 02:54:49] [INFO ] Flatten gal took : 6 ms
[2024-05-24 02:54:49] [INFO ] Flatten gal took : 5 ms
[2024-05-24 02:54:49] [INFO ] Time to serialize gal into /tmp/CTLFireability16733050967147037465.gal : 1 ms
[2024-05-24 02:54:49] [INFO ] Time to serialize properties into /tmp/CTLFireability2759782660591519487.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/CTLFireability16733050967147037465.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2759782660591519487.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,77445,0.025973,4416,2,711,5,3651,6,0,275,3619,0


Converting to forward existential form...Done !
original formula: AX((AG(((p22==1) + EF(((p16==1)&&(p97==1))))) + (((A((p65==1) U (p46==1)) * E((p103!=1) U EF((p24==1)))) * ((p90==1)&&(p97==0))) * ((p115...197
=> equivalent forward existential formula: [((FwdU((EY(Init) * !((((!((E(!((p46==1)) U (!((p65==1)) * !((p46==1)))) + EG(!((p46==1))))) * E((p103!=1) U E(T...320
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...312
(forward)formula 0,0,0.714382,33276,1,0,370,175902,206,194,2015,173867,446
FORMULA HealthRecord-PT-03-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 64 transition count 118
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 64 transition count 118
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 58 transition count 106
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 58 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 78 place count 58 transition count 104
Applied a total of 78 rules in 12 ms. Remains 58 /96 variables (removed 38) and now considering 104/182 (removed 78) transitions.
[2024-05-24 02:54:50] [INFO ] Flow matrix only has 103 transitions (discarded 1 similar events)
// Phase 1: matrix 103 rows 58 cols
[2024-05-24 02:54:50] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:54:50] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 02:54:50] [INFO ] Flow matrix only has 103 transitions (discarded 1 similar events)
[2024-05-24 02:54:50] [INFO ] Invariant cache hit.
[2024-05-24 02:54:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:54:50] [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 103 sub problems to find dead transitions.
[2024-05-24 02:54:50] [INFO ] Flow matrix only has 103 transitions (discarded 1 similar events)
[2024-05-24 02:54:50] [INFO ] Invariant cache hit.
[2024-05-24 02:54:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-24 02:54:50] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-24 02:54:50] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-24 02:54:50] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-24 02:54:50] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-24 02:54:50] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-24 02:54:50] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-24 02:54:50] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/72 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 1/161 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (OVERLAPS) 0/161 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 73 constraints, problems are : Problem set: 0 solved, 103 unsolved in 2390 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-24 02:54:52] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 102/160 variables, 58/73 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 103/176 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 1/161 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (OVERLAPS) 0/161 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 177 constraints, problems are : Problem set: 0 solved, 103 unsolved in 2844 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 8/8 constraints]
After SMT, in 5255ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 5256ms
Starting structural reductions in LTL mode, iteration 1 : 58/96 places, 104/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5346 ms. Remains : 58/96 places, 104/182 transitions.
[2024-05-24 02:54:55] [INFO ] Flatten gal took : 5 ms
[2024-05-24 02:54:55] [INFO ] Flatten gal took : 5 ms
[2024-05-24 02:54:55] [INFO ] Input system was already deterministic with 104 transitions.
[2024-05-24 02:54:55] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:54:55] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:54:55] [INFO ] Time to serialize gal into /tmp/CTLFireability1699011479273537831.gal : 2 ms
[2024-05-24 02:54:55] [INFO ] Time to serialize properties into /tmp/CTLFireability2015058490308389978.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/CTLFireability1699011479273537831.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2015058490308389978.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,142057,0.041677,5088,2,760,5,6670,6,0,334,6423,0


Converting to forward existential form...Done !
original formula: (AX((AX(((p16==0)||(p118==0))) * (A((((p6==1)&&(p38==1))||(!((p75==1)&&(p98==1)))) U ((p105==1) + A((p9==1) U (p84==1)))) + (p66==1)))) +...199
=> equivalent forward existential formula: [FwdG(((FwdU((Init * !(!(EX(!((!(EX(!(((p16==0)||(p118==0))))) * (!((E(!(((p105==1) + !((E(!((p84==1)) U (!((p9=...506
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...393
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 101/0/3
(forward)formula 0,0,1.03556,42720,1,0,525,241528,259,297,2531,226572,557
FORMULA HealthRecord-PT-03-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Graph (trivial) has 135 edges and 96 vertex of which 10 / 96 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 38 place count 53 transition count 102
Iterating global reduction 0 with 37 rules applied. Total rules applied 75 place count 53 transition count 102
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 84 place count 44 transition count 84
Iterating global reduction 0 with 9 rules applied. Total rules applied 93 place count 44 transition count 84
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 97 place count 44 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 99 place count 42 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 42 transition count 74
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 103 place count 40 transition count 70
Iterating global reduction 1 with 2 rules applied. Total rules applied 105 place count 40 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 107 place count 40 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 112 place count 40 transition count 63
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 116 place count 38 transition count 61
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 36 transition count 59
Applied a total of 118 rules in 18 ms. Remains 36 /96 variables (removed 60) and now considering 59/182 (removed 123) transitions.
[2024-05-24 02:54:56] [INFO ] Flow matrix only has 54 transitions (discarded 5 similar events)
// Phase 1: matrix 54 rows 36 cols
[2024-05-24 02:54:56] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 02:54:56] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 02:54:56] [INFO ] Flow matrix only has 54 transitions (discarded 5 similar events)
[2024-05-24 02:54:56] [INFO ] Invariant cache hit.
[2024-05-24 02:54:56] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-05-24 02:54:56] [INFO ] Redundant transitions in 1 ms returned []
Running 45 sub problems to find dead transitions.
[2024-05-24 02:54:56] [INFO ] Flow matrix only has 54 transitions (discarded 5 similar events)
[2024-05-24 02:54:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 7/36 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-24 02:54:56] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-24 02:54:56] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 53/89 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/89 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/90 variables, and 45 constraints, problems are : Problem set: 0 solved, 45 unsolved in 500 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 7/36 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-24 02:54:57] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 53/89 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 45/91 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 0/89 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/90 variables, and 91 constraints, problems are : Problem set: 0 solved, 45 unsolved in 577 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 3/3 constraints]
After SMT, in 1089ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 1090ms
Starting structural reductions in SI_CTL mode, iteration 1 : 36/96 places, 59/182 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1183 ms. Remains : 36/96 places, 59/182 transitions.
[2024-05-24 02:54:57] [INFO ] Flatten gal took : 6 ms
[2024-05-24 02:54:57] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:54:57] [INFO ] Input system was already deterministic with 59 transitions.
[2024-05-24 02:54:57] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:54:57] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:54:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15900973704195733806.gal : 1 ms
[2024-05-24 02:54:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4570513539271269188.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15900973704195733806.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4570513539271269188.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 23053 steps (2320 resets) in 34 ms. (658 steps per ms) remains 0/1 properties
FORMULA HealthRecord-PT-03-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Graph (trivial) has 109 edges and 96 vertex of which 10 / 96 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 37 place count 55 transition count 105
Iterating global reduction 0 with 36 rules applied. Total rules applied 73 place count 55 transition count 105
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 81 place count 47 transition count 89
Iterating global reduction 0 with 8 rules applied. Total rules applied 89 place count 47 transition count 89
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 93 place count 47 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 95 place count 45 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 45 transition count 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 99 place count 43 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 43 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 103 place count 43 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 108 place count 43 transition count 68
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 114 place count 40 transition count 65
Applied a total of 114 rules in 9 ms. Remains 40 /96 variables (removed 56) and now considering 65/182 (removed 117) transitions.
[2024-05-24 02:54:57] [INFO ] Flow matrix only has 60 transitions (discarded 5 similar events)
// Phase 1: matrix 60 rows 40 cols
[2024-05-24 02:54:57] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:54:57] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 02:54:57] [INFO ] Flow matrix only has 60 transitions (discarded 5 similar events)
[2024-05-24 02:54:57] [INFO ] Invariant cache hit.
[2024-05-24 02:54:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:54:57] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-24 02:54:57] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-24 02:54:57] [INFO ] Flow matrix only has 60 transitions (discarded 5 similar events)
[2024-05-24 02:54:57] [INFO ] Invariant cache hit.
[2024-05-24 02:54:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-24 02:54:57] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
[2024-05-24 02:54:58] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-24 02:54:58] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-24 02:54:58] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 59/99 variables, 40/51 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 1/100 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/100 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 52 constraints, problems are : Problem set: 0 solved, 64 unsolved in 945 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 40/40 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-24 02:54:58] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-24 02:54:58] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-24 02:54:59] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-24 02:54:59] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 59/99 variables, 40/55 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 64/119 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 1/100 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 0/100 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 120 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1405 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 40/40 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 8/8 constraints]
After SMT, in 2368ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 2368ms
Starting structural reductions in SI_CTL mode, iteration 1 : 40/96 places, 65/182 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2461 ms. Remains : 40/96 places, 65/182 transitions.
[2024-05-24 02:55:00] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:55:00] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:55:00] [INFO ] Input system was already deterministic with 65 transitions.
[2024-05-24 02:55:00] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:55:00] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:55:00] [INFO ] Time to serialize gal into /tmp/CTLFireability14540358086270811091.gal : 1 ms
[2024-05-24 02:55:00] [INFO ] Time to serialize properties into /tmp/CTLFireability15289803198077166196.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/CTLFireability14540358086270811091.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15289803198077166196.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,28193,0.017232,4116,2,492,5,2432,6,0,219,2169,0


Converting to forward existential form...Done !
original formula: EF(((AG((p58==1)) * (p24==0)) * ((p16==0)||(p118==0))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((p16==0)||(p118==0))) * (p24==0)) * !(E(TRUE U !((p58==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, t17, t18, t19, t20, t44...265
(forward)formula 0,0,0.070426,6492,1,0,129,15432,146,56,1504,11394,137
FORMULA HealthRecord-PT-03-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 56 transition count 102
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 56 transition count 102
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 89 place count 47 transition count 84
Iterating global reduction 0 with 9 rules applied. Total rules applied 98 place count 47 transition count 84
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 102 place count 47 transition count 80
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 105 place count 44 transition count 71
Iterating global reduction 1 with 3 rules applied. Total rules applied 108 place count 44 transition count 71
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 110 place count 42 transition count 67
Iterating global reduction 1 with 2 rules applied. Total rules applied 112 place count 42 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 114 place count 42 transition count 65
Applied a total of 114 rules in 4 ms. Remains 42 /96 variables (removed 54) and now considering 65/182 (removed 117) transitions.
[2024-05-24 02:55:00] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 42 cols
[2024-05-24 02:55:00] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 02:55:00] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 02:55:00] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
[2024-05-24 02:55:00] [INFO ] Invariant cache hit.
[2024-05-24 02:55:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:55:00] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-24 02:55:00] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
[2024-05-24 02:55:00] [INFO ] Invariant cache hit.
[2024-05-24 02:55:00] [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, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-24 02:55:00] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-24 02:55:00] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 63/105 variables, 42/51 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 1/106 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/106 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 52 constraints, problems are : Problem set: 0 solved, 64 unsolved in 841 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-24 02:55:01] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-24 02:55:01] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 63/105 variables, 42/53 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 64/117 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 1/106 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 0/106 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 118 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1366 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 4/4 constraints]
After SMT, in 2217ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 2218ms
Starting structural reductions in LTL mode, iteration 1 : 42/96 places, 65/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2304 ms. Remains : 42/96 places, 65/182 transitions.
[2024-05-24 02:55:02] [INFO ] Flatten gal took : 5 ms
[2024-05-24 02:55:02] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:55:02] [INFO ] Input system was already deterministic with 65 transitions.
[2024-05-24 02:55:02] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:55:02] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:55:02] [INFO ] Time to serialize gal into /tmp/CTLFireability6294907326990151351.gal : 1 ms
[2024-05-24 02:55:02] [INFO ] Time to serialize properties into /tmp/CTLFireability1793158945969951427.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/CTLFireability6294907326990151351.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1793158945969951427.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,32085,0.024043,3828,2,514,5,2280,6,0,231,2022,0


Converting to forward existential form...Done !
original formula: AX(AG((p94==0)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !((p94==0)))] = FALSE
(forward)formula 0,0,0.030651,4144,1,0,9,2304,10,2,463,2022,4
FORMULA HealthRecord-PT-03-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 59 transition count 108
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 59 transition count 108
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 82 place count 51 transition count 92
Iterating global reduction 0 with 8 rules applied. Total rules applied 90 place count 51 transition count 92
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 94 place count 51 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 50 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 50 transition count 85
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 49 transition count 83
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 49 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 99 place count 49 transition count 82
Applied a total of 99 rules in 6 ms. Remains 49 /96 variables (removed 47) and now considering 82/182 (removed 100) transitions.
[2024-05-24 02:55:02] [INFO ] Flow matrix only has 81 transitions (discarded 1 similar events)
// Phase 1: matrix 81 rows 49 cols
[2024-05-24 02:55:02] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:55:02] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 02:55:02] [INFO ] Flow matrix only has 81 transitions (discarded 1 similar events)
[2024-05-24 02:55:02] [INFO ] Invariant cache hit.
[2024-05-24 02:55:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:55:02] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2024-05-24 02:55:02] [INFO ] Flow matrix only has 81 transitions (discarded 1 similar events)
[2024-05-24 02:55:02] [INFO ] Invariant cache hit.
[2024-05-24 02:55:02] [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, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-24 02:55:03] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-24 02:55:03] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-24 02:55:03] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 80/129 variables, 49/59 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 1/130 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 60 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1338 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-24 02:55:04] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-24 02:55:04] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 80/129 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 81/142 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 1/130 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 143 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1898 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 5/5 constraints]
After SMT, in 3251ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 3252ms
Starting structural reductions in LTL mode, iteration 1 : 49/96 places, 82/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3346 ms. Remains : 49/96 places, 82/182 transitions.
[2024-05-24 02:55:05] [INFO ] Flatten gal took : 8 ms
[2024-05-24 02:55:05] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:55:05] [INFO ] Input system was already deterministic with 82 transitions.
[2024-05-24 02:55:05] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:55:05] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:55:05] [INFO ] Time to serialize gal into /tmp/CTLFireability6691147940858183411.gal : 1 ms
[2024-05-24 02:55:05] [INFO ] Time to serialize properties into /tmp/CTLFireability10140217119364380436.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/CTLFireability6691147940858183411.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10140217119364380436.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,53956,0.023156,4424,2,609,5,3573,6,0,276,3430,0


Converting to forward existential form...Done !
original formula: E(AX((!(EX((p120==1))) + EF(((((p39==1)&&(p16==1))&&(p89==1))||(!((p75==1)&&(p100==1))))))) U (p112==1))
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!((!(EX((p120==1))) + E(TRUE U ((((p39==1)&&(p16==1))&&(p89==1))||(!((p75==1)&&(p100==1))))))))...180
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t9, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t...307
(forward)formula 0,1,0.110287,8648,1,0,159,22085,186,76,1965,19673,183
FORMULA HealthRecord-PT-03-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Graph (trivial) has 123 edges and 96 vertex of which 10 / 96 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 38 place count 53 transition count 102
Iterating global reduction 0 with 37 rules applied. Total rules applied 75 place count 53 transition count 102
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 83 place count 45 transition count 86
Iterating global reduction 0 with 8 rules applied. Total rules applied 91 place count 45 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 95 place count 45 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 97 place count 43 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 99 place count 43 transition count 76
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 101 place count 41 transition count 72
Iterating global reduction 1 with 2 rules applied. Total rules applied 103 place count 41 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 105 place count 41 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 110 place count 41 transition count 65
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 114 place count 39 transition count 63
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 37 transition count 61
Applied a total of 116 rules in 10 ms. Remains 37 /96 variables (removed 59) and now considering 61/182 (removed 121) transitions.
[2024-05-24 02:55:06] [INFO ] Flow matrix only has 56 transitions (discarded 5 similar events)
// Phase 1: matrix 56 rows 37 cols
[2024-05-24 02:55:06] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 02:55:06] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 02:55:06] [INFO ] Flow matrix only has 56 transitions (discarded 5 similar events)
[2024-05-24 02:55:06] [INFO ] Invariant cache hit.
[2024-05-24 02:55:06] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-05-24 02:55:06] [INFO ] Redundant transitions in 1 ms returned []
Running 47 sub problems to find dead transitions.
[2024-05-24 02:55:06] [INFO ] Flow matrix only has 56 transitions (discarded 5 similar events)
[2024-05-24 02:55:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 7/37 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-24 02:55:06] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-24 02:55:06] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 55/92 variables, 37/46 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 0/92 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/93 variables, and 46 constraints, problems are : Problem set: 0 solved, 47 unsolved in 501 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 7/37 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-24 02:55:06] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 55/92 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 47/94 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/92 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/93 variables, and 94 constraints, problems are : Problem set: 0 solved, 47 unsolved in 605 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 3/3 constraints]
After SMT, in 1122ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1123ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/96 places, 61/182 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1370 ms. Remains : 37/96 places, 61/182 transitions.
[2024-05-24 02:55:07] [INFO ] Flatten gal took : 6 ms
[2024-05-24 02:55:07] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:55:07] [INFO ] Input system was already deterministic with 61 transitions.
[2024-05-24 02:55:07] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:55:07] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:55:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality826865546871040413.gal : 0 ms
[2024-05-24 02:55:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4617070293132021303.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality826865546871040413.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4617070293132021303.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (4063 resets) in 89 ms. (444 steps per ms) remains 1/1 properties

BEST_FIRST walk for 40002 steps (614 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4213 steps, run visited all 1 properties in 12 ms. (steps per millisecond=351 )
Probabilistic random walk after 4213 steps, saw 1031 distinct states, run finished after 15 ms. (steps per millisecond=280 ) properties seen :1
FORMULA HealthRecord-PT-03-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Graph (trivial) has 128 edges and 96 vertex of which 8 / 96 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 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 36 place count 56 transition count 107
Iterating global reduction 0 with 35 rules applied. Total rules applied 71 place count 56 transition count 107
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 79 place count 48 transition count 91
Iterating global reduction 0 with 8 rules applied. Total rules applied 87 place count 48 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 90 place count 48 transition count 88
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 93 place count 45 transition count 79
Iterating global reduction 1 with 3 rules applied. Total rules applied 96 place count 45 transition count 79
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 99 place count 42 transition count 73
Iterating global reduction 1 with 3 rules applied. Total rules applied 102 place count 42 transition count 73
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 105 place count 42 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 109 place count 42 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 40 transition count 64
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 39 transition count 63
Applied a total of 114 rules in 11 ms. Remains 39 /96 variables (removed 57) and now considering 63/182 (removed 119) transitions.
[2024-05-24 02:55:07] [INFO ] Flow matrix only has 59 transitions (discarded 4 similar events)
// Phase 1: matrix 59 rows 39 cols
[2024-05-24 02:55:07] [INFO ] Computed 7 invariants in 4 ms
[2024-05-24 02:55:07] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 02:55:07] [INFO ] Flow matrix only has 59 transitions (discarded 4 similar events)
[2024-05-24 02:55:07] [INFO ] Invariant cache hit.
[2024-05-24 02:55:07] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-24 02:55:07] [INFO ] Redundant transitions in 1 ms returned []
Running 49 sub problems to find dead transitions.
[2024-05-24 02:55:07] [INFO ] Flow matrix only has 59 transitions (discarded 4 similar events)
[2024-05-24 02:55:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 7/39 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-24 02:55:07] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-24 02:55:07] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 58/97 variables, 39/48 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/97 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/98 variables, and 48 constraints, problems are : Problem set: 0 solved, 49 unsolved in 562 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 39/39 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 7/39 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-24 02:55:08] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-24 02:55:08] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 58/97 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 49/99 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (OVERLAPS) 0/97 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/98 variables, and 99 constraints, problems are : Problem set: 0 solved, 49 unsolved in 728 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 39/39 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 4/4 constraints]
After SMT, in 1312ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 1313ms
Starting structural reductions in SI_CTL mode, iteration 1 : 39/96 places, 63/182 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1392 ms. Remains : 39/96 places, 63/182 transitions.
[2024-05-24 02:55:08] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:55:09] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:55:09] [INFO ] Input system was already deterministic with 63 transitions.
[2024-05-24 02:55:09] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:55:09] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:55:09] [INFO ] Time to serialize gal into /tmp/CTLFireability4803028883353785308.gal : 1 ms
[2024-05-24 02:55:09] [INFO ] Time to serialize properties into /tmp/CTLFireability5699637235972673290.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/CTLFireability4803028883353785308.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5699637235972673290.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,39532,0.015328,4080,2,474,5,2400,6,0,212,2083,0


Converting to forward existential form...Done !
original formula: EF((EG(AG((p26==1))) * ((p46==1) + (EF((p115==0)) * ((p83==0)||(p27==0))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * EG(!(E(TRUE U !((p26==1)))))) * (p46==1))] != FALSE + [(FwdU(((FwdU(Init,TRUE) * EG(!(E(TR...229
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t17, t19, t20, t38, t39...260
(forward)formula 0,0,0.078609,7248,1,0,127,16311,153,53,1459,13463,136
FORMULA HealthRecord-PT-03-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 60 transition count 110
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 60 transition count 110
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 54 transition count 98
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 54 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 85 place count 54 transition count 97
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 88 place count 51 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 91 place count 51 transition count 88
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 94 place count 48 transition count 82
Iterating global reduction 1 with 3 rules applied. Total rules applied 97 place count 48 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 100 place count 48 transition count 79
Applied a total of 100 rules in 2 ms. Remains 48 /96 variables (removed 48) and now considering 79/182 (removed 103) transitions.
[2024-05-24 02:55:09] [INFO ] Flow matrix only has 78 transitions (discarded 1 similar events)
// Phase 1: matrix 78 rows 48 cols
[2024-05-24 02:55:09] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 02:55:09] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-24 02:55:09] [INFO ] Flow matrix only has 78 transitions (discarded 1 similar events)
[2024-05-24 02:55:09] [INFO ] Invariant cache hit.
[2024-05-24 02:55:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:55:09] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-24 02:55:09] [INFO ] Flow matrix only has 78 transitions (discarded 1 similar events)
[2024-05-24 02:55:09] [INFO ] Invariant cache hit.
[2024-05-24 02:55:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-24 02:55:09] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-24 02:55:09] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 77/125 variables, 48/57 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 58 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1161 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-24 02:55:10] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-24 02:55:10] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 77/125 variables, 48/59 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 78/137 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 1/126 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (OVERLAPS) 0/126 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 138 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1789 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 4/4 constraints]
After SMT, in 2963ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 2966ms
Starting structural reductions in LTL mode, iteration 1 : 48/96 places, 79/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3086 ms. Remains : 48/96 places, 79/182 transitions.
[2024-05-24 02:55:12] [INFO ] Flatten gal took : 5 ms
[2024-05-24 02:55:12] [INFO ] Flatten gal took : 5 ms
[2024-05-24 02:55:12] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-24 02:55:12] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:55:12] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:55:12] [INFO ] Time to serialize gal into /tmp/CTLFireability6242451468430476589.gal : 1 ms
[2024-05-24 02:55:12] [INFO ] Time to serialize properties into /tmp/CTLFireability3686424288002246884.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/CTLFireability6242451468430476589.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3686424288002246884.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,64161,0.02115,4404,2,534,5,3561,6,0,269,3299,0


Converting to forward existential form...Done !
original formula: AG(((p79==0) * (((p53==0) + AF(((p36==0)||(p83==0)))) + EX(EX((p80==0))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !((p79==0)))] = FALSE * [FwdG(((FwdU(Init,TRUE) * !(EX(EX((p80==0))))) * !((p53==0))),!(((p...184
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t20, t21, t22, t...287
(forward)formula 0,0,0.093351,7836,1,0,158,19441,186,74,1843,17254,173
FORMULA HealthRecord-PT-03-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 57 transition count 104
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 57 transition count 104
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 84 place count 51 transition count 92
Iterating global reduction 0 with 6 rules applied. Total rules applied 90 place count 51 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 92 place count 51 transition count 90
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 94 place count 49 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 96 place count 49 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 98 place count 47 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 100 place count 47 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 102 place count 47 transition count 78
Applied a total of 102 rules in 2 ms. Remains 47 /96 variables (removed 49) and now considering 78/182 (removed 104) transitions.
[2024-05-24 02:55:12] [INFO ] Flow matrix only has 77 transitions (discarded 1 similar events)
// Phase 1: matrix 77 rows 47 cols
[2024-05-24 02:55:12] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 02:55:12] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 02:55:12] [INFO ] Flow matrix only has 77 transitions (discarded 1 similar events)
[2024-05-24 02:55:12] [INFO ] Invariant cache hit.
[2024-05-24 02:55:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:55:12] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2024-05-24 02:55:12] [INFO ] Flow matrix only has 77 transitions (discarded 1 similar events)
[2024-05-24 02:55:12] [INFO ] Invariant cache hit.
[2024-05-24 02:55:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-24 02:55:12] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-24 02:55:12] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-24 02:55:12] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 76/123 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 1/124 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 58 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1212 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-24 02:55:13] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-24 02:55:13] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 76/123 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 77/136 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 137 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1624 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 5/5 constraints]
After SMT, in 2858ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 2858ms
Starting structural reductions in LTL mode, iteration 1 : 47/96 places, 78/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2929 ms. Remains : 47/96 places, 78/182 transitions.
[2024-05-24 02:55:15] [INFO ] Flatten gal took : 5 ms
[2024-05-24 02:55:15] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:55:15] [INFO ] Input system was already deterministic with 78 transitions.
[2024-05-24 02:55:15] [INFO ] Flatten gal took : 3 ms
[2024-05-24 02:55:15] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:55:15] [INFO ] Time to serialize gal into /tmp/CTLFireability13860140066937686238.gal : 1 ms
[2024-05-24 02:55:15] [INFO ] Time to serialize properties into /tmp/CTLFireability3483929817415166655.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/CTLFireability13860140066937686238.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3483929817415166655.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.021093,4144,2,549,5,2529,6,0,264,2192,0


Converting to forward existential form...Done !
original formula: EF((E(!(A(EF((p86==1)) U AX(((p75==1)&&(p96==1))))) U (p81==1)) + AX(FALSE)))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),!(!((E(!(!(EX(!(((p75==1)&&(p96==1)))))) U (!(E(TRUE U (p86==1))) * !(!(EX(!(((p75==1)&&...286
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...277
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.154436,10744,1,0,195,40401,190,110,1951,34620,243
FORMULA HealthRecord-PT-03-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Graph (trivial) has 135 edges and 96 vertex of which 10 / 96 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 37 place count 54 transition count 104
Iterating global reduction 0 with 36 rules applied. Total rules applied 73 place count 54 transition count 104
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 81 place count 46 transition count 88
Iterating global reduction 0 with 8 rules applied. Total rules applied 89 place count 46 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 93 place count 46 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 95 place count 44 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 44 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 99 place count 42 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 42 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 103 place count 42 transition count 72
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 108 place count 42 transition count 67
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 112 place count 40 transition count 65
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 38 transition count 63
Applied a total of 114 rules in 16 ms. Remains 38 /96 variables (removed 58) and now considering 63/182 (removed 119) transitions.
[2024-05-24 02:55:15] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
// Phase 1: matrix 58 rows 38 cols
[2024-05-24 02:55:15] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:55:15] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 02:55:15] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
[2024-05-24 02:55:15] [INFO ] Invariant cache hit.
[2024-05-24 02:55:15] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-24 02:55:15] [INFO ] Redundant transitions in 1 ms returned []
Running 49 sub problems to find dead transitions.
[2024-05-24 02:55:15] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
[2024-05-24 02:55:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 7/38 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-24 02:55:15] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-24 02:55:15] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-24 02:55:15] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 57/95 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/95 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/96 variables, and 48 constraints, problems are : Problem set: 0 solved, 49 unsolved in 607 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 7/38 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-24 02:55:16] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-24 02:55:16] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 57/95 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 49/99 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 0/95 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/96 variables, and 99 constraints, problems are : Problem set: 0 solved, 49 unsolved in 673 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 5/5 constraints]
After SMT, in 1288ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 1289ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/96 places, 63/182 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1374 ms. Remains : 38/96 places, 63/182 transitions.
[2024-05-24 02:55:16] [INFO ] Flatten gal took : 5 ms
[2024-05-24 02:55:16] [INFO ] Flatten gal took : 4 ms
[2024-05-24 02:55:16] [INFO ] Input system was already deterministic with 63 transitions.
[2024-05-24 02:55:16] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:55:16] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:55:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3532368269399268383.gal : 1 ms
[2024-05-24 02:55:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10412590539386624001.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3532368269399268383.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10412590539386624001.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (4071 resets) in 63 ms. (625 steps per ms) remains 1/1 properties

BEST_FIRST walk for 40002 steps (574 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Finished probabilistic random walk after 4224 steps, run visited all 1 properties in 9 ms. (steps per millisecond=469 )
Probabilistic random walk after 4224 steps, saw 1036 distinct states, run finished after 9 ms. (steps per millisecond=469 ) properties seen :1
FORMULA HealthRecord-PT-03-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read1(BufferedInputStream.java:281)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:343)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Graph (trivial) has 133 edges and 96 vertex of which 10 / 96 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 37 place count 54 transition count 104
Iterating global reduction 0 with 36 rules applied. Total rules applied 73 place count 54 transition count 104
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 82 place count 45 transition count 86
Iterating global reduction 0 with 9 rules applied. Total rules applied 91 place count 45 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 95 place count 45 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 97 place count 43 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 99 place count 43 transition count 76
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 101 place count 41 transition count 72
Iterating global reduction 1 with 2 rules applied. Total rules applied 103 place count 41 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 105 place count 41 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 109 place count 41 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 40 transition count 65
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 113 place count 38 transition count 63
Applied a total of 113 rules in 7 ms. Remains 38 /96 variables (removed 58) and now considering 63/182 (removed 119) transitions.
[2024-05-24 02:55:16] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
// Phase 1: matrix 58 rows 38 cols
[2024-05-24 02:55:16] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 02:55:16] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 02:55:16] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
[2024-05-24 02:55:16] [INFO ] Invariant cache hit.
[2024-05-24 02:55:16] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-05-24 02:55:16] [INFO ] Redundant transitions in 0 ms returned []
Running 49 sub problems to find dead transitions.
[2024-05-24 02:55:16] [INFO ] Flow matrix only has 58 transitions (discarded 5 similar events)
[2024-05-24 02:55:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 7/38 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-24 02:55:17] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-24 02:55:17] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-05-24 02:55:17] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 57/95 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/95 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/96 variables, and 48 constraints, problems are : Problem set: 0 solved, 49 unsolved in 587 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 7/38 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 57/95 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 49/97 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/95 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 49 unsolved in 533 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 3/3 constraints]
After SMT, in 1134ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 1134ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/96 places, 63/182 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1210 ms. Remains : 38/96 places, 63/182 transitions.
[2024-05-24 02:55:18] [INFO ] Flatten gal took : 5 ms
[2024-05-24 02:55:18] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:55:18] [INFO ] Input system was already deterministic with 63 transitions.
[2024-05-24 02:55:18] [INFO ] Flatten gal took : 1 ms
[2024-05-24 02:55:18] [INFO ] Flatten gal took : 1 ms
[2024-05-24 02:55:18] [INFO ] Time to serialize gal into /tmp/CTLFireability14860740178597836519.gal : 0 ms
[2024-05-24 02:55:18] [INFO ] Time to serialize properties into /tmp/CTLFireability17891921423301842763.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/CTLFireability14860740178597836519.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17891921423301842763.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,17825,0.026374,4368,2,746,5,3942,6,0,207,4352,0


Converting to forward existential form...Done !
original formula: EF(AG(((p6==1)||(p74==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p6==1)||(p74==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, t17, t18, t28, t29, Interse...245
(forward)formula 0,0,0.102467,8064,1,0,117,22976,142,52,1442,19495,133
FORMULA HealthRecord-PT-03-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 59 transition count 108
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 59 transition count 108
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 83 place count 50 transition count 90
Iterating global reduction 0 with 9 rules applied. Total rules applied 92 place count 50 transition count 90
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 96 place count 50 transition count 86
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 99 place count 47 transition count 77
Iterating global reduction 1 with 3 rules applied. Total rules applied 102 place count 47 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 45 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 45 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 108 place count 45 transition count 71
Applied a total of 108 rules in 4 ms. Remains 45 /96 variables (removed 51) and now considering 71/182 (removed 111) transitions.
[2024-05-24 02:55:18] [INFO ] Flow matrix only has 70 transitions (discarded 1 similar events)
// Phase 1: matrix 70 rows 45 cols
[2024-05-24 02:55:18] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:55:18] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 02:55:18] [INFO ] Flow matrix only has 70 transitions (discarded 1 similar events)
[2024-05-24 02:55:18] [INFO ] Invariant cache hit.
[2024-05-24 02:55:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:55:18] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-05-24 02:55:18] [INFO ] Flow matrix only has 70 transitions (discarded 1 similar events)
[2024-05-24 02:55:18] [INFO ] Invariant cache hit.
[2024-05-24 02:55:18] [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, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-24 02:55:18] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-24 02:55:18] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-24 02:55:18] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 69/114 variables, 45/55 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 1/115 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/115 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 56 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1116 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-24 02:55:19] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 0 ms to minimize.
[2024-05-24 02:55:19] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-24 02:55:19] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-24 02:55:19] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-24 02:55:19] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-24 02:55:19] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 69/114 variables, 45/61 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 70/131 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (OVERLAPS) 1/115 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 11 (OVERLAPS) 0/115 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 132 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1807 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 9/9 constraints]
After SMT, in 2934ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 2934ms
Starting structural reductions in LTL mode, iteration 1 : 45/96 places, 71/182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3007 ms. Remains : 45/96 places, 71/182 transitions.
[2024-05-24 02:55:21] [INFO ] Flatten gal took : 5 ms
[2024-05-24 02:55:21] [INFO ] Flatten gal took : 6 ms
[2024-05-24 02:55:21] [INFO ] Input system was already deterministic with 71 transitions.
[2024-05-24 02:55:21] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:55:21] [INFO ] Flatten gal took : 2 ms
[2024-05-24 02:55:21] [INFO ] Time to serialize gal into /tmp/CTLFireability10254861284175875422.gal : 1 ms
[2024-05-24 02:55:21] [INFO ] Time to serialize properties into /tmp/CTLFireability2825471944859017108.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/CTLFireability10254861284175875422.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2825471944859017108.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,49582,0.029418,4160,2,521,5,3335,6,0,249,3365,0


Converting to forward existential form...Done !
original formula: A(!(AF(E((p46==1) U E(((p75==1)&&(p94==1)) U ((p16==1)&&(p118==1)))))) U AX(((p66==1) + EG((p72==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(((p66==1) + EG((p72==1)))))))))) * !(E(!(!(EX(!(((p66==1) + EG((p72==1))))))) U (!(!(!(E...280
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t16, t18, t20, t22, t23, t24, t25, t...287
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.492504,26684,1,0,364,148973,181,228,1729,135502,406
FORMULA HealthRecord-PT-03-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-24 02:55:21] [INFO ] Flatten gal took : 9 ms
[2024-05-24 02:55:21] [INFO ] Flatten gal took : 6 ms
Total runtime 95410 ms.

BK_STOP 1716519321803

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-03"
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-03, 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-171640604000714"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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