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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Apr 12 20:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 20:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 20:05 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 71K 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-13-CTLFireability-2024-00
FORMULA_NAME HealthRecord-PT-13-CTLFireability-2024-01
FORMULA_NAME HealthRecord-PT-13-CTLFireability-2024-02
FORMULA_NAME HealthRecord-PT-13-CTLFireability-2024-03
FORMULA_NAME HealthRecord-PT-13-CTLFireability-2024-04
FORMULA_NAME HealthRecord-PT-13-CTLFireability-2024-05
FORMULA_NAME HealthRecord-PT-13-CTLFireability-2024-06
FORMULA_NAME HealthRecord-PT-13-CTLFireability-2024-07
FORMULA_NAME HealthRecord-PT-13-CTLFireability-2024-08
FORMULA_NAME HealthRecord-PT-13-CTLFireability-2024-09
FORMULA_NAME HealthRecord-PT-13-CTLFireability-2024-10
FORMULA_NAME HealthRecord-PT-13-CTLFireability-2024-11
FORMULA_NAME HealthRecord-PT-13-CTLFireability-2023-12
FORMULA_NAME HealthRecord-PT-13-CTLFireability-2023-13
FORMULA_NAME HealthRecord-PT-13-CTLFireability-2023-14
FORMULA_NAME HealthRecord-PT-13-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716520731183

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-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-24 03:18:52] [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:18:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:18:52] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-05-24 03:18:52] [INFO ] Transformed 161 places.
[2024-05-24 03:18:52] [INFO ] Transformed 341 transitions.
[2024-05-24 03:18:52] [INFO ] Found NUPN structural information;
[2024-05-24 03:18:52] [INFO ] Parsed PT model containing 161 places and 341 transitions and 899 arcs in 177 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Support contains 71 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 313/313 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 109 transition count 215
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 109 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 105 place count 108 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 106 place count 108 transition count 213
Applied a total of 106 rules in 29 ms. Remains 108 /161 variables (removed 53) and now considering 213/313 (removed 100) transitions.
[2024-05-24 03:18:52] [INFO ] Flow matrix only has 207 transitions (discarded 6 similar events)
// Phase 1: matrix 207 rows 108 cols
[2024-05-24 03:18:52] [INFO ] Computed 12 invariants in 14 ms
[2024-05-24 03:18:52] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-24 03:18:52] [INFO ] Flow matrix only has 207 transitions (discarded 6 similar events)
[2024-05-24 03:18:52] [INFO ] Invariant cache hit.
[2024-05-24 03:18:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:18:52] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2024-05-24 03:18:52] [INFO ] Flow matrix only has 207 transitions (discarded 6 similar events)
[2024-05-24 03:18:52] [INFO ] Invariant cache hit.
[2024-05-24 03:18:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-24 03:18:54] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 11 ms to minimize.
[2024-05-24 03:18:54] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:18:54] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:18:54] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:18:54] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:18:54] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:18:54] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:18:54] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:18:54] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:18:54] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:18:54] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:18:54] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-24 03:18:54] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:18:54] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:18:54] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:18:55] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:18:55] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:18:55] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-24 03:18:55] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:18:55] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-24 03:18:56] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-24 03:18:56] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:18:56] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:18:56] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:18:56] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:18:56] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:18:56] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:18:56] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:18:56] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:18:56] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:18:56] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2024-05-24 03:18:56] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:18:57] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-05-24 03:18:57] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 2 ms to minimize.
[2024-05-24 03:18:57] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 4 ms to minimize.
[2024-05-24 03:18:57] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:18:57] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:18:57] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:18:57] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:18:57] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:18:57] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-24 03:18:57] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:18:57] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:18:57] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:18:57] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:18:57] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:18:57] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:18:57] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:18:58] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-24 03:18:58] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:18:58] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-24 03:18:59] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-24 03:18:59] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-24 03:18:59] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:18:59] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-24 03:19:00] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:19:00] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 7 ms to minimize.
[2024-05-24 03:19:00] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:19:00] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-24 03:19:01] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/108 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-24 03:19:01] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
[2024-05-24 03:19:01] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:19:02] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 0 ms to minimize.
[2024-05-24 03:19:02] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 2 ms to minimize.
[2024-05-24 03:19:02] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:19:02] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:19:02] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:19:02] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:19:02] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:19:02] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:19:02] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:19:02] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:19:02] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/108 variables, 13/85 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-24 03:19:03] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:19:03] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/108 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-24 03:19:04] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:19:04] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/108 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-24 03:19:04] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/108 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-24 03:19:05] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 0 ms to minimize.
[2024-05-24 03:19:05] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:19:05] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/108 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-24 03:19:06] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:19:06] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:19:06] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:19:06] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:19:06] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:19:06] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:19:06] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:19:06] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/108 variables, 8/101 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/108 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 18 (OVERLAPS) 206/314 variables, 108/209 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/314 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 20 (OVERLAPS) 1/315 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/315 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 22 (OVERLAPS) 0/315 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 210 constraints, problems are : Problem set: 0 solved, 212 unsolved in 19691 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 89/89 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 89/101 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-24 03:19:13] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:19:13] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:19:13] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:19:13] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:19:13] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:19:13] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:19:13] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:19:13] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:19:13] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:19:13] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:19:14] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:19:14] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:19:14] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:19:14] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:19:14] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:19:14] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:19:14] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 0 ms to minimize.
[2024-05-24 03:19:14] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 18/119 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-24 03:19:14] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:19:15] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-24 03:19:15] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-24 03:19:16] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:19:16] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (OVERLAPS) 206/314 variables, 108/232 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 212/444 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-24 03:19:18] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:19:18] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:19:18] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:19:19] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 4/448 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 13 (OVERLAPS) 1/315 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/315 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 15 (OVERLAPS) 0/315 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 449 constraints, problems are : Problem set: 0 solved, 212 unsolved in 25369 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 116/116 constraints]
After SMT, in 45211ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 45232ms
Starting structural reductions in LTL mode, iteration 1 : 108/161 places, 213/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45617 ms. Remains : 108/161 places, 213/313 transitions.
Support contains 71 out of 108 places after structural reductions.
[2024-05-24 03:19:38] [INFO ] Flatten gal took : 39 ms
[2024-05-24 03:19:38] [INFO ] Flatten gal took : 16 ms
[2024-05-24 03:19:38] [INFO ] Input system was already deterministic with 213 transitions.
RANDOM walk for 40000 steps (3120 resets) in 1603 ms. (24 steps per ms) remains 33/60 properties
BEST_FIRST walk for 4004 steps (44 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (39 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (44 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (39 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (40 resets) in 29 ms. (133 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (43 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (43 resets) in 45 ms. (87 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (43 resets) in 28 ms. (138 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (43 resets) in 30 ms. (129 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (60 resets) in 21 ms. (182 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (23 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (42 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (39 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (47 resets) in 10 ms. (363 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (44 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (40 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (37 resets) in 27 ms. (142 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (44 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (42 resets) in 10 ms. (363 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (43 resets) in 8 ms. (444 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (43 resets) in 9 ms. (400 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (42 resets) in 8 ms. (444 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (40 resets) in 9 ms. (400 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (40 resets) in 8 ms. (444 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (41 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (42 resets) in 10 ms. (364 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (41 resets) in 8 ms. (444 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (43 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (40 resets) in 8 ms. (444 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (60 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (39 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (43 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (42 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
[2024-05-24 03:19:39] [INFO ] Flow matrix only has 207 transitions (discarded 6 similar events)
[2024-05-24 03:19:39] [INFO ] Invariant cache hit.
[2024-05-24 03:19:39] [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, 33 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp31 is UNSAT
At refinement iteration 1 (OVERLAPS) 35/79 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 29/108 variables, 8/12 constraints. Problems are: Problem set: 2 solved, 31 unsolved
[2024-05-24 03:19:39] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:19:39] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:19:39] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:19:39] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:19:39] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:19:39] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 2 ms to minimize.
[2024-05-24 03:19:39] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:19:39] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:19:39] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:19:39] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:19:39] [INFO ] Deduced a trap composed of 33 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 11/23 constraints. Problems are: Problem set: 2 solved, 31 unsolved
[2024-05-24 03:19:39] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:19:39] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:19:40] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:19:40] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:19:40] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:19:40] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:19:40] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:19:40] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:19:40] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:19:40] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 10/33 constraints. Problems are: Problem set: 2 solved, 31 unsolved
[2024-05-24 03:19:40] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:19:40] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:19:40] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-24 03:19:40] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 4/37 constraints. Problems are: Problem set: 2 solved, 31 unsolved
[2024-05-24 03:19:40] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:19:40] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:19:40] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:19:40] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:19:40] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:19:40] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 6/43 constraints. Problems are: Problem set: 2 solved, 31 unsolved
[2024-05-24 03:19:40] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:19:40] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-05-24 03:19:41] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 3/46 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 0/46 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 206/314 variables, 108/154 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 0/154 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 12 (OVERLAPS) 1/315 variables, 1/155 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/315 variables, 0/155 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 14 (OVERLAPS) 0/315 variables, 0/155 constraints. Problems are: Problem set: 2 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 155 constraints, problems are : Problem set: 2 solved, 31 unsolved in 2580 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 2 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 38/79 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 7/11 constraints. Problems are: Problem set: 2 solved, 31 unsolved
[2024-05-24 03:19:41] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:19:41] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 2/13 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 29/108 variables, 8/21 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 27/48 constraints. Problems are: Problem set: 2 solved, 31 unsolved
[2024-05-24 03:19:42] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:19:42] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-05-24 03:19:42] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:19:42] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:19:42] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:19:42] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 6/54 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/54 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 9 (OVERLAPS) 206/314 variables, 108/162 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 31/193 constraints. Problems are: Problem set: 2 solved, 31 unsolved
[2024-05-24 03:19:42] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:19:42] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:19:42] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 3/196 constraints. Problems are: Problem set: 2 solved, 31 unsolved
[2024-05-24 03:19:43] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 1/197 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 0/197 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 14 (OVERLAPS) 1/315 variables, 1/198 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/315 variables, 0/198 constraints. Problems are: Problem set: 2 solved, 31 unsolved
[2024-05-24 03:19:44] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/315 variables, 1/199 constraints. Problems are: Problem set: 2 solved, 31 unsolved
[2024-05-24 03:19:44] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/315 variables, 1/200 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/315 variables, 0/200 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 19 (OVERLAPS) 0/315 variables, 0/200 constraints. Problems are: Problem set: 2 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 200 constraints, problems are : Problem set: 2 solved, 31 unsolved in 4230 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/33 constraints, Known Traps: 48/48 constraints]
After SMT, in 6828ms problems are : Problem set: 2 solved, 31 unsolved
Fused 31 Parikh solutions to 25 different solutions.
Parikh walk visited 28 properties in 2824 ms.
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 213/213 transitions.
Graph (trivial) has 141 edges and 108 vertex of which 6 / 108 are part of one of the 3 SCC in 3 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 458 edges and 105 vertex of which 102 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 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 102 transition count 198
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 100 transition count 197
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 100 transition count 196
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 99 transition count 196
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 53 place count 55 transition count 108
Iterating global reduction 2 with 44 rules applied. Total rules applied 97 place count 55 transition count 108
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 104 place count 48 transition count 92
Iterating global reduction 2 with 7 rules applied. Total rules applied 111 place count 48 transition count 92
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 120 place count 48 transition count 83
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 123 place count 45 transition count 76
Iterating global reduction 3 with 3 rules applied. Total rules applied 126 place count 45 transition count 76
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 132 place count 45 transition count 70
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 133 place count 44 transition count 68
Iterating global reduction 4 with 1 rules applied. Total rules applied 134 place count 44 transition count 68
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 137 place count 44 transition count 65
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 149 place count 38 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 150 place count 38 transition count 97
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 153 place count 38 transition count 94
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 156 place count 35 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 158 place count 35 transition count 92
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 160 place count 35 transition count 168
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 163 place count 33 transition count 167
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 166 place count 33 transition count 164
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 167 place count 32 transition count 123
Iterating global reduction 7 with 1 rules applied. Total rules applied 168 place count 32 transition count 123
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 169 place count 31 transition count 121
Iterating global reduction 7 with 1 rules applied. Total rules applied 170 place count 31 transition count 121
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 180 place count 31 transition count 111
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 187 place count 31 transition count 111
Applied a total of 187 rules in 90 ms. Remains 31 /108 variables (removed 77) and now considering 111/213 (removed 102) transitions.
Running 95 sub problems to find dead transitions.
[2024-05-24 03:19:48] [INFO ] Flow matrix only has 87 transitions (discarded 24 similar events)
// Phase 1: matrix 87 rows 31 cols
[2024-05-24 03:19:48] [INFO ] Computed 9 invariants in 6 ms
[2024-05-24 03:19:48] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 2/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 95 unsolved
Problem TDEAD33 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
At refinement iteration 4 (OVERLAPS) 87/118 variables, 31/40 constraints. Problems are: Problem set: 8 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 19/59 constraints. Problems are: Problem set: 8 solved, 87 unsolved
[2024-05-24 03:19:49] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:19:49] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD34 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 2/61 constraints. Problems are: Problem set: 11 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/61 constraints. Problems are: Problem set: 11 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/118 variables, 0/61 constraints. Problems are: Problem set: 11 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 61 constraints, problems are : Problem set: 11 solved, 84 unsolved in 1091 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 31/31 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 11 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 2/30 variables, 1/1 constraints. Problems are: Problem set: 11 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 2/3 constraints. Problems are: Problem set: 11 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 11 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 1/31 variables, 8/11 constraints. Problems are: Problem set: 11 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 11 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 87/118 variables, 31/42 constraints. Problems are: Problem set: 11 solved, 84 unsolved
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 19/61 constraints. Problems are: Problem set: 13 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 82/143 constraints. Problems are: Problem set: 13 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/143 constraints. Problems are: Problem set: 13 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/118 variables, 0/143 constraints. Problems are: Problem set: 13 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 143 constraints, problems are : Problem set: 13 solved, 82 unsolved in 1763 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 31/31 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 82/95 constraints, Known Traps: 2/2 constraints]
After SMT, in 2968ms problems are : Problem set: 13 solved, 82 unsolved
Search for dead transitions found 13 dead transitions in 2969ms
Found 13 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 13 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 13 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 31/108 places, 98/213 transitions.
Graph (complete) has 111 edges and 31 vertex of which 30 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 30 /31 variables (removed 1) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3070 ms. Remains : 30/108 places, 98/213 transitions.
RANDOM walk for 40000 steps (56 resets) in 788 ms. (50 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (38 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (45 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (48 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 512 steps, run visited all 3 properties in 10 ms. (steps per millisecond=51 )
Probabilistic random walk after 512 steps, saw 229 distinct states, run finished after 13 ms. (steps per millisecond=39 ) properties seen :3
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-24 03:19:52] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:19:52] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:19:52] [INFO ] Input system was already deterministic with 213 transitions.
Computed a total of 8 stabilizing places and 12 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 213/213 transitions.
Graph (trivial) has 145 edges and 108 vertex of which 8 / 108 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 48 place count 56 transition count 117
Iterating global reduction 0 with 47 rules applied. Total rules applied 95 place count 56 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 96 place count 56 transition count 116
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 102 place count 50 transition count 103
Iterating global reduction 1 with 6 rules applied. Total rules applied 108 place count 50 transition count 103
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 117 place count 50 transition count 94
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 119 place count 48 transition count 89
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 48 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 124 place count 48 transition count 86
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 47 transition count 84
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 47 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 129 place count 47 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 130 place count 47 transition count 80
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 4 with 2 rules applied. Total rules applied 132 place count 46 transition count 79
Applied a total of 132 rules in 19 ms. Remains 46 /108 variables (removed 62) and now considering 79/213 (removed 134) transitions.
[2024-05-24 03:19:52] [INFO ] Flow matrix only has 73 transitions (discarded 6 similar events)
// Phase 1: matrix 73 rows 46 cols
[2024-05-24 03:19:52] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:19:52] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 03:19:52] [INFO ] Flow matrix only has 73 transitions (discarded 6 similar events)
[2024-05-24 03:19:52] [INFO ] Invariant cache hit.
[2024-05-24 03:19:52] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-24 03:19:52] [INFO ] Redundant transitions in 14 ms returned []
Running 65 sub problems to find dead transitions.
[2024-05-24 03:19:52] [INFO ] Flow matrix only has 73 transitions (discarded 6 similar events)
[2024-05-24 03:19:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 7/46 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-24 03:19:52] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:19:52] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 72/118 variables, 46/57 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/118 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/119 variables, and 57 constraints, problems are : Problem set: 0 solved, 65 unsolved in 853 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 7/46 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-24 03:19:53] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 72/118 variables, 46/58 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 65/123 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-24 03:19:53] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-24 03:19:53] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-24 03:19:53] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/118 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/119 variables, and 126 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1347 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 6/6 constraints]
After SMT, in 2222ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 2223ms
Starting structural reductions in SI_CTL mode, iteration 1 : 46/108 places, 79/213 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2346 ms. Remains : 46/108 places, 79/213 transitions.
[2024-05-24 03:19:54] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:19:54] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:19:54] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-24 03:19:54] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:19:54] [INFO ] Flatten gal took : 13 ms
RANDOM walk for 40000 steps (4041 resets) in 205 ms. (194 steps per ms) remains 1/1 properties
[2024-05-24 03:19:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9260556270974278870.gal : 2 ms
BEST_FIRST walk for 40003 steps (513 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
[2024-05-24 03:19:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8557347144626950028.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/ReachabilityCardinality9260556270974278870.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8557347144626950028.prop' '--nowitness' '--gen-order' 'FOLLOW'

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/ReachabilityCardinality8557347144626950028.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 16
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :16 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 2804
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2804 after 3618
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3618 after 14958
Reachability property HealthRecord-PT-13-CTLFireability-2024-00 is true.
FORMULA HealthRecord-PT-13-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,51300,0.06567,5932,2,893,13,10636,6,0,253,7569,0
Total reachable state count : 51300

Verifying 1 reachability properties.
Reachability property HealthRecord-PT-13-CTLFireability-2024-00 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
HealthRecord-PT-13-CTLFireability-2024-00,1,0.066616,5932,2,47,13,10636,7,0,256,7569,0
ITS tools runner thread asked to quit. Dying gracefully.
Finished probabilistic random walk after 643948 steps, run visited all 1 properties in 514 ms. (steps per millisecond=1252 )
Probabilistic random walk after 643948 steps, saw 81994 distinct states, run finished after 514 ms. (steps per millisecond=1252 ) properties seen :1
Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 213/213 transitions.
Graph (trivial) has 125 edges and 108 vertex of which 8 / 108 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 49 place count 55 transition count 115
Iterating global reduction 0 with 48 rules applied. Total rules applied 97 place count 55 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 98 place count 55 transition count 114
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 105 place count 48 transition count 98
Iterating global reduction 1 with 7 rules applied. Total rules applied 112 place count 48 transition count 98
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 121 place count 48 transition count 89
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 124 place count 45 transition count 82
Iterating global reduction 2 with 3 rules applied. Total rules applied 127 place count 45 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 133 place count 45 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 134 place count 44 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 135 place count 44 transition count 74
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 138 place count 44 transition count 71
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 44 transition count 70
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 4 with 2 rules applied. Total rules applied 141 place count 43 transition count 69
Applied a total of 141 rules in 21 ms. Remains 43 /108 variables (removed 65) and now considering 69/213 (removed 144) transitions.
[2024-05-24 03:19:55] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
// Phase 1: matrix 63 rows 43 cols
[2024-05-24 03:19:55] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:19:55] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-24 03:19:55] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
[2024-05-24 03:19:55] [INFO ] Invariant cache hit.
[2024-05-24 03:19:55] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-24 03:19:55] [INFO ] Redundant transitions in 11 ms returned []
Running 55 sub problems to find dead transitions.
[2024-05-24 03:19:55] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
[2024-05-24 03:19:55] [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:19:55] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:19:55] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:19:55] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-24 03:19:55] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-24 03:19:55] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:19:55] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 62/105 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/105 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/106 variables, and 58 constraints, problems are : Problem set: 0 solved, 55 unsolved in 778 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 6/6 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, 6/15 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 62/105 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 55/113 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 0/105 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/106 variables, and 113 constraints, problems are : Problem set: 0 solved, 55 unsolved in 749 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 6/6 constraints]
After SMT, in 1547ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 1548ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/108 places, 69/213 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1662 ms. Remains : 43/108 places, 69/213 transitions.
[2024-05-24 03:19:57] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:19:57] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:19:57] [INFO ] Input system was already deterministic with 69 transitions.
RANDOM walk for 8940 steps (908 resets) in 16 ms. (525 steps per ms) remains 0/1 properties
FORMULA HealthRecord-PT-13-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-24 03:19:57] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:19:57] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:19:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3150549029169210002.gal : 1 ms
[2024-05-24 03:19:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6246490442593839920.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/ReachabilityCardinality3150549029169210002.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6246490442593839920.prop' '--nowitness' '--gen-order' 'FOLLOW'

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
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 213/213 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 60 transition count 120
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 60 transition count 120
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 103 place count 53 transition count 104
Iterating global reduction 0 with 7 rules applied. Total rules applied 110 place count 53 transition count 104
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 119 place count 53 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 122 place count 50 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 125 place count 50 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 131 place count 50 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 132 place count 49 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 49 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 136 place count 49 transition count 77
Applied a total of 136 rules in 5 ms. Remains 49 /108 variables (removed 59) and now considering 77/213 (removed 136) transitions.
[2024-05-24 03:19:57] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
// Phase 1: matrix 74 rows 49 cols
[2024-05-24 03:19:57] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:19:57] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 03:19:57] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
[2024-05-24 03:19:57] [INFO ] Invariant cache hit.
[2024-05-24 03:19:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:19:57] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-05-24 03:19:57] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
[2024-05-24 03:19:57] [INFO ] Invariant cache hit.
[2024-05-24 03:19:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-24 03:19:57] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:19:57] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 73/122 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 1/123 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/123 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 61 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1249 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-24 03:19:58] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-24 03:19:58] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-24 03:19:58] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 73/122 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 76/139 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 1/123 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (OVERLAPS) 0/123 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 140 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2226 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 5/5 constraints]
After SMT, in 3499ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 3500ms
Starting structural reductions in LTL mode, iteration 1 : 49/108 places, 77/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3605 ms. Remains : 49/108 places, 77/213 transitions.
[2024-05-24 03:20:00] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:20:00] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:20:00] [INFO ] Input system was already deterministic with 77 transitions.
[2024-05-24 03:20:00] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:20:00] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:20:00] [INFO ] Time to serialize gal into /tmp/CTLFireability11125023157513914206.gal : 1 ms
[2024-05-24 03:20:00] [INFO ] Time to serialize properties into /tmp/CTLFireability4740092838103393908.ctl : 5 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/CTLFireability11125023157513914206.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4740092838103393908.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,484794,0.067138,6240,2,1046,5,13131,6,0,269,11353,0


Converting to forward existential form...Done !
original formula: EG(AX(EF(EG(((p17==0)||(p158==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E(TRUE U EG(((p17==0)||(p158==0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t15, t17, t19, Intersection with reachab...227
(forward)formula 0,1,1.8672,71624,1,0,286,416566,179,141,2061,384580,346
FORMULA HealthRecord-PT-13-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 213/213 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 67 transition count 133
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 67 transition count 133
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 88 place count 61 transition count 120
Iterating global reduction 0 with 6 rules applied. Total rules applied 94 place count 61 transition count 120
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 103 place count 61 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 60 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 60 transition count 108
Applied a total of 105 rules in 5 ms. Remains 60 /108 variables (removed 48) and now considering 108/213 (removed 105) transitions.
[2024-05-24 03:20:02] [INFO ] Flow matrix only has 104 transitions (discarded 4 similar events)
// Phase 1: matrix 104 rows 60 cols
[2024-05-24 03:20:02] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:20:02] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 03:20:02] [INFO ] Flow matrix only has 104 transitions (discarded 4 similar events)
[2024-05-24 03:20:02] [INFO ] Invariant cache hit.
[2024-05-24 03:20:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:20:02] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2024-05-24 03:20:02] [INFO ] Flow matrix only has 104 transitions (discarded 4 similar events)
[2024-05-24 03:20:02] [INFO ] Invariant cache hit.
[2024-05-24 03:20:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-24 03:20:03] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:20:03] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-24 03:20:03] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:20:03] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 103/163 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 1/164 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 0/164 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 75 constraints, problems are : Problem set: 0 solved, 107 unsolved in 2284 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 103/163 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 107/181 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 1/164 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 0/164 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 182 constraints, problems are : Problem set: 0 solved, 107 unsolved in 3066 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 4/4 constraints]
After SMT, in 5381ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 5385ms
Starting structural reductions in LTL mode, iteration 1 : 60/108 places, 108/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5481 ms. Remains : 60/108 places, 108/213 transitions.
[2024-05-24 03:20:08] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:20:08] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:20:08] [INFO ] Input system was already deterministic with 108 transitions.
[2024-05-24 03:20:08] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:20:08] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:20:08] [INFO ] Time to serialize gal into /tmp/CTLFireability1319521049357197743.gal : 2 ms
[2024-05-24 03:20:08] [INFO ] Time to serialize properties into /tmp/CTLFireability2886676249161823204.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/CTLFireability1319521049357197743.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2886676249161823204.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(!(E(((p25==1) + A((((p28==1)&&(p115==1))&&(p130==1)) U ((p51==1)&&(p79==1)))) U (AX(EX((p15==1))) * E(A((p58==1) U (p86==1)) U !(((p11...178
=> equivalent forward existential formula: [(FwdU((FwdU(FwdU(Init,TRUE),((p25==1) + !((E(!(((p51==1)&&(p79==1))) U (!((((p28==1)&&(p115==1))&&(p130==1))) *...348
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...358
(forward)formula 0,0,7.82157,254480,1,0,472,1.53944e+06,260,249,2558,1.45794e+06,596
FORMULA HealthRecord-PT-13-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 213/213 transitions.
Graph (trivial) has 146 edges and 108 vertex of which 8 / 108 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 48 place count 56 transition count 116
Iterating global reduction 0 with 47 rules applied. Total rules applied 95 place count 56 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 96 place count 56 transition count 115
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 103 place count 49 transition count 99
Iterating global reduction 1 with 7 rules applied. Total rules applied 110 place count 49 transition count 99
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 119 place count 49 transition count 90
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 122 place count 46 transition count 83
Iterating global reduction 2 with 3 rules applied. Total rules applied 125 place count 46 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 131 place count 46 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 132 place count 45 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 45 transition count 75
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 136 place count 45 transition count 72
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 45 transition count 71
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 4 with 2 rules applied. Total rules applied 139 place count 44 transition count 70
Applied a total of 139 rules in 22 ms. Remains 44 /108 variables (removed 64) and now considering 70/213 (removed 143) transitions.
[2024-05-24 03:20:15] [INFO ] Flow matrix only has 63 transitions (discarded 7 similar events)
// Phase 1: matrix 63 rows 44 cols
[2024-05-24 03:20:15] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:20:16] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-24 03:20:16] [INFO ] Flow matrix only has 63 transitions (discarded 7 similar events)
[2024-05-24 03:20:16] [INFO ] Invariant cache hit.
[2024-05-24 03:20:16] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-24 03:20:16] [INFO ] Redundant transitions in 10 ms returned []
Running 56 sub problems to find dead transitions.
[2024-05-24 03:20:16] [INFO ] Flow matrix only has 63 transitions (discarded 7 similar events)
[2024-05-24 03:20:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 2/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-24 03:20:16] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:20:16] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-24 03:20:16] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-24 03:20:16] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:20:16] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 5/44 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 62/106 variables, 44/59 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 10 (OVERLAPS) 0/106 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/107 variables, and 59 constraints, problems are : Problem set: 0 solved, 56 unsolved in 957 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 2/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 5/44 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 62/106 variables, 44/59 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 56/115 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 10 (OVERLAPS) 0/106 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/107 variables, and 115 constraints, problems are : Problem set: 0 solved, 56 unsolved in 841 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 5/5 constraints]
After SMT, in 1816ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 1817ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/108 places, 70/213 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1941 ms. Remains : 44/108 places, 70/213 transitions.
[2024-05-24 03:20:17] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:20:17] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:20:17] [INFO ] Input system was already deterministic with 70 transitions.
[2024-05-24 03:20:17] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:20:17] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:20:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13472797463374437710.gal : 4 ms
[2024-05-24 03:20:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5146261294116829930.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/ReachabilityCardinality13472797463374437710.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5146261294116829930.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (4080 resets) in 125 ms. (317 steps per ms) remains 1/1 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5146261294116829930.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 14
SDD proceeding with computation,1 properties remain. new max is 16
BEST_FIRST walk for 40003 steps (529 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
SDD size :14 after 20
SDD proceeding with computation,1 properties remain. new max is 32
Finished probabilistic random walk after 1702 steps, run visited all 1 properties in 5 ms. (steps per millisecond=340 )
SDD size :20 after 22
Probabilistic random walk after 1702 steps, saw 643 distinct states, run finished after 5 ms. (steps per millisecond=340 ) properties seen :1
FORMULA HealthRecord-PT-13-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 213/213 transitions.
Graph (trivial) has 131 edges and 108 vertex of which 8 / 108 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 48 place count 56 transition count 117
Iterating global reduction 0 with 47 rules applied. Total rules applied 95 place count 56 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 96 place count 56 transition count 116
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 102 place count 50 transition count 103
Iterating global reduction 1 with 6 rules applied. Total rules applied 108 place count 50 transition count 103
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 117 place count 50 transition count 94
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 119 place count 48 transition count 89
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 48 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 124 place count 48 transition count 86
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 47 transition count 84
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 47 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 129 place count 47 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 130 place count 47 transition count 80
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 4 with 2 rules applied. Total rules applied 132 place count 46 transition count 79
Applied a total of 132 rules in 16 ms. Remains 46 /108 variables (removed 62) and now considering 79/213 (removed 134) transitions.
[2024-05-24 03:20:18] [INFO ] Flow matrix only has 73 transitions (discarded 6 similar events)
// Phase 1: matrix 73 rows 46 cols
[2024-05-24 03:20:18] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:20:18] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 03:20:18] [INFO ] Flow matrix only has 73 transitions (discarded 6 similar events)
[2024-05-24 03:20:18] [INFO ] Invariant cache hit.
[2024-05-24 03:20:18] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-24 03:20:18] [INFO ] Redundant transitions in 13 ms returned []
Running 65 sub problems to find dead transitions.
[2024-05-24 03:20:18] [INFO ] Flow matrix only has 73 transitions (discarded 6 similar events)
[2024-05-24 03:20:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 7/46 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-24 03:20:18] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-24 03:20:18] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 72/118 variables, 46/57 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/118 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/119 variables, and 57 constraints, problems are : Problem set: 0 solved, 65 unsolved in 790 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 7/46 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-24 03:20:19] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 72/118 variables, 46/58 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 65/123 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-24 03:20:19] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:20:19] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-24 03:20:19] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/118 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/119 variables, and 126 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1347 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 6/6 constraints]
After SMT, in 2160ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 2161ms
Starting structural reductions in SI_CTL mode, iteration 1 : 46/108 places, 79/213 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2269 ms. Remains : 46/108 places, 79/213 transitions.
[2024-05-24 03:20:20] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:20:20] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:20:20] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-24 03:20:20] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:20:20] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:20:20] [INFO ] Time to serialize gal into /tmp/CTLFireability2154312288444849199.gal : 1 ms
[2024-05-24 03:20:20] [INFO ] Time to serialize properties into /tmp/CTLFireability2699947727410570107.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/CTLFireability2154312288444849199.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2699947727410570107.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,436918,0.095778,7892,2,1271,5,19953,6,0,253,16853,0


Converting to forward existential form...Done !
original formula: AG((AF((p7==0)) + ((p88==1)&&(p158==1))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(((p88==1)&&(p158==1)))),!((p7==0)))] = FALSE
Hit Full ! (commute/partial/dont) 76/0/3
(forward)formula 0,0,0.25637,12908,1,0,11,52951,22,5,1404,27039,9
FORMULA HealthRecord-PT-13-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 213/213 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 64 transition count 128
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 64 transition count 128
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 94 place count 58 transition count 115
Iterating global reduction 0 with 6 rules applied. Total rules applied 100 place count 58 transition count 115
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 109 place count 58 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 57 transition count 103
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 57 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 56 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 56 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 115 place count 56 transition count 99
Applied a total of 115 rules in 3 ms. Remains 56 /108 variables (removed 52) and now considering 99/213 (removed 114) transitions.
[2024-05-24 03:20:20] [INFO ] Flow matrix only has 96 transitions (discarded 3 similar events)
// Phase 1: matrix 96 rows 56 cols
[2024-05-24 03:20:20] [INFO ] Computed 9 invariants in 4 ms
[2024-05-24 03:20:20] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 03:20:20] [INFO ] Flow matrix only has 96 transitions (discarded 3 similar events)
[2024-05-24 03:20:20] [INFO ] Invariant cache hit.
[2024-05-24 03:20:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:20:20] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-05-24 03:20:20] [INFO ] Flow matrix only has 96 transitions (discarded 3 similar events)
[2024-05-24 03:20:20] [INFO ] Invariant cache hit.
[2024-05-24 03:20:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-24 03:20:20] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:20:21] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:20:21] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-24 03:20:21] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:20:21] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:20:21] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 95/151 variables, 56/71 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 1/152 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/152 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 72 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2244 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-05-24 03:20:23] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:20:23] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 95/151 variables, 56/73 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 98/171 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 1/152 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/152 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 172 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2857 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 8/8 constraints]
After SMT, in 5126ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 5128ms
Starting structural reductions in LTL mode, iteration 1 : 56/108 places, 99/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5209 ms. Remains : 56/108 places, 99/213 transitions.
[2024-05-24 03:20:25] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:20:25] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:20:25] [INFO ] Input system was already deterministic with 99 transitions.
[2024-05-24 03:20:25] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:20:25] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:20:25] [INFO ] Time to serialize gal into /tmp/CTLFireability18224920261264938010.gal : 1 ms
[2024-05-24 03:20:25] [INFO ] Time to serialize properties into /tmp/CTLFireability6613259136774403745.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/CTLFireability18224920261264938010.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6613259136774403745.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.26385e+06,0.206979,12532,2,1871,5,39561,6,0,319,38554,0


Converting to forward existential form...Done !
original formula: (AF((p48==1)) + E(((p101==1) + AX(!(EF((((((p18==1)&&(p37==1))&&((p56==1)&&(p61==1)))&&(((p68==1)&&(p75==1))&&((p82==1)&&(p89==1))))&&((p...224
=> equivalent forward existential formula: [FwdG((Init * !(E(((p101==1) + !(EX(!(!(E(TRUE U (((((p18==1)&&(p37==1))&&((p56==1)&&(p61==1)))&&(((p68==1)&&(p7...341
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t21, t23, t...307
Hit Full ! (commute/partial/dont) 96/0/3
(forward)formula 0,0,8.32601,271096,1,0,490,1.56765e+06,240,254,2490,1.62426e+06,544
FORMULA HealthRecord-PT-13-CTLFireability-2024-06 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 : 108/108 places, 213/213 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 68 transition count 136
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 68 transition count 136
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 64 transition count 128
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 64 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 91 place count 64 transition count 125
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 63 transition count 122
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 63 transition count 122
Applied a total of 93 rules in 2 ms. Remains 63 /108 variables (removed 45) and now considering 122/213 (removed 91) transitions.
[2024-05-24 03:20:34] [INFO ] Flow matrix only has 119 transitions (discarded 3 similar events)
// Phase 1: matrix 119 rows 63 cols
[2024-05-24 03:20:34] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:20:34] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-24 03:20:34] [INFO ] Flow matrix only has 119 transitions (discarded 3 similar events)
[2024-05-24 03:20:34] [INFO ] Invariant cache hit.
[2024-05-24 03:20:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:20:34] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-24 03:20:34] [INFO ] Flow matrix only has 119 transitions (discarded 3 similar events)
[2024-05-24 03:20:34] [INFO ] Invariant cache hit.
[2024-05-24 03:20:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-24 03:20:34] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:20:34] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:20:34] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 118/181 variables, 63/75 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-24 03:20:35] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:20:35] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 1/182 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 0/182 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 78 constraints, problems are : Problem set: 0 solved, 121 unsolved in 3155 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-24 03:20:37] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:20:37] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:20:37] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 118/181 variables, 63/80 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 121/201 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 1/182 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-24 03:20:41] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/182 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (OVERLAPS) 0/182 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 203 constraints, problems are : Problem set: 0 solved, 121 unsolved in 6315 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 9/9 constraints]
After SMT, in 9513ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 9516ms
Starting structural reductions in LTL mode, iteration 1 : 63/108 places, 122/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9620 ms. Remains : 63/108 places, 122/213 transitions.
[2024-05-24 03:20:43] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:20:43] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:20:43] [INFO ] Input system was already deterministic with 122 transitions.
[2024-05-24 03:20:43] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:20:43] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:20:43] [INFO ] Time to serialize gal into /tmp/CTLFireability13694163576437963051.gal : 1 ms
[2024-05-24 03:20:43] [INFO ] Time to serialize properties into /tmp/CTLFireability15674265602271185256.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/CTLFireability13694163576437963051.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15674265602271185256.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.59069e+06,0.526986,23280,2,6824,5,79204,6,0,370,92478,0


Converting to forward existential form...Done !
original formula: EF((((EF(AG(AX((p38==1)))) + A((p132==1) U EF((p34==1)))) + (EX((AF((p26==1)) + A((p103==1) U (((p17==1)&&(p36==1))&&((p55==1)&&(p154==1)...237
=> equivalent forward existential formula: ((([(FwdU(FwdU(Init,TRUE),TRUE) * !(E(TRUE U !(!(EX(!((p38==1))))))))] != FALSE + [((FwdU(Init,TRUE) * !(EG(!(E(...716
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, ...376
(forward)formula 0,1,2.61795,82840,1,0,227,383174,263,91,2923,344460,256
FORMULA HealthRecord-PT-13-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 213/213 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 70 transition count 140
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 70 transition count 140
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 66 transition count 130
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 66 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 87 place count 66 transition count 127
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 89 place count 64 transition count 123
Iterating global reduction 1 with 2 rules applied. Total rules applied 91 place count 64 transition count 123
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 96 place count 64 transition count 118
Applied a total of 96 rules in 7 ms. Remains 64 /108 variables (removed 44) and now considering 118/213 (removed 95) transitions.
[2024-05-24 03:20:46] [INFO ] Flow matrix only has 115 transitions (discarded 3 similar events)
// Phase 1: matrix 115 rows 64 cols
[2024-05-24 03:20:46] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:20:46] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 03:20:46] [INFO ] Flow matrix only has 115 transitions (discarded 3 similar events)
[2024-05-24 03:20:46] [INFO ] Invariant cache hit.
[2024-05-24 03:20:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:20:46] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-05-24 03:20:46] [INFO ] Flow matrix only has 115 transitions (discarded 3 similar events)
[2024-05-24 03:20:46] [INFO ] Invariant cache hit.
[2024-05-24 03:20:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-24 03:20:47] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:20:47] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:20:47] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-24 03:20:47] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:20:47] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:20:47] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-24 03:20:47] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-24 03:20:47] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:20:47] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 114/178 variables, 64/82 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-24 03:20:48] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 1/179 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 0/179 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 84 constraints, problems are : Problem set: 0 solved, 117 unsolved in 3190 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-24 03:20:50] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-24 03:20:50] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-24 03:20:50] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 114/178 variables, 64/86 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 117/203 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 1/179 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/179 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 12 (OVERLAPS) 0/179 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 204 constraints, problems are : Problem set: 0 solved, 117 unsolved in 4719 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 64/64 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 13/13 constraints]
After SMT, in 7948ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 7949ms
Starting structural reductions in LTL mode, iteration 1 : 64/108 places, 118/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8039 ms. Remains : 64/108 places, 118/213 transitions.
[2024-05-24 03:20:54] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:20:54] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:20:54] [INFO ] Input system was already deterministic with 118 transitions.
[2024-05-24 03:20:54] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:20:54] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:20:54] [INFO ] Time to serialize gal into /tmp/CTLFireability12502787340981719403.gal : 1 ms
[2024-05-24 03:20:54] [INFO ] Time to serialize properties into /tmp/CTLFireability2103831313327174260.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/CTLFireability12502787340981719403.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2103831313327174260.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,3.27284e+06,0.478103,21228,2,2770,5,70631,6,0,370,88858,0


Converting to forward existential form...Done !
original formula: AG((AX(A((((p83==1)&&(p87==1))||(((p145==1)&&(p1==1))&&(p158==1))) U (EF((p100==1)) + EG((p57==1))))) * (((AF((p27==0)) + EF(((p88==0)||(...265
=> equivalent forward existential formula: (([(((FwdU(EY(FwdU(Init,TRUE)),!((E(TRUE U (p100==1)) + EG((p57==1))))) * !((((p83==1)&&(p87==1))||(((p145==1)&&...514
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...399
(forward)formula 0,0,2.91861,91080,1,0,319,442620,272,134,2734,464418,353
FORMULA HealthRecord-PT-13-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 213/213 transitions.
Graph (trivial) has 145 edges and 108 vertex of which 8 / 108 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 48 place count 56 transition count 117
Iterating global reduction 0 with 47 rules applied. Total rules applied 95 place count 56 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 96 place count 56 transition count 116
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 103 place count 49 transition count 100
Iterating global reduction 1 with 7 rules applied. Total rules applied 110 place count 49 transition count 100
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 119 place count 49 transition count 91
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 122 place count 46 transition count 84
Iterating global reduction 2 with 3 rules applied. Total rules applied 125 place count 46 transition count 84
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 131 place count 46 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 132 place count 45 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 45 transition count 76
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 136 place count 45 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 45 transition count 72
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 4 with 2 rules applied. Total rules applied 139 place count 44 transition count 71
Applied a total of 139 rules in 15 ms. Remains 44 /108 variables (removed 64) and now considering 71/213 (removed 142) transitions.
[2024-05-24 03:20:57] [INFO ] Flow matrix only has 65 transitions (discarded 6 similar events)
// Phase 1: matrix 65 rows 44 cols
[2024-05-24 03:20:57] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:20:57] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-24 03:20:57] [INFO ] Flow matrix only has 65 transitions (discarded 6 similar events)
[2024-05-24 03:20:57] [INFO ] Invariant cache hit.
[2024-05-24 03:20:57] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-24 03:20:57] [INFO ] Redundant transitions in 11 ms returned []
Running 57 sub problems to find dead transitions.
[2024-05-24 03:20:57] [INFO ] Flow matrix only has 65 transitions (discarded 6 similar events)
[2024-05-24 03:20:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 7/44 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-24 03:20:57] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:20:57] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-24 03:20:57] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-24 03:20:58] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 64/108 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 0/108 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/109 variables, and 57 constraints, problems are : Problem set: 0 solved, 57 unsolved in 847 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 7/44 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 64/108 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 57/114 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 0/108 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/109 variables, and 114 constraints, problems are : Problem set: 0 solved, 57 unsolved in 773 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 4/4 constraints]
After SMT, in 1637ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 1638ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/108 places, 71/213 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1740 ms. Remains : 44/108 places, 71/213 transitions.
[2024-05-24 03:20:59] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:20:59] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:20:59] [INFO ] Input system was already deterministic with 71 transitions.
[2024-05-24 03:20:59] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:20:59] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:20:59] [INFO ] Time to serialize gal into /tmp/CTLFireability1806859640619728698.gal : 3 ms
[2024-05-24 03:20:59] [INFO ] Time to serialize properties into /tmp/CTLFireability15016906599964972838.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/CTLFireability1806859640619728698.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15016906599964972838.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,366934,0.074237,6576,2,1106,5,14020,6,0,237,12169,0


Converting to forward existential form...Done !
original formula: EG(AG(AF((p34==0))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(!(EG(!((p34==0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t28, t29, t30, t31, t51, t52, In...250
(forward)formula 0,0,0.853964,34596,1,0,195,192398,167,85,1754,144331,225
FORMULA HealthRecord-PT-13-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 213/213 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 60 transition count 120
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 60 transition count 120
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 102 place count 54 transition count 107
Iterating global reduction 0 with 6 rules applied. Total rules applied 108 place count 54 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 117 place count 54 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 52 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 52 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 124 place count 52 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 51 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 51 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 129 place count 51 transition count 85
Applied a total of 129 rules in 6 ms. Remains 51 /108 variables (removed 57) and now considering 85/213 (removed 128) transitions.
[2024-05-24 03:21:00] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
// Phase 1: matrix 82 rows 51 cols
[2024-05-24 03:21:00] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:21:00] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 03:21:00] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2024-05-24 03:21:00] [INFO ] Invariant cache hit.
[2024-05-24 03:21:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:21:00] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-05-24 03:21:00] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2024-05-24 03:21:00] [INFO ] Invariant cache hit.
[2024-05-24 03:21:00] [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, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-24 03:21:00] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:21:00] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 81/132 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 1/133 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/133 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 63 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1372 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 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/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-05-24 03:21:01] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:21:01] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-24 03:21:01] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:21:01] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (OVERLAPS) 81/132 variables, 51/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 84/150 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 1/133 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 151 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2235 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 6/6 constraints]
After SMT, in 3628ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 3630ms
Starting structural reductions in LTL mode, iteration 1 : 51/108 places, 85/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3718 ms. Remains : 51/108 places, 85/213 transitions.
[2024-05-24 03:21:03] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:21:03] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:21:03] [INFO ] Input system was already deterministic with 85 transitions.
[2024-05-24 03:21:03] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:21:03] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:21:03] [INFO ] Time to serialize gal into /tmp/CTLFireability222430359071140437.gal : 0 ms
[2024-05-24 03:21:03] [INFO ] Time to serialize properties into /tmp/CTLFireability10899523618176866173.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/CTLFireability222430359071140437.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10899523618176866173.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,576648,0.053746,5584,2,969,5,10103,6,0,285,8212,0


Converting to forward existential form...Done !
original formula: AG(EX((p137==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((p137==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t18, t20, t22, Intersecti...242
(forward)formula 0,0,0.173697,10072,1,0,144,31513,182,67,2018,26059,173
FORMULA HealthRecord-PT-13-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 213/213 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 63 transition count 125
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 63 transition count 125
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 97 place count 56 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 104 place count 56 transition count 109
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 112 place count 56 transition count 101
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 115 place count 53 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 118 place count 53 transition count 94
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 124 place count 53 transition count 88
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 52 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 52 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 129 place count 52 transition count 83
Applied a total of 129 rules in 5 ms. Remains 52 /108 variables (removed 56) and now considering 83/213 (removed 130) transitions.
[2024-05-24 03:21:04] [INFO ] Flow matrix only has 79 transitions (discarded 4 similar events)
// Phase 1: matrix 79 rows 52 cols
[2024-05-24 03:21:04] [INFO ] Computed 10 invariants in 0 ms
[2024-05-24 03:21:04] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 03:21:04] [INFO ] Flow matrix only has 79 transitions (discarded 4 similar events)
[2024-05-24 03:21:04] [INFO ] Invariant cache hit.
[2024-05-24 03:21:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:21:04] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2024-05-24 03:21:04] [INFO ] Flow matrix only has 79 transitions (discarded 4 similar events)
[2024-05-24 03:21:04] [INFO ] Invariant cache hit.
[2024-05-24 03:21:04] [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, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-24 03:21:04] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:21:04] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 78/130 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 1/131 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 0/131 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 65 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1508 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-24 03:21:05] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 78/130 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 82/147 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 1/131 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (OVERLAPS) 0/131 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 148 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2048 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 3/3 constraints]
After SMT, in 3574ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 3575ms
Starting structural reductions in LTL mode, iteration 1 : 52/108 places, 83/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3673 ms. Remains : 52/108 places, 83/213 transitions.
[2024-05-24 03:21:07] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:21:07] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:21:07] [INFO ] Input system was already deterministic with 83 transitions.
[2024-05-24 03:21:07] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:21:07] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:21:07] [INFO ] Time to serialize gal into /tmp/CTLFireability3014924382597367448.gal : 1 ms
[2024-05-24 03:21:07] [INFO ] Time to serialize properties into /tmp/CTLFireability5095790602223182552.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/CTLFireability3014924382597367448.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5095790602223182552.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,599977,0.09157,7152,2,1151,5,16405,6,0,285,14476,0


Converting to forward existential form...Done !
original formula: A(((p91==1) + E(AF(AG((p150==1))) U AX(((p17==1)&&(p158==1))))) U !(EF((p23==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U (p23==1))))))) * !(E(!(!(E(TRUE U (p23==1)))) U (!(((p91==1) + E(!(EG(!(!(E(TRUE U !...249
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t9, t10, t11, t12, t13, t14, t15, t17, t19, t21, t36, t37, Intersect...243
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.59326,57724,1,0,240,305471,199,134,2216,250826,308
FORMULA HealthRecord-PT-13-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 213/213 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 66 transition count 132
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 66 transition count 132
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 91 place count 59 transition count 116
Iterating global reduction 0 with 7 rules applied. Total rules applied 98 place count 59 transition count 116
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 106 place count 59 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 109 place count 56 transition count 101
Iterating global reduction 1 with 3 rules applied. Total rules applied 112 place count 56 transition count 101
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 117 place count 56 transition count 96
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 55 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 55 transition count 94
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 122 place count 55 transition count 91
Applied a total of 122 rules in 6 ms. Remains 55 /108 variables (removed 53) and now considering 91/213 (removed 122) transitions.
[2024-05-24 03:21:09] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
// Phase 1: matrix 88 rows 55 cols
[2024-05-24 03:21:09] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:21:09] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 03:21:09] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
[2024-05-24 03:21:09] [INFO ] Invariant cache hit.
[2024-05-24 03:21:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:21:09] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2024-05-24 03:21:09] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
[2024-05-24 03:21:09] [INFO ] Invariant cache hit.
[2024-05-24 03:21:09] [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, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-24 03:21:09] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:21:09] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:21:09] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 87/142 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-24 03:21:10] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 1/143 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/143 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 69 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2104 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-24 03:21:11] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:21:11] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:21:11] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:21:11] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:21:12] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-24 03:21:12] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 87/142 variables, 55/74 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 90/164 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-24 03:21:12] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:21:13] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (OVERLAPS) 1/143 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 12 (OVERLAPS) 0/143 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 167 constraints, problems are : Problem set: 0 solved, 90 unsolved in 3341 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 12/12 constraints]
After SMT, in 5468ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 5469ms
Starting structural reductions in LTL mode, iteration 1 : 55/108 places, 91/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5561 ms. Remains : 55/108 places, 91/213 transitions.
[2024-05-24 03:21:14] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:21:14] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:21:14] [INFO ] Input system was already deterministic with 91 transitions.
[2024-05-24 03:21:14] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:21:14] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:21:14] [INFO ] Time to serialize gal into /tmp/CTLFireability9615958586973911033.gal : 1 ms
[2024-05-24 03:21:14] [INFO ] Time to serialize properties into /tmp/CTLFireability5927080640466266911.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/CTLFireability9615958586973911033.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5927080640466266911.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(E(((AX((p52!=1)) * !((EG(((p55==1)&&(p158==1))) + E((p107==1) U (p57==1))))) * AF(((p72==1)||(!((p115==1)&&(p144==1)))))) U AG((p43==1...159
=> equivalent forward existential formula: [FwdG(Init,E(((!(EX(!((p52!=1)))) * !((EG(((p55==1)&&(p158==1))) + E((p107==1) U (p57==1))))) * !(EG(!(((p72==1)...226
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, t21, t22, t23, t...367
(forward)formula 0,0,1.00986,38508,1,0,247,190571,227,107,2255,174234,254
FORMULA HealthRecord-PT-13-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 213/213 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 69 transition count 138
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 69 transition count 138
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 81 place count 66 transition count 132
Iterating global reduction 0 with 3 rules applied. Total rules applied 84 place count 66 transition count 132
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 90 place count 66 transition count 126
Applied a total of 90 rules in 6 ms. Remains 66 /108 variables (removed 42) and now considering 126/213 (removed 87) transitions.
[2024-05-24 03:21:16] [INFO ] Flow matrix only has 123 transitions (discarded 3 similar events)
// Phase 1: matrix 123 rows 66 cols
[2024-05-24 03:21:16] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:21:16] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 03:21:16] [INFO ] Flow matrix only has 123 transitions (discarded 3 similar events)
[2024-05-24 03:21:16] [INFO ] Invariant cache hit.
[2024-05-24 03:21:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:21:16] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2024-05-24 03:21:16] [INFO ] Flow matrix only has 123 transitions (discarded 3 similar events)
[2024-05-24 03:21:16] [INFO ] Invariant cache hit.
[2024-05-24 03:21:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-24 03:21:16] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:21:16] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:21:16] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 2 ms to minimize.
[2024-05-24 03:21:16] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-24 03:21:16] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-24 03:21:16] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-05-24 03:21:16] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:21:16] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-24 03:21:16] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-24 03:21:17] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-24 03:21:17] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:21:17] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-24 03:21:17] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 122/188 variables, 66/88 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (OVERLAPS) 1/189 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 89 constraints, problems are : Problem set: 0 solved, 125 unsolved in 3463 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-24 03:21:19] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 122/188 variables, 66/89 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 125/214 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-24 03:21:21] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-24 03:21:22] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (OVERLAPS) 1/189 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 12 (OVERLAPS) 0/189 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 217 constraints, problems are : Problem set: 0 solved, 125 unsolved in 6793 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 16/16 constraints]
After SMT, in 10297ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 10299ms
Starting structural reductions in LTL mode, iteration 1 : 66/108 places, 126/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10395 ms. Remains : 66/108 places, 126/213 transitions.
[2024-05-24 03:21:26] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:21:26] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:21:26] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-24 03:21:26] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:21:26] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:21:26] [INFO ] Time to serialize gal into /tmp/CTLFireability15030721544397024129.gal : 0 ms
[2024-05-24 03:21:26] [INFO ] Time to serialize properties into /tmp/CTLFireability5165149243124294465.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/CTLFireability15030721544397024129.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5165149243124294465.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,2.4961e+06,0.875993,33420,2,4194,5,113662,6,0,386,135625,0


Converting to forward existential form...Done !
original formula: (EG(((p65==1) * !(E(EF((p125==1)) U ((p121==1)||(p136==1)))))) + EF(((E(!(EX((p47==1))) U (((p88==1)&&(p158==1)) + AG((p64==1)))) * (p49=...194
=> equivalent forward existential formula: ([FwdG(Init,((p65==1) * !(E(E(TRUE U (p125==1)) U ((p121==1)||(p136==1))))))] != FALSE + ([(EY(FwdU((FwdU(Init,T...420
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...424
(forward)formula 0,1,4.30356,132140,1,0,393,694825,290,197,3041,670788,410
FORMULA HealthRecord-PT-13-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 213/213 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 60 transition count 120
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 60 transition count 120
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 103 place count 53 transition count 104
Iterating global reduction 0 with 7 rules applied. Total rules applied 110 place count 53 transition count 104
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 119 place count 53 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 122 place count 50 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 125 place count 50 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 131 place count 50 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 132 place count 49 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 49 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 136 place count 49 transition count 77
Applied a total of 136 rules in 2 ms. Remains 49 /108 variables (removed 59) and now considering 77/213 (removed 136) transitions.
[2024-05-24 03:21:30] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
// Phase 1: matrix 74 rows 49 cols
[2024-05-24 03:21:30] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:21:30] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 03:21:30] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
[2024-05-24 03:21:30] [INFO ] Invariant cache hit.
[2024-05-24 03:21:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:21:30] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-05-24 03:21:30] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
[2024-05-24 03:21:30] [INFO ] Invariant cache hit.
[2024-05-24 03:21:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-24 03:21:31] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:21:31] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 73/122 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 1/123 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/123 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 61 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1276 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-24 03:21:32] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-24 03:21:32] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-24 03:21:32] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 73/122 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 76/139 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 1/123 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (OVERLAPS) 0/123 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 140 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2253 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 5/5 constraints]
After SMT, in 3546ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 3547ms
Starting structural reductions in LTL mode, iteration 1 : 49/108 places, 77/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3616 ms. Remains : 49/108 places, 77/213 transitions.
[2024-05-24 03:21:34] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:21:34] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:21:34] [INFO ] Input system was already deterministic with 77 transitions.
[2024-05-24 03:21:34] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:21:34] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:21:34] [INFO ] Time to serialize gal into /tmp/CTLFireability7355214956687301621.gal : 1 ms
[2024-05-24 03:21:34] [INFO ] Time to serialize properties into /tmp/CTLFireability17597017747513149707.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/CTLFireability7355214956687301621.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17597017747513149707.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,484794,0.066007,6304,2,1046,5,13131,6,0,269,11353,0


Converting to forward existential form...Done !
original formula: AG(AX(EX(AX((((((p18==0)||(p37==0))||((p56==0)||(p61==0)))||(((p68==0)||(p75==0))||((p82==0)||(p89==0))))||((p115==0)||(p159==0)))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(EX(!(EX(!((((((p18==0)||(p37==0))||((p56==0)||(p61==0)))||(((p68==0)||(p75==0))||((p82...212
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t15, t17, t19, Intersection with reachab...227
(forward)formula 0,0,0.232235,11848,1,0,137,41680,167,65,1929,36041,162
FORMULA HealthRecord-PT-13-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 213/213 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 69 transition count 138
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 69 transition count 138
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 82 place count 65 transition count 129
Iterating global reduction 0 with 4 rules applied. Total rules applied 86 place count 65 transition count 129
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 92 place count 65 transition count 123
Applied a total of 92 rules in 6 ms. Remains 65 /108 variables (removed 43) and now considering 123/213 (removed 90) transitions.
[2024-05-24 03:21:34] [INFO ] Flow matrix only has 120 transitions (discarded 3 similar events)
// Phase 1: matrix 120 rows 65 cols
[2024-05-24 03:21:34] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:21:34] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 03:21:34] [INFO ] Flow matrix only has 120 transitions (discarded 3 similar events)
[2024-05-24 03:21:34] [INFO ] Invariant cache hit.
[2024-05-24 03:21:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:21:34] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-24 03:21:34] [INFO ] Flow matrix only has 120 transitions (discarded 3 similar events)
[2024-05-24 03:21:34] [INFO ] Invariant cache hit.
[2024-05-24 03:21:34] [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, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-24 03:21:35] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:21:35] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:21:35] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:21:35] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:21:35] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:21:35] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:21:35] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:21:35] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 119/184 variables, 65/82 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-24 03:21:36] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:21:36] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:21:36] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-24 03:21:36] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-24 03:21:36] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 5/87 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 1/185 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 0/185 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 88 constraints, problems are : Problem set: 0 solved, 122 unsolved in 3489 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-24 03:21:38] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:21:38] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 119/184 variables, 65/89 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 122/211 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 1/185 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 0/185 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 212 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4818 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 15/15 constraints]
After SMT, in 8354ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 8355ms
Starting structural reductions in LTL mode, iteration 1 : 65/108 places, 123/213 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8447 ms. Remains : 65/108 places, 123/213 transitions.
[2024-05-24 03:21:43] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:21:43] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:21:43] [INFO ] Input system was already deterministic with 123 transitions.
[2024-05-24 03:21:43] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:21:43] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:21:43] [INFO ] Time to serialize gal into /tmp/CTLFireability241771206235960945.gal : 1 ms
[2024-05-24 03:21:43] [INFO ] Time to serialize properties into /tmp/CTLFireability18429434895075347666.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/CTLFireability241771206235960945.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18429434895075347666.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.48679e+06,0.630907,25856,2,3551,5,87965,6,0,379,113055,0


Converting to forward existential form...Done !
original formula: AG(((EF(((((p44==0)&&(p101==0)) + AX((p48==0))) * (p122==0))) + (p46==0)) + EF(((p78==0) * ((A((p30==1) U (p27==1)) + (p106==1)) + (p125=...163
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(E(TRUE U ((p78==0) * ((!((E(!((p27==1)) U (!((p30==1)) * !((p27==1)))) + EG(!((p27==1)))...286
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...459
(forward)formula 0,1,1.64117,46848,1,0,268,212589,266,101,2797,214657,266
FORMULA HealthRecord-PT-13-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-24 03:21:44] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:21:44] [INFO ] Flatten gal took : 6 ms
Total runtime 172531 ms.

BK_STOP 1716520904858

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

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