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.r356-tall-171683762200938.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 ShieldRVt-PT-004B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683762200938
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 21:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 11 21:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 21:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 11 21:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 48K May 18 16:43 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 ShieldRVt-PT-004B-CTLFireability-2024-00
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-2024-01
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-2024-02
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-2024-03
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-2024-04
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-2024-05
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-2024-06
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-2024-07
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-2024-08
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-2024-09
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-2024-10
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-2024-11
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-2023-12
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-2023-13
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-2023-14
FORMULA_NAME ShieldRVt-PT-004B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717075779184

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-004B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-30 13:29:40] [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-30 13:29:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 13:29:40] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-05-30 13:29:40] [INFO ] Transformed 203 places.
[2024-05-30 13:29:40] [INFO ] Transformed 203 transitions.
[2024-05-30 13:29:40] [INFO ] Found NUPN structural information;
[2024-05-30 13:29:40] [INFO ] Parsed PT model containing 203 places and 203 transitions and 478 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 113 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 203/203 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 195 transition count 195
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 195 transition count 195
Applied a total of 16 rules in 29 ms. Remains 195 /203 variables (removed 8) and now considering 195/203 (removed 8) transitions.
// Phase 1: matrix 195 rows 195 cols
[2024-05-30 13:29:40] [INFO ] Computed 17 invariants in 19 ms
[2024-05-30 13:29:40] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-30 13:29:40] [INFO ] Invariant cache hit.
[2024-05-30 13:29:40] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2024-05-30 13:29:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-30 13:29:42] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 20 ms to minimize.
[2024-05-30 13:29:43] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
[2024-05-30 13:29:43] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-05-30 13:29:43] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:29:43] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:29:43] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 0 ms to minimize.
[2024-05-30 13:29:43] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:29:43] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:29:43] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 3 ms to minimize.
[2024-05-30 13:29:43] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:29:43] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:29:43] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:29:43] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:29:44] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:29:44] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:29:44] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:29:44] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:29:44] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:29:44] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:29:44] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-30 13:29:44] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 2 ms to minimize.
[2024-05-30 13:29:44] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:29:44] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-30 13:29:44] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:29:45] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:29:45] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-30 13:29:46] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:29:46] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:29:46] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-30 13:29:47] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:29:47] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-30 13:29:47] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-30 13:29:48] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:29:48] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:29:48] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:29:48] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:29:48] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-30 13:29:49] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (OVERLAPS) 195/390 variables, 195/250 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-30 13:29:51] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:29:51] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 2 ms to minimize.
[2024-05-30 13:29:51] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:29:51] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:29:51] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:29:52] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:29:52] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:29:52] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2024-05-30 13:29:52] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:29:52] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:29:52] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:29:52] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:29:52] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 13/263 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-30 13:29:53] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-30 13:29:56] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/390 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 15 (OVERLAPS) 0/390 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 265 constraints, problems are : Problem set: 0 solved, 194 unsolved in 19182 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (OVERLAPS) 1/195 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 53/70 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 195/390 variables, 195/265 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 194/459 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-30 13:30:01] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 2 ms to minimize.
[2024-05-30 13:30:02] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:30:02] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:30:02] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 2 ms to minimize.
[2024-05-30 13:30:02] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:30:02] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 2 ms to minimize.
[2024-05-30 13:30:02] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:30:02] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:30:02] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:30:02] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:30:03] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
[2024-05-30 13:30:03] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:30:03] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:30:03] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:30:03] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
[2024-05-30 13:30:03] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-30 13:30:03] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 2 ms to minimize.
[2024-05-30 13:30:03] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:30:03] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:30:03] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 20/479 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-30 13:30:04] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:30:05] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:30:05] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:30:05] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:30:05] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:30:06] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 0 ms to minimize.
[2024-05-30 13:30:06] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:30:06] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-30 13:30:06] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:30:06] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-30 13:30:06] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:30:06] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:30:06] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:30:06] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/390 variables, 14/493 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-30 13:30:08] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 2 ms to minimize.
[2024-05-30 13:30:08] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:30:08] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 2 ms to minimize.
[2024-05-30 13:30:09] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:30:09] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:30:09] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:30:09] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:30:09] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:30:09] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:30:10] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:30:10] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 11/504 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-30 13:30:12] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-30 13:30:15] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:30:17] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:30:17] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:30:17] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:30:17] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:30:17] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 6/511 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-30 13:30:19] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:30:19] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:30:19] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:30:19] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-05-30 13:30:20] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 5/516 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-30 13:30:23] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 1/517 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 194 unsolved
[2024-05-30 13:30:29] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 390/390 variables, and 518 constraints, problems are : Problem set: 0 solved, 194 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 112/112 constraints]
After SMT, in 49259ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 49278ms
Starting structural reductions in LTL mode, iteration 1 : 195/203 places, 195/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49733 ms. Remains : 195/203 places, 195/203 transitions.
Support contains 113 out of 195 places after structural reductions.
[2024-05-30 13:30:30] [INFO ] Flatten gal took : 34 ms
[2024-05-30 13:30:30] [INFO ] Flatten gal took : 13 ms
[2024-05-30 13:30:30] [INFO ] Input system was already deterministic with 195 transitions.
Support contains 111 out of 195 places (down from 113) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 78 to 77
RANDOM walk for 40000 steps (10 resets) in 1744 ms. (22 steps per ms) remains 7/77 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 141 ms. (281 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 85 ms. (465 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 57 ms. (689 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 72 ms. (547 steps per ms) remains 4/5 properties
[2024-05-30 13:30:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp56 is UNSAT
At refinement iteration 1 (OVERLAPS) 106/119 variables, 10/10 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-30 13:30:31] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:30:31] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 2/12 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/195 variables, 7/19 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-30 13:30:31] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:30:31] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:30:31] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:30:31] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:30:31] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:30:31] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 6/25 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/25 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 195/390 variables, 195/220 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-30 13:30:31] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:30:31] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:30:31] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:30:31] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 4/224 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 0/224 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/390 variables, 0/224 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 224 constraints, problems are : Problem set: 3 solved, 1 unsolved in 646 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/45 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 150/195 variables, 14/17 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 12/29 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-30 13:30:32] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:30:32] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 2/31 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/31 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 195/390 variables, 195/226 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 1/227 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-30 13:30:32] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 1/228 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/228 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/390 variables, 0/228 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 228 constraints, problems are : Problem set: 3 solved, 1 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 195/195 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 15/15 constraints]
After SMT, in 885ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 4 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 195/195 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 195 transition count 136
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 136 transition count 136
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 118 place count 136 transition count 118
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 154 place count 118 transition count 118
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 176 place count 96 transition count 96
Iterating global reduction 2 with 22 rules applied. Total rules applied 198 place count 96 transition count 96
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 198 place count 96 transition count 86
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 218 place count 86 transition count 86
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 286 place count 52 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 287 place count 52 transition count 51
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 289 place count 51 transition count 50
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 309 place count 41 transition count 58
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 310 place count 41 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 311 place count 40 transition count 56
Applied a total of 311 rules in 33 ms. Remains 40 /195 variables (removed 155) and now considering 56/195 (removed 139) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 40/195 places, 56/195 transitions.
RANDOM walk for 40000 steps (26 resets) in 314 ms. (126 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Probably explored full state space saw : 261993 states, properties seen :0
Probabilistic random walk after 2357985 steps, saw 261993 distinct states, run finished after 2161 ms. (steps per millisecond=1091 ) properties seen :0
Explored full state space saw : 262153 states, properties seen :0
Exhaustive walk after 2359320 steps, saw 262153 distinct states, run finished after 1905 ms. (steps per millisecond=1238 ) properties seen :0
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2024-05-30 13:30:36] [INFO ] Flatten gal took : 10 ms
[2024-05-30 13:30:36] [INFO ] Flatten gal took : 9 ms
[2024-05-30 13:30:36] [INFO ] Input system was already deterministic with 195 transitions.
Support contains 99 out of 195 places (down from 100) after GAL structural reductions.
Computed a total of 62 stabilizing places and 62 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 195/195 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 162 transition count 162
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 162 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 161 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 161 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 160 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 160 transition count 160
Applied a total of 70 rules in 18 ms. Remains 160 /195 variables (removed 35) and now considering 160/195 (removed 35) transitions.
// Phase 1: matrix 160 rows 160 cols
[2024-05-30 13:30:36] [INFO ] Computed 17 invariants in 3 ms
[2024-05-30 13:30:36] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-30 13:30:36] [INFO ] Invariant cache hit.
[2024-05-30 13:30:36] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2024-05-30 13:30:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:30:37] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:30:37] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:30:37] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:30:37] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:30:37] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:30:38] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/320 variables, 160/183 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (OVERLAPS) 0/320 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 183 constraints, problems are : Problem set: 0 solved, 159 unsolved in 4497 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/320 variables, 160/183 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 159/342 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:30:42] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:30:42] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:30:42] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:30:42] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:30:42] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:30:42] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2024-05-30 13:30:42] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:30:42] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 2 ms to minimize.
[2024-05-30 13:30:42] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:30:43] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 2 ms to minimize.
[2024-05-30 13:30:43] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:30:43] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:30:43] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:30:43] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:30:43] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:30:43] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:30:43] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:30:43] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:30:43] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:30:43] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 20/362 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:30:44] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:30:44] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:30:44] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:30:44] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:30:44] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:30:45] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 6 ms to minimize.
[2024-05-30 13:30:45] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:30:45] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:30:45] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 2 ms to minimize.
[2024-05-30 13:30:45] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 10/372 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:30:46] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:30:46] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:30:47] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:30:47] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 4/376 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:30:48] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:30:48] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:30:50] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:30:54] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/320 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/320 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:30:58] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/320 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/320 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:31:02] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/320 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:31:03] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/320 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:31:05] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/320 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:31:08] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/320 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/320 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 320/320 variables, and 385 constraints, problems are : Problem set: 0 solved, 159 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 49/49 constraints]
After SMT, in 34522ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 34525ms
Starting structural reductions in LTL mode, iteration 1 : 160/195 places, 160/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34694 ms. Remains : 160/195 places, 160/195 transitions.
[2024-05-30 13:31:11] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:31:11] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:31:11] [INFO ] Input system was already deterministic with 160 transitions.
[2024-05-30 13:31:11] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:31:11] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:31:11] [INFO ] Time to serialize gal into /tmp/CTLFireability18243851492460831218.gal : 6 ms
[2024-05-30 13:31:11] [INFO ] Time to serialize properties into /tmp/CTLFireability9763154142923382794.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/CTLFireability18243851492460831218.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9763154142923382794.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,4.45381e+14,0.664144,28620,2,1562,5,73612,6,0,802,174060,0


Converting to forward existential form...Done !
original formula: A(AX(FALSE) U ((!(AG(((((p137==1)&&(p21==1))||(p126==1))||(p84==1)))) * (p59==1)) * (p146!=1)))
=> equivalent forward existential formula: [((Init * !(EG(!(((!(!(E(TRUE U !(((((p137==1)&&(p21==1))||(p126==1))||(p84==1)))))) * (p59==1)) * (p146!=1)))))...392
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t41, t46, t50, t55, t59, t62, t66, t72, t76, ...351
Detected timeout of ITS tools.
[2024-05-30 13:31:41] [INFO ] Flatten gal took : 14 ms
[2024-05-30 13:31:41] [INFO ] Applying decomposition
[2024-05-30 13:31:41] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11104350237912880810.txt' '-o' '/tmp/graph11104350237912880810.bin' '-w' '/tmp/graph11104350237912880810.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11104350237912880810.bin' '-l' '-1' '-v' '-w' '/tmp/graph11104350237912880810.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:31:41] [INFO ] Decomposing Gal with order
[2024-05-30 13:31:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:31:41] [INFO ] Removed a total of 39 redundant transitions.
[2024-05-30 13:31:41] [INFO ] Flatten gal took : 61 ms
[2024-05-30 13:31:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-30 13:31:41] [INFO ] Time to serialize gal into /tmp/CTLFireability14689920308238954347.gal : 17 ms
[2024-05-30 13:31:41] [INFO ] Time to serialize properties into /tmp/CTLFireability8124478100599530643.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/CTLFireability14689920308238954347.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8124478100599530643.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.45381e+14,0.077859,6972,376,23,6827,264,330,9787,38,505,0


Converting to forward existential form...Done !
original formula: A(AX(FALSE) U ((!(AG(((((i12.u47.p137==1)&&(i1.u8.p21==1))||(i11.u43.p126==1))||(i7.u31.p84==1)))) * (i0.i2.u21.p59==1)) * (i13.u51.p146!...160
=> equivalent forward existential formula: [((Init * !(EG(!(((!(!(E(TRUE U !(((((i12.u47.p137==1)&&(i1.u8.p21==1))||(i11.u43.p126==1))||(i7.u31.p84==1)))))...533
Reverse transition relation is NOT exact ! Due to transitions t145, t150, i0.i0.u2.t141, i1.t139, i1.u8.t134, i2.t130, i3.t117, i3.u16.t121, i4.t112, i4.u1...531
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 195/195 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 163 transition count 163
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 163 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 162 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 162 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 161 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 161 transition count 161
Applied a total of 68 rules in 17 ms. Remains 161 /195 variables (removed 34) and now considering 161/195 (removed 34) transitions.
// Phase 1: matrix 161 rows 161 cols
[2024-05-30 13:32:11] [INFO ] Computed 17 invariants in 6 ms
[2024-05-30 13:32:11] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-30 13:32:11] [INFO ] Invariant cache hit.
[2024-05-30 13:32:11] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2024-05-30 13:32:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-30 13:32:12] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:32:12] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:32:13] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-30 13:32:13] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:32:13] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-30 13:32:13] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:32:13] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:32:13] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:32:13] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:32:13] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-30 13:32:13] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:32:13] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 161/322 variables, 161/190 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/322 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 190 constraints, problems are : Problem set: 0 solved, 160 unsolved in 4688 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 161/322 variables, 161/190 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 160/350 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-30 13:32:17] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:32:17] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:32:18] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:32:18] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:32:18] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:32:18] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:32:18] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:32:18] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:32:18] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:32:18] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:32:18] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:32:18] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:32:18] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:32:19] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 14/364 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-30 13:32:20] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:32:20] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:32:20] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:32:20] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:32:20] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:32:20] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:32:21] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:32:21] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 8/372 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-30 13:32:22] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:32:22] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:32:22] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-30 13:32:24] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:32:24] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:32:24] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:32:24] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:32:24] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:32:25] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 6/381 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-30 13:32:26] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-30 13:32:28] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:32:28] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:32:28] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/322 variables, 3/385 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-30 13:32:30] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:32:30] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 2/387 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-30 13:32:32] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:32:32] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:32:32] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:32:32] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:32:32] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 5/392 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-30 13:32:34] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:32:34] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 2/394 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/322 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 16 (OVERLAPS) 0/322 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 394 constraints, problems are : Problem set: 0 solved, 160 unsolved in 24657 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 56/56 constraints]
After SMT, in 29359ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 29361ms
Starting structural reductions in LTL mode, iteration 1 : 161/195 places, 161/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29661 ms. Remains : 161/195 places, 161/195 transitions.
[2024-05-30 13:32:41] [INFO ] Flatten gal took : 16 ms
[2024-05-30 13:32:41] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:32:41] [INFO ] Input system was already deterministic with 161 transitions.
[2024-05-30 13:32:41] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:32:41] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:32:41] [INFO ] Time to serialize gal into /tmp/CTLFireability6653988347950070676.gal : 1 ms
[2024-05-30 13:32:41] [INFO ] Time to serialize properties into /tmp/CTLFireability14536825000951203294.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/CTLFireability6653988347950070676.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14536825000951203294.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,4.97353e+14,0.708754,31892,2,1881,5,80913,6,0,807,201211,0


Converting to forward existential form...Done !
original formula: E((p18==1) U (!(EX(AG((p122!=1)))) + (A(!(((p88==1)&&((p44==1)||(p94==1)))) U (p139==1)) * (E(AG((p82==1)) U E((p133==1) U (p17==1))) + (...166
=> equivalent forward existential formula: ([(FwdU(Init,(p18==1)) * !(EX(!(E(TRUE U !((p122!=1)))))))] != FALSE + ([(FwdU(FwdU((FwdU(Init,(p18==1)) * !((E(...457
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t45, t50, t52, t53, t56, t62, t64, t68, t74, ...375
Hit Full ! (commute/partial/dont) 159/0/2
(forward)formula 0,1,11.1062,345876,1,0,387,1.79456e+06,351,197,4513,2.30294e+06,417
FORMULA ShieldRVt-PT-004B-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 195/195 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 160 transition count 160
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 160 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 159 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 159 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 158 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 158 transition count 158
Applied a total of 74 rules in 10 ms. Remains 158 /195 variables (removed 37) and now considering 158/195 (removed 37) transitions.
// Phase 1: matrix 158 rows 158 cols
[2024-05-30 13:32:52] [INFO ] Computed 17 invariants in 2 ms
[2024-05-30 13:32:52] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-30 13:32:52] [INFO ] Invariant cache hit.
[2024-05-30 13:32:52] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2024-05-30 13:32:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:32:53] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:32:53] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:32:53] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:32:53] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:32:54] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:32:54] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:32:54] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 158/316 variables, 158/182 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 0/316 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 182 constraints, problems are : Problem set: 0 solved, 157 unsolved in 4451 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:32:57] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:32:57] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:32:58] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 158/316 variables, 158/185 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 157/342 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:32:59] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:32:59] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:32:59] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:32:59] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:32:59] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-05-30 13:32:59] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:32:59] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:32:59] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:33:00] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:33:00] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2024-05-30 13:33:00] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-30 13:33:00] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:33:00] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 13/355 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:33:01] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:33:01] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:33:01] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:33:01] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:33:01] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:33:01] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:33:01] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:33:01] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-30 13:33:02] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:33:02] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:33:02] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 11/366 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:33:03] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:33:03] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:33:03] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:33:03] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-30 13:33:03] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:33:04] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 6/372 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:33:07] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/316 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:33:09] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/316 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:33:11] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:33:11] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/316 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/316 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 16 (OVERLAPS) 0/316 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 376 constraints, problems are : Problem set: 0 solved, 157 unsolved in 19020 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 44/44 constraints]
After SMT, in 23484ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 23486ms
Starting structural reductions in LTL mode, iteration 1 : 158/195 places, 158/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23644 ms. Remains : 158/195 places, 158/195 transitions.
[2024-05-30 13:33:16] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:33:16] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:33:16] [INFO ] Input system was already deterministic with 158 transitions.
[2024-05-30 13:33:16] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:33:16] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:33:16] [INFO ] Time to serialize gal into /tmp/CTLFireability16037174845764504777.gal : 1 ms
[2024-05-30 13:33:16] [INFO ] Time to serialize properties into /tmp/CTLFireability9793122747587345728.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/CTLFireability16037174845764504777.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9793122747587345728.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.56832e+14,0.589848,27968,2,1646,5,73297,6,0,792,168502,0


Converting to forward existential form...Done !
original formula: (EX(AG((((p30!=1)||(p49!=1))&&((p177!=1)||(p196!=1))))) + EF((p144==1)))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U !((((p30!=1)||(p49!=1))&&((p177!=1)||(p196!=1)))))))] != FALSE + [(FwdU(Init,TRUE) * (p...174
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t41, t43, t46, t50, t55, t59, t62, t66, t72, t76, ...352
(forward)formula 0,1,16.5286,530496,1,0,353,2.68282e+06,339,183,4446,3.69945e+06,376
FORMULA ShieldRVt-PT-004B-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 195/195 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 194 transition count 135
Reduce places removed 59 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 60 rules applied. Total rules applied 119 place count 135 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 120 place count 134 transition count 134
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 120 place count 134 transition count 117
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 154 place count 117 transition count 117
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 177 place count 94 transition count 94
Iterating global reduction 3 with 23 rules applied. Total rules applied 200 place count 94 transition count 94
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 200 place count 94 transition count 84
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 220 place count 84 transition count 84
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 274 place count 57 transition count 57
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 275 place count 57 transition count 57
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 277 place count 55 transition count 55
Applied a total of 277 rules in 29 ms. Remains 55 /195 variables (removed 140) and now considering 55/195 (removed 140) transitions.
// Phase 1: matrix 55 rows 55 cols
[2024-05-30 13:33:32] [INFO ] Computed 17 invariants in 0 ms
[2024-05-30 13:33:32] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-30 13:33:32] [INFO ] Invariant cache hit.
[2024-05-30 13:33:33] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-30 13:33:33] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2024-05-30 13:33:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 55/110 variables, 55/72 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 0/110 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 72 constraints, problems are : Problem set: 0 solved, 53 unsolved in 681 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 55/110 variables, 55/72 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 53/125 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/110 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 125 constraints, problems are : Problem set: 0 solved, 53 unsolved in 581 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
After SMT, in 1268ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 1268ms
Starting structural reductions in SI_CTL mode, iteration 1 : 55/195 places, 55/195 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1397 ms. Remains : 55/195 places, 55/195 transitions.
[2024-05-30 13:33:34] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:33:34] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:33:34] [INFO ] Input system was already deterministic with 55 transitions.
[2024-05-30 13:33:34] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:33:34] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:33:34] [INFO ] Time to serialize gal into /tmp/CTLFireability5736783158894460712.gal : 0 ms
[2024-05-30 13:33:34] [INFO ] Time to serialize properties into /tmp/CTLFireability4703926705633722787.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/CTLFireability5736783158894460712.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4703926705633722787.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.91319e+08,0.01818,4068,2,140,5,3131,6,0,277,3859,0


Converting to forward existential form...Done !
original formula: AG((E(!(E((p107==1) U (p163==1))) U (p171!=1)) + (p199==0)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((p199==0))) * !(E(!(E((p107==1) U (p163==1))) U (p171!=1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t11, t13, t14, t21, t24, t26, t28, t34, t48, Intersection with reachable at each step en...209
(forward)formula 0,0,0.048048,5652,1,0,190,10509,136,98,1695,10596,200
FORMULA ShieldRVt-PT-004B-CTLFireability-2024-03 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 : 195/195 places, 195/195 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 160 transition count 160
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 160 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 159 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 159 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 158 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 158 transition count 158
Applied a total of 74 rules in 9 ms. Remains 158 /195 variables (removed 37) and now considering 158/195 (removed 37) transitions.
// Phase 1: matrix 158 rows 158 cols
[2024-05-30 13:33:34] [INFO ] Computed 17 invariants in 1 ms
[2024-05-30 13:33:34] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-30 13:33:34] [INFO ] Invariant cache hit.
[2024-05-30 13:33:34] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2024-05-30 13:33:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:33:35] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:33:35] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:33:35] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:33:35] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:33:35] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 158/316 variables, 158/180 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 0/316 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 180 constraints, problems are : Problem set: 0 solved, 157 unsolved in 4365 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 158/316 variables, 158/180 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 157/337 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:33:40] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:33:40] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:33:40] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:33:40] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:33:40] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:33:40] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:33:40] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-30 13:33:40] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:33:40] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:33:40] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:33:40] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:33:40] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:33:40] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 2 ms to minimize.
[2024-05-30 13:33:41] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:33:41] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:33:41] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-05-30 13:33:41] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:33:41] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:33:41] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 19/356 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:33:42] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2024-05-30 13:33:42] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:33:42] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:33:43] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:33:43] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:33:43] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-30 13:33:43] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:33:43] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:33:43] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:33:43] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 10/366 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:33:45] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:33:46] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:33:46] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:33:47] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:33:47] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 4/371 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:33:48] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2024-05-30 13:33:49] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-30 13:33:49] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 3/374 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:33:50] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:33:51] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 2/376 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:33:52] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/316 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:33:55] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/316 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:33:57] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2024-05-30 13:33:57] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:33:57] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/316 variables, 3/381 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:33:58] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/316 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:34:01] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/316 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/316 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 18 (OVERLAPS) 0/316 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 383 constraints, problems are : Problem set: 0 solved, 157 unsolved in 27723 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 51/51 constraints]
After SMT, in 32102ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 32103ms
Starting structural reductions in LTL mode, iteration 1 : 158/195 places, 158/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32457 ms. Remains : 158/195 places, 158/195 transitions.
[2024-05-30 13:34:06] [INFO ] Flatten gal took : 9 ms
[2024-05-30 13:34:06] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:34:06] [INFO ] Input system was already deterministic with 158 transitions.
[2024-05-30 13:34:06] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:34:06] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:34:06] [INFO ] Time to serialize gal into /tmp/CTLFireability10052925814196865671.gal : 2 ms
[2024-05-30 13:34:06] [INFO ] Time to serialize properties into /tmp/CTLFireability17869950304923455307.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/CTLFireability10052925814196865671.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17869950304923455307.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,3.6945e+14,0.541264,24116,2,1374,5,63304,6,0,792,137986,0


Converting to forward existential form...Done !
original formula: AG(EF(((AX((p31==0)) + (p186==0)) + (((p140==1)&&(p152==1))&&(p184==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((!(EX(!((p31==0)))) + (p186==0)) + (((p140==1)&&(p152==1))&&(p184==1))))))] = FA...158
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t45, t49, t54, t58, t61, t65, t71, t75, t80, ...347
(forward)formula 0,1,1.07905,34884,1,0,313,162622,340,164,4431,162729,332
FORMULA ShieldRVt-PT-004B-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 195/195 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 163 transition count 163
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 163 transition count 163
Applied a total of 64 rules in 5 ms. Remains 163 /195 variables (removed 32) and now considering 163/195 (removed 32) transitions.
// Phase 1: matrix 163 rows 163 cols
[2024-05-30 13:34:07] [INFO ] Computed 17 invariants in 0 ms
[2024-05-30 13:34:08] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-30 13:34:08] [INFO ] Invariant cache hit.
[2024-05-30 13:34:08] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-30 13:34:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-30 13:34:09] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:34:09] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:34:09] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-30 13:34:09] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:34:09] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:34:09] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:34:09] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:34:09] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 163/326 variables, 163/188 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/326 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 188 constraints, problems are : Problem set: 0 solved, 162 unsolved in 4613 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 163/326 variables, 163/188 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 162/350 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-30 13:34:13] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:34:14] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:34:14] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:34:14] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:34:14] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:34:14] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:34:14] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:34:14] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:34:14] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:34:14] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:34:14] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-05-30 13:34:15] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2024-05-30 13:34:15] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:34:15] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:34:15] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:34:15] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-30 13:34:15] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:34:15] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:34:15] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 19/369 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-30 13:34:16] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:34:16] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:34:16] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:34:17] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
[2024-05-30 13:34:17] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-30 13:34:17] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:34:17] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:34:17] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 8/377 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-30 13:34:18] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:34:18] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 2/379 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-30 13:34:20] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-30 13:34:22] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-30 13:34:23] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:34:23] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:34:23] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:34:24] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:34:24] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:34:24] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 6/387 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-30 13:34:25] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 14 (OVERLAPS) 0/326 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 388 constraints, problems are : Problem set: 0 solved, 162 unsolved in 18692 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 46/46 constraints]
After SMT, in 23318ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 23321ms
Starting structural reductions in LTL mode, iteration 1 : 163/195 places, 163/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23479 ms. Remains : 163/195 places, 163/195 transitions.
[2024-05-30 13:34:31] [INFO ] Flatten gal took : 15 ms
[2024-05-30 13:34:31] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:34:31] [INFO ] Input system was already deterministic with 163 transitions.
[2024-05-30 13:34:31] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:34:31] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:34:31] [INFO ] Time to serialize gal into /tmp/CTLFireability9548480125669725808.gal : 2 ms
[2024-05-30 13:34:31] [INFO ] Time to serialize properties into /tmp/CTLFireability674511880283704793.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/CTLFireability9548480125669725808.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability674511880283704793.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.99038e+14,0.729824,30392,2,1472,5,76839,6,0,817,188400,0


Converting to forward existential form...Done !
original formula: (AX(((EF((p17==1)) * ((p197==0)||(p161==0))) * ((p159==0)||(p97==0)))) * AX(A((p17==1) U EF((((p177==1)&&(p196==1))&&((p180==1)||(p123==1...162
=> equivalent forward existential formula: ((([(EY(Init) * !(E(TRUE U (p17==1))))] = FALSE * [(EY(Init) * !(((p197==0)||(p161==0))))] = FALSE) * [(EY(Init)...456
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t33, t34, t36, t40, t44, t49, t53, t58, t62, t63, t66, t70, ...362
(forward)formula 0,1,27.4382,845788,1,0,521,4.4124e+06,363,241,4579,5.86634e+06,571
FORMULA ShieldRVt-PT-004B-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 195/195 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 167 transition count 167
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 167 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 166 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 166 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 165 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 165 transition count 165
Applied a total of 60 rules in 5 ms. Remains 165 /195 variables (removed 30) and now considering 165/195 (removed 30) transitions.
// Phase 1: matrix 165 rows 165 cols
[2024-05-30 13:34:59] [INFO ] Computed 17 invariants in 1 ms
[2024-05-30 13:34:59] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-30 13:34:59] [INFO ] Invariant cache hit.
[2024-05-30 13:34:59] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-05-30 13:34:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-30 13:35:00] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:35:00] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:35:00] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-30 13:35:00] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:35:00] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:35:00] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:35:00] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 165/330 variables, 165/189 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/330 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 189 constraints, problems are : Problem set: 0 solved, 164 unsolved in 4803 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-30 13:35:04] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 165/330 variables, 165/190 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 164/354 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-30 13:35:05] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:35:05] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:35:05] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:35:05] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:35:05] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:35:06] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:35:06] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:35:06] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:35:06] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:35:06] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:35:06] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:35:06] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-30 13:35:07] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:35:07] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:35:07] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 15/369 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-30 13:35:08] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:35:08] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:35:08] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:35:08] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:35:08] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:35:08] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:35:09] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/330 variables, 7/376 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-30 13:35:10] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:35:10] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:35:10] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:35:10] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:35:10] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:35:10] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:35:11] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/330 variables, 7/383 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-30 13:35:13] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:35:13] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/330 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/330 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-30 13:35:17] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/330 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/330 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 14 (OVERLAPS) 0/330 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 386 constraints, problems are : Problem set: 0 solved, 164 unsolved in 22059 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 40/40 constraints]
After SMT, in 26873ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 26874ms
Starting structural reductions in LTL mode, iteration 1 : 165/195 places, 165/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27025 ms. Remains : 165/195 places, 165/195 transitions.
[2024-05-30 13:35:26] [INFO ] Flatten gal took : 11 ms
[2024-05-30 13:35:26] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:35:26] [INFO ] Input system was already deterministic with 165 transitions.
[2024-05-30 13:35:26] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:35:26] [INFO ] Flatten gal took : 16 ms
[2024-05-30 13:35:26] [INFO ] Time to serialize gal into /tmp/CTLFireability6477071441348843621.gal : 2 ms
[2024-05-30 13:35:26] [INFO ] Time to serialize properties into /tmp/CTLFireability2276292836918266189.ctl : 3 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/CTLFireability6477071441348843621.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2276292836918266189.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,5.37835e+14,0.715758,31284,2,1659,5,81589,6,0,827,191608,0


Converting to forward existential form...Done !
original formula: EF((E(!(AG(((p164==1)&&(p78==1)))) U (((E((p101==1) U (p22==1)) * (p190==1)) + (((p130==1)||(p172==1))&&(p175!=1))) * EX((p95==1)))) + (E...332
=> equivalent forward existential formula: ([(EY((FwdU(FwdU(Init,TRUE),!(!(E(TRUE U !(((p164==1)&&(p78==1))))))) * ((E((p101==1) U (p22==1)) * (p190==1)) +...707
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t13, t18, t22, t26, t27, t31, t32, t38, t42, t48, t53, t57, t61, t64, t68, t74, t79, ...375
(forward)formula 0,1,1.69819,53076,1,0,368,257435,361,188,4938,308682,391
FORMULA ShieldRVt-PT-004B-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 195/195 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 194 transition count 141
Reduce places removed 53 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 55 rules applied. Total rules applied 108 place count 141 transition count 139
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 110 place count 139 transition count 139
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 110 place count 139 transition count 120
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 148 place count 120 transition count 120
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 169 place count 99 transition count 99
Iterating global reduction 3 with 21 rules applied. Total rules applied 190 place count 99 transition count 99
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 190 place count 99 transition count 92
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 204 place count 92 transition count 92
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 260 place count 64 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 261 place count 64 transition count 63
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 263 place count 63 transition count 62
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 265 place count 61 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 266 place count 60 transition count 60
Applied a total of 266 rules in 23 ms. Remains 60 /195 variables (removed 135) and now considering 60/195 (removed 135) transitions.
// Phase 1: matrix 60 rows 60 cols
[2024-05-30 13:35:27] [INFO ] Computed 16 invariants in 0 ms
[2024-05-30 13:35:27] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-30 13:35:27] [INFO ] Invariant cache hit.
[2024-05-30 13:35:28] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-05-30 13:35:28] [INFO ] Redundant transitions in 0 ms returned []
Running 56 sub problems to find dead transitions.
[2024-05-30 13:35:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 3/60 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-30 13:35:28] [INFO ] Deduced a trap composed of 7 places in 13 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 60/120 variables, 60/77 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-30 13:35:28] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 78 constraints, problems are : Problem set: 0 solved, 56 unsolved in 815 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (OVERLAPS) 3/60 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 60/120 variables, 60/78 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 56/134 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-30 13:35:29] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 135 constraints, problems are : Problem set: 0 solved, 56 unsolved in 813 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 3/3 constraints]
After SMT, in 1634ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 1634ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/195 places, 60/195 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1764 ms. Remains : 60/195 places, 60/195 transitions.
[2024-05-30 13:35:29] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:35:29] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:35:29] [INFO ] Input system was already deterministic with 60 transitions.
[2024-05-30 13:35:29] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:35:29] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:35:29] [INFO ] Time to serialize gal into /tmp/CTLFireability12078818572594438135.gal : 0 ms
[2024-05-30 13:35:29] [INFO ] Time to serialize properties into /tmp/CTLFireability15815662525106230758.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/CTLFireability12078818572594438135.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15815662525106230758.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,3.19903e+08,0.045468,5412,2,298,5,7112,6,0,300,12649,0


Converting to forward existential form...Done !
original formula: !(E(E(!(((p35==1)||(p149==1))) U ((((AG((p59==1)) + (p67!=1)) + ((p193==1)||(p119==1))) * (p79==1)) * (p98==1))) U (p43==1)))
=> equivalent forward existential formula: [(FwdU(Init,E(!(((p35==1)||(p149==1))) U ((((!(E(TRUE U !((p59==1)))) + (p67!=1)) + ((p193==1)||(p119==1))) * (p...197
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t5, t7, t8, t12, t15, t16, t21, t26, t29, t31, t34, t37, t38, t42, t44, t48, t49, t52...255
(forward)formula 0,0,15.3469,539676,1,0,494,2.27513e+06,156,324,1872,5.24532e+06,573
FORMULA ShieldRVt-PT-004B-CTLFireability-2024-07 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 : 195/195 places, 195/195 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 162 transition count 162
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 162 transition count 162
Applied a total of 66 rules in 3 ms. Remains 162 /195 variables (removed 33) and now considering 162/195 (removed 33) transitions.
// Phase 1: matrix 162 rows 162 cols
[2024-05-30 13:35:45] [INFO ] Computed 17 invariants in 2 ms
[2024-05-30 13:35:45] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-30 13:35:45] [INFO ] Invariant cache hit.
[2024-05-30 13:35:45] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2024-05-30 13:35:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-30 13:35:46] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-05-30 13:35:46] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:35:46] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:35:46] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:35:46] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/324 variables, 162/184 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/324 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 184 constraints, problems are : Problem set: 0 solved, 161 unsolved in 4461 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-30 13:35:50] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 162/324 variables, 162/185 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 161/346 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-30 13:35:51] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 2 ms to minimize.
[2024-05-30 13:35:51] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:35:51] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:35:51] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:35:51] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:35:51] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:35:52] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 0 ms to minimize.
[2024-05-30 13:35:52] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:35:52] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:35:52] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:35:52] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 0 ms to minimize.
[2024-05-30 13:35:52] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2024-05-30 13:35:52] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:35:52] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-05-30 13:35:52] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:35:52] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:35:52] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:35:52] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-30 13:35:53] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-05-30 13:35:53] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 20/366 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-30 13:35:53] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:35:53] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:35:53] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:35:54] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2024-05-30 13:35:54] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:35:54] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:35:54] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:35:54] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:35:54] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:35:54] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:35:54] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:35:55] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:35:55] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:35:55] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 14/380 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-30 13:35:56] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:35:56] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:35:56] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:35:56] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:35:57] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-05-30 13:35:57] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 6/386 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-30 13:35:58] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:35:58] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/324 variables, 2/388 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-30 13:36:00] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:36:01] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/324 variables, 2/390 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/324 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 13 (OVERLAPS) 0/324 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 390 constraints, problems are : Problem set: 0 solved, 161 unsolved in 17016 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 50/50 constraints]
After SMT, in 21489ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 21490ms
Starting structural reductions in LTL mode, iteration 1 : 162/195 places, 162/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21633 ms. Remains : 162/195 places, 162/195 transitions.
[2024-05-30 13:36:06] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:36:06] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:36:06] [INFO ] Input system was already deterministic with 162 transitions.
[2024-05-30 13:36:06] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:36:06] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:36:06] [INFO ] Time to serialize gal into /tmp/CTLFireability15480877022492780053.gal : 1 ms
[2024-05-30 13:36:06] [INFO ] Time to serialize properties into /tmp/CTLFireability2445833297397769249.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/CTLFireability15480877022492780053.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2445833297397769249.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,5.79261e+14,0.627986,29648,2,1575,5,78574,6,0,812,179036,0


Converting to forward existential form...Done !
original formula: AX((!(A(EG(EF((p35==1))) U ((p169==1) * (EF((p51==1)) + (((p128==1)&&(p147==1))&&(p18==1)))))) + !(A((((p85==1)||((p114==1)&&(p68==1)))||...216
=> equivalent forward existential formula: [(((EY(Init) * !(!(!((E(!(!((!(EX(!(((p79==1)&&(p98==1))))) * E(TRUE U (p137==1))))) U (!((((p85==1)||((p114==1)...601
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t32, t38, t42, t47, t51, t56, t60, t63, t67, t73, t77, t82, t86, ...365
Detected timeout of ITS tools.
[2024-05-30 13:36:36] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:36:36] [INFO ] Applying decomposition
[2024-05-30 13:36:36] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8706690168283653591.txt' '-o' '/tmp/graph8706690168283653591.bin' '-w' '/tmp/graph8706690168283653591.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8706690168283653591.bin' '-l' '-1' '-v' '-w' '/tmp/graph8706690168283653591.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:36:36] [INFO ] Decomposing Gal with order
[2024-05-30 13:36:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:36:36] [INFO ] Removed a total of 42 redundant transitions.
[2024-05-30 13:36:36] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:36:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 13:36:36] [INFO ] Time to serialize gal into /tmp/CTLFireability7213431237894755571.gal : 4 ms
[2024-05-30 13:36:36] [INFO ] Time to serialize properties into /tmp/CTLFireability13960136204892091273.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/CTLFireability7213431237894755571.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13960136204892091273.ctl'

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 -...263
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,5.79261e+14,0.132165,8852,400,23,10759,261,340,16721,40,526,0


Converting to forward existential form...Done !
original formula: AX((!(A(EG(EF((i3.u15.p35==1))) U ((i14.u53.p169==1) * (EF((i4.u17.p51==1)) + (((i11.u43.p128==1)&&(i13.u50.p147==1))&&(i2.u6.p18==1)))))...311
=> equivalent forward existential formula: [(((EY(Init) * !(!(!((E(!(!((!(EX(!(((i7.u24.p79==1)&&(i9.u35.p98==1))))) * E(TRUE U (i12.u46.p137==1))))) U (!(...814
Reverse transition relation is NOT exact ! Due to transitions t147, t152, i1.t133, i2.t136, i2.u5.t140, i3.t123, i3.u12.t119, i3.u15.t125, i4.t114, i4.u16....554
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 195/195 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 194 transition count 141
Reduce places removed 53 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 61 rules applied. Total rules applied 114 place count 141 transition count 133
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 122 place count 133 transition count 133
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 122 place count 133 transition count 117
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 154 place count 117 transition count 117
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 174 place count 97 transition count 97
Iterating global reduction 3 with 20 rules applied. Total rules applied 194 place count 97 transition count 97
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 194 place count 97 transition count 89
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 210 place count 89 transition count 89
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 266 place count 61 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 267 place count 61 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 269 place count 60 transition count 59
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 271 place count 58 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 272 place count 57 transition count 57
Applied a total of 272 rules in 21 ms. Remains 57 /195 variables (removed 138) and now considering 57/195 (removed 138) transitions.
// Phase 1: matrix 57 rows 57 cols
[2024-05-30 13:37:07] [INFO ] Computed 16 invariants in 0 ms
[2024-05-30 13:37:07] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-30 13:37:07] [INFO ] Invariant cache hit.
[2024-05-30 13:37:07] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-30 13:37:07] [INFO ] Redundant transitions in 0 ms returned []
Running 55 sub problems to find dead transitions.
[2024-05-30 13:37:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-30 13:37:07] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 57/114 variables, 57/74 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 0/114 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 74 constraints, problems are : Problem set: 0 solved, 55 unsolved in 677 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 1/57 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 57/114 variables, 57/74 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 55/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 0/114 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 129 constraints, problems are : Problem set: 0 solved, 55 unsolved in 643 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 1/1 constraints]
After SMT, in 1326ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 1328ms
Starting structural reductions in SI_CTL mode, iteration 1 : 57/195 places, 57/195 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1441 ms. Remains : 57/195 places, 57/195 transitions.
[2024-05-30 13:37:08] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:37:08] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:37:08] [INFO ] Input system was already deterministic with 57 transitions.
[2024-05-30 13:37:08] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:37:08] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:37:08] [INFO ] Time to serialize gal into /tmp/CTLFireability16654398218194324475.gal : 1 ms
[2024-05-30 13:37:08] [INFO ] Time to serialize properties into /tmp/CTLFireability9489729852889057005.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/CTLFireability16654398218194324475.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9489729852889057005.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.02331e+08,0.018952,4332,2,145,5,3628,6,0,287,4630,0


Converting to forward existential form...Done !
original formula: EG((((p74==0)||(p77==1)) + (E(A((p5==1) U (p198==1)) U EG((p14==1))) * (EG(((p51==1)||(p100==1))) + ((p142==0) * EF((p62==0)))))))
=> equivalent forward existential formula: [FwdG(Init,(((p74==0)||(p77==1)) + (E(!((E(!((p198==1)) U (!((p5==1)) * !((p198==1)))) + EG(!((p198==1))))) U EG...244
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t12, t14, t16, t18, t21, t23, t25, t28, t38, t40, t43, t55, Intersection wit...236
Detected timeout of ITS tools.
[2024-05-30 13:37:38] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:37:38] [INFO ] Applying decomposition
[2024-05-30 13:37:38] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1405263718596040131.txt' '-o' '/tmp/graph1405263718596040131.bin' '-w' '/tmp/graph1405263718596040131.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1405263718596040131.bin' '-l' '-1' '-v' '-w' '/tmp/graph1405263718596040131.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:37:38] [INFO ] Decomposing Gal with order
[2024-05-30 13:37:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:37:38] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-30 13:37:38] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:37:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-30 13:37:38] [INFO ] Time to serialize gal into /tmp/CTLFireability15456588408487797192.gal : 1 ms
[2024-05-30 13:37:38] [INFO ] Time to serialize properties into /tmp/CTLFireability15994065521087765583.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/CTLFireability15456588408487797192.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15994065521087765583.ctl'

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 -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.02331e+08,0.011493,3920,48,19,764,93,145,1065,52,240,0


Converting to forward existential form...Done !
original formula: EG((((u6.p74==0)||(u6.p77==1)) + (E(A((i0.u0.p5==1) U (i10.u16.p198==1)) U EG((u1.p14==1))) * (EG(((i2.u4.p51==1)||(u8.p100==1))) + ((i8....190
=> equivalent forward existential formula: [FwdG(Init,(((u6.p74==0)||(u6.p77==1)) + (E(!((E(!((i10.u16.p198==1)) U (!((i0.u0.p5==1)) * !((i10.u16.p198==1))...302
Reverse transition relation is NOT exact ! Due to transitions t55, u1.t5, u1.t21, u5.t4, u6.t3, u6.t14, u7.t38, u8.t16, u9.t40, i0.u0.t6, i0.u3.t25, i2.u2....301
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,1,3.49054,146740,1,0,249401,299,861,624510,248,902,202011
FORMULA ShieldRVt-PT-004B-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 195/195 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 162 transition count 162
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 162 transition count 162
Applied a total of 66 rules in 2 ms. Remains 162 /195 variables (removed 33) and now considering 162/195 (removed 33) transitions.
// Phase 1: matrix 162 rows 162 cols
[2024-05-30 13:37:42] [INFO ] Computed 17 invariants in 3 ms
[2024-05-30 13:37:42] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-30 13:37:42] [INFO ] Invariant cache hit.
[2024-05-30 13:37:42] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2024-05-30 13:37:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-30 13:37:43] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:37:43] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-30 13:37:43] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:37:43] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:37:43] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:37:43] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/324 variables, 162/185 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/324 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 185 constraints, problems are : Problem set: 0 solved, 161 unsolved in 4514 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-30 13:37:47] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 162/324 variables, 162/186 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 161/347 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-30 13:37:48] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:37:48] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:37:48] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:37:48] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:37:48] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:37:48] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:37:48] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:37:48] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:37:48] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:37:49] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:37:49] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:37:49] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:37:49] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:37:49] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-30 13:37:49] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:37:49] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:37:49] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:37:49] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:37:50] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 19/366 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-30 13:37:50] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:37:50] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:37:51] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:37:51] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:37:51] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:37:51] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 6/372 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-30 13:37:52] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:37:53] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:37:53] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:37:53] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:37:53] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:37:53] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 6/378 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-30 13:37:55] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 0 ms to minimize.
[2024-05-30 13:37:55] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/324 variables, 2/380 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-30 13:37:57] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/324 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-30 13:37:59] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:37:59] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/324 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-30 13:38:00] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/324 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/324 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 15 (OVERLAPS) 0/324 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 384 constraints, problems are : Problem set: 0 solved, 161 unsolved in 19209 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 44/44 constraints]
After SMT, in 23737ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 23739ms
Starting structural reductions in LTL mode, iteration 1 : 162/195 places, 162/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23863 ms. Remains : 162/195 places, 162/195 transitions.
[2024-05-30 13:38:05] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:38:05] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:38:05] [INFO ] Input system was already deterministic with 162 transitions.
[2024-05-30 13:38:05] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:38:05] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:38:05] [INFO ] Time to serialize gal into /tmp/CTLFireability12200197533679286160.gal : 1 ms
[2024-05-30 13:38:05] [INFO ] Time to serialize properties into /tmp/CTLFireability14705311027814072699.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/CTLFireability12200197533679286160.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14705311027814072699.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,5.29842e+14,0.588041,27320,2,1548,5,71264,6,0,812,162417,0


Converting to forward existential form...Done !
original formula: (AF((((E((p101==1) U (p186==1)) + !(A((p162==1) U (p142==1)))) * A(!(((p164==1)||(p81==1))) U (AX((p104==1)) + (p96==1)))) * E((EG((((p64...291
=> equivalent forward existential formula: ([FwdG(Init,!((((E((p101==1) U (p186==1)) + !(!((E(!((p142==1)) U (!((p162==1)) * !((p142==1)))) + EG(!((p142==1...508
Hit Full ! (commute/partial/dont) 160/0/2
(forward)formula 0,0,1.42758,46968,1,0,73,183806,20,3,3709,213181,71
FORMULA ShieldRVt-PT-004B-CTLFireability-2024-10 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 : 195/195 places, 195/195 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 160 transition count 160
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 160 transition count 160
Applied a total of 70 rules in 2 ms. Remains 160 /195 variables (removed 35) and now considering 160/195 (removed 35) transitions.
// Phase 1: matrix 160 rows 160 cols
[2024-05-30 13:38:07] [INFO ] Computed 17 invariants in 1 ms
[2024-05-30 13:38:07] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-30 13:38:07] [INFO ] Invariant cache hit.
[2024-05-30 13:38:07] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2024-05-30 13:38:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:38:08] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 10 ms to minimize.
[2024-05-30 13:38:08] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:38:08] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:38:08] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:38:08] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/320 variables, 160/182 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (OVERLAPS) 0/320 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 182 constraints, problems are : Problem set: 0 solved, 159 unsolved in 4295 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/320 variables, 160/182 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 159/341 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:38:13] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:38:13] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:38:13] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:38:13] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:38:13] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:38:13] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-30 13:38:13] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:38:13] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:38:13] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:38:13] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:38:13] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:38:13] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-30 13:38:13] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:38:14] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:38:14] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:38:14] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:38:14] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:38:14] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-30 13:38:14] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:38:14] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:38:15] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:38:15] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:38:15] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:38:15] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:38:15] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2024-05-30 13:38:15] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:38:16] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 7/368 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:38:17] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:38:17] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:38:17] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:38:17] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-30 13:38:17] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:38:17] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:38:18] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:38:18] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2024-05-30 13:38:18] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 9/377 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:38:19] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:38:22] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 12 (OVERLAPS) 0/320 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 379 constraints, problems are : Problem set: 0 solved, 159 unsolved in 15247 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 43/43 constraints]
After SMT, in 19552ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 19553ms
Starting structural reductions in LTL mode, iteration 1 : 160/195 places, 160/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19678 ms. Remains : 160/195 places, 160/195 transitions.
[2024-05-30 13:38:27] [INFO ] Flatten gal took : 10 ms
[2024-05-30 13:38:27] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:38:27] [INFO ] Input system was already deterministic with 160 transitions.
[2024-05-30 13:38:27] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:38:27] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:38:27] [INFO ] Time to serialize gal into /tmp/CTLFireability11026191062020073478.gal : 1 ms
[2024-05-30 13:38:27] [INFO ] Time to serialize properties into /tmp/CTLFireability6087257814771657831.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/CTLFireability11026191062020073478.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6087257814771657831.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,4.62536e+14,0.560893,24648,2,1392,5,64565,6,0,802,141497,0


Converting to forward existential form...Done !
original formula: AF(EX((p161==1)))
=> equivalent forward existential formula: [FwdG(Init,!(EX((p161==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t32, t33, t39, t43, t48, t52, t57, t61, t64, t68, t74, t78, t83, ...347
Detected timeout of ITS tools.
[2024-05-30 13:38:57] [INFO ] Flatten gal took : 9 ms
[2024-05-30 13:38:57] [INFO ] Applying decomposition
[2024-05-30 13:38:57] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14105874350537051481.txt' '-o' '/tmp/graph14105874350537051481.bin' '-w' '/tmp/graph14105874350537051481.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14105874350537051481.bin' '-l' '-1' '-v' '-w' '/tmp/graph14105874350537051481.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:38:57] [INFO ] Decomposing Gal with order
[2024-05-30 13:38:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:38:57] [INFO ] Removed a total of 41 redundant transitions.
[2024-05-30 13:38:57] [INFO ] Flatten gal took : 9 ms
[2024-05-30 13:38:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 13:38:57] [INFO ] Time to serialize gal into /tmp/CTLFireability336834230272990922.gal : 2 ms
[2024-05-30 13:38:57] [INFO ] Time to serialize properties into /tmp/CTLFireability7485181420077764106.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/CTLFireability336834230272990922.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7485181420077764106.ctl'

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 -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.62536e+14,0.102379,8336,297,22,10006,260,315,13496,38,518,0


Converting to forward existential form...Done !
original formula: AF(EX((i14.u51.p161==1)))
=> equivalent forward existential formula: [FwdG(Init,!(EX((i14.u51.p161==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t145, t148, t150, i0.i0.u2.t141, i1.i1.t131, i2.t134, i2.u5.t138, i3.t118, i3.u12.t122, i4.t1...521
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,0,27.7779,716096,1,0,1.32774e+06,260,1777,2.24035e+06,190,1071,1285580
FORMULA ShieldRVt-PT-004B-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 195/195 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 162 transition count 162
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 162 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 161 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 161 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 160 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 160 transition count 160
Applied a total of 70 rules in 4 ms. Remains 160 /195 variables (removed 35) and now considering 160/195 (removed 35) transitions.
// Phase 1: matrix 160 rows 160 cols
[2024-05-30 13:39:25] [INFO ] Computed 17 invariants in 2 ms
[2024-05-30 13:39:25] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-30 13:39:25] [INFO ] Invariant cache hit.
[2024-05-30 13:39:25] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2024-05-30 13:39:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:39:26] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:39:26] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:39:26] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:39:26] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2024-05-30 13:39:26] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-30 13:39:26] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:39:26] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (OVERLAPS) 160/320 variables, 160/184 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:39:28] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (OVERLAPS) 0/320 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 185 constraints, problems are : Problem set: 0 solved, 159 unsolved in 5649 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:39:31] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:39:32] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (OVERLAPS) 160/320 variables, 160/187 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 159/346 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:39:33] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:39:33] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:39:33] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-05-30 13:39:33] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:39:33] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:39:33] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:39:33] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:39:33] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:39:33] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:39:34] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-30 13:39:34] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:39:34] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:39:34] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 13/359 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:39:35] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:39:35] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:39:35] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:39:35] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:39:35] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:39:36] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 6/365 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:39:37] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:39:37] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:39:38] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:39:38] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:39:39] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:39:39] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:39:39] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 5/372 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:39:40] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-05-30 13:39:40] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:39:40] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/320 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:39:42] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/320 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/320 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 15 (OVERLAPS) 0/320 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 376 constraints, problems are : Problem set: 0 solved, 159 unsolved in 17411 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 40/40 constraints]
After SMT, in 23072ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 23074ms
Starting structural reductions in LTL mode, iteration 1 : 160/195 places, 160/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23210 ms. Remains : 160/195 places, 160/195 transitions.
[2024-05-30 13:39:48] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:39:48] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:39:48] [INFO ] Input system was already deterministic with 160 transitions.
[2024-05-30 13:39:48] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:39:48] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:39:48] [INFO ] Time to serialize gal into /tmp/CTLFireability12947514836983270685.gal : 1 ms
[2024-05-30 13:39:48] [INFO ] Time to serialize properties into /tmp/CTLFireability5208695164636218080.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/CTLFireability12947514836983270685.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5208695164636218080.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,4.23346e+14,0.740033,32608,2,1550,5,83782,6,0,802,205245,0


Converting to forward existential form...Done !
original formula: (EG((E(EF((((p72==1)&&(p128==1))&&(p147==1))) U !(((p66!=1) * AG((p74==1))))) * EG((p117==0)))) * E((AX(!(((p121==1)||(p102==1)))) + (p12...175
=> equivalent forward existential formula: [(FwdU((Init * EG((E(E(TRUE U (((p72==1)&&(p128==1))&&(p147==1))) U !(((p66!=1) * !(E(TRUE U !((p74==1))))))) * ...245
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t45, t49, t54, t58, t61, t62, t66, t68, t72, ...366
Detected timeout of ITS tools.
[2024-05-30 13:40:18] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:40:18] [INFO ] Applying decomposition
[2024-05-30 13:40:18] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16180969643083101796.txt' '-o' '/tmp/graph16180969643083101796.bin' '-w' '/tmp/graph16180969643083101796.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16180969643083101796.bin' '-l' '-1' '-v' '-w' '/tmp/graph16180969643083101796.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:40:18] [INFO ] Decomposing Gal with order
[2024-05-30 13:40:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:40:18] [INFO ] Removed a total of 39 redundant transitions.
[2024-05-30 13:40:18] [INFO ] Flatten gal took : 9 ms
[2024-05-30 13:40:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 13:40:18] [INFO ] Time to serialize gal into /tmp/CTLFireability8535976206999991881.gal : 1 ms
[2024-05-30 13:40:18] [INFO ] Time to serialize properties into /tmp/CTLFireability1936174222915684499.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/CTLFireability8535976206999991881.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1936174222915684499.ctl'

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 -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.23346e+14,0.107645,8576,461,23,10804,276,338,14196,40,564,0


Converting to forward existential form...Done !
original formula: (EG((E(EF((((i7.u26.p72==1)&&(i12.i1.u41.p128==1))&&(i13.u46.p147==1))) U !(((i6.u22.p66!=1) * AG((i7.u25.p74==1))))) * EG((i11.u36.p117=...260
=> equivalent forward existential formula: [(FwdU((Init * EG((E(E(TRUE U (((i7.u26.p72==1)&&(i12.i1.u41.p128==1))&&(i13.u46.p147==1))) U !(((i6.u22.p66!=1)...330
Reverse transition relation is NOT exact ! Due to transitions t150, i0.t25, i0.t21, i1.i1.u2.t141, i2.t134, i2.u6.t138, i3.i1.t127, i3.i1.t131, i4.t118, i4...577
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 195/195 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 194 transition count 131
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 131 transition count 131
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 126 place count 131 transition count 114
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 160 place count 114 transition count 114
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 181 place count 93 transition count 93
Iterating global reduction 2 with 21 rules applied. Total rules applied 202 place count 93 transition count 93
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 202 place count 93 transition count 84
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 220 place count 84 transition count 84
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 282 place count 53 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 283 place count 53 transition count 52
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 285 place count 52 transition count 51
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 287 place count 50 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 288 place count 49 transition count 49
Applied a total of 288 rules in 11 ms. Remains 49 /195 variables (removed 146) and now considering 49/195 (removed 146) transitions.
// Phase 1: matrix 49 rows 49 cols
[2024-05-30 13:40:48] [INFO ] Computed 16 invariants in 0 ms
[2024-05-30 13:40:48] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-30 13:40:48] [INFO ] Invariant cache hit.
[2024-05-30 13:40:48] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-30 13:40:48] [INFO ] Redundant transitions in 0 ms returned []
Running 48 sub problems to find dead transitions.
[2024-05-30 13:40:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 49/98 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 0/98 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 65 constraints, problems are : Problem set: 0 solved, 48 unsolved in 375 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 49/98 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 48/113 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 0/98 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 113 constraints, problems are : Problem set: 0 solved, 48 unsolved in 404 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 786ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 786ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/195 places, 49/195 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 872 ms. Remains : 49/195 places, 49/195 transitions.
[2024-05-30 13:40:49] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:40:49] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:40:49] [INFO ] Input system was already deterministic with 49 transitions.
[2024-05-30 13:40:49] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:40:49] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:40:49] [INFO ] Time to serialize gal into /tmp/CTLFireability8595368495866204350.gal : 1 ms
[2024-05-30 13:40:49] [INFO ] Time to serialize properties into /tmp/CTLFireability9859572922616821519.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/CTLFireability8595368495866204350.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9859572922616821519.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,5.09835e+07,0.018918,4024,2,150,5,2982,6,0,248,3784,0


Converting to forward existential form...Done !
original formula: AG(AF(!(E((p90==1) U (p193==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(!(E((p90==1) U (p193==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t5, t7, t9, t11, t13, t14, t17, t19, t23, t25, t26, t29, t31, t33, Intersection with...235
(forward)formula 0,0,0.136675,10624,1,0,225,34759,124,105,1538,63601,216
FORMULA ShieldRVt-PT-004B-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 195/195 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 194 transition count 135
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 135 transition count 135
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 118 place count 135 transition count 116
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 156 place count 116 transition count 116
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 180 place count 92 transition count 92
Iterating global reduction 2 with 24 rules applied. Total rules applied 204 place count 92 transition count 92
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 204 place count 92 transition count 82
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 224 place count 82 transition count 82
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 280 place count 54 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 281 place count 54 transition count 53
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 283 place count 53 transition count 52
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 285 place count 51 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 286 place count 50 transition count 50
Applied a total of 286 rules in 18 ms. Remains 50 /195 variables (removed 145) and now considering 50/195 (removed 145) transitions.
// Phase 1: matrix 50 rows 50 cols
[2024-05-30 13:40:49] [INFO ] Computed 16 invariants in 1 ms
[2024-05-30 13:40:49] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-30 13:40:49] [INFO ] Invariant cache hit.
[2024-05-30 13:40:49] [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-30 13:40:49] [INFO ] Redundant transitions in 0 ms returned []
Running 47 sub problems to find dead transitions.
[2024-05-30 13:40:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 2/50 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 50/100 variables, 50/66 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 0/100 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 66 constraints, problems are : Problem set: 0 solved, 47 unsolved in 447 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 2/50 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 50/100 variables, 50/66 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 47/113 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 113 constraints, problems are : Problem set: 0 solved, 47 unsolved in 436 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
After SMT, in 887ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 887ms
Starting structural reductions in SI_CTL mode, iteration 1 : 50/195 places, 50/195 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 984 ms. Remains : 50/195 places, 50/195 transitions.
[2024-05-30 13:40:50] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:40:50] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:40:50] [INFO ] Input system was already deterministic with 50 transitions.
[2024-05-30 13:40:50] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:40:50] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:40:50] [INFO ] Time to serialize gal into /tmp/CTLFireability5514333539920134808.gal : 1 ms
[2024-05-30 13:40:50] [INFO ] Time to serialize properties into /tmp/CTLFireability4073608883279346499.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/CTLFireability5514333539920134808.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4073608883279346499.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,6.80244e+07,0.019247,4024,2,85,5,2765,6,0,253,3350,0


Converting to forward existential form...Done !
original formula: AF(AG((((p118==1)&&(p124==1))&&(p140==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((((p118==1)&&(p124==1))&&(p140==1)))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.037585,4816,1,0,8,5906,19,5,1337,5949,10
FORMULA ShieldRVt-PT-004B-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 195/195 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 161 transition count 161
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 161 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 160 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 160 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 159 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 159 transition count 159
Applied a total of 72 rules in 7 ms. Remains 159 /195 variables (removed 36) and now considering 159/195 (removed 36) transitions.
// Phase 1: matrix 159 rows 159 cols
[2024-05-30 13:40:50] [INFO ] Computed 17 invariants in 1 ms
[2024-05-30 13:40:50] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-30 13:40:50] [INFO ] Invariant cache hit.
[2024-05-30 13:40:50] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 158 sub problems to find dead transitions.
[2024-05-30 13:40:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-30 13:40:51] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:40:51] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:40:51] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:40:51] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:40:51] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:40:51] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-30 13:40:52] [INFO ] Deduced a trap composed of 29 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (OVERLAPS) 159/318 variables, 159/183 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (OVERLAPS) 0/318 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 183 constraints, problems are : Problem set: 0 solved, 158 unsolved in 4796 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (OVERLAPS) 159/318 variables, 159/183 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 158/341 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-30 13:40:56] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:40:56] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:40:56] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:40:56] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:40:56] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:40:57] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:40:57] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2024-05-30 13:40:57] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:40:57] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:40:57] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:40:57] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:40:57] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:40:57] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:40:57] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:40:57] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:40:58] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 16/357 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-30 13:40:58] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:40:59] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:40:59] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:40:59] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:40:59] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:40:59] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:40:59] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 7/364 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-30 13:41:00] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:41:00] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 2/366 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-30 13:41:03] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:41:04] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/318 variables, 2/368 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-30 13:41:05] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:41:05] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:41:05] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 3/371 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-30 13:41:08] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:41:09] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:41:09] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:41:09] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:41:09] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:41:09] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/318 variables, 6/377 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-30 13:41:11] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/318 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-30 13:41:13] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/318 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/318 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-30 13:41:16] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:41:16] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/318 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/318 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 19 (OVERLAPS) 0/318 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 381 constraints, problems are : Problem set: 0 solved, 158 unsolved in 26123 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 47/47 constraints]
After SMT, in 30930ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 30932ms
Starting structural reductions in LTL mode, iteration 1 : 159/195 places, 159/195 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31060 ms. Remains : 159/195 places, 159/195 transitions.
[2024-05-30 13:41:21] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:41:21] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:41:21] [INFO ] Input system was already deterministic with 159 transitions.
[2024-05-30 13:41:21] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:41:21] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:41:21] [INFO ] Time to serialize gal into /tmp/CTLFireability13206987775029541668.gal : 1 ms
[2024-05-30 13:41:21] [INFO ] Time to serialize properties into /tmp/CTLFireability10553119306950964988.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/CTLFireability13206987775029541668.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10553119306950964988.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,4.17529e+14,0.570849,27140,2,1538,5,70011,6,0,797,164250,0


Converting to forward existential form...Done !
original formula: AG(EF((((p182==1) * (AX((((p20==1)&&(p26==1))&&(p42==1))) + EX((p27==1)))) * ((p145==1)||(((p30==1)&&(p49==1))&&(((p118==0)||(p124==0))||...170
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((p182==1) * (!(EX(!((((p20==1)&&(p26==1))&&(p42==1))))) + EX((p27==1)))) * ((p1...236
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t18, t22, t26, t30, t31, t37, t41, t43, t47, t51, t56, t60, t63, t67, t73, ...357
Detected timeout of ITS tools.
[2024-05-30 13:41:51] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:41:51] [INFO ] Applying decomposition
[2024-05-30 13:41:51] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9276363911169089664.txt' '-o' '/tmp/graph9276363911169089664.bin' '-w' '/tmp/graph9276363911169089664.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9276363911169089664.bin' '-l' '-1' '-v' '-w' '/tmp/graph9276363911169089664.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:41:51] [INFO ] Decomposing Gal with order
[2024-05-30 13:41:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:41:51] [INFO ] Removed a total of 43 redundant transitions.
[2024-05-30 13:41:51] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:41:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 13:41:51] [INFO ] Time to serialize gal into /tmp/CTLFireability3550863608622644117.gal : 4 ms
[2024-05-30 13:41:51] [INFO ] Time to serialize properties into /tmp/CTLFireability12185843732996203175.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/CTLFireability3550863608622644117.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12185843732996203175.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.17529e+14,0.07795,7260,367,22,7151,262,343,10596,38,518,0


Converting to forward existential form...Done !
original formula: AG(EF((((i16.u59.p182==1) * (AX((((i2.u6.p20==1)&&(i3.u9.p26==1))&&(i0.i2.u12.p42==1))) + EX((i3.u9.p27==1)))) * ((i12.u48.p145==1)||(((i...250
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((i16.u59.p182==1) * (!(EX(!((((i2.u6.p20==1)&&(i3.u9.p26==1))&&(i0.i2.u12.p42==...316
Reverse transition relation is NOT exact ! Due to transitions t144, t147, t149, i0.i0.u2.t140, i0.i2.t117, i0.i2.u12.t121, i1.t112, i1.u15.t108, i2.t133, i...540
(forward)formula 0,0,4.75422,158532,1,0,228228,280,2093,699100,192,935,259643
FORMULA ShieldRVt-PT-004B-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2024-05-30 13:41:56] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:41:56] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:41:56] [INFO ] Applying decomposition
[2024-05-30 13:41:56] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3962034240054934076.txt' '-o' '/tmp/graph3962034240054934076.bin' '-w' '/tmp/graph3962034240054934076.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3962034240054934076.bin' '-l' '-1' '-v' '-w' '/tmp/graph3962034240054934076.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:41:56] [INFO ] Decomposing Gal with order
[2024-05-30 13:41:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:41:56] [INFO ] Removed a total of 25 redundant transitions.
[2024-05-30 13:41:56] [INFO ] Flatten gal took : 10 ms
[2024-05-30 13:41:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-30 13:41:56] [INFO ] Time to serialize gal into /tmp/CTLFireability13460476725102723122.gal : 15 ms
[2024-05-30 13:41:56] [INFO ] Time to serialize properties into /tmp/CTLFireability18185028034153191928.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/CTLFireability13460476725102723122.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18185028034153191928.ctl'

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 -...264
No direction supplied, using forward translation only.
Parsed 3 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,5.26183e+15,0.718589,30284,1016,28,47420,226,408,97374,44,527,0


Converting to forward existential form...Done !
original formula: A(AX(FALSE) U ((!(AG(((((i10.u55.p137==1)&&(i2.u5.p21==1))||(i9.u51.p126==1))||(i7.u33.p84==1)))) * (i6.i0.u24.p59==1)) * (i11.u60.p146!=...159
=> equivalent forward existential formula: [((Init * !(EG(!(((!(!(E(TRUE U !(((((i10.u55.p137==1)&&(i2.u5.p21==1))||(i9.u51.p126==1))||(i7.u33.p84==1))))))...530
Reverse transition relation is NOT exact ! Due to transitions i0.t155, i0.t149, i0.u17.t153, i1.i1.t160, i1.i1.u12.t164, i1.i1.u12.t165, i2.t174, i2.t168, ...906
Detected timeout of ITS tools.
[2024-05-30 14:06:01] [INFO ] Applying decomposition
[2024-05-30 14:06:01] [INFO ] Flatten gal took : 4 ms
[2024-05-30 14:06:01] [INFO ] Decomposing Gal with order
[2024-05-30 14:06:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:06:01] [INFO ] Removed a total of 3 redundant transitions.
[2024-05-30 14:06:01] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:06:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 14:06:01] [INFO ] Time to serialize gal into /tmp/CTLFireability12558363128427742666.gal : 2 ms
[2024-05-30 14:06:01] [INFO ] Time to serialize properties into /tmp/CTLFireability14955607530999163173.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/CTLFireability12558363128427742666.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14955607530999163173.ctl'

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 -...264
No direction supplied, using forward translation only.
Parsed 3 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,5.26183e+15,6.11748,209004,1163,344,325797,822,254,1.73659e+06,117,8794,0


Converting to forward existential form...Done !
original formula: A(AX(FALSE) U ((!(AG(((((i0.i1.i0.u24.p137==1)&&(i0.i0.i0.i1.i0.i0.u8.p21==1))||(i0.i1.i0.i0.u23.p126==1))||(i0.i0.i1.i0.u17.p84==1)))) *...208
=> equivalent forward existential formula: [((Init * !(EG(!(((!(!(E(TRUE U !(((((i0.i1.i0.u24.p137==1)&&(i0.i0.i0.i1.i0.i0.u8.p21==1))||(i0.i1.i0.i0.u23.p1...677
Reverse transition relation is NOT exact ! Due to transitions i0.i0.i0.u4.t176, i0.i0.i0.i1.u11.t137, i0.i0.i0.i1.u11.t138, i0.i0.i0.i1.u11.t142, i0.i0.i0....1485

BK_TIME_CONFINEMENT_REACHED

--------------------
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="ShieldRVt-PT-004B"
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 ShieldRVt-PT-004B, 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 r356-tall-171683762200938"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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