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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 15:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 20:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 20:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 20:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 20:25 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 70K 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-11-CTLFireability-2024-00
FORMULA_NAME HealthRecord-PT-11-CTLFireability-2024-01
FORMULA_NAME HealthRecord-PT-11-CTLFireability-2024-02
FORMULA_NAME HealthRecord-PT-11-CTLFireability-2024-03
FORMULA_NAME HealthRecord-PT-11-CTLFireability-2024-04
FORMULA_NAME HealthRecord-PT-11-CTLFireability-2024-05
FORMULA_NAME HealthRecord-PT-11-CTLFireability-2024-06
FORMULA_NAME HealthRecord-PT-11-CTLFireability-2024-07
FORMULA_NAME HealthRecord-PT-11-CTLFireability-2024-08
FORMULA_NAME HealthRecord-PT-11-CTLFireability-2024-09
FORMULA_NAME HealthRecord-PT-11-CTLFireability-2024-10
FORMULA_NAME HealthRecord-PT-11-CTLFireability-2024-11
FORMULA_NAME HealthRecord-PT-11-CTLFireability-2023-12
FORMULA_NAME HealthRecord-PT-11-CTLFireability-2023-13
FORMULA_NAME HealthRecord-PT-11-CTLFireability-2023-14
FORMULA_NAME HealthRecord-PT-11-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716520344169

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-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-24 03:12:25] [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 03:12:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:12:25] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-05-24 03:12:25] [INFO ] Transformed 159 places.
[2024-05-24 03:12:25] [INFO ] Transformed 334 transitions.
[2024-05-24 03:12:25] [INFO ] Found NUPN structural information;
[2024-05-24 03:12:25] [INFO ] Parsed PT model containing 159 places and 334 transitions and 879 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
Support contains 75 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 307/307 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 114 transition count 224
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 114 transition count 224
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 112 transition count 220
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 112 transition count 220
Applied a total of 94 rules in 25 ms. Remains 112 /159 variables (removed 47) and now considering 220/307 (removed 87) transitions.
[2024-05-24 03:12:25] [INFO ] Flow matrix only has 215 transitions (discarded 5 similar events)
// Phase 1: matrix 215 rows 112 cols
[2024-05-24 03:12:25] [INFO ] Computed 11 invariants in 16 ms
[2024-05-24 03:12:25] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-24 03:12:25] [INFO ] Flow matrix only has 215 transitions (discarded 5 similar events)
[2024-05-24 03:12:25] [INFO ] Invariant cache hit.
[2024-05-24 03:12:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:12:25] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-05-24 03:12:25] [INFO ] Flow matrix only has 215 transitions (discarded 5 similar events)
[2024-05-24 03:12:25] [INFO ] Invariant cache hit.
[2024-05-24 03:12:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-24 03:12:27] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 13 ms to minimize.
[2024-05-24 03:12:27] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:12:27] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:12:27] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:12:27] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:12:27] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:12:27] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:12:28] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:12:28] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-24 03:12:28] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:12:28] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:12:28] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:12:28] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:12:28] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:12:28] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 3 ms to minimize.
[2024-05-24 03:12:28] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:12:28] [INFO ] Deduced a trap composed of 35 places in 246 ms of which 1 ms to minimize.
[2024-05-24 03:12:28] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:12:28] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 19/30 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 214/326 variables, 112/142 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 1/327 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-24 03:12:32] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-24 03:12:33] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
[2024-05-24 03:12:33] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:12:33] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:12:33] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/327 variables, 4/148 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/327 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-24 03:12:36] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/327 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/327 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 13 (OVERLAPS) 0/327 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 149 constraints, problems are : Problem set: 0 solved, 219 unsolved in 13485 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-24 03:12:40] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:12:40] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:12:40] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:12:40] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:12:40] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:12:40] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:12:40] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:12:40] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:12:40] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:12:41] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:12:41] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:12:41] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:12:41] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:12:41] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:12:41] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 2 ms to minimize.
[2024-05-24 03:12:41] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:12:41] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:12:41] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 18/54 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-24 03:12:41] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:12:41] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:12:41] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:12:41] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:12:41] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:12:41] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-24 03:12:42] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:12:42] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:12:42] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-24 03:12:43] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 214/326 variables, 112/176 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 219/395 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-24 03:12:45] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:12:46] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-24 03:12:50] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 14 (OVERLAPS) 1/327 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/327 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 16 (OVERLAPS) 0/327 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 399 constraints, problems are : Problem set: 0 solved, 219 unsolved in 24910 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 56/56 constraints]
After SMT, in 38554ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 38574ms
Starting structural reductions in LTL mode, iteration 1 : 112/159 places, 220/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38963 ms. Remains : 112/159 places, 220/307 transitions.
Support contains 75 out of 112 places after structural reductions.
[2024-05-24 03:13:04] [INFO ] Flatten gal took : 37 ms
[2024-05-24 03:13:04] [INFO ] Flatten gal took : 17 ms
[2024-05-24 03:13:04] [INFO ] Input system was already deterministic with 220 transitions.
RANDOM walk for 40000 steps (2671 resets) in 1883 ms. (21 steps per ms) remains 31/65 properties
BEST_FIRST walk for 4004 steps (60 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (39 resets) in 43 ms. (91 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (39 resets) in 36 ms. (108 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (23 resets) in 25 ms. (154 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (37 resets) in 33 ms. (117 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (38 resets) in 25 ms. (153 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (37 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (39 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (38 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (39 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (34 resets) in 8 ms. (444 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (37 resets) in 19 ms. (200 steps per ms) remains 28/31 properties
BEST_FIRST walk for 4004 steps (39 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (40 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (41 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (38 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (35 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (38 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (39 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (36 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (22 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (40 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (36 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (39 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (36 resets) in 21 ms. (182 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (38 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (24 resets) in 30 ms. (129 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (34 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (36 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
[2024-05-24 03:13:05] [INFO ] Flow matrix only has 215 transitions (discarded 5 similar events)
[2024-05-24 03:13:05] [INFO ] Invariant cache hit.
[2024-05-24 03:13:05] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 37/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 31/112 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 28 unsolved
[2024-05-24 03:13:05] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-24 03:13:05] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-24 03:13:06] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:13:06] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:13:06] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:13:06] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:13:06] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:13:06] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:13:06] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:13:06] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:13:06] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
Problem AtomicPropp34 is UNSAT
[2024-05-24 03:13:06] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:13:06] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:13:06] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:13:06] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:13:06] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:13:06] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:13:06] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 18/29 constraints. Problems are: Problem set: 1 solved, 27 unsolved
[2024-05-24 03:13:06] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:13:06] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:13:06] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:13:06] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 0 ms to minimize.
[2024-05-24 03:13:06] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:13:07] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:13:07] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:13:07] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:13:07] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:13:07] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 10/39 constraints. Problems are: Problem set: 1 solved, 27 unsolved
[2024-05-24 03:13:07] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 1/40 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 27 unsolved
Problem AtomicPropp60 is UNSAT
At refinement iteration 8 (OVERLAPS) 214/326 variables, 112/152 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 0/152 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 1/327 variables, 1/153 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/327 variables, 0/153 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 0/327 variables, 0/153 constraints. Problems are: Problem set: 2 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 153 constraints, problems are : Problem set: 2 solved, 26 unsolved in 2240 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 2 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 39/80 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 4/7 constraints. Problems are: Problem set: 2 solved, 26 unsolved
[2024-05-24 03:13:08] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:13:08] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 3 ms to minimize.
[2024-05-24 03:13:08] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 3/10 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 32/112 variables, 8/18 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 25/43 constraints. Problems are: Problem set: 2 solved, 26 unsolved
[2024-05-24 03:13:08] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:13:08] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:13:08] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 3/46 constraints. Problems are: Problem set: 2 solved, 26 unsolved
[2024-05-24 03:13:08] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 0 ms to minimize.
[2024-05-24 03:13:08] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:13:08] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:13:08] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:13:08] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:13:08] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2024-05-24 03:13:08] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:13:08] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:13:09] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:13:09] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:13:09] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:13:09] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 12/58 constraints. Problems are: Problem set: 2 solved, 26 unsolved
[2024-05-24 03:13:09] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:13:09] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:13:09] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:13:09] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 4/62 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 0/62 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 214/326 variables, 112/174 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 26/200 constraints. Problems are: Problem set: 2 solved, 26 unsolved
[2024-05-24 03:13:10] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:13:10] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:13:10] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:13:10] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 4/204 constraints. Problems are: Problem set: 2 solved, 26 unsolved
[2024-05-24 03:13:10] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:13:10] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:13:10] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/326 variables, 3/207 constraints. Problems are: Problem set: 2 solved, 26 unsolved
[2024-05-24 03:13:11] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/326 variables, 1/208 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/326 variables, 0/208 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 17 (OVERLAPS) 1/327 variables, 1/209 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/327 variables, 0/209 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 19 (OVERLAPS) 0/327 variables, 0/209 constraints. Problems are: Problem set: 2 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 209 constraints, problems are : Problem set: 2 solved, 26 unsolved in 4665 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 26/28 constraints, Known Traps: 59/59 constraints]
After SMT, in 6923ms problems are : Problem set: 2 solved, 26 unsolved
Fused 26 Parikh solutions to 24 different solutions.
Parikh walk visited 21 properties in 5792 ms.
Support contains 19 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 220/220 transitions.
Graph (trivial) has 58 edges and 112 vertex of which 10 / 112 are part of one of the 5 SCC in 17 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 450 edges and 107 vertex of which 106 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 106 transition count 202
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 104 transition count 200
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 48 place count 64 transition count 121
Iterating global reduction 2 with 40 rules applied. Total rules applied 88 place count 64 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 89 place count 64 transition count 120
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 95 place count 58 transition count 108
Iterating global reduction 3 with 6 rules applied. Total rules applied 101 place count 58 transition count 108
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 107 place count 58 transition count 102
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 108 place count 57 transition count 99
Iterating global reduction 4 with 1 rules applied. Total rules applied 109 place count 57 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 110 place count 56 transition count 97
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 56 transition count 97
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 114 place count 56 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 116 place count 55 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 119 place count 55 transition count 90
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 119 place count 55 transition count 87
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 125 place count 52 transition count 87
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 127 place count 52 transition count 85
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 129 place count 50 transition count 85
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 130 place count 50 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 131 place count 49 transition count 84
Applied a total of 131 rules in 66 ms. Remains 49 /112 variables (removed 63) and now considering 84/220 (removed 136) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 49/112 places, 84/220 transitions.
RANDOM walk for 40000 steps (4018 resets) in 757 ms. (52 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (627 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (403 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
[2024-05-24 03:13:18] [INFO ] Flow matrix only has 83 transitions (discarded 1 similar events)
// Phase 1: matrix 83 rows 49 cols
[2024-05-24 03:13:18] [INFO ] Computed 10 invariants in 4 ms
[2024-05-24 03:13:18] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/49 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 83/132 variables, 49/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 10/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 69 constraints, problems are : Problem set: 0 solved, 2 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 49/49 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 19/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 22/49 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 03:13:18] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:13:18] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:13:18] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:13:18] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-24 03:13:19] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 03:13:19] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 83/132 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 03:13:19] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:13:19] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-24 03:13:19] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/132 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/132 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/132 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 80 constraints, problems are : Problem set: 0 solved, 2 unsolved in 402 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 49/49 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 466ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 83 ms.
Support contains 8 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 84/84 transitions.
Graph (complete) has 189 edges and 49 vertex of which 47 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 47 transition count 82
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 place count 44 transition count 82
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 0 with 2 rules applied. Total rules applied 8 place count 43 transition count 81
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 41 transition count 103
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 41 transition count 100
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 41 transition count 97
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 38 transition count 97
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 1 with 15 rules applied. Total rules applied 36 place count 38 transition count 97
Applied a total of 36 rules in 23 ms. Remains 38 /49 variables (removed 11) and now considering 97/84 (removed -13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 38/49 places, 97/84 transitions.
RANDOM walk for 40000 steps (2610 resets) in 613 ms. (65 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (525 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (471 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 13391 steps, run visited all 2 properties in 47 ms. (steps per millisecond=284 )
Probabilistic random walk after 13391 steps, saw 3168 distinct states, run finished after 54 ms. (steps per millisecond=247 ) properties seen :2
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-24 03:13:19] [INFO ] Flatten gal took : 23 ms
[2024-05-24 03:13:19] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:13:19] [INFO ] Input system was already deterministic with 220 transitions.
Computed a total of 9 stabilizing places and 14 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 220/220 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 69 transition count 136
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 69 transition count 136
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 92 place count 63 transition count 124
Iterating global reduction 0 with 6 rules applied. Total rules applied 98 place count 63 transition count 124
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 104 place count 63 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 62 transition count 115
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 62 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 61 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 61 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 110 place count 61 transition count 111
Applied a total of 110 rules in 8 ms. Remains 61 /112 variables (removed 51) and now considering 111/220 (removed 109) transitions.
[2024-05-24 03:13:19] [INFO ] Flow matrix only has 108 transitions (discarded 3 similar events)
// Phase 1: matrix 108 rows 61 cols
[2024-05-24 03:13:19] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:13:19] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 03:13:19] [INFO ] Flow matrix only has 108 transitions (discarded 3 similar events)
[2024-05-24 03:13:19] [INFO ] Invariant cache hit.
[2024-05-24 03:13:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:13:19] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-24 03:13:19] [INFO ] Flow matrix only has 108 transitions (discarded 3 similar events)
[2024-05-24 03:13:19] [INFO ] Invariant cache hit.
[2024-05-24 03:13:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-24 03:13:20] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:13:20] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-24 03:13:20] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:13:20] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:13:20] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:13:20] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-24 03:13:20] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 107/168 variables, 61/77 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 1/169 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 0/169 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 78 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2638 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-24 03:13:22] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-24 03:13:23] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:13:23] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:13:23] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-24 03:13:23] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 107/168 variables, 61/82 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 110/192 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 1/169 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 12 (OVERLAPS) 0/169 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 193 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4090 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 12/12 constraints]
After SMT, in 6768ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 6769ms
Starting structural reductions in LTL mode, iteration 1 : 61/112 places, 111/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6857 ms. Remains : 61/112 places, 111/220 transitions.
[2024-05-24 03:13:26] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:13:26] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:13:26] [INFO ] Input system was already deterministic with 111 transitions.
[2024-05-24 03:13:26] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:13:26] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:13:26] [INFO ] Time to serialize gal into /tmp/CTLFireability2449172069553765334.gal : 2 ms
[2024-05-24 03:13:26] [INFO ] Time to serialize properties into /tmp/CTLFireability9695045953616843408.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2449172069553765334.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9695045953616843408.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.81773e+06,0.189345,10680,2,1543,5,29232,6,0,351,32762,0


Converting to forward existential form...Done !
original formula: A(!(AF((E((p13!=1) U (p92!=1)) + AF((((((p18==1)&&(p37==1))&&((p56==1)&&(p61==1)))&&(((p66==1)&&(p73==1))&&((p80==1)&&(p87==1))))&&((p113...255
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !((!(!(EX(!((p70==1))))) + !(E(TRUE U !((((p67==1)&&(p76==1)) + !((E(!((p26==1)) U (...719
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t22, t...378
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,9.3473,287124,1,0,621,1.83512e+06,273,353,2769,1.61809e+06,762
FORMULA HealthRecord-PT-11-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 220/220 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 64 transition count 126
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 64 transition count 126
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 102 place count 58 transition count 113
Iterating global reduction 0 with 6 rules applied. Total rules applied 108 place count 58 transition count 113
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 117 place count 58 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 56 transition count 99
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 56 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 123 place count 56 transition count 97
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 55 transition count 95
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 55 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 128 place count 55 transition count 92
Applied a total of 128 rules in 14 ms. Remains 55 /112 variables (removed 57) and now considering 92/220 (removed 128) transitions.
[2024-05-24 03:13:36] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
// Phase 1: matrix 89 rows 55 cols
[2024-05-24 03:13:36] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:13:36] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-24 03:13:36] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2024-05-24 03:13:36] [INFO ] Invariant cache hit.
[2024-05-24 03:13:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:13:36] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-05-24 03:13:36] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2024-05-24 03:13:36] [INFO ] Invariant cache hit.
[2024-05-24 03:13:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 03:13:36] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:13:36] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:13:36] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:13:36] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:13:36] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 88/143 variables, 55/69 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 1/144 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/144 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 70 constraints, problems are : Problem set: 0 solved, 91 unsolved in 1643 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-05-24 03:13:38] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:13:38] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:13:38] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 88/143 variables, 55/72 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 91/163 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 1/144 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/144 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 164 constraints, problems are : Problem set: 0 solved, 91 unsolved in 2683 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 8/8 constraints]
After SMT, in 4354ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 4355ms
Starting structural reductions in LTL mode, iteration 1 : 55/112 places, 92/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4473 ms. Remains : 55/112 places, 92/220 transitions.
[2024-05-24 03:13:40] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:13:40] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:13:40] [INFO ] Input system was already deterministic with 92 transitions.
[2024-05-24 03:13:40] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:13:40] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:13:40] [INFO ] Time to serialize gal into /tmp/CTLFireability17356013490356264230.gal : 2 ms
[2024-05-24 03:13:40] [INFO ] Time to serialize properties into /tmp/CTLFireability785548013795775385.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/CTLFireability17356013490356264230.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability785548013795775385.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,817947,0.059129,6148,2,1095,5,11233,6,0,308,10827,0


Converting to forward existential form...Done !
original formula: EF((EF(((EF((p49==0)) + (p17==1)) + (p124==1))) * EX((((p97==1)&&(p36==1))&&(p156==1)))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * E(TRUE U ((E(TRUE U (p49==0)) + (p17==1)) + (p124==1))))) * (((p97==1)&&(p36==1))&&(p156...171
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t20, t22, t24, t...312
(forward)formula 0,1,0.295813,14860,1,0,183,54076,204,79,2268,46457,198
FORMULA HealthRecord-PT-11-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 220/220 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 64 transition count 126
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 64 transition count 126
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 104 place count 56 transition count 109
Iterating global reduction 0 with 8 rules applied. Total rules applied 112 place count 56 transition count 109
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 121 place count 56 transition count 100
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 124 place count 53 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 127 place count 53 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 130 place count 53 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 131 place count 52 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 132 place count 52 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 134 place count 52 transition count 85
Applied a total of 134 rules in 5 ms. Remains 52 /112 variables (removed 60) and now considering 85/220 (removed 135) transitions.
[2024-05-24 03:13:40] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
// Phase 1: matrix 82 rows 52 cols
[2024-05-24 03:13:40] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:13:40] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 03:13:40] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2024-05-24 03:13:40] [INFO ] Invariant cache hit.
[2024-05-24 03:13:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:13:41] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-05-24 03:13:41] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2024-05-24 03:13:41] [INFO ] Invariant cache hit.
[2024-05-24 03:13:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-24 03:13:41] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:13:41] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 81/133 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 1/134 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 64 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1493 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-24 03:13:42] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:13:42] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 81/133 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 84/149 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 1/134 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 150 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2075 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 4/4 constraints]
After SMT, in 3604ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 3605ms
Starting structural reductions in LTL mode, iteration 1 : 52/112 places, 85/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3703 ms. Remains : 52/112 places, 85/220 transitions.
[2024-05-24 03:13:44] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:13:44] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:13:44] [INFO ] Input system was already deterministic with 85 transitions.
[2024-05-24 03:13:44] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:13:44] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:13:44] [INFO ] Time to serialize gal into /tmp/CTLFireability18409164442786881179.gal : 7 ms
[2024-05-24 03:13:44] [INFO ] Time to serialize properties into /tmp/CTLFireability17511789278186519813.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/CTLFireability18409164442786881179.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17511789278186519813.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,658297,0.051863,5832,2,850,5,11151,6,0,289,10451,0


Converting to forward existential form...Done !
original formula: AF(AG((EX((p140==0)) + ((p109==0)&&(p12==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((EX((p140==0)) + ((p109==0)&&(p12==0))))))))] = FALSE
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, t40, t41, t76, ...252
(forward)formula 0,1,0.179481,10320,1,0,147,31403,192,67,2067,29954,177
FORMULA HealthRecord-PT-11-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 220/220 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 63 transition count 124
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 63 transition count 124
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 105 place count 56 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 112 place count 56 transition count 109
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 118 place count 56 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 121 place count 53 transition count 95
Iterating global reduction 1 with 3 rules applied. Total rules applied 124 place count 53 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 127 place count 53 transition count 92
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 129 place count 51 transition count 88
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 51 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 137 place count 51 transition count 82
Applied a total of 137 rules in 10 ms. Remains 51 /112 variables (removed 61) and now considering 82/220 (removed 138) transitions.
[2024-05-24 03:13:44] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
// Phase 1: matrix 79 rows 51 cols
[2024-05-24 03:13:44] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:13:44] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-24 03:13:44] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
[2024-05-24 03:13:44] [INFO ] Invariant cache hit.
[2024-05-24 03:13:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:13:44] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2024-05-24 03:13:44] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
[2024-05-24 03:13:44] [INFO ] Invariant cache hit.
[2024-05-24 03:13:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-24 03:13:45] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2024-05-24 03:13:45] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 78/129 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 1/130 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 63 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1338 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-24 03:13:46] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:13:46] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:13:46] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 78/129 variables, 51/65 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 81/146 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 1/130 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 147 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2141 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 5/5 constraints]
After SMT, in 3514ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 3515ms
Starting structural reductions in LTL mode, iteration 1 : 51/112 places, 82/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3614 ms. Remains : 51/112 places, 82/220 transitions.
[2024-05-24 03:13:48] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:13:48] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:13:48] [INFO ] Input system was already deterministic with 82 transitions.
[2024-05-24 03:13:48] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:13:48] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:13:48] [INFO ] Time to serialize gal into /tmp/CTLFireability12527446286434117045.gal : 14 ms
[2024-05-24 03:13:48] [INFO ] Time to serialize properties into /tmp/CTLFireability3700219445196148530.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/CTLFireability12527446286434117045.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3700219445196148530.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,576648,0.049784,5808,2,953,5,10898,6,0,282,8954,0


Converting to forward existential form...Done !
original formula: (EG(AF(((p17==0)||(p156==0)))) * EX(AX(EF((p119==1)))))
=> equivalent forward existential formula: [(EY((Init * EG(!(EG(!(((p17==0)||(p156==0)))))))) * !(EX(!(E(TRUE U (p119==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t18, t20, t22, Intersecti...242
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,2.20261,80236,1,0,307,477188,195,183,2149,423434,341
FORMULA HealthRecord-PT-11-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 220/220 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 64 transition count 126
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 64 transition count 126
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 104 place count 56 transition count 109
Iterating global reduction 0 with 8 rules applied. Total rules applied 112 place count 56 transition count 109
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 121 place count 56 transition count 100
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 124 place count 53 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 127 place count 53 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 129 place count 53 transition count 90
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 131 place count 51 transition count 86
Iterating global reduction 2 with 2 rules applied. Total rules applied 133 place count 51 transition count 86
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 139 place count 51 transition count 80
Applied a total of 139 rules in 13 ms. Remains 51 /112 variables (removed 61) and now considering 80/220 (removed 140) transitions.
[2024-05-24 03:13:50] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
// Phase 1: matrix 77 rows 51 cols
[2024-05-24 03:13:50] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:13:50] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-24 03:13:50] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2024-05-24 03:13:50] [INFO ] Invariant cache hit.
[2024-05-24 03:13:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:13:50] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-05-24 03:13:50] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2024-05-24 03:13:50] [INFO ] Invariant cache hit.
[2024-05-24 03:13:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-24 03:13:51] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-24 03:13:51] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 76/127 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 1/128 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 63 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1331 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-24 03:13:52] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-24 03:13:52] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:13:52] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-24 03:13:52] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:13:52] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 76/127 variables, 51/67 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 79/146 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 1/128 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 12 (OVERLAPS) 0/128 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 147 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2282 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 7/7 constraints]
After SMT, in 3631ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 3632ms
Starting structural reductions in LTL mode, iteration 1 : 51/112 places, 80/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3771 ms. Remains : 51/112 places, 80/220 transitions.
[2024-05-24 03:13:54] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:13:54] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:13:54] [INFO ] Input system was already deterministic with 80 transitions.
[2024-05-24 03:13:54] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:13:54] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:13:54] [INFO ] Time to serialize gal into /tmp/CTLFireability12145960923320079520.gal : 2 ms
[2024-05-24 03:13:54] [INFO ] Time to serialize properties into /tmp/CTLFireability11401734463641859915.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/CTLFireability12145960923320079520.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11401734463641859915.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,801909,0.055154,5788,2,793,5,10332,6,0,280,9600,0


Converting to forward existential form...Done !
original formula: EF(AG(EX((AF((p13==1)) + EX((p81==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX((!(EG(!((p13==1)))) + EX((p81==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t15, t17, t19, t39, t40, Intersection wi...237
(forward)formula 0,0,1.57612,59660,1,0,297,352183,185,147,2051,340747,355
FORMULA HealthRecord-PT-11-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 220/220 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 65 transition count 128
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 65 transition count 128
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 101 place count 58 transition count 113
Iterating global reduction 0 with 7 rules applied. Total rules applied 108 place count 58 transition count 113
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 114 place count 58 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 117 place count 55 transition count 99
Iterating global reduction 1 with 3 rules applied. Total rules applied 120 place count 55 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 123 place count 55 transition count 96
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 125 place count 53 transition count 92
Iterating global reduction 2 with 2 rules applied. Total rules applied 127 place count 53 transition count 92
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 133 place count 53 transition count 86
Applied a total of 133 rules in 7 ms. Remains 53 /112 variables (removed 59) and now considering 86/220 (removed 134) transitions.
[2024-05-24 03:13:56] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
// Phase 1: matrix 83 rows 53 cols
[2024-05-24 03:13:56] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:13:56] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-24 03:13:56] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2024-05-24 03:13:56] [INFO ] Invariant cache hit.
[2024-05-24 03:13:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:13:56] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2024-05-24 03:13:56] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2024-05-24 03:13:56] [INFO ] Invariant cache hit.
[2024-05-24 03:13:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:13:56] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:13:56] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:13:56] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:13:56] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:13:56] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:13:56] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:13:56] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:13:57] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 82/135 variables, 53/70 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 1/136 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 0/136 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 71 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1937 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 82/135 variables, 53/70 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 85/155 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 1/136 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 0/136 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 156 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2205 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 8/8 constraints]
After SMT, in 4167ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 4168ms
Starting structural reductions in LTL mode, iteration 1 : 53/112 places, 86/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4355 ms. Remains : 53/112 places, 86/220 transitions.
[2024-05-24 03:14:00] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:14:00] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:14:00] [INFO ] Input system was already deterministic with 86 transitions.
[2024-05-24 03:14:00] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:14:00] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:14:00] [INFO ] Time to serialize gal into /tmp/CTLFireability7361245276291961520.gal : 1 ms
[2024-05-24 03:14:00] [INFO ] Time to serialize properties into /tmp/CTLFireability572939631011540049.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/CTLFireability7361245276291961520.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability572939631011540049.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AX(AX(((EF(EX((p59==1))) + (p92==1)) * (EF((p104==0)) + AX(((p20==0)||(p156==0)))))))
=> equivalent forward existential formula: ([((EY(EY(Init)) * !((p92==1))) * !(E(TRUE U EX((p59==1)))))] = FALSE * [(EY((EY(EY(Init)) * !(E(TRUE U (p104==0...198
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t16, t18, t20, t21, t22, t23, t24, t...282
(forward)formula 0,0,0.391185,18076,1,0,176,78016,194,78,2192,62987,197
FORMULA HealthRecord-PT-11-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 220/220 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 67 transition count 131
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 67 transition count 131
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 98 place count 59 transition count 114
Iterating global reduction 0 with 8 rules applied. Total rules applied 106 place count 59 transition count 114
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 115 place count 59 transition count 105
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 118 place count 56 transition count 97
Iterating global reduction 1 with 3 rules applied. Total rules applied 121 place count 56 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 123 place count 56 transition count 95
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 125 place count 54 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 127 place count 54 transition count 91
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 132 place count 54 transition count 86
Applied a total of 132 rules in 9 ms. Remains 54 /112 variables (removed 58) and now considering 86/220 (removed 134) transitions.
[2024-05-24 03:14:00] [INFO ] Flow matrix only has 82 transitions (discarded 4 similar events)
// Phase 1: matrix 82 rows 54 cols
[2024-05-24 03:14:00] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:14:00] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-24 03:14:00] [INFO ] Flow matrix only has 82 transitions (discarded 4 similar events)
[2024-05-24 03:14:00] [INFO ] Invariant cache hit.
[2024-05-24 03:14:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:14:01] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2024-05-24 03:14:01] [INFO ] Flow matrix only has 82 transitions (discarded 4 similar events)
[2024-05-24 03:14:01] [INFO ] Invariant cache hit.
[2024-05-24 03:14:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:14:01] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:14:01] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:14:01] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-24 03:14:01] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 81/135 variables, 54/68 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 1/136 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/136 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 69 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1732 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 81/135 variables, 54/68 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 85/153 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 1/136 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/136 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 154 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1931 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 4/4 constraints]
After SMT, in 3694ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 3695ms
Starting structural reductions in LTL mode, iteration 1 : 54/112 places, 86/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3786 ms. Remains : 54/112 places, 86/220 transitions.
[2024-05-24 03:14:04] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:14:04] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:14:04] [INFO ] Input system was already deterministic with 86 transitions.
[2024-05-24 03:14:04] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:14:04] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:14:04] [INFO ] Time to serialize gal into /tmp/CTLFireability12742796302998122240.gal : 2 ms
[2024-05-24 03:14:04] [INFO ] Time to serialize properties into /tmp/CTLFireability13012940307957273652.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/CTLFireability12742796302998122240.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13012940307957273652.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.27657e+06,0.048694,5564,2,718,5,9373,6,0,295,8890,0


Converting to forward existential form...Done !
original formula: (AG(EF(((EF((p32==1)) + E((p85==1) U (((((p18==1)&&(p37==1))&&((p56==1)&&(p61==1)))&&(((p66==1)&&(p73==1))&&((p80==1)&&(p87==1))))&&((p11...222
=> equivalent forward existential formula: [(FwdU((Init * !(EX((p75==1)))),TRUE) * !(E(TRUE U ((E(TRUE U (p32==1)) + E((p85==1) U (((((p18==1)&&(p37==1))&&...336
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t15, t17, t19, t38, t39, t40, t41, Inter...247
(forward)formula 0,1,2.28694,81524,1,0,497,501329,205,250,2180,470549,582
FORMULA HealthRecord-PT-11-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 220/220 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 69 transition count 135
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 69 transition count 135
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 92 place count 63 transition count 123
Iterating global reduction 0 with 6 rules applied. Total rules applied 98 place count 63 transition count 123
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 103 place count 63 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 62 transition count 115
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 62 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 61 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 61 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 110 place count 61 transition count 110
Applied a total of 110 rules in 3 ms. Remains 61 /112 variables (removed 51) and now considering 110/220 (removed 110) transitions.
[2024-05-24 03:14:07] [INFO ] Flow matrix only has 106 transitions (discarded 4 similar events)
// Phase 1: matrix 106 rows 61 cols
[2024-05-24 03:14:07] [INFO ] Computed 10 invariants in 0 ms
[2024-05-24 03:14:07] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-24 03:14:07] [INFO ] Flow matrix only has 106 transitions (discarded 4 similar events)
[2024-05-24 03:14:07] [INFO ] Invariant cache hit.
[2024-05-24 03:14:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:14:07] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2024-05-24 03:14:07] [INFO ] Flow matrix only has 106 transitions (discarded 4 similar events)
[2024-05-24 03:14:07] [INFO ] Invariant cache hit.
[2024-05-24 03:14:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-24 03:14:07] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:14:07] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2024-05-24 03:14:07] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 105/166 variables, 61/74 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-24 03:14:08] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:14:08] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:14:08] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-05-24 03:14:08] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 1/167 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (OVERLAPS) 0/167 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 79 constraints, problems are : Problem set: 0 solved, 109 unsolved in 2836 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 105/166 variables, 61/78 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 109/187 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-24 03:14:10] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:14:10] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:14:10] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 1/167 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-24 03:14:12] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (OVERLAPS) 0/167 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 192 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4482 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 11/11 constraints]
After SMT, in 7372ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 7383ms
Starting structural reductions in LTL mode, iteration 1 : 61/112 places, 110/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7578 ms. Remains : 61/112 places, 110/220 transitions.
[2024-05-24 03:14:14] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:14:14] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:14:14] [INFO ] Input system was already deterministic with 110 transitions.
[2024-05-24 03:14:14] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:14:14] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:14:14] [INFO ] Time to serialize gal into /tmp/CTLFireability14188021987334989508.gal : 2 ms
[2024-05-24 03:14:14] [INFO ] Time to serialize properties into /tmp/CTLFireability13090093270916956669.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/CTLFireability14188021987334989508.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13090093270916956669.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.49446e+06,0.179686,11276,2,1973,5,33079,6,0,347,33830,0


Converting to forward existential form...Done !
original formula: EG(((EG((p58==1)) + AX((p9==1))) + ((AG((p14==0)) * EX((p117==0))) + (((p48==0)||(p104==0)) * ((AG((p4==1)) + (p146==1)) + ((p72==1)&&(p1...167
=> equivalent forward existential formula: [FwdG(Init,((EG((p58==1)) + !(EX(!((p9==1))))) + ((!(E(TRUE U !((p14==0)))) * EX((p117==0))) + (((p48==0)||(p104...240
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t21, t22, t...398
(forward)formula 0,0,1.62535,55344,1,0,264,283963,256,118,2626,251856,283
FORMULA HealthRecord-PT-11-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 220/220 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 64 transition count 126
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 64 transition count 126
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 102 place count 58 transition count 114
Iterating global reduction 0 with 6 rules applied. Total rules applied 108 place count 58 transition count 114
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 113 place count 58 transition count 109
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 115 place count 56 transition count 103
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 56 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 54 transition count 99
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 54 transition count 99
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 127 place count 54 transition count 93
Applied a total of 127 rules in 7 ms. Remains 54 /112 variables (removed 58) and now considering 93/220 (removed 127) transitions.
[2024-05-24 03:14:16] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
// Phase 1: matrix 90 rows 54 cols
[2024-05-24 03:14:16] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:14:16] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-24 03:14:16] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
[2024-05-24 03:14:16] [INFO ] Invariant cache hit.
[2024-05-24 03:14:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:14:16] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-05-24 03:14:16] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
[2024-05-24 03:14:16] [INFO ] Invariant cache hit.
[2024-05-24 03:14:16] [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, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-24 03:14:17] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:14:17] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-24 03:14:17] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:14:17] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 89/143 variables, 54/67 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 1/144 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-24 03:14:18] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:14:18] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 0/144 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 70 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2524 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-24 03:14:19] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 89/143 variables, 54/70 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 92/162 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 1/144 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/144 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 0/144 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 163 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2431 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 7/7 constraints]
After SMT, in 5006ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 5010ms
Starting structural reductions in LTL mode, iteration 1 : 54/112 places, 93/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5186 ms. Remains : 54/112 places, 93/220 transitions.
[2024-05-24 03:14:21] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:14:21] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:14:21] [INFO ] Input system was already deterministic with 93 transitions.
[2024-05-24 03:14:21] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:14:21] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:14:21] [INFO ] Time to serialize gal into /tmp/CTLFireability13916897840526388676.gal : 0 ms
[2024-05-24 03:14:21] [INFO ] Time to serialize properties into /tmp/CTLFireability1004937459870019609.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/CTLFireability13916897840526388676.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1004937459870019609.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,884286,0.192551,8528,2,1215,5,22566,6,0,305,20902,0


Converting to forward existential form...Done !
original formula: EX(((p9==1) + (EX(AX(((p113==0)||(p118==0)))) * EG(E(!(((p55==1)&&(p156==1))) U (p42==1))))))
=> equivalent forward existential formula: ([(EY(Init) * (p9==1))] != FALSE + [FwdG((EY(Init) * EX(!(EX(!(((p113==0)||(p118==0))))))),E(!(((p55==1)&&(p156=...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, t21, t23, t35, t...282
(forward)formula 0,0,0.475173,18544,1,0,177,81940,212,79,2233,69507,207
FORMULA HealthRecord-PT-11-CTLFireability-2024-08 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 : 112/112 places, 220/220 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 72 transition count 142
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 72 transition count 142
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 85 place count 67 transition count 132
Iterating global reduction 0 with 5 rules applied. Total rules applied 90 place count 67 transition count 132
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 98 place count 67 transition count 124
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 66 transition count 121
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 66 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 65 transition count 119
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 65 transition count 119
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 65 transition count 116
Applied a total of 105 rules in 18 ms. Remains 65 /112 variables (removed 47) and now considering 116/220 (removed 104) transitions.
[2024-05-24 03:14:22] [INFO ] Flow matrix only has 113 transitions (discarded 3 similar events)
// Phase 1: matrix 113 rows 65 cols
[2024-05-24 03:14:22] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:14:22] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-24 03:14:22] [INFO ] Flow matrix only has 113 transitions (discarded 3 similar events)
[2024-05-24 03:14:22] [INFO ] Invariant cache hit.
[2024-05-24 03:14:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:14:22] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2024-05-24 03:14:22] [INFO ] Flow matrix only has 113 transitions (discarded 3 similar events)
[2024-05-24 03:14:22] [INFO ] Invariant cache hit.
[2024-05-24 03:14:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-24 03:14:22] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-24 03:14:22] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:14:22] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:14:23] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:14:23] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:14:23] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-24 03:14:23] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:14:23] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:14:23] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:14:23] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 0 ms to minimize.
[2024-05-24 03:14:23] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2024-05-24 03:14:23] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:14:23] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 112/177 variables, 65/87 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 1/178 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (OVERLAPS) 0/178 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 88 constraints, problems are : Problem set: 0 solved, 115 unsolved in 3377 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-24 03:14:26] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:14:26] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-05-24 03:14:26] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:14:26] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 112/177 variables, 65/91 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 115/206 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (OVERLAPS) 1/178 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/178 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (OVERLAPS) 0/178 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 207 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4607 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 17/17 constraints]
After SMT, in 8072ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 8073ms
Starting structural reductions in LTL mode, iteration 1 : 65/112 places, 116/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8282 ms. Remains : 65/112 places, 116/220 transitions.
[2024-05-24 03:14:30] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:14:30] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:14:30] [INFO ] Input system was already deterministic with 116 transitions.
[2024-05-24 03:14:30] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:14:30] [INFO ] Flatten gal took : 10 ms
[2024-05-24 03:14:30] [INFO ] Time to serialize gal into /tmp/CTLFireability4234229385879778077.gal : 13 ms
[2024-05-24 03:14:30] [INFO ] Time to serialize properties into /tmp/CTLFireability8174221523508290197.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/CTLFireability4234229385879778077.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8174221523508290197.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,3.7371e+06,0.308692,15260,2,2506,5,45471,6,0,372,55587,0


Converting to forward existential form...Done !
original formula: EF(((EF((EF((p43==1)) + (((EG((p53==1)) * (p17==1)) * ((p36==1)&&(p55==1))) * ((p131==1)&&(p59==1))))) + ((p44==1) * AX(E((p33==1) U (p97...254
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (E(TRUE U (E(TRUE U (p43==1)) + (((EG((p53==1)) * (p17==1)) * ((p36==1)&&(p55==1))) * ((p1...525
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...458
(forward)formula 0,1,1.76914,62108,1,0,332,334420,268,142,2745,290765,348
FORMULA HealthRecord-PT-11-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 220/220 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 65 transition count 128
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 65 transition count 128
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 101 place count 58 transition count 114
Iterating global reduction 0 with 7 rules applied. Total rules applied 108 place count 58 transition count 114
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 116 place count 58 transition count 106
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 118 place count 56 transition count 100
Iterating global reduction 1 with 2 rules applied. Total rules applied 120 place count 56 transition count 100
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 122 place count 54 transition count 96
Iterating global reduction 1 with 2 rules applied. Total rules applied 124 place count 54 transition count 96
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 130 place count 54 transition count 90
Applied a total of 130 rules in 8 ms. Remains 54 /112 variables (removed 58) and now considering 90/220 (removed 130) transitions.
[2024-05-24 03:14:32] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
// Phase 1: matrix 87 rows 54 cols
[2024-05-24 03:14:32] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:14:32] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-24 03:14:32] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2024-05-24 03:14:32] [INFO ] Invariant cache hit.
[2024-05-24 03:14:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:14:32] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2024-05-24 03:14:32] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2024-05-24 03:14:32] [INFO ] Invariant cache hit.
[2024-05-24 03:14:32] [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, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 03:14:32] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:14:32] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:14:32] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 03:14:32] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:14:32] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 86/140 variables, 54/68 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/141 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 03:14:33] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/141 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 0/141 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 70 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2409 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 03:14:34] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 86/140 variables, 54/70 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 89/159 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 1/141 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/141 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 160 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2441 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 7/7 constraints]
After SMT, in 4905ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 4906ms
Starting structural reductions in LTL mode, iteration 1 : 54/112 places, 90/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5034 ms. Remains : 54/112 places, 90/220 transitions.
[2024-05-24 03:14:37] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:14:37] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:14:37] [INFO ] Input system was already deterministic with 90 transitions.
[2024-05-24 03:14:37] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:14:37] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:14:37] [INFO ] Time to serialize gal into /tmp/CTLFireability9242010987926533014.gal : 1 ms
[2024-05-24 03:14:37] [INFO ] Time to serialize properties into /tmp/CTLFireability16897614806889626270.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/CTLFireability9242010987926533014.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16897614806889626270.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,923652,0.09046,7712,2,1098,5,18699,6,0,302,17823,0


Converting to forward existential form...Done !
original formula: AG(((AG((!(E((p146==1) U ((p72==1)&&(p156==1)))) + AG((p4==0)))) + AF((p8==1))) + AX((p27==1))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !((!(E(TRUE U !((!(E((p146==1) U ((p72==1)&&(p156==1)))) + !(E(TRUE U !((p4==0)))))))) +...201
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t18, t20, t22, t37, t38, t...287
(forward)formula 0,0,2.63956,101460,1,0,356,632510,213,172,2262,572833,408
FORMULA HealthRecord-PT-11-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 220/220 transitions.
Graph (trivial) has 156 edges and 112 vertex of which 10 / 112 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 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 61 transition count 126
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 61 transition count 126
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 100 place count 52 transition count 107
Iterating global reduction 0 with 9 rules applied. Total rules applied 109 place count 52 transition count 107
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 119 place count 52 transition count 97
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 122 place count 49 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 125 place count 49 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 128 place count 49 transition count 86
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 130 place count 47 transition count 82
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 47 transition count 82
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 138 place count 47 transition count 76
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 142 place count 47 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 146 place count 45 transition count 70
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 148 place count 43 transition count 68
Applied a total of 148 rules in 18 ms. Remains 43 /112 variables (removed 69) and now considering 68/220 (removed 152) transitions.
[2024-05-24 03:14:39] [INFO ] Flow matrix only has 61 transitions (discarded 7 similar events)
// Phase 1: matrix 61 rows 43 cols
[2024-05-24 03:14:39] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:14:39] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 03:14:39] [INFO ] Flow matrix only has 61 transitions (discarded 7 similar events)
[2024-05-24 03:14:39] [INFO ] Invariant cache hit.
[2024-05-24 03:14:39] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-24 03:14:40] [INFO ] Redundant transitions in 11 ms returned []
Running 54 sub problems to find dead transitions.
[2024-05-24 03:14:40] [INFO ] Flow matrix only has 61 transitions (discarded 7 similar events)
[2024-05-24 03:14:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 7/43 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-24 03:14:40] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:14:40] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:14:40] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 60/103 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 0/103 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/104 variables, and 55 constraints, problems are : Problem set: 0 solved, 54 unsolved in 736 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 7/43 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 60/103 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 54/109 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 0/103 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/104 variables, and 109 constraints, problems are : Problem set: 0 solved, 54 unsolved in 789 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 3/3 constraints]
After SMT, in 1541ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 1546ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/112 places, 68/220 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1666 ms. Remains : 43/112 places, 68/220 transitions.
[2024-05-24 03:14:41] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:14:41] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:14:41] [INFO ] Input system was already deterministic with 68 transitions.
[2024-05-24 03:14:41] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:14:41] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:14:41] [INFO ] Time to serialize gal into /tmp/CTLFireability18007732045146692058.gal : 2 ms
[2024-05-24 03:14:41] [INFO ] Time to serialize properties into /tmp/CTLFireability4056041742043979954.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/CTLFireability18007732045146692058.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4056041742043979954.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,266656,0.030638,4700,2,690,5,6359,6,0,228,5617,0


Converting to forward existential form...Done !
original formula: AG(EF((p19==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p19==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t30, t34, Intersection with reac...230
(forward)formula 0,0,0.17584,10772,1,0,126,43507,149,57,1630,29197,141
FORMULA HealthRecord-PT-11-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 220/220 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 74 transition count 146
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 74 transition count 146
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 81 place count 69 transition count 135
Iterating global reduction 0 with 5 rules applied. Total rules applied 86 place count 69 transition count 135
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 91 place count 69 transition count 130
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 68 transition count 127
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 68 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 67 transition count 125
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 67 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 96 place count 67 transition count 124
Applied a total of 96 rules in 2 ms. Remains 67 /112 variables (removed 45) and now considering 124/220 (removed 96) transitions.
[2024-05-24 03:14:41] [INFO ] Flow matrix only has 121 transitions (discarded 3 similar events)
// Phase 1: matrix 121 rows 67 cols
[2024-05-24 03:14:41] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:14:41] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-24 03:14:41] [INFO ] Flow matrix only has 121 transitions (discarded 3 similar events)
[2024-05-24 03:14:41] [INFO ] Invariant cache hit.
[2024-05-24 03:14:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:14:41] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-24 03:14:41] [INFO ] Flow matrix only has 121 transitions (discarded 3 similar events)
[2024-05-24 03:14:41] [INFO ] Invariant cache hit.
[2024-05-24 03:14:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-24 03:14:42] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 0 ms to minimize.
[2024-05-24 03:14:42] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:14:42] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:14:42] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-24 03:14:42] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:14:42] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2024-05-24 03:14:42] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-24 03:14:43] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 120/187 variables, 67/84 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 1/188 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 0/188 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 85 constraints, problems are : Problem set: 0 solved, 123 unsolved in 3339 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 67/67 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-24 03:14:45] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 120/187 variables, 67/85 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 123/208 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 1/188 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 0/188 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 209 constraints, problems are : Problem set: 0 solved, 123 unsolved in 3970 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 67/67 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 9/9 constraints]
After SMT, in 7367ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 7368ms
Starting structural reductions in LTL mode, iteration 1 : 67/112 places, 124/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7531 ms. Remains : 67/112 places, 124/220 transitions.
[2024-05-24 03:14:49] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:14:49] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:14:49] [INFO ] Input system was already deterministic with 124 transitions.
[2024-05-24 03:14:49] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:14:49] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:14:49] [INFO ] Time to serialize gal into /tmp/CTLFireability2959616485274909111.gal : 1 ms
[2024-05-24 03:14:49] [INFO ] Time to serialize properties into /tmp/CTLFireability8741279736217797784.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/CTLFireability2959616485274909111.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8741279736217797784.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,4.20553e+06,0.53451,25112,2,3441,5,84748,6,0,388,105080,0


Converting to forward existential form...Done !
original formula: E((EG(EX(!(((p113==1)&&(p132==1))))) + ((EX(EX((((p23==1)&&(p55==1))&&(p156==1)))) * (((p12!=1)||(p99==1)) + (((EF((p145==1)) * (p113==1)...374
=> equivalent forward existential formula: [(FwdU(Init,(EG(EX(!(((p113==1)&&(p132==1))))) + ((EX(EX((((p23==1)&&(p55==1))&&(p156==1)))) * (((p12!=1)||(p99=...444
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...423
(forward)formula 0,0,1.80172,57648,1,0,263,290337,268,109,2768,210944,287
FORMULA HealthRecord-PT-11-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 220/220 transitions.
Graph (trivial) has 114 edges and 112 vertex of which 10 / 112 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 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 61 transition count 126
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 61 transition count 126
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 100 place count 52 transition count 107
Iterating global reduction 0 with 9 rules applied. Total rules applied 109 place count 52 transition count 107
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 118 place count 52 transition count 98
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 121 place count 49 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 124 place count 49 transition count 90
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 127 place count 49 transition count 87
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 129 place count 47 transition count 83
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 47 transition count 83
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 137 place count 47 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 47 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 3 with 4 rules applied. Total rules applied 145 place count 45 transition count 71
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 43 transition count 69
Applied a total of 147 rules in 13 ms. Remains 43 /112 variables (removed 69) and now considering 69/220 (removed 151) transitions.
[2024-05-24 03:14:51] [INFO ] Flow matrix only has 62 transitions (discarded 7 similar events)
// Phase 1: matrix 62 rows 43 cols
[2024-05-24 03:14:51] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:14:51] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-24 03:14:51] [INFO ] Flow matrix only has 62 transitions (discarded 7 similar events)
[2024-05-24 03:14:51] [INFO ] Invariant cache hit.
[2024-05-24 03:14:51] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-24 03:14:51] [INFO ] Redundant transitions in 12 ms returned []
Running 55 sub problems to find dead transitions.
[2024-05-24 03:14:51] [INFO ] Flow matrix only has 62 transitions (discarded 7 similar events)
[2024-05-24 03:14:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 7/43 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-24 03:14:51] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:14:51] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-24 03:14:51] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 61/104 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/104 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/105 variables, and 55 constraints, problems are : Problem set: 0 solved, 55 unsolved in 702 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 7/43 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 61/104 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 55/110 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 0/104 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/105 variables, and 110 constraints, problems are : Problem set: 0 solved, 55 unsolved in 671 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 3/3 constraints]
After SMT, in 1424ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 1424ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/112 places, 69/220 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1549 ms. Remains : 43/112 places, 69/220 transitions.
[2024-05-24 03:14:52] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:14:52] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:14:52] [INFO ] Input system was already deterministic with 69 transitions.
[2024-05-24 03:14:52] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:14:52] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:14:52] [INFO ] Time to serialize gal into /tmp/CTLFireability2286704551444116734.gal : 10 ms
[2024-05-24 03:14:52] [INFO ] Time to serialize properties into /tmp/CTLFireability4269010091286274812.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/CTLFireability2286704551444116734.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4269010091286274812.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,266656,0.057711,6296,2,762,5,12410,6,0,229,11439,0


Converting to forward existential form...Done !
original formula: AG(((AG((p35==0)) + EG(EF(((p55==0)||(p156==0))))) + EF((((p17==0)||(p36==0))||((p55==0)||(p146==0))))))
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !(E(TRUE U (((p17==0)||(p36==0))||((p55==0)||(p146==0)))))) * !(EG(E(TRUE U ((p55==0)...201
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t27, t28, Intersection with reac...230
(forward)formula 0,1,0.630639,24872,1,0,171,127704,156,81,1679,104825,198
FORMULA HealthRecord-PT-11-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 220/220 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 67 transition count 132
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 67 transition count 132
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 96 place count 61 transition count 120
Iterating global reduction 0 with 6 rules applied. Total rules applied 102 place count 61 transition count 120
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 108 place count 61 transition count 114
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 110 place count 59 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 112 place count 59 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 114 place count 57 transition count 104
Iterating global reduction 1 with 2 rules applied. Total rules applied 116 place count 57 transition count 104
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 122 place count 57 transition count 98
Applied a total of 122 rules in 3 ms. Remains 57 /112 variables (removed 55) and now considering 98/220 (removed 122) transitions.
[2024-05-24 03:14:53] [INFO ] Flow matrix only has 95 transitions (discarded 3 similar events)
// Phase 1: matrix 95 rows 57 cols
[2024-05-24 03:14:53] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:14:53] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 03:14:53] [INFO ] Flow matrix only has 95 transitions (discarded 3 similar events)
[2024-05-24 03:14:53] [INFO ] Invariant cache hit.
[2024-05-24 03:14:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:14:53] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-24 03:14:53] [INFO ] Flow matrix only has 95 transitions (discarded 3 similar events)
[2024-05-24 03:14:53] [INFO ] Invariant cache hit.
[2024-05-24 03:14:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-24 03:14:53] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:14:53] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 94/151 variables, 57/68 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 1/152 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 0/152 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 69 constraints, problems are : Problem set: 0 solved, 97 unsolved in 1710 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 57/57 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-24 03:14:55] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:14:55] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:14:55] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-24 03:14:55] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:14:55] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-24 03:14:55] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:14:55] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-24 03:14:55] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:14:55] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-24 03:14:56] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:14:56] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:14:56] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:14:56] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:14:56] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-24 03:14:56] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 94/151 variables, 57/83 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 97/180 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 1/152 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (OVERLAPS) 0/152 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 181 constraints, problems are : Problem set: 0 solved, 97 unsolved in 3890 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 57/57 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 17/17 constraints]
After SMT, in 5663ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 5664ms
Starting structural reductions in LTL mode, iteration 1 : 57/112 places, 98/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5752 ms. Remains : 57/112 places, 98/220 transitions.
[2024-05-24 03:14:59] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:14:59] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:14:59] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-24 03:14:59] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:14:59] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:14:59] [INFO ] Time to serialize gal into /tmp/CTLFireability18310685573010629679.gal : 1 ms
[2024-05-24 03:14:59] [INFO ] Time to serialize properties into /tmp/CTLFireability7957967818023589692.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/CTLFireability18310685573010629679.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7957967818023589692.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.12048e+06,0.173231,10404,2,1530,5,30368,6,0,322,32591,0


Converting to forward existential form...Done !
original formula: EF(((((p53==1)&&(p150!=1)) * (EX(EX(AG((p84==1)))) * ((p55!=1)||(p156!=1)))) * ((AG((p9==0)) + (p84==0)) + ((p28==0)||(((p113==0)||(p144=...187
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * (((p53==1)&&(p150!=1)) * (EX(EX(!(E(TRUE U !((p84==1)))))) * ((p55!=1)||(p156!=1))))) * !...503
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t21, t23, t25, ...333
(forward)formula 0,0,0.823165,33240,1,0,204,170642,220,88,2321,133919,234
FORMULA HealthRecord-PT-11-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 220/220 transitions.
Graph (trivial) has 156 edges and 112 vertex of which 10 / 112 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 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 61 transition count 126
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 61 transition count 126
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 100 place count 52 transition count 107
Iterating global reduction 0 with 9 rules applied. Total rules applied 109 place count 52 transition count 107
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 119 place count 52 transition count 97
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 121 place count 50 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 123 place count 50 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 126 place count 50 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 49 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 49 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 131 place count 49 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 135 place count 49 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 139 place count 47 transition count 78
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 45 transition count 76
Applied a total of 141 rules in 24 ms. Remains 45 /112 variables (removed 67) and now considering 76/220 (removed 144) transitions.
[2024-05-24 03:15:00] [INFO ] Flow matrix only has 69 transitions (discarded 7 similar events)
// Phase 1: matrix 69 rows 45 cols
[2024-05-24 03:15:00] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:15:00] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-24 03:15:00] [INFO ] Flow matrix only has 69 transitions (discarded 7 similar events)
[2024-05-24 03:15:00] [INFO ] Invariant cache hit.
[2024-05-24 03:15:00] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-05-24 03:15:00] [INFO ] Redundant transitions in 16 ms returned []
Running 62 sub problems to find dead transitions.
[2024-05-24 03:15:00] [INFO ] Flow matrix only has 69 transitions (discarded 7 similar events)
[2024-05-24 03:15:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 7/45 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-24 03:15:00] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-24 03:15:00] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-24 03:15:00] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 68/113 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 0/113 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/114 variables, and 57 constraints, problems are : Problem set: 0 solved, 62 unsolved in 889 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 7/45 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-24 03:15:01] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 68/113 variables, 45/58 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 62/120 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (OVERLAPS) 0/113 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/114 variables, and 120 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1000 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 4/4 constraints]
After SMT, in 1913ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 1914ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/112 places, 76/220 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2067 ms. Remains : 45/112 places, 76/220 transitions.
[2024-05-24 03:15:02] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:15:02] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:15:02] [INFO ] Input system was already deterministic with 76 transitions.
[2024-05-24 03:15:02] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:15:02] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:15:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3567923525475871978.gal : 1 ms
[2024-05-24 03:15:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6196686016406694394.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/ReachabilityCardinality3567923525475871978.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6196686016406694394.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 40000 steps (4046 resets) in 162 ms. (245 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (561 resets) in 56 ms. (701 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 ...328
Loading property file /tmp/ReachabilityCardinality6196686016406694394.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 48
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :48 after 71
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :71 after 78
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :78 after 120
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :120 after 5184
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5184 after 7800
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :7800 after 84888
Finished probabilistic random walk after 65540 steps, run visited all 1 properties in 73 ms. (steps per millisecond=897 )
Probabilistic random walk after 65540 steps, saw 10891 distinct states, run finished after 73 ms. (steps per millisecond=897 ) properties seen :1
FORMULA HealthRecord-PT-11-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-24 03:15:02] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:15:02] [INFO ] Flatten gal took : 6 ms
Total runtime 157046 ms.

BK_STOP 1716520502442

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

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