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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 19K Apr 12 21:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 230K Apr 12 21:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 21:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 21:30 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 68K 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-09-CTLFireability-2024-00
FORMULA_NAME HealthRecord-PT-09-CTLFireability-2024-01
FORMULA_NAME HealthRecord-PT-09-CTLFireability-2024-02
FORMULA_NAME HealthRecord-PT-09-CTLFireability-2024-03
FORMULA_NAME HealthRecord-PT-09-CTLFireability-2024-04
FORMULA_NAME HealthRecord-PT-09-CTLFireability-2024-05
FORMULA_NAME HealthRecord-PT-09-CTLFireability-2024-06
FORMULA_NAME HealthRecord-PT-09-CTLFireability-2024-07
FORMULA_NAME HealthRecord-PT-09-CTLFireability-2024-08
FORMULA_NAME HealthRecord-PT-09-CTLFireability-2024-09
FORMULA_NAME HealthRecord-PT-09-CTLFireability-2024-10
FORMULA_NAME HealthRecord-PT-09-CTLFireability-2024-11
FORMULA_NAME HealthRecord-PT-09-CTLFireability-2023-12
FORMULA_NAME HealthRecord-PT-09-CTLFireability-2023-13
FORMULA_NAME HealthRecord-PT-09-CTLFireability-2023-14
FORMULA_NAME HealthRecord-PT-09-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716520035190

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-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-24 03:07:16] [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:07:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:07:16] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-05-24 03:07:16] [INFO ] Transformed 157 places.
[2024-05-24 03:07:16] [INFO ] Transformed 327 transitions.
[2024-05-24 03:07:16] [INFO ] Found NUPN structural information;
[2024-05-24 03:07:16] [INFO ] Parsed PT model containing 157 places and 327 transitions and 859 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Support contains 84 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 301/301 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 120 transition count 233
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 120 transition count 233
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 118 transition count 229
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 118 transition count 229
Applied a total of 78 rules in 25 ms. Remains 118 /157 variables (removed 39) and now considering 229/301 (removed 72) transitions.
[2024-05-24 03:07:16] [INFO ] Flow matrix only has 223 transitions (discarded 6 similar events)
// Phase 1: matrix 223 rows 118 cols
[2024-05-24 03:07:16] [INFO ] Computed 12 invariants in 15 ms
[2024-05-24 03:07:16] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-24 03:07:16] [INFO ] Flow matrix only has 223 transitions (discarded 6 similar events)
[2024-05-24 03:07:16] [INFO ] Invariant cache hit.
[2024-05-24 03:07:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:07:17] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-05-24 03:07:17] [INFO ] Flow matrix only has 223 transitions (discarded 6 similar events)
[2024-05-24 03:07:17] [INFO ] Invariant cache hit.
[2024-05-24 03:07:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-24 03:07:18] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 12 ms to minimize.
[2024-05-24 03:07:18] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:07:18] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 3 ms to minimize.
[2024-05-24 03:07:18] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:07:19] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:07:19] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:07:19] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:07:19] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:07:19] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:07:19] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:07:19] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:07:19] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:07:19] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:07:19] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-24 03:07:20] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:07:20] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:07:20] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:07:20] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:07:20] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:07:20] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:07:20] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:07:21] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 4 ms to minimize.
[2024-05-24 03:07:21] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 9/35 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-24 03:07:21] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:07:21] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:07:21] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:07:21] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:07:21] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:07:21] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:07:21] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:07:21] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:07:21] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:07:21] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:07:21] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 2 ms to minimize.
[2024-05-24 03:07:21] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 4 ms to minimize.
[2024-05-24 03:07:21] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:07:22] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:07:22] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:07:22] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2024-05-24 03:07:22] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 2 ms to minimize.
[2024-05-24 03:07:22] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:07:22] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:07:22] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-24 03:07:22] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 0 ms to minimize.
[2024-05-24 03:07:22] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 222/340 variables, 118/175 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-24 03:07:24] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:07:24] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:07:24] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:07:24] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:07:24] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:07:24] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 2 ms to minimize.
[2024-05-24 03:07:24] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:07:25] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:07:25] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:07:25] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 0 ms to minimize.
[2024-05-24 03:07:25] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 2 ms to minimize.
[2024-05-24 03:07:25] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:07:25] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:07:25] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:07:25] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:07:25] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:07:25] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:07:25] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:07:25] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:07:25] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 20/195 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-24 03:07:27] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:07:27] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:07:27] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-24 03:07:28] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:07:28] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:07:28] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-24 03:07:29] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:07:29] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
[2024-05-24 03:07:29] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2024-05-24 03:07:29] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:07:29] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:07:30] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 6/207 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-24 03:07:31] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 0 ms to minimize.
[2024-05-24 03:07:31] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:07:31] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/340 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-24 03:07:33] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:07:33] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/340 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-24 03:07:34] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:07:34] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:07:34] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:07:34] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:07:34] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:07:34] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 0 ms to minimize.
[2024-05-24 03:07:34] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:07:34] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:07:34] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2024-05-24 03:07:34] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:07:34] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:07:34] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:07:35] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:07:35] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:07:35] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:07:35] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:07:35] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:07:35] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:07:35] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/340 variables, 19/231 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-24 03:07:37] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:07:37] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:07:37] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:07:37] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:07:37] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:07:37] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:07:37] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:07:37] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:07:37] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:07:37] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:07:38] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:07:38] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:07:38] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:07:38] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:07:38] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:07:38] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:07:38] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:07:38] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 0 ms to minimize.
[2024-05-24 03:07:38] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:07:38] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/340 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-24 03:07:39] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:07:39] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2024-05-24 03:07:39] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:07:39] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:07:39] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:07:39] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:07:39] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:07:39] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2024-05-24 03:07:39] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:07:39] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:07:39] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:07:39] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:07:39] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:07:40] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/340 variables, 14/265 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-24 03:07:40] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:07:41] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/340 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/340 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 20 (OVERLAPS) 1/341 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-24 03:07:44] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:07:44] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:07:44] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2024-05-24 03:07:44] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/341 variables, 4/272 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 341/341 variables, and 272 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 141/141 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 141/153 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-24 03:07:48] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:07:48] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:07:48] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:07:48] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:07:48] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:07:48] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-24 03:07:49] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-24 03:07:50] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:07:50] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:07:50] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-24 03:07:51] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-24 03:07:52] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:07:52] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:07:52] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:07:52] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:07:52] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 0 ms to minimize.
[2024-05-24 03:07:53] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:07:53] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 7/171 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-24 03:07:54] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:07:54] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 0 ms to minimize.
[2024-05-24 03:07:54] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:07:54] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:07:54] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 5/176 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-24 03:07:56] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:07:56] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-24 03:07:57] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:07:57] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:07:58] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 3 ms to minimize.
[2024-05-24 03:07:58] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/118 variables, 4/182 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-24 03:07:59] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:07:59] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:07:59] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/118 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-24 03:08:01] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/118 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-24 03:08:03] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:08:03] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/118 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/118 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 16 (OVERLAPS) 222/340 variables, 118/306 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/340 variables, 228/534 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/340 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 228 unsolved
SMT process timed out in 60183ms, After SMT, problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 60200ms
Starting structural reductions in LTL mode, iteration 1 : 118/157 places, 229/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60624 ms. Remains : 118/157 places, 229/301 transitions.
Support contains 84 out of 118 places after structural reductions.
[2024-05-24 03:08:17] [INFO ] Flatten gal took : 60 ms
[2024-05-24 03:08:17] [INFO ] Flatten gal took : 21 ms
[2024-05-24 03:08:17] [INFO ] Input system was already deterministic with 229 transitions.
RANDOM walk for 40000 steps (2356 resets) in 1486 ms. (26 steps per ms) remains 43/78 properties
BEST_FIRST walk for 4003 steps (34 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (34 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (33 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (33 resets) in 24 ms. (160 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (33 resets) in 22 ms. (174 steps per ms) remains 41/43 properties
BEST_FIRST walk for 4004 steps (37 resets) in 26 ms. (148 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (23 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (37 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (34 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (33 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (33 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (35 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (35 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (35 resets) in 11 ms. (333 steps per ms) remains 37/41 properties
BEST_FIRST walk for 4004 steps (60 resets) in 8 ms. (444 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (34 resets) in 10 ms. (363 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (33 resets) in 9 ms. (400 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (33 resets) in 9 ms. (400 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (28 resets) in 9 ms. (400 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (31 resets) in 8 ms. (444 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (34 resets) in 9 ms. (400 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (33 resets) in 10 ms. (363 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (31 resets) in 10 ms. (364 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (56 resets) in 10 ms. (364 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (30 resets) in 8 ms. (444 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (33 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (32 resets) in 8 ms. (444 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (34 resets) in 8 ms. (444 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (32 resets) in 10 ms. (364 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (35 resets) in 8 ms. (444 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (34 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (37 resets) in 9 ms. (400 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (34 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (33 resets) in 8 ms. (444 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (38 resets) in 8 ms. (444 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (33 resets) in 8 ms. (444 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (34 resets) in 8 ms. (444 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4003 steps (37 resets) in 9 ms. (400 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (32 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
[2024-05-24 03:08:18] [INFO ] Flow matrix only has 223 transitions (discarded 6 similar events)
[2024-05-24 03:08:18] [INFO ] Invariant cache hit.
[2024-05-24 03:08:18] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 34/89 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 29/118 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-05-24 03:08:18] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-24 03:08:18] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:08:18] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:08:18] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:08:19] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:08:19] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:08:19] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:08:19] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:08:19] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:08:19] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:08:19] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:08:19] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 0 ms to minimize.
[2024-05-24 03:08:19] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:08:19] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:08:19] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:08:19] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
Problem AtomicPropp65 is UNSAT
[2024-05-24 03:08:19] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:08:19] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
Problem AtomicPropp34 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 18/30 constraints. Problems are: Problem set: 2 solved, 34 unsolved
[2024-05-24 03:08:19] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 1/31 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/31 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 222/340 variables, 118/149 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/149 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 1/341 variables, 1/150 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 0/150 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 11 (OVERLAPS) 0/341 variables, 0/150 constraints. Problems are: Problem set: 2 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 150 constraints, problems are : Problem set: 2 solved, 34 unsolved in 2348 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 2 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 36/88 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 6/10 constraints. Problems are: Problem set: 2 solved, 34 unsolved
[2024-05-24 03:08:20] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:08:20] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:08:20] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 3/13 constraints. Problems are: Problem set: 2 solved, 34 unsolved
[2024-05-24 03:08:21] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/14 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 30/118 variables, 8/22 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 13/35 constraints. Problems are: Problem set: 2 solved, 34 unsolved
[2024-05-24 03:08:21] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:08:21] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-24 03:08:21] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:08:21] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:08:21] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:08:21] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:08:21] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:08:21] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:08:21] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:08:21] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:08:21] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:08:21] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 12/47 constraints. Problems are: Problem set: 2 solved, 34 unsolved
[2024-05-24 03:08:21] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:08:22] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 2/49 constraints. Problems are: Problem set: 2 solved, 34 unsolved
[2024-05-24 03:08:22] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:08:22] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-24 03:08:22] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:08:22] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
[2024-05-24 03:08:22] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:08:22] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 6/55 constraints. Problems are: Problem set: 2 solved, 34 unsolved
[2024-05-24 03:08:22] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:08:22] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:08:22] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:08:22] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:08:22] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:08:22] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:08:22] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:08:22] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:08:22] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:08:22] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:08:23] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/118 variables, 11/66 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/118 variables, 0/66 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 13 (OVERLAPS) 222/340 variables, 118/184 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/340 variables, 34/218 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/340 variables, 0/218 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 16 (OVERLAPS) 1/341 variables, 1/219 constraints. Problems are: Problem set: 2 solved, 34 unsolved
[2024-05-24 03:08:24] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:08:24] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/341 variables, 2/221 constraints. Problems are: Problem set: 2 solved, 34 unsolved
[2024-05-24 03:08:25] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:08:25] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/341 variables, 2/223 constraints. Problems are: Problem set: 2 solved, 34 unsolved
[2024-05-24 03:08:25] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:08:25] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
SMT process timed out in 7392ms, After SMT, problems are : Problem set: 2 solved, 34 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 52 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 229/229 transitions.
Graph (trivial) has 13 edges and 118 vertex of which 6 / 118 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 482 edges and 115 vertex of which 114 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 25 place count 91 transition count 170
Iterating global reduction 0 with 23 rules applied. Total rules applied 48 place count 91 transition count 170
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 91 transition count 168
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 50 place count 91 transition count 166
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 89 transition count 166
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 89 transition count 164
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 87 transition count 164
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 87 transition count 164
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 87 transition count 162
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 85 transition count 160
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 85 transition count 160
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 84 transition count 159
Applied a total of 67 rules in 60 ms. Remains 84 /118 variables (removed 34) and now considering 159/229 (removed 70) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 84/118 places, 159/229 transitions.
RANDOM walk for 40000 steps (2716 resets) in 467 ms. (85 steps per ms) remains 32/34 properties
BEST_FIRST walk for 4003 steps (48 resets) in 26 ms. (148 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (43 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (44 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (24 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (46 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (47 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (45 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (42 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (43 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (80 resets) in 31 ms. (125 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (42 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (45 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (46 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (46 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (44 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (42 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (43 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (68 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (38 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (41 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (40 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (43 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (44 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (44 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (50 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (47 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (45 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (47 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (41 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (46 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (44 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
Probabilistic random walk after 1000001 steps, saw 125576 distinct states, run finished after 2177 ms. (steps per millisecond=459 ) properties seen :31
[2024-05-24 03:08:28] [INFO ] Flow matrix only has 156 transitions (discarded 3 similar events)
// Phase 1: matrix 156 rows 84 cols
[2024-05-24 03:08:28] [INFO ] Computed 11 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 03:08:28] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:08:28] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:08:28] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 41/84 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 03:08:28] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:08:28] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:08:28] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 156/240 variables, 84/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 03:08:28] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/240 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 102 constraints, problems are : Problem set: 0 solved, 1 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 41/84 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 03:08:28] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:08:28] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:08:28] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 156/240 variables, 84/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/240 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 106 constraints, problems are : Problem set: 0 solved, 1 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 548ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 26 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 6 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-24 03:08:28] [INFO ] Flatten gal took : 13 ms
[2024-05-24 03:08:28] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:08:29] [INFO ] Input system was already deterministic with 229 transitions.
Support contains 77 out of 118 places (down from 80) after GAL structural reductions.
Computed a total of 12 stabilizing places and 20 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 229/229 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 64 transition count 124
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 64 transition count 124
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 115 place count 57 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 122 place count 57 transition count 109
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 128 place count 57 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 130 place count 55 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 55 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 135 place count 55 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 136 place count 54 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 137 place count 54 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 140 place count 54 transition count 90
Applied a total of 140 rules in 10 ms. Remains 54 /118 variables (removed 64) and now considering 90/229 (removed 139) transitions.
[2024-05-24 03:08:29] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
// Phase 1: matrix 87 rows 54 cols
[2024-05-24 03:08:29] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:08:29] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 03:08:29] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2024-05-24 03:08:29] [INFO ] Invariant cache hit.
[2024-05-24 03:08:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:08:29] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2024-05-24 03:08:29] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2024-05-24 03:08:29] [INFO ] Invariant cache hit.
[2024-05-24 03:08:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 03:08:29] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:08:29] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:08:29] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 86/140 variables, 54/66 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 1/141 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 0/141 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 67 constraints, problems are : Problem set: 0 solved, 89 unsolved in 1497 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 03:08:30] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-24 03:08:31] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:08:31] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 86/140 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 89/158 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 1/141 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/141 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 0/141 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 159 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2498 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 6/6 constraints]
After SMT, in 4024ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 4026ms
Starting structural reductions in LTL mode, iteration 1 : 54/118 places, 90/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4120 ms. Remains : 54/118 places, 90/229 transitions.
[2024-05-24 03:08:33] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:08:33] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:08:33] [INFO ] Input system was already deterministic with 90 transitions.
[2024-05-24 03:08:33] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:08:33] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:08:33] [INFO ] Time to serialize gal into /tmp/CTLFireability15531387839660113019.gal : 2 ms
[2024-05-24 03:08:33] [INFO ] Time to serialize properties into /tmp/CTLFireability7038501673066796416.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15531387839660113019.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7038501673066796416.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,865332,0.06343,5792,2,842,5,9954,6,0,302,10360,0


Converting to forward existential form...Done !
original formula: E(EG(AX(AF((p8==1)))) U AG(!(AG(AX((p88==1))))))
=> equivalent forward existential formula: [(FwdU(Init,EG(!(EX(!(!(EG(!((p8==1))))))))) * !(E(TRUE U !(!(!(E(TRUE U !(!(EX(!((p88==1))))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t21, t23, t25, t...297
Using saturation style SCC detection
(forward)formula 0,0,2.33847,84480,1,0,338,496336,216,164,2295,501167,394
FORMULA HealthRecord-PT-09-CTLFireability-2024-00 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 : 118/118 places, 229/229 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 71 transition count 138
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 71 transition count 138
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 99 place count 66 transition count 128
Iterating global reduction 0 with 5 rules applied. Total rules applied 104 place count 66 transition count 128
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 110 place count 66 transition count 122
Applied a total of 110 rules in 6 ms. Remains 66 /118 variables (removed 52) and now considering 122/229 (removed 107) transitions.
[2024-05-24 03:08:35] [INFO ] Flow matrix only has 119 transitions (discarded 3 similar events)
// Phase 1: matrix 119 rows 66 cols
[2024-05-24 03:08:35] [INFO ] Computed 9 invariants in 3 ms
[2024-05-24 03:08:35] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 03:08:35] [INFO ] Flow matrix only has 119 transitions (discarded 3 similar events)
[2024-05-24 03:08:35] [INFO ] Invariant cache hit.
[2024-05-24 03:08:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:08:35] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-24 03:08:35] [INFO ] Flow matrix only has 119 transitions (discarded 3 similar events)
[2024-05-24 03:08:35] [INFO ] Invariant cache hit.
[2024-05-24 03:08:35] [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, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-24 03:08:36] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:08:36] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:08:36] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-24 03:08:36] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 118/184 variables, 66/79 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 1/185 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-24 03:08:37] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 0/185 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 81 constraints, problems are : Problem set: 0 solved, 121 unsolved in 3095 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 66/66 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/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-24 03:08:39] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:08:39] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-24 03:08:39] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-24 03:08:39] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-24 03:08:39] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:08:39] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:08:39] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-24 03:08:39] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-24 03:08:39] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-24 03:08:40] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:08:40] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:08:40] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 118/184 variables, 66/92 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 121/213 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-24 03:08:41] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-24 03:08:42] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:08:42] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (OVERLAPS) 1/185 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/185 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 15 (OVERLAPS) 0/185 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 217 constraints, problems are : Problem set: 0 solved, 121 unsolved in 7842 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 66/66 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 20/20 constraints]
After SMT, in 10974ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 10976ms
Starting structural reductions in LTL mode, iteration 1 : 66/118 places, 122/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11093 ms. Remains : 66/118 places, 122/229 transitions.
[2024-05-24 03:08:46] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:08:46] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:08:46] [INFO ] Input system was already deterministic with 122 transitions.
[2024-05-24 03:08:46] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:08:46] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:08:46] [INFO ] Time to serialize gal into /tmp/CTLFireability2860023471415112221.gal : 2 ms
[2024-05-24 03:08:46] [INFO ] Time to serialize properties into /tmp/CTLFireability16632229339181624760.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/CTLFireability2860023471415112221.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16632229339181624760.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.19624e+06,0.286699,15316,2,3389,5,44449,6,0,382,61171,0


Converting to forward existential form...Done !
original formula: AF((EF((EX(EG((p52==1))) + (((AF(((p36==1)&&(p154==1))) + A((p6==1) U (p50==1))) * (p36==1)) * (p28==0)))) * (EF(((p20==1)&&(p154==1))) +...277
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U (EX(EG((p52==1))) + (((!(EG(!(((p36==1)&&(p154==1))))) + !((E(!((p50==1)) U (!((p6==1)) *...391
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...475
(forward)formula 0,1,12.7504,404644,1,0,799,2.43575e+06,304,410,2872,2.442e+06,946
FORMULA HealthRecord-PT-09-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 229/229 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 65 transition count 126
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 65 transition count 126
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 113 place count 58 transition count 112
Iterating global reduction 0 with 7 rules applied. Total rules applied 120 place count 58 transition count 112
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 129 place count 58 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 57 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 57 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 132 place count 56 transition count 98
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 56 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 135 place count 56 transition count 96
Applied a total of 135 rules in 8 ms. Remains 56 /118 variables (removed 62) and now considering 96/229 (removed 133) transitions.
[2024-05-24 03:08:59] [INFO ] Flow matrix only has 93 transitions (discarded 3 similar events)
// Phase 1: matrix 93 rows 56 cols
[2024-05-24 03:08:59] [INFO ] Computed 9 invariants in 3 ms
[2024-05-24 03:08:59] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 03:08:59] [INFO ] Flow matrix only has 93 transitions (discarded 3 similar events)
[2024-05-24 03:08:59] [INFO ] Invariant cache hit.
[2024-05-24 03:08:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:08:59] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2024-05-24 03:08:59] [INFO ] Flow matrix only has 93 transitions (discarded 3 similar events)
[2024-05-24 03:08:59] [INFO ] Invariant cache hit.
[2024-05-24 03:08:59] [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, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-24 03:09:00] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:09:00] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 92/148 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 1/149 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 0/149 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 68 constraints, problems are : Problem set: 0 solved, 95 unsolved in 1651 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-24 03:09:01] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-24 03:09:01] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-24 03:09:01] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 92/148 variables, 56/70 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 95/165 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 1/149 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/149 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 166 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2874 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 5/5 constraints]
After SMT, in 4555ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 4556ms
Starting structural reductions in LTL mode, iteration 1 : 56/118 places, 96/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4649 ms. Remains : 56/118 places, 96/229 transitions.
[2024-05-24 03:09:04] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:09:04] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:09:04] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-24 03:09:04] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:09:04] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:09:04] [INFO ] Time to serialize gal into /tmp/CTLFireability17110170631737476543.gal : 1 ms
[2024-05-24 03:09:04] [INFO ] Time to serialize properties into /tmp/CTLFireability12654748494006900586.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/CTLFireability17110170631737476543.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12654748494006900586.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.07383e+06,0.087164,7232,2,1358,5,15906,6,0,316,15921,0


Converting to forward existential form...Done !
original formula: EX(((!(E(!(EX((p11==1))) U ((((p134==1)&&(p36==1))&&(p154==1))||(p48==1)))) * (p45==0)) * EG(((p36==0)||(p154==0)))))
=> equivalent forward existential formula: [FwdG((EY(Init) * (!(E(!(EX((p11==1))) U ((((p134==1)&&(p36==1))&&(p154==1))||(p48==1)))) * (p45==0))),((p36==0)...178
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...297
(forward)formula 0,0,0.773189,34616,1,0,306,192165,218,169,2314,183390,323
FORMULA HealthRecord-PT-09-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 229/229 transitions.
Graph (trivial) has 141 edges and 118 vertex of which 12 / 118 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 51 place count 61 transition count 124
Iterating global reduction 0 with 50 rules applied. Total rules applied 101 place count 61 transition count 124
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 110 place count 52 transition count 105
Iterating global reduction 0 with 9 rules applied. Total rules applied 119 place count 52 transition count 105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 128 place count 52 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 131 place count 49 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 134 place count 49 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 137 place count 49 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 139 place count 47 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 141 place count 47 transition count 81
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 147 place count 47 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 150 place count 47 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 3 with 2 rules applied. Total rules applied 152 place count 46 transition count 71
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 154 place count 44 transition count 69
Applied a total of 154 rules in 22 ms. Remains 44 /118 variables (removed 74) and now considering 69/229 (removed 160) transitions.
[2024-05-24 03:09:05] [INFO ] Flow matrix only has 60 transitions (discarded 9 similar events)
// Phase 1: matrix 60 rows 44 cols
[2024-05-24 03:09:05] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:09:05] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 03:09:05] [INFO ] Flow matrix only has 60 transitions (discarded 9 similar events)
[2024-05-24 03:09:05] [INFO ] Invariant cache hit.
[2024-05-24 03:09:05] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-24 03:09:05] [INFO ] Redundant transitions in 11 ms returned []
Running 55 sub problems to find dead transitions.
[2024-05-24 03:09:05] [INFO ] Flow matrix only has 60 transitions (discarded 9 similar events)
[2024-05-24 03:09:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 2/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-24 03:09:05] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-24 03:09:05] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-24 03:09:05] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-24 03:09:05] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-24 03:09:05] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 5/44 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 59/103 variables, 44/59 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 0/103 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/104 variables, and 59 constraints, problems are : Problem set: 0 solved, 55 unsolved in 974 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 2/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 5/44 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 59/103 variables, 44/59 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 55/114 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-24 03:09:06] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/103 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-24 03:09:06] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/103 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-24 03:09:07] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/103 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/103 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 14 (OVERLAPS) 0/103 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/104 variables, and 117 constraints, problems are : Problem set: 0 solved, 55 unsolved in 1528 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 8/8 constraints]
After SMT, in 2525ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 2527ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/118 places, 69/229 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2634 ms. Remains : 44/118 places, 69/229 transitions.
[2024-05-24 03:09:07] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:09:07] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:09:07] [INFO ] Input system was already deterministic with 69 transitions.
[2024-05-24 03:09:07] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:09:07] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:09:07] [INFO ] Time to serialize gal into /tmp/CTLFireability15240091460919701178.gal : 1 ms
[2024-05-24 03:09:07] [INFO ] Time to serialize properties into /tmp/CTLFireability266719179515324649.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/CTLFireability15240091460919701178.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability266719179515324649.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,195844,0.033195,4964,2,750,5,6201,6,0,228,6462,0


Converting to forward existential form...Done !
original formula: EF(((AF((p68==0)) * (p42==0)) * A((p102==1) U AG(((p55==1)&&(p154==1))))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (!(EG(!((p68==0)))) * (p42==0))) * !(EG(!(!(E(TRUE U !(((p55==1)&&(p154==1))))))))) * !(E(...268
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t13, t14, t15, t16, t17, t25, t26, t36, t37...290
(forward)formula 0,0,0.125273,9188,1,0,147,27073,152,61,1623,21127,144
FORMULA HealthRecord-PT-09-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 229/229 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 64 transition count 124
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 64 transition count 124
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 114 place count 58 transition count 112
Iterating global reduction 0 with 6 rules applied. Total rules applied 120 place count 58 transition count 112
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 126 place count 58 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 57 transition count 103
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 57 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 56 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 56 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 133 place count 56 transition count 98
Applied a total of 133 rules in 4 ms. Remains 56 /118 variables (removed 62) and now considering 98/229 (removed 131) transitions.
[2024-05-24 03:09:07] [INFO ] Flow matrix only has 95 transitions (discarded 3 similar events)
// Phase 1: matrix 95 rows 56 cols
[2024-05-24 03:09:07] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:09:07] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 03:09:07] [INFO ] Flow matrix only has 95 transitions (discarded 3 similar events)
[2024-05-24 03:09:07] [INFO ] Invariant cache hit.
[2024-05-24 03:09:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:09:07] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-24 03:09:07] [INFO ] Flow matrix only has 95 transitions (discarded 3 similar events)
[2024-05-24 03:09:07] [INFO ] Invariant cache hit.
[2024-05-24 03:09:07] [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, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-24 03:09:08] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:09:08] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:09:08] [INFO ] Deduced a trap composed of 16 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, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 94/150 variables, 56/68 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 1/151 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 0/151 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 69 constraints, problems are : Problem set: 0 solved, 97 unsolved in 1737 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-24 03:09:09] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:09:10] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-24 03:09:10] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 94/150 variables, 56/71 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 97/168 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 1/151 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 0/151 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 169 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2586 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 6/6 constraints]
After SMT, in 4349ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 4351ms
Starting structural reductions in LTL mode, iteration 1 : 56/118 places, 98/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4427 ms. Remains : 56/118 places, 98/229 transitions.
[2024-05-24 03:09:12] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:09:12] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:09:12] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-24 03:09:12] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:09:12] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:09:12] [INFO ] Time to serialize gal into /tmp/CTLFireability16561908724455446162.gal : 1 ms
[2024-05-24 03:09:12] [INFO ] Time to serialize properties into /tmp/CTLFireability17604191836385622281.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/CTLFireability16561908724455446162.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17604191836385622281.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,987804,0.047749,5660,2,797,5,9281,6,0,318,8642,0


Converting to forward existential form...Done !
original formula: A((p48==1) U AG(!((EX((((p36==1)&&(p154==1))||(p129==1))) * AF((p90!=1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!((EX((((p36==1)&&(p154==1))||(p129==1))) * !(EG(!((p90!=1))))))))))))) * !(E(!(!(...349
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t22, t...317
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.389383,21048,1,0,255,104044,229,124,2436,80224,309
FORMULA HealthRecord-PT-09-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 229/229 transitions.
Graph (trivial) has 55 edges and 118 vertex of which 10 / 118 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 49 place count 64 transition count 129
Iterating global reduction 0 with 48 rules applied. Total rules applied 97 place count 64 transition count 129
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 104 place count 57 transition count 115
Iterating global reduction 0 with 7 rules applied. Total rules applied 111 place count 57 transition count 115
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 118 place count 57 transition count 108
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 121 place count 57 transition count 105
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 1 with 2 rules applied. Total rules applied 123 place count 56 transition count 104
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 125 place count 54 transition count 102
Applied a total of 125 rules in 12 ms. Remains 54 /118 variables (removed 64) and now considering 102/229 (removed 127) transitions.
[2024-05-24 03:09:12] [INFO ] Flow matrix only has 94 transitions (discarded 8 similar events)
// Phase 1: matrix 94 rows 54 cols
[2024-05-24 03:09:12] [INFO ] Computed 10 invariants in 0 ms
[2024-05-24 03:09:12] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 03:09:12] [INFO ] Flow matrix only has 94 transitions (discarded 8 similar events)
[2024-05-24 03:09:12] [INFO ] Invariant cache hit.
[2024-05-24 03:09:12] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-05-24 03:09:12] [INFO ] Redundant transitions in 12 ms returned []
Running 88 sub problems to find dead transitions.
[2024-05-24 03:09:12] [INFO ] Flow matrix only has 94 transitions (discarded 8 similar events)
[2024-05-24 03:09:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 2/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-24 03:09:13] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
[2024-05-24 03:09:13] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:09:13] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 5/54 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 93/147 variables, 54/67 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 0/147 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/148 variables, and 67 constraints, problems are : Problem set: 0 solved, 88 unsolved in 1448 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 2/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 5/54 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 93/147 variables, 54/67 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 88/155 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/148 variables, and 155 constraints, problems are : Problem set: 0 solved, 88 unsolved in 1459 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 3/3 constraints]
After SMT, in 2942ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 2943ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/118 places, 102/229 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3041 ms. Remains : 54/118 places, 102/229 transitions.
[2024-05-24 03:09:15] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:09:15] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:09:15] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-24 03:09:15] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:09:15] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:09:15] [INFO ] Time to serialize gal into /tmp/CTLFireability5592275947366318267.gal : 1 ms
[2024-05-24 03:09:15] [INFO ] Time to serialize properties into /tmp/CTLFireability28654495479665201.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/CTLFireability5592275947366318267.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability28654495479665201.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 -...281
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,492484,0.092249,7784,2,2018,5,17247,6,0,303,16401,0


Converting to forward existential form...Done !
original formula: (EF(((p36==1)&&(p154==1))) * AG((E((p36==1) U EF(((p119==1)||((p111==1)&&(p128==1))))) * !(A(((p27==1)&&((p45==1)||(p70==1))) U E((((((p1...283
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((p36==1)&&(p154==1)))))] = FALSE * ([(FwdU(Init,TRUE) * !(E((p36==1) U E(TRUE U ((p119==1)...694
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...326
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,3.03235,118156,1,0,312,704555,225,186,2368,660612,359
FORMULA HealthRecord-PT-09-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 229/229 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 63 transition count 122
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 63 transition count 122
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 118 place count 55 transition count 105
Iterating global reduction 0 with 8 rules applied. Total rules applied 126 place count 55 transition count 105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 135 place count 55 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 138 place count 52 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 141 place count 52 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 144 place count 52 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 146 place count 50 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 50 transition count 81
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 153 place count 50 transition count 76
Applied a total of 153 rules in 3 ms. Remains 50 /118 variables (removed 68) and now considering 76/229 (removed 153) transitions.
[2024-05-24 03:09:18] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
// Phase 1: matrix 73 rows 50 cols
[2024-05-24 03:09:18] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:09:18] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-24 03:09:18] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
[2024-05-24 03:09:18] [INFO ] Invariant cache hit.
[2024-05-24 03:09:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:09:18] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2024-05-24 03:09:18] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
[2024-05-24 03:09:18] [INFO ] Invariant cache hit.
[2024-05-24 03:09:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-24 03:09:19] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-24 03:09:19] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 72/122 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 1/123 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/123 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 62 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1125 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-24 03:09:20] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-24 03:09:20] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-24 03:09:20] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-24 03:09:20] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 72/122 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 75/140 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 1/123 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 12 (OVERLAPS) 0/123 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 141 constraints, problems are : Problem set: 0 solved, 75 unsolved in 2257 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 6/6 constraints]
After SMT, in 3395ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 3396ms
Starting structural reductions in LTL mode, iteration 1 : 50/118 places, 76/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3492 ms. Remains : 50/118 places, 76/229 transitions.
[2024-05-24 03:09:22] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:09:22] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:09:22] [INFO ] Input system was already deterministic with 76 transitions.
[2024-05-24 03:09:22] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:09:22] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:09:22] [INFO ] Time to serialize gal into /tmp/CTLFireability8662880743050943898.gal : 0 ms
[2024-05-24 03:09:22] [INFO ] Time to serialize properties into /tmp/CTLFireability7680483242635631832.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/CTLFireability8662880743050943898.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7680483242635631832.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,601434,0.132243,9460,2,2003,5,27877,6,0,272,19189,0


Converting to forward existential form...Done !
original formula: EF(EX((p12==1)))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * (p12==1))] != FALSE
(forward)formula 0,1,0.151594,9724,1,0,8,27877,8,1,477,19189,2
FORMULA HealthRecord-PT-09-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 229/229 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 67 transition count 130
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 67 transition count 130
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 108 place count 61 transition count 118
Iterating global reduction 0 with 6 rules applied. Total rules applied 114 place count 61 transition count 118
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 123 place count 61 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 124 place count 60 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 125 place count 60 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 126 place count 59 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 127 place count 59 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 130 place count 59 transition count 101
Applied a total of 130 rules in 3 ms. Remains 59 /118 variables (removed 59) and now considering 101/229 (removed 128) transitions.
[2024-05-24 03:09:22] [INFO ] Flow matrix only has 98 transitions (discarded 3 similar events)
// Phase 1: matrix 98 rows 59 cols
[2024-05-24 03:09:22] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:09:22] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-24 03:09:22] [INFO ] Flow matrix only has 98 transitions (discarded 3 similar events)
[2024-05-24 03:09:22] [INFO ] Invariant cache hit.
[2024-05-24 03:09:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:09:22] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2024-05-24 03:09:22] [INFO ] Flow matrix only has 98 transitions (discarded 3 similar events)
[2024-05-24 03:09:22] [INFO ] Invariant cache hit.
[2024-05-24 03:09:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-24 03:09:23] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:09:23] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-24 03:09:23] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 97/156 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-24 03:09:23] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:09:23] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:09:23] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 1/157 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (OVERLAPS) 0/157 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 75 constraints, problems are : Problem set: 0 solved, 100 unsolved in 2492 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-24 03:09:25] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-05-24 03:09:25] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 97/156 variables, 59/76 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 100/176 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 1/157 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 0/157 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 177 constraints, problems are : Problem set: 0 solved, 100 unsolved in 3315 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 8/8 constraints]
After SMT, in 5829ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 5830ms
Starting structural reductions in LTL mode, iteration 1 : 59/118 places, 101/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6000 ms. Remains : 59/118 places, 101/229 transitions.
[2024-05-24 03:09:28] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:09:28] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:09:28] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-24 03:09:28] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:09:28] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:09:28] [INFO ] Time to serialize gal into /tmp/CTLFireability15945624000782400357.gal : 1 ms
[2024-05-24 03:09:28] [INFO ] Time to serialize properties into /tmp/CTLFireability12213000642797301107.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/CTLFireability15945624000782400357.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12213000642797301107.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.18974e+06,0.064793,6456,2,1124,5,12192,6,0,333,11833,0


Converting to forward existential form...Done !
original formula: (EG((((p144==1) + AF((p62==1))) + AF((!(A((p156==1) U (p17==1))) * (((p36==0)||(p154==0))||(p121==1)))))) * AG((AG((AX((p48==0)) + (p36==...177
=> equivalent forward existential formula: ([(Init * !(EG((((p144==1) + !(EG(!((p62==1))))) + !(EG(!((!(!((E(!((p17==1)) U (!((p156==1)) * !((p17==1)))) + ...329
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...313
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,6.63767,242220,1,0,652,1.53143e+06,252,356,2571,1.43443e+06,725
FORMULA HealthRecord-PT-09-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 229/229 transitions.
Graph (trivial) has 168 edges and 118 vertex of which 12 / 118 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 53 place count 59 transition count 121
Iterating global reduction 0 with 52 rules applied. Total rules applied 105 place count 59 transition count 121
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 114 place count 50 transition count 102
Iterating global reduction 0 with 9 rules applied. Total rules applied 123 place count 50 transition count 102
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 133 place count 50 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 135 place count 48 transition count 87
Iterating global reduction 1 with 2 rules applied. Total rules applied 137 place count 48 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 140 place count 48 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 47 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 47 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 145 place count 47 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 148 place count 47 transition count 76
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 3 with 2 rules applied. Total rules applied 150 place count 46 transition count 75
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 152 place count 44 transition count 73
Applied a total of 152 rules in 14 ms. Remains 44 /118 variables (removed 74) and now considering 73/229 (removed 156) transitions.
[2024-05-24 03:09:35] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
// Phase 1: matrix 65 rows 44 cols
[2024-05-24 03:09:35] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:09:35] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 03:09:35] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
[2024-05-24 03:09:35] [INFO ] Invariant cache hit.
[2024-05-24 03:09:35] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-05-24 03:09:35] [INFO ] Redundant transitions in 10 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-24 03:09:35] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
[2024-05-24 03:09:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 7/44 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-24 03:09:35] [INFO ] Deduced a trap composed of 5 places in 12 ms of which 0 ms to minimize.
[2024-05-24 03:09:35] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-24 03:09:35] [INFO ] Deduced a trap composed of 4 places in 15 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, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 64/108 variables, 44/56 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 0/108 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/109 variables, and 56 constraints, problems are : Problem set: 0 solved, 59 unsolved in 714 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 7/44 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-24 03:09:36] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 1 ms to minimize.
[2024-05-24 03:09:36] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-24 03:09:36] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-05-24 03:09:36] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 64/108 variables, 44/60 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 59/119 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/108 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/109 variables, and 119 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1054 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 7/7 constraints]
After SMT, in 1787ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 1788ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/118 places, 73/229 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1902 ms. Remains : 44/118 places, 73/229 transitions.
[2024-05-24 03:09:37] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:09:37] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:09:37] [INFO ] Input system was already deterministic with 73 transitions.
[2024-05-24 03:09:37] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:09:37] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:09:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12892669066729415100.gal : 1 ms
[2024-05-24 03:09:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality549053211090778157.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12892669066729415100.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality549053211090778157.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/ReachabilityCardinality549053211090778157.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 56
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :56 after 72
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :72 after 88
SDD proceeding with computation,1 properties remain. new max is 128
RANDOM walk for 40000 steps (4044 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
SDD size :88 after 3528
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3528 after 21168
BEST_FIRST walk for 40003 steps (612 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
Reachability property HealthRecord-PT-09-CTLFireability-2024-08 is true.
FORMULA HealthRecord-PT-09-CTLFireability-2024-08 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,99144,0.039584,4628,2,553,13,5178,6,0,235,4534,0
Total reachable state count : 99144

Verifying 1 reachability properties.
Reachability property HealthRecord-PT-09-CTLFireability-2024-08 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-09-CTLFireability-2024-08,1,0.040224,4888,2,45,13,5178,7,0,238,4534,0
Finished probabilistic random walk after 26509 steps, run visited all 1 properties in 28 ms. (steps per millisecond=946 )
Probabilistic random walk after 26509 steps, saw 5105 distinct states, run finished after 31 ms. (steps per millisecond=855 ) properties seen :1
Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 229/229 transitions.
Graph (trivial) has 102 edges and 118 vertex of which 8 / 118 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 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 49 place count 65 transition count 131
Iterating global reduction 0 with 48 rules applied. Total rules applied 97 place count 65 transition count 131
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 103 place count 59 transition count 118
Iterating global reduction 0 with 6 rules applied. Total rules applied 109 place count 59 transition count 118
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 117 place count 59 transition count 110
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 57 transition count 105
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 57 transition count 105
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 57 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 56 transition count 100
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 56 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 128 place count 56 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 56 transition count 96
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 3 with 2 rules applied. Total rules applied 132 place count 55 transition count 95
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 55 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 134 place count 54 transition count 94
Applied a total of 134 rules in 17 ms. Remains 54 /118 variables (removed 64) and now considering 94/229 (removed 135) transitions.
[2024-05-24 03:09:37] [INFO ] Flow matrix only has 87 transitions (discarded 7 similar events)
// Phase 1: matrix 87 rows 54 cols
[2024-05-24 03:09:37] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:09:37] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 03:09:37] [INFO ] Flow matrix only has 87 transitions (discarded 7 similar events)
[2024-05-24 03:09:37] [INFO ] Invariant cache hit.
[2024-05-24 03:09:37] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-05-24 03:09:37] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-24 03:09:37] [INFO ] Flow matrix only has 87 transitions (discarded 7 similar events)
[2024-05-24 03:09:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 7/54 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-24 03:09:37] [INFO ] Deduced a trap composed of 8 places in 13 ms of which 1 ms to minimize.
[2024-05-24 03:09:37] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:09:37] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:09:37] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-24 03:09:37] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 86/140 variables, 54/68 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/141 variables, and 68 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1187 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 7/54 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-24 03:09:38] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 86/140 variables, 54/69 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 80/149 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/140 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/141 variables, and 149 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1436 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 6/6 constraints]
After SMT, in 2641ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 2642ms
Starting structural reductions in SI_CTL mode, iteration 1 : 54/118 places, 94/229 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2746 ms. Remains : 54/118 places, 94/229 transitions.
[2024-05-24 03:09:40] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:09:40] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:09:40] [INFO ] Input system was already deterministic with 94 transitions.
[2024-05-24 03:09:40] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:09:40] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:09:40] [INFO ] Time to serialize gal into /tmp/CTLFireability4260956496133779593.gal : 1 ms
[2024-05-24 03:09:40] [INFO ] Time to serialize properties into /tmp/CTLFireability10275446718173964924.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/CTLFireability4260956496133779593.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10275446718173964924.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,571543,0.064197,6436,2,2254,5,11951,6,0,297,11954,0


Converting to forward existential form...Done !
original formula: A((AG((p105==1)) + EF(((((((AF((p16==1)) * (p18==1)) * ((p37==1)&&(p56==1))) * (((p61==1)&&(p66==1))&&((p71==1)&&(p78==1)))) * (((p85==1)...242
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U (p121==1))))))) * !(E(!(!(E(TRUE U (p121==1)))) U (!((!(E(TRUE U !((p105==1)))) + E(...393
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...295
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,3.48913,127312,1,0,346,727572,224,173,2328,707915,421
FORMULA HealthRecord-PT-09-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 229/229 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 69 transition count 133
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 69 transition count 133
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 105 place count 62 transition count 119
Iterating global reduction 0 with 7 rules applied. Total rules applied 112 place count 62 transition count 119
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 119 place count 62 transition count 112
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 121 place count 60 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 123 place count 60 transition count 106
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 125 place count 58 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 127 place count 58 transition count 102
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 132 place count 58 transition count 97
Applied a total of 132 rules in 3 ms. Remains 58 /118 variables (removed 60) and now considering 97/229 (removed 132) transitions.
[2024-05-24 03:09:43] [INFO ] Flow matrix only has 93 transitions (discarded 4 similar events)
// Phase 1: matrix 93 rows 58 cols
[2024-05-24 03:09:43] [INFO ] Computed 10 invariants in 0 ms
[2024-05-24 03:09:43] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 03:09:43] [INFO ] Flow matrix only has 93 transitions (discarded 4 similar events)
[2024-05-24 03:09:43] [INFO ] Invariant cache hit.
[2024-05-24 03:09:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:09:43] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-24 03:09:43] [INFO ] Flow matrix only has 93 transitions (discarded 4 similar events)
[2024-05-24 03:09:43] [INFO ] Invariant cache hit.
[2024-05-24 03:09:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-24 03:09:44] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:09:44] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-24 03:09:44] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 92/150 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 1/151 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/151 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 72 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2004 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-24 03:09:45] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:09:45] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:09:46] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:09:46] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:09:46] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-24 03:09:46] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:09:46] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 92/150 variables, 58/78 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 96/174 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 1/151 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-24 03:09:47] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/151 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (OVERLAPS) 0/151 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 176 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3563 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 11/11 constraints]
After SMT, in 5589ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 5591ms
Starting structural reductions in LTL mode, iteration 1 : 58/118 places, 97/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5678 ms. Remains : 58/118 places, 97/229 transitions.
[2024-05-24 03:09:49] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:09:49] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:09:49] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-24 03:09:49] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:09:49] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:09:49] [INFO ] Time to serialize gal into /tmp/CTLFireability10954580832033276654.gal : 1 ms
[2024-05-24 03:09:49] [INFO ] Time to serialize properties into /tmp/CTLFireability17448226556914470060.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/CTLFireability10954580832033276654.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17448226556914470060.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.82834e+06,0.245194,13552,2,2921,5,44832,6,0,322,39795,0


Converting to forward existential form...Done !
original formula: (EG(AF((p36==0))) * (AG((!(A(EF((p31==1)) U ((p28==1)&&(p54==1)))) * AG(EX((p6==0))))) + AF((!(E(AX((p67==1)) U (p63!=1))) * (p3==0)))))
=> equivalent forward existential formula: ([(Init * !(EG(!(EG(!((p36==0)))))))] = FALSE * [FwdG((Init * !(!(E(TRUE U !((!(!((E(!(((p28==1)&&(p54==1))) U (...335
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, t36, t37, t...307
(forward)formula 0,0,8.07523,255664,1,0,504,1.50928e+06,230,292,2420,1.3502e+06,553
FORMULA HealthRecord-PT-09-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 229/229 transitions.
Graph (trivial) has 146 edges and 118 vertex of which 12 / 118 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 54 place count 58 transition count 119
Iterating global reduction 0 with 53 rules applied. Total rules applied 107 place count 58 transition count 119
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 116 place count 49 transition count 100
Iterating global reduction 0 with 9 rules applied. Total rules applied 125 place count 49 transition count 100
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 135 place count 49 transition count 90
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 138 place count 46 transition count 82
Iterating global reduction 1 with 3 rules applied. Total rules applied 141 place count 46 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 144 place count 46 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 146 place count 44 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 44 transition count 75
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 154 place count 44 transition count 69
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 157 place count 44 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 159 place count 43 transition count 65
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 161 place count 41 transition count 63
Applied a total of 161 rules in 20 ms. Remains 41 /118 variables (removed 77) and now considering 63/229 (removed 166) transitions.
[2024-05-24 03:09:57] [INFO ] Flow matrix only has 55 transitions (discarded 8 similar events)
// Phase 1: matrix 55 rows 41 cols
[2024-05-24 03:09:57] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:09:57] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 03:09:57] [INFO ] Flow matrix only has 55 transitions (discarded 8 similar events)
[2024-05-24 03:09:57] [INFO ] Invariant cache hit.
[2024-05-24 03:09:57] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-24 03:09:57] [INFO ] Redundant transitions in 14 ms returned []
Running 49 sub problems to find dead transitions.
[2024-05-24 03:09:57] [INFO ] Flow matrix only has 55 transitions (discarded 8 similar events)
[2024-05-24 03:09:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 7/41 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-24 03:09:57] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:09:57] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-24 03:09:57] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 54/95 variables, 41/53 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/95 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/96 variables, and 53 constraints, problems are : Problem set: 0 solved, 49 unsolved in 610 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 7/41 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 54/95 variables, 41/53 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 49/102 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/95 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/96 variables, and 102 constraints, problems are : Problem set: 0 solved, 49 unsolved in 594 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 3/3 constraints]
After SMT, in 1218ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 1220ms
Starting structural reductions in SI_CTL mode, iteration 1 : 41/118 places, 63/229 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1332 ms. Remains : 41/118 places, 63/229 transitions.
[2024-05-24 03:09:58] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:09:58] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:09:58] [INFO ] Input system was already deterministic with 63 transitions.
[2024-05-24 03:09:58] [INFO ] Flatten gal took : 2 ms
RANDOM walk for 8212 steps (832 resets) in 13 ms. (586 steps per ms) remains 0/1 properties
FORMULA HealthRecord-PT-09-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-24 03:09:58] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:09:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14903967352860343410.gal : 1 ms
[2024-05-24 03:09:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17056354351962066227.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/ReachabilityCardinality14903967352860343410.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17056354351962066227.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
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 ...330
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 229/229 transitions.
Graph (trivial) has 163 edges and 118 vertex of which 12 / 118 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 51 place count 61 transition count 125
Iterating global reduction 0 with 50 rules applied. Total rules applied 101 place count 61 transition count 125
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 108 place count 54 transition count 110
Iterating global reduction 0 with 7 rules applied. Total rules applied 115 place count 54 transition count 110
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 124 place count 54 transition count 101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 52 transition count 96
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 52 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 131 place count 52 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 132 place count 51 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 51 transition count 91
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 51 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 139 place count 51 transition count 85
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 3 with 2 rules applied. Total rules applied 141 place count 50 transition count 84
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 143 place count 48 transition count 82
Applied a total of 143 rules in 21 ms. Remains 48 /118 variables (removed 70) and now considering 82/229 (removed 147) transitions.
[2024-05-24 03:09:58] [INFO ] Flow matrix only has 74 transitions (discarded 8 similar events)
// Phase 1: matrix 74 rows 48 cols
[2024-05-24 03:09:58] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:09:58] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 03:09:58] [INFO ] Flow matrix only has 74 transitions (discarded 8 similar events)
[2024-05-24 03:09:58] [INFO ] Invariant cache hit.
[2024-05-24 03:09:58] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-24 03:09:58] [INFO ] Redundant transitions in 17 ms returned []
Running 68 sub problems to find dead transitions.
[2024-05-24 03:09:58] [INFO ] Flow matrix only has 74 transitions (discarded 8 similar events)
[2024-05-24 03:09:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 7/48 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2024-05-24 03:09:59] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-24 03:09:59] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-24 03:09:59] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-24 03:09:59] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2024-05-24 03:09:59] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (OVERLAPS) 73/121 variables, 48/62 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 0/121 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/122 variables, and 62 constraints, problems are : Problem set: 0 solved, 68 unsolved in 1046 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 7/48 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (OVERLAPS) 73/121 variables, 48/62 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 68/130 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 0/121 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/122 variables, and 130 constraints, problems are : Problem set: 0 solved, 68 unsolved in 1005 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 5/5 constraints]
After SMT, in 2075ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 2076ms
Starting structural reductions in SI_CTL mode, iteration 1 : 48/118 places, 82/229 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2205 ms. Remains : 48/118 places, 82/229 transitions.
[2024-05-24 03:10:00] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:10:00] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:10:00] [INFO ] Input system was already deterministic with 82 transitions.
[2024-05-24 03:10:01] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:10:01] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:10:01] [INFO ] Time to serialize gal into /tmp/CTLFireability3817662373672820949.gal : 1 ms
[2024-05-24 03:10:01] [INFO ] Time to serialize properties into /tmp/CTLFireability8505375901309379225.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/CTLFireability3817662373672820949.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8505375901309379225.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,282100,0.095223,7624,2,2100,5,17048,6,0,260,18901,0


Converting to forward existential form...Done !
original formula: AF(EG(E((((p24!=1)||(p44!=1))||(p139==1)) U AG(EF((p132==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(E((((p24!=1)||(p44!=1))||(p139==1)) U !(E(TRUE U !(E(TRUE U (p132==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t20, t21...280
(forward)formula 0,0,0.756937,29340,1,0,172,137214,189,79,1982,108927,194
FORMULA HealthRecord-PT-09-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 229/229 transitions.
Graph (trivial) has 131 edges and 118 vertex of which 12 / 118 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 47 place count 66 transition count 134
Iterating global reduction 0 with 46 rules applied. Total rules applied 93 place count 66 transition count 134
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 100 place count 59 transition count 120
Iterating global reduction 0 with 7 rules applied. Total rules applied 107 place count 59 transition count 120
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 113 place count 59 transition count 114
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 115 place count 57 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 57 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 55 transition count 104
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 55 transition count 104
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 127 place count 55 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 130 place count 55 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 134 place count 53 transition count 93
Applied a total of 134 rules in 8 ms. Remains 53 /118 variables (removed 65) and now considering 93/229 (removed 136) transitions.
[2024-05-24 03:10:01] [INFO ] Flow matrix only has 85 transitions (discarded 8 similar events)
// Phase 1: matrix 85 rows 53 cols
[2024-05-24 03:10:01] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:10:01] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 03:10:01] [INFO ] Flow matrix only has 85 transitions (discarded 8 similar events)
[2024-05-24 03:10:01] [INFO ] Invariant cache hit.
[2024-05-24 03:10:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:10:01] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2024-05-24 03:10:01] [INFO ] Redundant transitions in 14 ms returned []
Running 92 sub problems to find dead transitions.
[2024-05-24 03:10:01] [INFO ] Flow matrix only has 85 transitions (discarded 8 similar events)
[2024-05-24 03:10:01] [INFO ] Invariant cache hit.
[2024-05-24 03:10:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-24 03:10:02] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-24 03:10:02] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
[2024-05-24 03:10:02] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 84/137 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 1/138 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 66 constraints, problems are : Problem set: 0 solved, 92 unsolved in 1572 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-24 03:10:03] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:10:03] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:10:03] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-24 03:10:03] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:10:03] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 84/137 variables, 53/70 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 92/162 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 1/138 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 11 (OVERLAPS) 0/138 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 163 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2681 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 8/8 constraints]
After SMT, in 4281ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 4283ms
Starting structural reductions in SI_CTL mode, iteration 1 : 53/118 places, 93/229 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4396 ms. Remains : 53/118 places, 93/229 transitions.
[2024-05-24 03:10:06] [INFO ] Flatten gal took : 10 ms
[2024-05-24 03:10:06] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:10:06] [INFO ] Input system was already deterministic with 93 transitions.
[2024-05-24 03:10:06] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:10:06] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:10:06] [INFO ] Time to serialize gal into /tmp/CTLFireability18376759858174484760.gal : 1 ms
[2024-05-24 03:10:06] [INFO ] Time to serialize properties into /tmp/CTLFireability14611704798699900966.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/CTLFireability18376759858174484760.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14611704798699900966.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,967253,0.148838,10340,2,2019,5,27773,6,0,296,33101,0


Converting to forward existential form...Done !
original formula: EF(((A(((p55==1)&&(p154==1)) U (p3==1)) * (p101==1)) * E((AF((p38==1)) + !(((p67==1) + E((p41==1) U (p29==1))))) U A((p54==1) U (p24!=1))...158
=> equivalent forward existential formula: [((FwdU((FwdU(Init,TRUE) * (!((E(!((p3==1)) U (!(((p55==1)&&(p154==1))) * !((p3==1)))) + EG(!((p3==1))))) * (p10...308
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t17, t18, t19, t20, t30...340
(forward)formula 0,1,5.96863,208656,1,0,575,1.17031e+06,231,287,2157,1.33991e+06,629
FORMULA HealthRecord-PT-09-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 229/229 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 67 transition count 130
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 67 transition count 130
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 108 place count 61 transition count 117
Iterating global reduction 0 with 6 rules applied. Total rules applied 114 place count 61 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 117 place count 61 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 118 place count 60 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 119 place count 60 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 120 place count 59 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 121 place count 59 transition count 109
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 59 transition count 106
Applied a total of 124 rules in 3 ms. Remains 59 /118 variables (removed 59) and now considering 106/229 (removed 123) transitions.
[2024-05-24 03:10:12] [INFO ] Flow matrix only has 103 transitions (discarded 3 similar events)
// Phase 1: matrix 103 rows 59 cols
[2024-05-24 03:10:12] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:10:12] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 03:10:12] [INFO ] Flow matrix only has 103 transitions (discarded 3 similar events)
[2024-05-24 03:10:12] [INFO ] Invariant cache hit.
[2024-05-24 03:10:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:10:12] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-05-24 03:10:12] [INFO ] Flow matrix only has 103 transitions (discarded 3 similar events)
[2024-05-24 03:10:12] [INFO ] Invariant cache hit.
[2024-05-24 03:10:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-24 03:10:12] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:10:12] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-24 03:10:12] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:10:12] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 102/161 variables, 59/72 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (OVERLAPS) 1/162 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/162 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 73 constraints, problems are : Problem set: 0 solved, 105 unsolved in 1944 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-24 03:10:14] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:10:14] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-24 03:10:14] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-24 03:10:14] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:10:14] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-24 03:10:15] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 102/161 variables, 59/78 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 105/183 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 1/162 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (OVERLAPS) 0/162 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 184 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3949 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 10/10 constraints]
After SMT, in 5920ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 5921ms
Starting structural reductions in LTL mode, iteration 1 : 59/118 places, 106/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6011 ms. Remains : 59/118 places, 106/229 transitions.
[2024-05-24 03:10:18] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:10:18] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:10:18] [INFO ] Input system was already deterministic with 106 transitions.
[2024-05-24 03:10:18] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:10:18] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:10:18] [INFO ] Time to serialize gal into /tmp/CTLFireability4247031986127195558.gal : 1 ms
[2024-05-24 03:10:18] [INFO ] Time to serialize properties into /tmp/CTLFireability8552617010522654079.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/CTLFireability4247031986127195558.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8552617010522654079.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.59239e+06,0.129459,9136,2,1521,5,22149,6,0,338,25603,0


Converting to forward existential form...Done !
original formula: EF(!(E(EF(EG((p38==1))) U (((AX((p43==1)) * (((p7!=1)||(p141==1))||(p90==1))) + AF((p138==1))) + (((p17==1)&&(p36==1))&&((p55==1)&&(p150=...164
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(E(TRUE U EG((p38==1))) U (((!(EX(!((p43==1)))) * (((p7!=1)||(p141==1))||(p90==1))) + !(E...234
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...358
(forward)formula 0,1,5.50606,186332,1,0,485,1.13506e+06,248,243,2524,1.10368e+06,528
FORMULA HealthRecord-PT-09-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 229/229 transitions.
Graph (trivial) has 135 edges and 118 vertex of which 12 / 118 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 48 place count 64 transition count 131
Iterating global reduction 0 with 47 rules applied. Total rules applied 95 place count 64 transition count 131
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 102 place count 57 transition count 117
Iterating global reduction 0 with 7 rules applied. Total rules applied 109 place count 57 transition count 117
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 118 place count 57 transition count 108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 56 transition count 105
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 56 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 55 transition count 103
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 55 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 124 place count 55 transition count 101
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 127 place count 55 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 129 place count 54 transition count 97
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 52 transition count 95
Applied a total of 131 rules in 8 ms. Remains 52 /118 variables (removed 66) and now considering 95/229 (removed 134) transitions.
[2024-05-24 03:10:23] [INFO ] Flow matrix only has 87 transitions (discarded 8 similar events)
// Phase 1: matrix 87 rows 52 cols
[2024-05-24 03:10:23] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:10:23] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 03:10:23] [INFO ] Flow matrix only has 87 transitions (discarded 8 similar events)
[2024-05-24 03:10:23] [INFO ] Invariant cache hit.
[2024-05-24 03:10:23] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-24 03:10:23] [INFO ] Redundant transitions in 17 ms returned []
Running 81 sub problems to find dead transitions.
[2024-05-24 03:10:23] [INFO ] Flow matrix only has 87 transitions (discarded 8 similar events)
[2024-05-24 03:10:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 7/52 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-24 03:10:24] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
[2024-05-24 03:10:24] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-24 03:10:24] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-24 03:10:24] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 86/138 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 0/138 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/139 variables, and 65 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1161 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 7/52 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-24 03:10:25] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:10:25] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:10:25] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-24 03:10:25] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-24 03:10:25] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-24 03:10:25] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-24 03:10:25] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:10:25] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 86/138 variables, 52/73 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 81/154 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 12 (OVERLAPS) 0/138 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/139 variables, and 154 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2062 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 12/12 constraints]
After SMT, in 3248ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 3249ms
Starting structural reductions in SI_CTL mode, iteration 1 : 52/118 places, 95/229 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3356 ms. Remains : 52/118 places, 95/229 transitions.
[2024-05-24 03:10:27] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:10:27] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:10:27] [INFO ] Input system was already deterministic with 95 transitions.
[2024-05-24 03:10:27] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:10:27] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:10:27] [INFO ] Time to serialize gal into /tmp/CTLFireability6050274433589852503.gal : 0 ms
[2024-05-24 03:10:27] [INFO ] Time to serialize properties into /tmp/CTLFireability16537449287693095837.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/CTLFireability6050274433589852503.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16537449287693095837.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,458860,0.13884,9036,2,1497,5,20000,6,0,289,27429,0


Converting to forward existential form...Done !
original formula: EG((EG((p33==1)) + E(E(!(EG((p92==1))) U !(AF((p22==1)))) U A(((EF((p34==1)) + ((p17==1)&&(p154==1))) + (p97==1)) U (p9==1)))))
=> equivalent forward existential formula: [FwdG(Init,(EG((p33==1)) + E(E(!(EG((p92==1))) U !(!(EG(!((p22==1)))))) U !((E(!((p9==1)) U (!(((E(TRUE U (p34==...243
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...390
(forward)formula 0,1,7.23663,248632,1,0,817,1.44618e+06,238,472,2173,1.59209e+06,902
FORMULA HealthRecord-PT-09-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-24 03:10:34] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:10:34] [INFO ] Flatten gal took : 5 ms
Total runtime 198157 ms.

BK_STOP 1716520234541

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

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