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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K 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 55K 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 3.6K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 21:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 11 21:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 11 21:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 21:13 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 60K 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-005B-CTLFireability-2024-00
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-2024-01
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-2024-02
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-2024-03
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-2024-04
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-2024-05
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-2024-06
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-2024-07
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-2024-08
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-2024-09
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-2024-10
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-2024-11
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-2023-12
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-2023-13
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-2023-14
FORMULA_NAME ShieldRVt-PT-005B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717076187249

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-005B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-30 13:36:28] [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:36:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 13:36:28] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-05-30 13:36:28] [INFO ] Transformed 253 places.
[2024-05-30 13:36:28] [INFO ] Transformed 253 transitions.
[2024-05-30 13:36:28] [INFO ] Found NUPN structural information;
[2024-05-30 13:36:28] [INFO ] Parsed PT model containing 253 places and 253 transitions and 596 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Support contains 106 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 253/253 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 236 transition count 236
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 236 transition count 236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 235 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 235 transition count 235
Applied a total of 36 rules in 44 ms. Remains 235 /253 variables (removed 18) and now considering 235/253 (removed 18) transitions.
// Phase 1: matrix 235 rows 235 cols
[2024-05-30 13:36:28] [INFO ] Computed 21 invariants in 18 ms
[2024-05-30 13:36:28] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-30 13:36:28] [INFO ] Invariant cache hit.
[2024-05-30 13:36:29] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2024-05-30 13:36:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-30 13:36:31] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 8 ms to minimize.
[2024-05-30 13:36:31] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:36:31] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-30 13:36:31] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-05-30 13:36:31] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:36:31] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:36:31] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:36:31] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:36:31] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:36:31] [INFO ] Deduced a trap composed of 23 places in 19 ms of which 1 ms to minimize.
[2024-05-30 13:36:31] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:36:31] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:36:31] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 1 ms to minimize.
[2024-05-30 13:36:31] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:36:32] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-30 13:36:32] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 0 ms to minimize.
[2024-05-30 13:36:32] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:36:32] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:36:32] [INFO ] Deduced a trap composed of 27 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:36:32] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-30 13:36:32] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:36:32] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:36:32] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 1 ms to minimize.
[2024-05-30 13:36:32] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:36:32] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:36:33] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:36:33] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:36:33] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:36:33] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
[2024-05-30 13:36:33] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:36:33] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-05-30 13:36:33] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:36:33] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 1 ms to minimize.
[2024-05-30 13:36:33] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 2 ms to minimize.
[2024-05-30 13:36:33] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 4 ms to minimize.
[2024-05-30 13:36:33] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:36:33] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:36:33] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-30 13:36:35] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-30 13:36:36] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:36:36] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:36:36] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-05-30 13:36:36] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:36:36] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-30 13:36:37] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:36:37] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:36:37] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:36:37] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-30 13:36:39] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-30 13:36:40] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:36:40] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:36:41] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-30 13:36:42] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 11 (OVERLAPS) 235/470 variables, 235/309 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-30 13:36:44] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:36:45] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:36:45] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:36:45] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 6 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/470 variables, 4/313 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/470 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 14 (OVERLAPS) 0/470 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 313 constraints, problems are : Problem set: 0 solved, 234 unsolved in 20796 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 57/78 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-30 13:36:51] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:36:51] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 235/470 variables, 235/315 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 234/549 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-30 13:36:53] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:36:53] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2024-05-30 13:36:53] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-05-30 13:36:53] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 2 ms to minimize.
[2024-05-30 13:36:53] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-05-30 13:36:54] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 2 ms to minimize.
[2024-05-30 13:36:54] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:36:54] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 2 ms to minimize.
[2024-05-30 13:36:54] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:36:54] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:36:54] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 2 ms to minimize.
[2024-05-30 13:36:54] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 2 ms to minimize.
[2024-05-30 13:36:54] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 2 ms to minimize.
[2024-05-30 13:36:54] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
[2024-05-30 13:36:55] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:36:55] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:36:55] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:36:55] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:36:55] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:36:55] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 20/569 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-30 13:36:56] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 ms to minimize.
[2024-05-30 13:36:57] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:36:57] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:36:57] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:36:57] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:36:57] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:36:57] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 2 ms to minimize.
[2024-05-30 13:36:58] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:36:58] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:36:58] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:36:58] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:36:58] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:36:58] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2024-05-30 13:36:59] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:36:59] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:36:59] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:36:59] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 17/586 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-30 13:37:01] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
[2024-05-30 13:37:01] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-30 13:37:02] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:37:03] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:37:03] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:37:03] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:37:03] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:37:03] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 0 ms to minimize.
[2024-05-30 13:37:03] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:37:03] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 10/596 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-30 13:37:07] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:37:07] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:37:08] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:37:08] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:37:08] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/470 variables, 5/601 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-30 13:37:11] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:37:11] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:37:12] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:37:12] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:37:12] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-30 13:37:12] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:37:13] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/470 variables, 7/608 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-30 13:37:17] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:37:18] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/470 variables, 2/610 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/470 variables, and 610 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 120/120 constraints]
After SMT, in 50877ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 50892ms
Starting structural reductions in LTL mode, iteration 1 : 235/253 places, 235/253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51383 ms. Remains : 235/253 places, 235/253 transitions.
Support contains 106 out of 235 places after structural reductions.
[2024-05-30 13:37:20] [INFO ] Flatten gal took : 39 ms
[2024-05-30 13:37:20] [INFO ] Flatten gal took : 17 ms
[2024-05-30 13:37:20] [INFO ] Input system was already deterministic with 235 transitions.
RANDOM walk for 40000 steps (8 resets) in 1799 ms. (22 steps per ms) remains 8/87 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 143 ms. (277 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 191 ms. (208 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 4/5 properties
[2024-05-30 13:37:21] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp78 is UNSAT
At refinement iteration 1 (OVERLAPS) 196/207 variables, 18/18 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-30 13:37:21] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:37:21] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:37:21] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:37:21] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:37:21] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:37:21] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:37:21] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:37:21] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:37:21] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:37:21] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:37:21] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 11/29 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 0/29 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 28/235 variables, 3/32 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 235/470 variables, 235/267 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 0/267 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/470 variables, 0/267 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 267 constraints, problems are : Problem set: 2 solved, 2 unsolved in 652 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 42/47 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 188/235 variables, 18/22 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 10/32 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-30 13:37:21] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:37:21] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 2/34 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 235/470 variables, 235/269 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 2/271 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-30 13:37:22] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
[2024-05-30 13:37:22] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:37:22] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 2 ms to minimize.
[2024-05-30 13:37:22] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:37:22] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:37:22] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/470 variables, 6/277 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/470 variables, 0/277 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/470 variables, 0/277 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 470/470 variables, and 277 constraints, problems are : Problem set: 2 solved, 2 unsolved in 636 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 19/19 constraints]
After SMT, in 1295ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 0 properties in 335 ms.
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 235/235 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 235 transition count 168
Reduce places removed 67 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 70 rules applied. Total rules applied 137 place count 168 transition count 165
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 140 place count 165 transition count 165
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 140 place count 165 transition count 141
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 188 place count 141 transition count 141
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 209 place count 120 transition count 120
Iterating global reduction 3 with 21 rules applied. Total rules applied 230 place count 120 transition count 120
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 230 place count 120 transition count 109
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 252 place count 109 transition count 109
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 342 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 343 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 345 place count 63 transition count 62
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 371 place count 50 transition count 73
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 372 place count 50 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 373 place count 49 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 374 place count 48 transition count 71
Applied a total of 374 rules in 40 ms. Remains 48 /235 variables (removed 187) and now considering 71/235 (removed 164) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 48/235 places, 71/235 transitions.
RANDOM walk for 40000 steps (16 resets) in 261 ms. (152 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (9 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (9 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1577256 steps, run timeout after 3001 ms. (steps per millisecond=525 ) properties seen :0 out of 2
Probabilistic random walk after 1577256 steps, saw 262577 distinct states, run finished after 3004 ms. (steps per millisecond=525 ) properties seen :0
// Phase 1: matrix 71 rows 48 cols
[2024-05-30 13:37:25] [INFO ] Computed 20 invariants in 1 ms
[2024-05-30 13:37:25] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/18 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/49 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 53/102 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 17/119 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/119 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/119 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/119 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 76 constraints, problems are : Problem set: 0 solved, 2 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 48/48 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/18 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/49 variables, 18/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 53/102 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 10/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 17/119 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/119 variables, 5/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/119 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/119 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 78 constraints, problems are : Problem set: 0 solved, 2 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 48/48 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 165ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 57 ms.
Support contains 5 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 71/71 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 71/71 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 48/48 places, 71/71 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 71/71 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2024-05-30 13:37:26] [INFO ] Invariant cache hit.
[2024-05-30 13:37:26] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-30 13:37:26] [INFO ] Invariant cache hit.
[2024-05-30 13:37:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-30 13:37:26] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-05-30 13:37:26] [INFO ] Redundant transitions in 1 ms returned []
Running 66 sub problems to find dead transitions.
[2024-05-30 13:37:26] [INFO ] Invariant cache hit.
[2024-05-30 13:37:26] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 2/48 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-30 13:37:26] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 1 ms to minimize.
[2024-05-30 13:37:26] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 71/119 variables, 48/70 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 78 constraints, problems are : Problem set: 0 solved, 66 unsolved in 826 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 48/48 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 71/119 variables, 48/70 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 8/78 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 66/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 0/119 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 144 constraints, problems are : Problem set: 0 solved, 66 unsolved in 751 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 48/48 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 2/2 constraints]
After SMT, in 1599ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 1612ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1723 ms. Remains : 48/48 places, 71/71 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 18 edges and 48 vertex of which 4 / 48 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 131 edges and 46 vertex of which 44 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 15 edges and 42 vertex of which 2 / 42 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 41 transition count 62
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 14 edges and 40 vertex of which 2 / 40 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 39 transition count 57
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17 place count 39 transition count 55
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 19 place count 38 transition count 54
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 20 place count 38 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 24 place count 38 transition count 49
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 26 place count 36 transition count 49
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 26 place count 36 transition count 48
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 28 place count 35 transition count 48
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 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 31 place count 33 transition count 47
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 34 place count 33 transition count 44
Applied a total of 34 rules in 19 ms. Remains 33 /48 variables (removed 15) and now considering 44/71 (removed 27) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 44 rows 33 cols
[2024-05-30 13:37:27] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 13:37:27] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-30 13:37:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-05-30 13:37:28] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-30 13:37:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-30 13:37:28] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-30 13:37:28] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-30 13:37:28] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 113 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-30 13:37:28] [INFO ] Flatten gal took : 11 ms
[2024-05-30 13:37:28] [INFO ] Flatten gal took : 10 ms
[2024-05-30 13:37:28] [INFO ] Input system was already deterministic with 235 transitions.
Computed a total of 73 stabilizing places and 73 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 235/235 places, 235/235 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 234 transition count 168
Reduce places removed 66 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 67 rules applied. Total rules applied 133 place count 168 transition count 167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 167 transition count 167
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 134 place count 167 transition count 140
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 188 place count 140 transition count 140
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 212 place count 116 transition count 116
Iterating global reduction 3 with 24 rules applied. Total rules applied 236 place count 116 transition count 116
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 236 place count 116 transition count 106
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 256 place count 106 transition count 106
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 326 place count 71 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 327 place count 71 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 329 place count 70 transition count 69
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 331 place count 68 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 332 place count 67 transition count 67
Applied a total of 332 rules in 23 ms. Remains 67 /235 variables (removed 168) and now considering 67/235 (removed 168) transitions.
// Phase 1: matrix 67 rows 67 cols
[2024-05-30 13:37:28] [INFO ] Computed 20 invariants in 1 ms
[2024-05-30 13:37:28] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-30 13:37:28] [INFO ] Invariant cache hit.
[2024-05-30 13:37:28] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-30 13:37:28] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-30 13:37:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 2/67 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-30 13:37:28] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 67/134 variables, 67/88 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 88 constraints, problems are : Problem set: 0 solved, 64 unsolved in 880 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 2/67 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 67/134 variables, 67/88 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 64/152 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 152 constraints, problems are : Problem set: 0 solved, 64 unsolved in 806 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 1/1 constraints]
After SMT, in 1697ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 1697ms
Starting structural reductions in SI_CTL mode, iteration 1 : 67/235 places, 67/235 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1820 ms. Remains : 67/235 places, 67/235 transitions.
[2024-05-30 13:37:29] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:37:29] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:37:29] [INFO ] Input system was already deterministic with 67 transitions.
[2024-05-30 13:37:29] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:37:29] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:37:29] [INFO ] Time to serialize gal into /tmp/CTLFireability1467209178987477275.gal : 2 ms
[2024-05-30 13:37:29] [INFO ] Time to serialize properties into /tmp/CTLFireability10460020410311407293.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/CTLFireability1467209178987477275.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10460020410311407293.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,7.34279e+09,0.04415,5132,2,298,5,6583,6,0,336,10130,0


Converting to forward existential form...Done !
original formula: EF((AG((p89==1)) * (!(E((((p59==1)||(p108==1))&&(p183!=1)) U (p194==1))) + EG((p66==1)))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(E(TRUE U !((p89==1))))) * !(E((((p59==1)||(p108==1))&&(p183!=1)) U (p194==1))))] != FALS...230
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t9, t11, t13, t16, t19, t21, t25, t33, t34, t36, t41, t43, t53, t57, Intersectio...241
(forward)formula 0,0,0.360298,20368,1,0,276,94137,170,126,2150,132519,270
FORMULA ShieldRVt-PT-005B-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 235/235 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 200 transition count 200
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 200 transition count 200
Applied a total of 70 rules in 7 ms. Remains 200 /235 variables (removed 35) and now considering 200/235 (removed 35) transitions.
// Phase 1: matrix 200 rows 200 cols
[2024-05-30 13:37:30] [INFO ] Computed 21 invariants in 2 ms
[2024-05-30 13:37:30] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-30 13:37:30] [INFO ] Invariant cache hit.
[2024-05-30 13:37:30] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2024-05-30 13:37:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-30 13:37:31] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:37:32] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:37:32] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:37:32] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:37:32] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:37:32] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:37:32] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:37:32] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:37:32] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-30 13:37:33] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:37:33] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:37:33] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (OVERLAPS) 200/400 variables, 200/233 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (OVERLAPS) 0/400 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 233 constraints, problems are : Problem set: 0 solved, 199 unsolved in 7698 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-30 13:37:39] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:37:39] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (OVERLAPS) 200/400 variables, 200/235 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 199/434 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-30 13:37:40] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 2 ms to minimize.
[2024-05-30 13:37:40] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-05-30 13:37:41] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:37:41] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:37:41] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:37:41] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:37:41] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:37:41] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:37:41] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:37:41] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:37:42] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:37:42] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:37:42] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:37:42] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:37:42] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:37:42] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:37:42] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:37:43] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 18/452 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-30 13:37:43] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:37:43] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:37:44] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
[2024-05-30 13:37:44] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2024-05-30 13:37:45] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-30 13:37:45] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:37:45] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:37:45] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:37:45] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 9/461 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-30 13:37:47] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:37:47] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:37:47] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:37:48] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 0 ms to minimize.
[2024-05-30 13:37:48] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:37:48] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 6/467 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-30 13:37:50] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:37:50] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:37:50] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
[2024-05-30 13:37:50] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 4/471 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-30 13:37:52] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-05-30 13:37:53] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:37:53] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:37:53] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2024-05-30 13:37:53] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:37:53] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:37:54] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 7/478 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 13 (OVERLAPS) 0/400 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 478 constraints, problems are : Problem set: 0 solved, 199 unsolved in 24764 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 58/58 constraints]
After SMT, in 32480ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 32483ms
Starting structural reductions in LTL mode, iteration 1 : 200/235 places, 200/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32687 ms. Remains : 200/235 places, 200/235 transitions.
[2024-05-30 13:38:03] [INFO ] Flatten gal took : 13 ms
[2024-05-30 13:38:03] [INFO ] Flatten gal took : 15 ms
[2024-05-30 13:38:03] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-30 13:38:03] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:38:03] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:38:03] [INFO ] Time to serialize gal into /tmp/CTLFireability3412717820764224604.gal : 4 ms
[2024-05-30 13:38:03] [INFO ] Time to serialize properties into /tmp/CTLFireability6000079318168948290.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/CTLFireability3412717820764224604.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6000079318168948290.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.47323e+18,1.5645,59472,2,2401,5,154307,6,0,1002,406052,0


Converting to forward existential form...Done !
original formula: EG((((AX((p110==1)) * AG(AF((p115==0)))) * ((p203==0) + (!(E((((p114==1)&&(p168==1))&&(p202==1)) U (p247==1))) * ((EX((p121==0)) + (p24==...245
=> equivalent forward existential formula: [FwdG(Init,(((!(EX(!((p110==1)))) * !(E(TRUE U !(!(EG(!((p115==0)))))))) * ((p203==0) + (!(E((((p114==1)&&(p168=...318
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t37, t43, t44, t47, t51, t56, t60, t63, t67, t73, t77, ...422
Detected timeout of ITS tools.
[2024-05-30 13:38:33] [INFO ] Flatten gal took : 16 ms
[2024-05-30 13:38:33] [INFO ] Applying decomposition
[2024-05-30 13:38:33] [INFO ] Flatten gal took : 9 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/graph10050415943136627074.txt' '-o' '/tmp/graph10050415943136627074.bin' '-w' '/tmp/graph10050415943136627074.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10050415943136627074.bin' '-l' '-1' '-v' '-w' '/tmp/graph10050415943136627074.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:38:33] [INFO ] Decomposing Gal with order
[2024-05-30 13:38:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:38:33] [INFO ] Removed a total of 49 redundant transitions.
[2024-05-30 13:38:33] [INFO ] Flatten gal took : 47 ms
[2024-05-30 13:38:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-30 13:38:33] [INFO ] Time to serialize gal into /tmp/CTLFireability16788643733326303836.gal : 4 ms
[2024-05-30 13:38:33] [INFO ] Time to serialize properties into /tmp/CTLFireability4667063569709707453.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/CTLFireability16788643733326303836.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4667063569709707453.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,1.47323e+18,0.171496,11580,413,23,16206,291,368,25052,43,612,0


Converting to forward existential form...Done !
original formula: EG((((AX((i8.u35.p110==1)) * AG(AF((i8.u36.p115==0)))) * ((i14.u61.p203==0) + (!(E((((i8.u36.p114==1)&&(i11.u53.p168==1))&&(i14.u61.p202=...365
=> equivalent forward existential formula: [FwdG(Init,(((!(EX(!((i8.u35.p110==1)))) * !(E(TRUE U !(!(EG(!((i8.u36.p115==0)))))))) * ((i14.u61.p203==0) + (!...438
Reverse transition relation is NOT exact ! Due to transitions t183, t186, t188, i0.i0.u2.t177, i1.t170, i1.u7.t174, i2.t154, i2.u13.t158, i3.i0.t163, i3.i0...690
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 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
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 235/235 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 198 transition count 198
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 198 transition count 198
Applied a total of 74 rules in 12 ms. Remains 198 /235 variables (removed 37) and now considering 198/235 (removed 37) transitions.
// Phase 1: matrix 198 rows 198 cols
[2024-05-30 13:39:03] [INFO ] Computed 21 invariants in 1 ms
[2024-05-30 13:39:03] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-30 13:39:03] [INFO ] Invariant cache hit.
[2024-05-30 13:39:03] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2024-05-30 13:39:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:39:05] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:39:05] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2024-05-30 13:39:05] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:39:05] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2024-05-30 13:39:05] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:39:05] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:39:05] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:39:06] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (OVERLAPS) 198/396 variables, 198/227 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (OVERLAPS) 0/396 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 227 constraints, problems are : Problem set: 0 solved, 197 unsolved in 7450 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/396 variables, 198/227 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 197/424 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:39:12] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:39:12] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:39:13] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:39:13] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 2 ms to minimize.
[2024-05-30 13:39:13] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:39:13] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
[2024-05-30 13:39:13] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:39:13] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2024-05-30 13:39:13] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 2 ms to minimize.
[2024-05-30 13:39:13] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:39:13] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:39:14] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:39:14] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:39:14] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:39:14] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:39:14] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:39:14] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:39:14] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:39:14] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:39:14] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 20/444 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:39:15] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2024-05-30 13:39:15] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-05-30 13:39:16] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:39:16] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:39:16] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:39:16] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:39:16] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:39:17] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 8/452 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:39:19] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2024-05-30 13:39:19] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:39:19] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:39:19] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:39:19] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 5/457 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:39:21] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:39:24] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:39:24] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 2/460 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:39:27] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:39:29] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/396 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:39:35] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 2 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/396 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:39:36] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/396 variables, 1/464 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/396 variables, and 464 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 48/48 constraints]
After SMT, in 37480ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 37482ms
Starting structural reductions in LTL mode, iteration 1 : 198/235 places, 198/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37732 ms. Remains : 198/235 places, 198/235 transitions.
[2024-05-30 13:39:41] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:39:41] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:39:41] [INFO ] Input system was already deterministic with 198 transitions.
[2024-05-30 13:39:41] [INFO ] Flatten gal took : 12 ms
[2024-05-30 13:39:41] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:39:41] [INFO ] Time to serialize gal into /tmp/CTLFireability11086836819125132334.gal : 2 ms
[2024-05-30 13:39:41] [INFO ] Time to serialize properties into /tmp/CTLFireability8580820207454255316.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/CTLFireability11086836819125132334.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8580820207454255316.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.36694e+18,1.40063,54792,2,2191,5,145045,6,0,992,365078,0


Converting to forward existential form...Done !
original formula: EX((AX((((A((p126==1) U (p115==1)) * EX((p226==1))) + (p150==1)) + ((p145==0)||(p181==0)))) * AG(AF(EG((p97==0))))))
=> equivalent forward existential formula: [((EY(Init) * !(EX(!((((!((E(!((p115==1)) U (!((p126==1)) * !((p115==1)))) + EG(!((p115==1))))) * EX((p226==1)))...250
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, t76, t78, ...412
Detected timeout of ITS tools.
[2024-05-30 13:40:11] [INFO ] Flatten gal took : 10 ms
[2024-05-30 13:40:11] [INFO ] Applying decomposition
[2024-05-30 13:40:11] [INFO ] Flatten gal took : 5 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/graph13593818437127027238.txt' '-o' '/tmp/graph13593818437127027238.bin' '-w' '/tmp/graph13593818437127027238.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13593818437127027238.bin' '-l' '-1' '-v' '-w' '/tmp/graph13593818437127027238.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:40:11] [INFO ] Decomposing Gal with order
[2024-05-30 13:40:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:40:11] [INFO ] Removed a total of 51 redundant transitions.
[2024-05-30 13:40:11] [INFO ] Flatten gal took : 16 ms
[2024-05-30 13:40:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 13:40:11] [INFO ] Time to serialize gal into /tmp/CTLFireability1215766687414968528.gal : 4 ms
[2024-05-30 13:40:11] [INFO ] Time to serialize properties into /tmp/CTLFireability9852343012543322448.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/CTLFireability1215766687414968528.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9852343012543322448.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,1.36694e+18,0.189306,11072,389,23,14270,272,392,25866,40,543,0


Converting to forward existential form...Done !
original formula: EX((AX((((A((i10.i1.u40.p126==1) U (i9.u36.p115==1)) * EX((i16.u71.p226==1))) + (i8.u48.p150==1)) + ((i8.u47.p145==0)||(i14.u60.p181==0))...189
=> equivalent forward existential formula: [((EY(Init) * !(EX(!((((!((E(!((i9.u36.p115==1)) U (!((i10.i1.u40.p126==1)) * !((i9.u36.p115==1)))) + EG(!((i9.u...319
Reverse transition relation is NOT exact ! Due to transitions t179, t181, t186, i0.i0.u2.t175, i0.i2.t152, i0.i2.u13.t156, i1.t168, i1.u7.t172, i2.t165, i2...666
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 235/235 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 196 transition count 196
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 196 transition count 196
Applied a total of 78 rules in 10 ms. Remains 196 /235 variables (removed 39) and now considering 196/235 (removed 39) transitions.
// Phase 1: matrix 196 rows 196 cols
[2024-05-30 13:40:41] [INFO ] Computed 21 invariants in 4 ms
[2024-05-30 13:40:41] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-30 13:40:41] [INFO ] Invariant cache hit.
[2024-05-30 13:40:41] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-30 13:40:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:40:42] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:40:43] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:40:43] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:40:43] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:40:43] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/392 variables, 196/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (OVERLAPS) 0/392 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 222 constraints, problems are : Problem set: 0 solved, 195 unsolved in 6529 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/392 variables, 196/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 195/417 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:40:49] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
[2024-05-30 13:40:49] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:40:50] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 3 ms to minimize.
[2024-05-30 13:40:50] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:40:50] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-05-30 13:40:50] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:40:50] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:40:50] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:40:50] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:40:50] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:40:50] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:40:51] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:40:51] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:40:51] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:40:51] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:40:51] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:40:51] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:40:51] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:40:51] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:40:51] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:40:52] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 2 ms to minimize.
[2024-05-30 13:40:52] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:40:53] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:40:53] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:40:53] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:40:53] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:40:53] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:40:53] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2024-05-30 13:40:54] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:40:54] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:40:54] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:40:54] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 12/449 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:40:55] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:40:55] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
[2024-05-30 13:40:56] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 2 ms to minimize.
[2024-05-30 13:40:56] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:40:56] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:40:56] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:40:57] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 7/456 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:41:01] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:41:01] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 2 ms to minimize.
[2024-05-30 13:41:01] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/392 variables, 3/459 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:41:05] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:41:09] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:41:09] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/392 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:41:16] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2024-05-30 13:41:16] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/392 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 464 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 52/52 constraints]
After SMT, in 36559ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 36562ms
Starting structural reductions in LTL mode, iteration 1 : 196/235 places, 196/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36758 ms. Remains : 196/235 places, 196/235 transitions.
[2024-05-30 13:41:18] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:41:18] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:41:18] [INFO ] Input system was already deterministic with 196 transitions.
[2024-05-30 13:41:18] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:41:18] [INFO ] Flatten gal took : 12 ms
[2024-05-30 13:41:18] [INFO ] Time to serialize gal into /tmp/CTLFireability10140051832179912367.gal : 2 ms
[2024-05-30 13:41:18] [INFO ] Time to serialize properties into /tmp/CTLFireability10393258606910407504.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/CTLFireability10140051832179912367.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10393258606910407504.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.13628e+18,1.14917,43696,2,1831,5,118079,6,0,982,280217,0


Converting to forward existential form...Done !
original formula: AF(EX(EF(AG(((p8==1)||(p149==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(E(TRUE U !(E(TRUE U !(((p8==1)||(p149==1)))))))))] = FALSE
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, ...401
(forward)formula 0,0,3.3473,98048,1,0,461,377895,418,202,5780,540408,486
FORMULA ShieldRVt-PT-005B-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 : 235/235 places, 235/235 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 198 transition count 198
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 198 transition count 198
Applied a total of 74 rules in 5 ms. Remains 198 /235 variables (removed 37) and now considering 198/235 (removed 37) transitions.
// Phase 1: matrix 198 rows 198 cols
[2024-05-30 13:41:21] [INFO ] Computed 21 invariants in 1 ms
[2024-05-30 13:41:21] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-30 13:41:21] [INFO ] Invariant cache hit.
[2024-05-30 13:41:21] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2024-05-30 13:41:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:41:23] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-30 13:41:23] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:41:23] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:41:23] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:41:23] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2024-05-30 13:41:23] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/396 variables, 198/225 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (OVERLAPS) 0/396 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 225 constraints, problems are : Problem set: 0 solved, 197 unsolved in 6592 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 198/396 variables, 198/225 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 197/422 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:41:30] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:41:30] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:41:30] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:41:30] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:41:30] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:41:30] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:41:30] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:41:30] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:41:30] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2024-05-30 13:41:31] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 2 ms to minimize.
[2024-05-30 13:41:31] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:41:31] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:41:31] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:41:31] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:41:31] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:41:31] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:41:31] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:41:31] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:41:31] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:41:31] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 20/442 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:41:32] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:41:32] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-30 13:41:32] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:41:33] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 2 ms to minimize.
[2024-05-30 13:41:33] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:41:33] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:41:33] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:41:33] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:41:33] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:41:33] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:41:34] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:41:34] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:41:34] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 13/455 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:41:35] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:41:36] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:41:36] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:41:36] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:41:37] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:41:37] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-30 13:41:37] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:41:37] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 8/463 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:41:38] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:41:39] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
[2024-05-30 13:41:39] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:41:39] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:41:39] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:41:40] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:41:40] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 7/470 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:41:42] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:41:42] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-30 13:41:42] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:41:43] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 4/474 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-30 13:41:48] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/396 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/396 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 14 (OVERLAPS) 0/396 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 475 constraints, problems are : Problem set: 0 solved, 197 unsolved in 28712 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 198/198 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 59/59 constraints]
After SMT, in 35322ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 35324ms
Starting structural reductions in LTL mode, iteration 1 : 198/235 places, 198/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35511 ms. Remains : 198/235 places, 198/235 transitions.
[2024-05-30 13:41:57] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:41:57] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:41:57] [INFO ] Input system was already deterministic with 198 transitions.
[2024-05-30 13:41:57] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:41:57] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:41:57] [INFO ] Time to serialize gal into /tmp/CTLFireability10415369825194081524.gal : 2 ms
[2024-05-30 13:41:57] [INFO ] Time to serialize properties into /tmp/CTLFireability13351030837313146504.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/CTLFireability10415369825194081524.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13351030837313146504.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.4213e+18,1.16363,45892,2,1854,5,121172,6,0,992,292255,0


Converting to forward existential form...Done !
original formula: EG(((p208==1) + E(AF(AX((p75==1))) U (p53==1))))
=> equivalent forward existential formula: [FwdG(Init,((p208==1) + E(!(EG(!(!(EX(!((p75==1))))))) U (p53==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t30, t31, t37, t41, t46, t50, t55, t59, t62, t66, t72, t76, t81, ...407
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-30 13:42:27] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:42:27] [INFO ] Applying decomposition
[2024-05-30 13:42:27] [INFO ] Flatten gal took : 4 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/graph1036432553049422846.txt' '-o' '/tmp/graph1036432553049422846.bin' '-w' '/tmp/graph1036432553049422846.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1036432553049422846.bin' '-l' '-1' '-v' '-w' '/tmp/graph1036432553049422846.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:42:27] [INFO ] Decomposing Gal with order
[2024-05-30 13:42:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:42:27] [INFO ] Removed a total of 49 redundant transitions.
[2024-05-30 13:42:27] [INFO ] Flatten gal took : 9 ms
[2024-05-30 13:42:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 13:42:27] [INFO ] Time to serialize gal into /tmp/CTLFireability10611550220061311198.gal : 2 ms
[2024-05-30 13:42:27] [INFO ] Time to serialize properties into /tmp/CTLFireability16216825721771922547.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/CTLFireability10611550220061311198.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16216825721771922547.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,1.4213e+18,0.122104,9192,377,33,10992,698,391,16927,49,1374,0


Converting to forward existential form...Done !
original formula: EG(((i17.u65.p208==1) + E(AF(AX((i5.u24.p75==1))) U (i3.u17.p53==1))))
=> equivalent forward existential formula: [FwdG(Init,((i17.u65.p208==1) + E(!(EG(!(!(EX(!((i5.u24.p75==1))))))) U (i3.u17.p53==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t179, t181, t184, t186, i0.i0.u2.t175, i0.i2.t152, i0.i2.u13.t156, i1.t168, i1.u6.t172, i2.t1...651
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
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
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
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
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
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
(forward)formula 0,0,24.5867,751124,1,0,1.21918e+06,698,2390,2.32202e+06,270,1813,804711
FORMULA ShieldRVt-PT-005B-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 235/235 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 202 transition count 202
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 202 transition count 202
Applied a total of 66 rules in 3 ms. Remains 202 /235 variables (removed 33) and now considering 202/235 (removed 33) transitions.
// Phase 1: matrix 202 rows 202 cols
[2024-05-30 13:42:52] [INFO ] Computed 21 invariants in 3 ms
[2024-05-30 13:42:52] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-30 13:42:52] [INFO ] Invariant cache hit.
[2024-05-30 13:42:52] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-30 13:42:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-30 13:42:53] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:42:53] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:42:53] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:42:53] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:42:54] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 0 ms to minimize.
[2024-05-30 13:42:54] [INFO ] Deduced a trap composed of 23 places in 19 ms of which 0 ms to minimize.
[2024-05-30 13:42:54] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2024-05-30 13:42:54] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:42:54] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 0 ms to minimize.
[2024-05-30 13:42:54] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-30 13:42:54] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:42:54] [INFO ] Deduced a trap composed of 28 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 202/404 variables, 202/235 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-30 13:42:57] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 0/404 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 236 constraints, problems are : Problem set: 0 solved, 201 unsolved in 8807 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 202/404 variables, 202/236 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 201/437 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-30 13:43:02] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
[2024-05-30 13:43:02] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:43:03] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:43:03] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:43:03] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 2 ms to minimize.
[2024-05-30 13:43:03] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:43:03] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:43:03] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:43:03] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:43:03] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-05-30 13:43:03] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:43:03] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2024-05-30 13:43:03] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:43:04] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 2 ms to minimize.
[2024-05-30 13:43:04] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:43:04] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-05-30 13:43:04] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:43:04] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
[2024-05-30 13:43:04] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:43:05] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 20/457 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-30 13:43:05] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 2 ms to minimize.
[2024-05-30 13:43:06] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:43:06] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:43:06] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:43:06] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
[2024-05-30 13:43:06] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:43:06] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:43:06] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:43:07] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:43:07] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:43:07] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:43:07] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:43:07] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:43:07] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:43:07] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:43:07] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:43:07] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 17/474 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-30 13:43:09] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:43:10] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:43:10] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:43:10] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:43:10] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 5/479 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-30 13:43:13] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:43:13] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:43:13] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:43:14] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:43:14] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 5/484 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-30 13:43:18] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:43:19] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2024-05-30 13:43:19] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:43:19] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/404 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-30 13:43:22] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:43:22] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:43:23] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 3/491 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-30 13:43:25] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:43:27] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:43:27] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:43:27] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/404 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-30 13:43:29] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/404 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 404/404 variables, and 496 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 72/72 constraints]
After SMT, in 38832ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 38834ms
Starting structural reductions in LTL mode, iteration 1 : 202/235 places, 202/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38992 ms. Remains : 202/235 places, 202/235 transitions.
[2024-05-30 13:43:31] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:43:31] [INFO ] Flatten gal took : 10 ms
[2024-05-30 13:43:31] [INFO ] Input system was already deterministic with 202 transitions.
[2024-05-30 13:43:31] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:43:31] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:43:31] [INFO ] Time to serialize gal into /tmp/CTLFireability15642463841148244101.gal : 1 ms
[2024-05-30 13:43:31] [INFO ] Time to serialize properties into /tmp/CTLFireability15991078358751225787.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/CTLFireability15642463841148244101.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15991078358751225787.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,2.15296e+18,1.39049,50184,2,2133,5,131389,6,0,1012,328899,0


Converting to forward existential form...Done !
original formula: !(A(E(A(A((p12==1) U (p116==1)) U ((p102==1)||(p181==1))) U ((((p244==1)||(p74==1)) * AF((p32==1))) * A((p23==1) U (p193==1)))) U (EG(EF(...215
=> equivalent forward existential formula: (([(FwdU(((FwdU(Init,!((EG(E(TRUE U (p179==1))) + (!(E(TRUE U !((p91==1)))) * !(EX(!(E((p30==1) U (p37==1)))))))...1126
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t9, t13, t17, t22, t26, t30, t31, t37, t41, t46, t50, t56, t61, t63, t67, t73, t77, t...435
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-30 13:44:01] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:44:01] [INFO ] Applying decomposition
[2024-05-30 13:44:01] [INFO ] Flatten gal took : 4 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/graph68120896122424796.txt' '-o' '/tmp/graph68120896122424796.bin' '-w' '/tmp/graph68120896122424796.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph68120896122424796.bin' '-l' '-1' '-v' '-w' '/tmp/graph68120896122424796.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:44:01] [INFO ] Decomposing Gal with order
[2024-05-30 13:44:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:44:01] [INFO ] Removed a total of 43 redundant transitions.
[2024-05-30 13:44:01] [INFO ] Flatten gal took : 10 ms
[2024-05-30 13:44:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 13:44:01] [INFO ] Time to serialize gal into /tmp/CTLFireability16239639802081938791.gal : 2 ms
[2024-05-30 13:44:01] [INFO ] Time to serialize properties into /tmp/CTLFireability8348245090656993841.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/CTLFireability16239639802081938791.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8348245090656993841.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,2.15296e+18,0.174141,11068,445,40,14927,424,430,23031,52,918,0


Converting to forward existential form...Done !
original formula: !(A(E(A(A((i1.u5.p12==1) U (i10.u35.p116==1)) U ((i8.u32.p102==1)||(i16.u57.p181==1))) U ((((i17.u74.p244==1)||(i6.u24.p74==1)) * AF((i2....311
=> equivalent forward existential formula: (([(FwdU(((FwdU(Init,!((EG(E(TRUE U (i15.u52.p179==1))) + (!(E(TRUE U !((i7.u30.p91==1)))) * !(EX(!(E((i2.u9.p30...1518
Reverse transition relation is NOT exact ! Due to transitions t183, t185, t188, t190, i0.i0.u2.t179, i1.t172, i1.u6.t176, i2.t169, i2.t165, i2.u10.t170, i3...711
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
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
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
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 LTL mode, iteration 0 : 235/235 places, 235/235 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 203 transition count 203
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 203 transition count 203
Applied a total of 64 rules in 3 ms. Remains 203 /235 variables (removed 32) and now considering 203/235 (removed 32) transitions.
// Phase 1: matrix 203 rows 203 cols
[2024-05-30 13:44:31] [INFO ] Computed 21 invariants in 1 ms
[2024-05-30 13:44:31] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-30 13:44:31] [INFO ] Invariant cache hit.
[2024-05-30 13:44:31] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2024-05-30 13:44:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-30 13:44:32] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:44:32] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:44:32] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:44:33] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:44:33] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:44:33] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
[2024-05-30 13:44:33] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:44:33] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-30 13:44:33] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:44:34] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2024-05-30 13:44:34] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 203/406 variables, 203/235 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (OVERLAPS) 0/406 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 235 constraints, problems are : Problem set: 0 solved, 202 unsolved in 7802 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 11/32 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-30 13:44:39] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:44:40] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 203/406 variables, 203/237 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 202/439 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-30 13:44:41] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:44:41] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:44:41] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 2 ms to minimize.
[2024-05-30 13:44:41] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 2 ms to minimize.
[2024-05-30 13:44:42] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:44:42] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:44:42] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 2 ms to minimize.
[2024-05-30 13:44:42] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-05-30 13:44:42] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:44:42] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:44:42] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:44:43] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:44:43] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:44:43] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2024-05-30 13:44:43] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:44:43] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:44:43] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:44:43] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:44:43] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:44:43] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 20/459 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-30 13:44:44] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:44:44] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:44:45] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:44:45] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:44:45] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:44:45] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:44:46] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:44:46] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:44:46] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:44:46] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 10/469 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-30 13:44:47] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:44:48] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:44:48] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-30 13:44:48] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 2 ms to minimize.
[2024-05-30 13:44:48] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:44:49] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:44:49] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:44:49] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 8/477 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-30 13:44:51] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:44:52] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:44:52] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:44:52] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:44:52] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:44:52] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 6/483 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-30 13:44:55] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:44:56] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:44:56] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
[2024-05-30 13:44:56] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/406 variables, 4/487 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-30 13:45:01] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:45:01] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:45:02] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:45:03] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/406 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-30 13:45:08] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 492 constraints, problems are : Problem set: 0 solved, 202 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 66/66 constraints]
After SMT, in 37827ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 37829ms
Starting structural reductions in LTL mode, iteration 1 : 203/235 places, 203/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37990 ms. Remains : 203/235 places, 203/235 transitions.
[2024-05-30 13:45:09] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:45:09] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:45:09] [INFO ] Input system was already deterministic with 203 transitions.
[2024-05-30 13:45:09] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:45:09] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:45:09] [INFO ] Time to serialize gal into /tmp/CTLFireability2183921794117867204.gal : 1 ms
[2024-05-30 13:45:09] [INFO ] Time to serialize properties into /tmp/CTLFireability7731140059915069674.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/CTLFireability2183921794117867204.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7731140059915069674.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.33097e+18,2.18617,62176,2,2635,5,157695,6,0,1017,425825,0


Converting to forward existential form...Done !
original formula: !(E(A(!((A((p134==1) U ((p31==1)&&(p50==1))) + (AX((p165==1)) * ((p74==1)||(p14==1))))) U (!((EF((p182==1)) * AG((p53==1)))) * (((p80==1)...275
=> equivalent forward existential formula: [FwdG(FwdU(Init,!((E(!((!((E(TRUE U (p182==1)) * !(E(TRUE U !((p53==1)))))) * (((p80==1)&&(p99==1))||(((p146!=1)...669
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t8, t13, t17, t22, t26, t29, t31, t32, t34, t38, t42, t47, t52, t54, t57, t61, t64, t...437
Detected timeout of ITS tools.
[2024-05-30 13:45:39] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:45:39] [INFO ] Applying decomposition
[2024-05-30 13:45:39] [INFO ] Flatten gal took : 9 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/graph1544052027252803342.txt' '-o' '/tmp/graph1544052027252803342.bin' '-w' '/tmp/graph1544052027252803342.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1544052027252803342.bin' '-l' '-1' '-v' '-w' '/tmp/graph1544052027252803342.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:45:39] [INFO ] Decomposing Gal with order
[2024-05-30 13:45:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:45:39] [INFO ] Removed a total of 44 redundant transitions.
[2024-05-30 13:45:39] [INFO ] Flatten gal took : 10 ms
[2024-05-30 13:45:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 13:45:39] [INFO ] Time to serialize gal into /tmp/CTLFireability12878161368785588181.gal : 3 ms
[2024-05-30 13:45:39] [INFO ] Time to serialize properties into /tmp/CTLFireability1886613558764993375.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/CTLFireability12878161368785588181.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1886613558764993375.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,2.33097e+18,0.200798,12424,491,39,16621,385,435,29681,49,827,0


Converting to forward existential form...Done !
original formula: !(E(A(!((A((i10.u46.p134==1) U ((i1.u12.p31==1)&&(i2.u18.p50==1))) + (AX((i12.u53.p165==1)) * ((i5.u25.p74==1)||(i0.u7.p14==1))))) U (!((...406
=> equivalent forward existential formula: [FwdG(FwdU(Init,!((E(!((!((E(TRUE U (i14.u60.p182==1)) * !(E(TRUE U !((i2.u17.p53==1)))))) * (((i5.u25.p80==1)&&...936
Reverse transition relation is NOT exact ! Due to transitions t184, t186, t189, i0.t178, i0.t172, i0.u8.t176, i1.t169, i1.t165, i2.u18.t147, i2.u18.t151, i...738
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 235/235 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 203 transition count 203
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 203 transition count 203
Applied a total of 64 rules in 9 ms. Remains 203 /235 variables (removed 32) and now considering 203/235 (removed 32) transitions.
// Phase 1: matrix 203 rows 203 cols
[2024-05-30 13:46:09] [INFO ] Computed 21 invariants in 3 ms
[2024-05-30 13:46:09] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-30 13:46:09] [INFO ] Invariant cache hit.
[2024-05-30 13:46:09] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2024-05-30 13:46:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-30 13:46:10] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:46:11] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:46:11] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:46:11] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:46:11] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:46:11] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:46:11] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:46:11] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-30 13:46:11] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:46:11] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:46:11] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 11/32 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/406 variables, 203/235 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-30 13:46:13] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (OVERLAPS) 0/406 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 236 constraints, problems are : Problem set: 0 solved, 202 unsolved in 8206 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 12/33 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/406 variables, 203/236 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 202/438 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-30 13:46:19] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:46:19] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:46:19] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 3 ms to minimize.
[2024-05-30 13:46:19] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:46:20] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:46:20] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:46:20] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 2 ms to minimize.
[2024-05-30 13:46:20] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:46:20] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 2 ms to minimize.
[2024-05-30 13:46:20] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 2 ms to minimize.
[2024-05-30 13:46:20] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:46:20] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:46:20] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:46:21] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:46:21] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:46:21] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:46:21] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 2 ms to minimize.
[2024-05-30 13:46:21] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
[2024-05-30 13:46:21] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2024-05-30 13:46:21] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 20/458 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-30 13:46:22] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:46:22] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-05-30 13:46:22] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:46:22] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:46:22] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:46:22] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:46:22] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:46:22] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:46:23] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2024-05-30 13:46:23] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:46:23] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:46:23] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:46:23] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:46:23] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:46:24] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:46:24] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:46:24] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:46:24] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:46:24] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:46:24] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 20/478 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-30 13:46:25] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:46:25] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
[2024-05-30 13:46:25] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:46:26] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:46:26] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:46:26] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:46:26] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:46:27] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:46:27] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:46:27] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:46:27] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 2 ms to minimize.
[2024-05-30 13:46:28] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:46:28] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:46:28] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 14/492 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-30 13:46:30] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:46:30] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:46:31] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 3/495 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-05-30 13:46:34] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:46:34] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2024-05-30 13:46:34] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 3/498 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/406 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 12 (OVERLAPS) 0/406 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 498 constraints, problems are : Problem set: 0 solved, 202 unsolved in 26061 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 72/72 constraints]
After SMT, in 34289ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 34292ms
Starting structural reductions in LTL mode, iteration 1 : 203/235 places, 203/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34483 ms. Remains : 203/235 places, 203/235 transitions.
[2024-05-30 13:46:43] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:46:43] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:46:43] [INFO ] Input system was already deterministic with 203 transitions.
[2024-05-30 13:46:43] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:46:43] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:46:43] [INFO ] Time to serialize gal into /tmp/CTLFireability10172279367781988217.gal : 1 ms
[2024-05-30 13:46:43] [INFO ] Time to serialize properties into /tmp/CTLFireability8397648377781658299.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/CTLFireability10172279367781988217.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8397648377781658299.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.18426e+18,2.84938,96696,2,2845,5,220252,6,0,1017,717852,0


Converting to forward existential form...Done !
original formula: EF(((p84==1) * (E((!(((p111==1)||(p135==1))) * AX((p195==1))) U EX(EX((p101==1)))) + ((p152==1) * (AF((p64==1)) + A((p102!=1) U E((((p43=...199
=> equivalent forward existential formula: ([(EY(EY(FwdU((FwdU(Init,TRUE) * (p84==1)),(!(((p111==1)||(p135==1))) * !(EX(!((p195==1)))))))) * (p101==1))] !=...492
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t42, t46, t50, t55, t59, t62, t68, t73, t74, ...463
(forward)formula 0,1,4.02868,98132,1,0,417,339645,431,208,5550,717852,421
FORMULA ShieldRVt-PT-005B-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 235/235 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 200 transition count 200
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 200 transition count 200
Applied a total of 70 rules in 3 ms. Remains 200 /235 variables (removed 35) and now considering 200/235 (removed 35) transitions.
// Phase 1: matrix 200 rows 200 cols
[2024-05-30 13:46:48] [INFO ] Computed 21 invariants in 2 ms
[2024-05-30 13:46:48] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-30 13:46:48] [INFO ] Invariant cache hit.
[2024-05-30 13:46:48] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2024-05-30 13:46:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-30 13:46:49] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:46:49] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:46:49] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:46:49] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:46:50] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:46:50] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:46:50] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:46:50] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/400 variables, 200/229 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-30 13:46:52] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:46:52] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (OVERLAPS) 0/400 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 231 constraints, problems are : Problem set: 0 solved, 199 unsolved in 7879 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/200 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/400 variables, 200/231 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 199/430 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-30 13:46:57] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:46:57] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:46:58] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:46:58] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:46:58] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:46:58] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
[2024-05-30 13:46:58] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:46:58] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:46:58] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2024-05-30 13:46:58] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:46:58] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:46:58] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:46:58] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:46:59] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:46:59] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:46:59] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:46:59] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:46:59] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:46:59] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:46:59] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 20/450 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-30 13:47:00] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:47:00] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 2 ms to minimize.
[2024-05-30 13:47:00] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:47:00] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:47:01] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:47:01] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:47:01] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:47:01] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:47:02] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:47:02] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:47:02] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 11/461 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-30 13:47:03] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:47:04] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:47:04] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:47:04] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:47:04] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:47:04] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:47:05] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:47:05] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 2 ms to minimize.
[2024-05-30 13:47:05] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:47:05] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 10/471 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-30 13:47:07] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:47:07] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:47:08] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:47:08] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 4/475 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-30 13:47:11] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:47:11] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:47:11] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:47:11] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:47:12] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 5/480 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-30 13:47:15] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:47:15] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 2/482 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 13 (OVERLAPS) 0/400 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 482 constraints, problems are : Problem set: 0 solved, 199 unsolved in 29054 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 62/62 constraints]
After SMT, in 36949ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 36954ms
Starting structural reductions in LTL mode, iteration 1 : 200/235 places, 200/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37116 ms. Remains : 200/235 places, 200/235 transitions.
[2024-05-30 13:47:25] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:47:25] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:47:25] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-30 13:47:25] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:47:25] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:47:25] [INFO ] Time to serialize gal into /tmp/CTLFireability3825295345757071302.gal : 1 ms
[2024-05-30 13:47:25] [INFO ] Time to serialize properties into /tmp/CTLFireability2150303479022856449.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/CTLFireability3825295345757071302.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2150303479022856449.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.75866e+18,1.35213,53912,2,2067,5,140081,6,0,1002,362108,0


Converting to forward existential form...Done !
original formula: E(!(A(A(E((p40==1) U (p37==1)) U E((p156==1) U (p98==1))) U EF((p216==1)))) U EX(EX((p184==1))))
=> equivalent forward existential formula: [(EY(EY(FwdU(Init,!(!((E(!(E(TRUE U (p216==1))) U (!(!((E(!(E((p156==1) U (p98==1))) U (!(E((p40==1) U (p37==1))...308
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t28, t30, t31, t33, t37, t41, t46, t50, t51, t56, t60, t63, t67, ...422
Detected timeout of ITS tools.
[2024-05-30 13:47:55] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:47:55] [INFO ] Applying decomposition
[2024-05-30 13:47:55] [INFO ] Flatten gal took : 5 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/graph8526163855682679991.txt' '-o' '/tmp/graph8526163855682679991.bin' '-w' '/tmp/graph8526163855682679991.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8526163855682679991.bin' '-l' '-1' '-v' '-w' '/tmp/graph8526163855682679991.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:47:55] [INFO ] Decomposing Gal with order
[2024-05-30 13:47:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:47:55] [INFO ] Removed a total of 48 redundant transitions.
[2024-05-30 13:47:55] [INFO ] Flatten gal took : 21 ms
[2024-05-30 13:47:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 13:47:55] [INFO ] Time to serialize gal into /tmp/CTLFireability18384717148681327390.gal : 2 ms
[2024-05-30 13:47:55] [INFO ] Time to serialize properties into /tmp/CTLFireability7550584977780070234.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/CTLFireability18384717148681327390.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7550584977780070234.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,1.75866e+18,0.126644,9240,390,23,11661,281,391,17702,40,585,0


Converting to forward existential form...Done !
original formula: E(!(A(A(E((i2.u13.p40==1) U (i2.u14.p37==1)) U E((i8.i1.u50.p156==1) U (i7.u34.p98==1))) U EF((i17.u69.p216==1)))) U EX(EX((i15.u63.p184=...161
=> equivalent forward existential formula: [(EY(EY(FwdU(Init,!(!((E(!(E(TRUE U (i17.u69.p216==1))) U (!(!((E(!(E((i8.i1.u50.p156==1) U (i7.u34.p98==1))) U ...405
Reverse transition relation is NOT exact ! Due to transitions t181, t183, t186, i0.i1.t167, i0.i2.t148, i0.i2.u16.t144, i1.t170, i1.u5.t174, i2.t158, i2.u1...688
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 235/235 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 197 transition count 197
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 197 transition count 197
Applied a total of 76 rules in 9 ms. Remains 197 /235 variables (removed 38) and now considering 197/235 (removed 38) transitions.
// Phase 1: matrix 197 rows 197 cols
[2024-05-30 13:48:25] [INFO ] Computed 21 invariants in 2 ms
[2024-05-30 13:48:25] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-30 13:48:25] [INFO ] Invariant cache hit.
[2024-05-30 13:48:25] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-30 13:48:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:48:26] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:48:26] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:48:27] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:48:27] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:48:27] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/394 variables, 197/223 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 0/394 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 223 constraints, problems are : Problem set: 0 solved, 196 unsolved in 6439 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/394 variables, 197/223 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 196/419 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:48:33] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:48:33] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 2 ms to minimize.
[2024-05-30 13:48:33] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:48:33] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 2 ms to minimize.
[2024-05-30 13:48:33] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:48:34] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:48:34] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:48:34] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:48:34] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:48:34] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:48:34] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 4 ms to minimize.
[2024-05-30 13:48:34] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:48:34] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:48:34] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 2 ms to minimize.
[2024-05-30 13:48:34] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 2 ms to minimize.
[2024-05-30 13:48:34] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:48:35] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:48:35] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:48:35] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:48:35] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 20/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:48:36] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:48:36] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:48:36] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:48:36] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:48:36] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:48:37] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:48:37] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:48:37] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:48:37] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:48:37] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:48:37] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:48:37] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 2 ms to minimize.
[2024-05-30 13:48:37] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
[2024-05-30 13:48:38] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-05-30 13:48:38] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 15/454 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:48:40] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:48:40] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:48:40] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 3/457 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:48:42] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 2 ms to minimize.
[2024-05-30 13:48:42] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:48:43] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:48:43] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:48:43] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:48:43] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 6/463 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:48:45] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 1/464 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:48:48] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-05-30 13:48:49] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:48:49] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:48:49] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 4/468 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:48:55] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/394 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:48:57] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/394 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/394 variables, and 470 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 56/56 constraints]
After SMT, in 36461ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 36463ms
Starting structural reductions in LTL mode, iteration 1 : 197/235 places, 197/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36627 ms. Remains : 197/235 places, 197/235 transitions.
[2024-05-30 13:49:01] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:49:02] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:49:02] [INFO ] Input system was already deterministic with 197 transitions.
[2024-05-30 13:49:02] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:49:02] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:49:02] [INFO ] Time to serialize gal into /tmp/CTLFireability8527276802133339366.gal : 1 ms
[2024-05-30 13:49:02] [INFO ] Time to serialize properties into /tmp/CTLFireability957812646660072399.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/CTLFireability8527276802133339366.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability957812646660072399.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,1.26042e+18,1.39959,50836,2,1844,5,129755,6,0,987,339994,0


Converting to forward existential form...Done !
original formula: EX(!(A((AX(!((((p190==1)&&(p202==1))&&(p234==1)))) + !(((p80==1)&&(p99==1)))) U (p161==1))))
=> equivalent forward existential formula: ([(EY(((FwdU(EY(Init),!((p161==1))) * !((p161==1))) * !(!(((p80==1)&&(p99==1)))))) * (((p190==1)&&(p202==1))&&(p...216
Hit Full ! (commute/partial/dont) 195/0/2
(forward)formula 0,1,1.95154,50836,1,0,16,129755,17,4,1894,339994,8
FORMULA ShieldRVt-PT-005B-CTLFireability-2024-09 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 : 235/235 places, 235/235 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 196 transition count 196
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 196 transition count 196
Applied a total of 78 rules in 3 ms. Remains 196 /235 variables (removed 39) and now considering 196/235 (removed 39) transitions.
// Phase 1: matrix 196 rows 196 cols
[2024-05-30 13:49:04] [INFO ] Computed 21 invariants in 3 ms
[2024-05-30 13:49:04] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-30 13:49:04] [INFO ] Invariant cache hit.
[2024-05-30 13:49:04] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-05-30 13:49:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:49:05] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:49:05] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:49:05] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:49:05] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:49:06] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/392 variables, 196/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (OVERLAPS) 0/392 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 222 constraints, problems are : Problem set: 0 solved, 195 unsolved in 6468 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (OVERLAPS) 196/392 variables, 196/222 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 195/417 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:49:12] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:49:12] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 2 ms to minimize.
[2024-05-30 13:49:12] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:49:12] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:49:12] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:49:12] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 2 ms to minimize.
[2024-05-30 13:49:12] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:49:13] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:49:13] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:49:13] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:49:13] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:49:13] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
[2024-05-30 13:49:13] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:49:13] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 2 ms to minimize.
[2024-05-30 13:49:13] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:49:13] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:49:13] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:49:14] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:49:14] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:49:14] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 20/437 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:49:14] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:49:14] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:49:15] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:49:15] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:49:15] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:49:15] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:49:15] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:49:16] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:49:16] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:49:16] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:49:16] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:49:16] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 12/449 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:49:18] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:49:18] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:49:18] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:49:18] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:49:19] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:49:19] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-30 13:49:19] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 7/456 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:49:23] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:49:24] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 2 ms to minimize.
[2024-05-30 13:49:24] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/392 variables, 3/459 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:49:27] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:49:32] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:49:32] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/392 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-05-30 13:49:38] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:49:38] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/392 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 195 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 464 constraints, problems are : Problem set: 0 solved, 195 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 52/52 constraints]
After SMT, in 36492ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 36494ms
Starting structural reductions in LTL mode, iteration 1 : 196/235 places, 196/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36649 ms. Remains : 196/235 places, 196/235 transitions.
[2024-05-30 13:49:40] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:49:40] [INFO ] Flatten gal took : 11 ms
[2024-05-30 13:49:40] [INFO ] Input system was already deterministic with 196 transitions.
[2024-05-30 13:49:40] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:49:40] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:49:40] [INFO ] Time to serialize gal into /tmp/CTLFireability4687876764485854534.gal : 1 ms
[2024-05-30 13:49:40] [INFO ] Time to serialize properties into /tmp/CTLFireability13227047871277175772.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/CTLFireability4687876764485854534.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13227047871277175772.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.13628e+18,1.1607,43700,2,1831,5,118079,6,0,982,280217,0


Converting to forward existential form...Done !
original formula: AG(AX((AX((EF((p8==1)) + ((p178==1)&&(p197==1)))) + (p6==1))))
=> equivalent forward existential formula: [((EY((EY(FwdU(Init,TRUE)) * !((p6==1)))) * !(((p178==1)&&(p197==1)))) * !(E(TRUE U (p8==1))))] = FALSE
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, ...401
(forward)formula 0,0,2.09703,47748,1,0,390,226797,417,204,5512,280217,406
FORMULA ShieldRVt-PT-005B-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 235/235 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 197 transition count 197
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 197 transition count 197
Applied a total of 76 rules in 9 ms. Remains 197 /235 variables (removed 38) and now considering 197/235 (removed 38) transitions.
// Phase 1: matrix 197 rows 197 cols
[2024-05-30 13:49:42] [INFO ] Computed 21 invariants in 1 ms
[2024-05-30 13:49:42] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-30 13:49:42] [INFO ] Invariant cache hit.
[2024-05-30 13:49:42] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-30 13:49:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:49:44] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:49:44] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:49:44] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:49:44] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:49:44] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/394 variables, 197/223 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 0/394 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 223 constraints, problems are : Problem set: 0 solved, 196 unsolved in 6476 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/394 variables, 197/223 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 196/419 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:49:51] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:49:51] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 2 ms to minimize.
[2024-05-30 13:49:51] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:49:51] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:49:51] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:49:51] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:49:51] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:49:51] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:49:51] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:49:52] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:49:52] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 2 ms to minimize.
[2024-05-30 13:49:52] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 2 ms to minimize.
[2024-05-30 13:49:52] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:49:52] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:49:52] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:49:52] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:49:52] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:49:52] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:49:53] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:49:53] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 20/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:49:53] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:49:54] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:49:54] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:49:54] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:49:54] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:49:54] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 2 ms to minimize.
[2024-05-30 13:49:54] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:49:55] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:49:55] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 2 ms to minimize.
[2024-05-30 13:49:55] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:49:55] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:49:55] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 2 ms to minimize.
[2024-05-30 13:49:55] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:49:55] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:49:55] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:49:55] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2024-05-30 13:49:55] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 3 ms to minimize.
[2024-05-30 13:49:55] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 18/457 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:49:57] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:49:57] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:49:58] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:49:58] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:49:58] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 5/462 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:49:59] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:50:00] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:50:01] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 3/465 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:50:03] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:50:03] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:50:03] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:50:03] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:50:04] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:50:04] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 2 ms to minimize.
[2024-05-30 13:50:04] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:50:04] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:50:04] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 9/474 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:50:09] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/394 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:50:11] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:50:11] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:50:11] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/394 variables, 3/478 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:50:14] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:50:15] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:50:16] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 3/481 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/394 variables, and 481 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 67/67 constraints]
After SMT, in 36502ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 36504ms
Starting structural reductions in LTL mode, iteration 1 : 197/235 places, 197/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36673 ms. Remains : 197/235 places, 197/235 transitions.
[2024-05-30 13:50:19] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:50:19] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:50:19] [INFO ] Input system was already deterministic with 197 transitions.
[2024-05-30 13:50:19] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:50:19] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:50:19] [INFO ] Time to serialize gal into /tmp/CTLFireability12768472091266104111.gal : 1 ms
[2024-05-30 13:50:19] [INFO ] Time to serialize properties into /tmp/CTLFireability13293146772804945416.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/CTLFireability12768472091266104111.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13293146772804945416.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.25919e+18,1.14131,44496,2,1859,5,118757,6,0,987,287071,0


Converting to forward existential form...Done !
original formula: EG(AX(AG(EF(EX((p245==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!(E(TRUE U !(E(TRUE U EX((p245==1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t8, t13, t17, t22, t26, t30, t31, t37, t41, t46, t50, t55, t59, t62, t66, t72, t76, t...405
Detected timeout of ITS tools.
[2024-05-30 13:50:49] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:50:49] [INFO ] Applying decomposition
[2024-05-30 13:50:49] [INFO ] Flatten gal took : 4 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/graph2508874990087671948.txt' '-o' '/tmp/graph2508874990087671948.bin' '-w' '/tmp/graph2508874990087671948.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2508874990087671948.bin' '-l' '-1' '-v' '-w' '/tmp/graph2508874990087671948.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:50:49] [INFO ] Decomposing Gal with order
[2024-05-30 13:50:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:50:49] [INFO ] Removed a total of 52 redundant transitions.
[2024-05-30 13:50:49] [INFO ] Flatten gal took : 10 ms
[2024-05-30 13:50:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 13:50:49] [INFO ] Time to serialize gal into /tmp/CTLFireability2391042981722584282.gal : 1 ms
[2024-05-30 13:50:49] [INFO ] Time to serialize properties into /tmp/CTLFireability970702152997574418.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/CTLFireability2391042981722584282.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability970702152997574418.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,1.25919e+18,0.143681,9728,353,22,12052,282,367,20241,38,554,0


Converting to forward existential form...Done !
original formula: EG(AX(AG(EF(EX((i17.u78.p245==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(!(E(TRUE U !(E(TRUE U EX((i17.u78.p245==1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t178, t180, t183, t185, i0.t167, i0.u6.t171, i1.t164, i2.i0.u2.t174, i2.i1.t151, i2.i1.u13.t1...654
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 235/235 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 202 transition count 202
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 202 transition count 202
Applied a total of 66 rules in 3 ms. Remains 202 /235 variables (removed 33) and now considering 202/235 (removed 33) transitions.
// Phase 1: matrix 202 rows 202 cols
[2024-05-30 13:51:19] [INFO ] Computed 21 invariants in 3 ms
[2024-05-30 13:51:19] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-30 13:51:19] [INFO ] Invariant cache hit.
[2024-05-30 13:51:19] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-30 13:51:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-30 13:51:21] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:51:21] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:51:21] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:51:21] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:51:21] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:51:21] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:51:21] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-30 13:51:22] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:51:22] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-30 13:51:23] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:51:23] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (OVERLAPS) 202/404 variables, 202/234 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (OVERLAPS) 0/404 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 234 constraints, problems are : Problem set: 0 solved, 201 unsolved in 8296 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 11/32 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-30 13:51:29] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:51:29] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 202/404 variables, 202/236 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 201/437 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-30 13:51:30] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:51:30] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:51:30] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:51:30] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:51:31] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:51:31] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:51:31] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:51:31] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:51:31] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:51:31] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:51:31] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
[2024-05-30 13:51:31] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:51:31] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:51:31] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:51:31] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:51:31] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:51:31] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:51:32] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:51:32] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:51:32] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 20/457 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-30 13:51:33] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:51:33] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:51:33] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 2 ms to minimize.
[2024-05-30 13:51:33] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:51:33] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:51:33] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:51:33] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:51:33] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 2 ms to minimize.
[2024-05-30 13:51:34] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:51:34] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:51:34] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:51:34] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:51:34] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:51:34] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:51:34] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:51:34] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:51:34] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:51:35] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:51:35] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:51:35] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 20/477 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-30 13:51:36] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:51:37] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:51:37] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:51:37] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:51:38] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:51:38] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2024-05-30 13:51:38] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 7/484 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-30 13:51:39] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:51:40] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:51:40] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:51:40] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-30 13:51:44] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:51:44] [INFO ] Deduced a trap composed of 52 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:51:44] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:51:44] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:51:44] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2024-05-30 13:51:44] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:51:45] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/404 variables, 7/495 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-30 13:51:50] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:51:50] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:51:51] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:51:52] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:51:52] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:51:53] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/404 variables, 6/501 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-30 13:51:54] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:51:56] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:51:56] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/404 variables, 3/504 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 404/404 variables, and 504 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 80/80 constraints]
After SMT, in 38320ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 38323ms
Starting structural reductions in LTL mode, iteration 1 : 202/235 places, 202/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38493 ms. Remains : 202/235 places, 202/235 transitions.
[2024-05-30 13:51:58] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:51:58] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:51:58] [INFO ] Input system was already deterministic with 202 transitions.
[2024-05-30 13:51:58] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:51:58] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:51:58] [INFO ] Time to serialize gal into /tmp/CTLFireability9452458266575204832.gal : 1 ms
[2024-05-30 13:51:58] [INFO ] Time to serialize properties into /tmp/CTLFireability18409653722128669326.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/CTLFireability9452458266575204832.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18409653722128669326.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.82826e+18,1.89853,64860,2,2042,5,160455,6,0,1012,453568,0


Converting to forward existential form...Done !
original formula: E(!((!((((p118==1)||(p115==1)) * AG((p54==1)))) * (p213==1))) U EG((EG((((p18==1)||(p126==1)) * EX((p61==1)))) * (AF(((p162==1)&&(p89==1)...215
=> equivalent forward existential formula: [FwdG(FwdU(Init,!((!((((p118==1)||(p115==1)) * !(E(TRUE U !((p54==1)))))) * (p213==1)))),(EG((((p18==1)||(p126==...324
Reverse transition relation is NOT exact ! Due to transitions t4, t9, t13, t17, t22, t26, t28, t31, t32, t38, t42, t47, t51, t56, t60, t61, t64, t68, t69, ...429
Detected timeout of ITS tools.
[2024-05-30 13:52:28] [INFO ] Flatten gal took : 10 ms
[2024-05-30 13:52:28] [INFO ] Applying decomposition
[2024-05-30 13:52:28] [INFO ] Flatten gal took : 4 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/graph17232217045506774167.txt' '-o' '/tmp/graph17232217045506774167.bin' '-w' '/tmp/graph17232217045506774167.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17232217045506774167.bin' '-l' '-1' '-v' '-w' '/tmp/graph17232217045506774167.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:52:28] [INFO ] Decomposing Gal with order
[2024-05-30 13:52:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:52:28] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-30 13:52:28] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:52:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 13:52:28] [INFO ] Time to serialize gal into /tmp/CTLFireability16199558859756900406.gal : 2 ms
[2024-05-30 13:52:28] [INFO ] Time to serialize properties into /tmp/CTLFireability3488167492383830386.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/CTLFireability16199558859756900406.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3488167492383830386.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,1.82826e+18,0.20971,11632,397,23,14986,282,423,28848,43,568,0


Converting to forward existential form...Done !
original formula: E(!((!((((i8.u37.p118==1)||(i8.u36.p115==1)) * AG((i3.u15.p54==1)))) * (i16.u70.p213==1))) U EG((EG((((i1.u7.p18==1)||(i9.i1.u39.p126==1)...314
=> equivalent forward existential formula: [FwdG(FwdU(Init,!((!((((i8.u37.p118==1)||(i8.u36.p115==1)) * !(E(TRUE U !((i3.u15.p54==1)))))) * (i16.u70.p213==...439
Reverse transition relation is NOT exact ! Due to transitions t183, t185, i0.i0.u2.t179, i0.i2.t156, i0.i2.u13.t160, i1.t172, i1.u7.t176, i2.t169, i2.t165,...716
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 235/235 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 197 transition count 197
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 197 transition count 197
Applied a total of 76 rules in 3 ms. Remains 197 /235 variables (removed 38) and now considering 197/235 (removed 38) transitions.
// Phase 1: matrix 197 rows 197 cols
[2024-05-30 13:52:58] [INFO ] Computed 21 invariants in 5 ms
[2024-05-30 13:52:58] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-30 13:52:58] [INFO ] Invariant cache hit.
[2024-05-30 13:52:58] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-30 13:52:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:52:59] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:52:59] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:53:00] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:53:00] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:53:00] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/394 variables, 197/223 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 0/394 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 223 constraints, problems are : Problem set: 0 solved, 196 unsolved in 6334 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 197/394 variables, 197/223 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 196/419 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:53:06] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:53:06] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 2 ms to minimize.
[2024-05-30 13:53:06] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:53:06] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:53:06] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:53:06] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:53:06] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:53:07] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:53:07] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:53:07] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:53:07] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:53:07] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:53:07] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:53:07] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:53:07] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:53:07] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:53:07] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:53:07] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:53:08] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:53:08] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 20/439 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:53:09] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:53:09] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:53:09] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:53:09] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:53:09] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:53:09] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:53:09] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:53:10] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:53:10] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:53:10] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:53:10] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 2 ms to minimize.
[2024-05-30 13:53:10] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:53:10] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:53:10] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:53:11] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 15/454 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:53:12] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:53:12] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:53:13] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 3/457 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:53:15] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2024-05-30 13:53:15] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:53:15] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:53:16] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:53:16] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-05-30 13:53:16] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 6/463 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:53:18] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 1/464 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:53:21] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:53:21] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:53:21] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:53:22] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 4/468 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:53:27] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/394 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 13:53:29] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/394 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/394 variables, and 470 constraints, problems are : Problem set: 0 solved, 196 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 56/56 constraints]
After SMT, in 36359ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 36361ms
Starting structural reductions in LTL mode, iteration 1 : 197/235 places, 197/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36538 ms. Remains : 197/235 places, 197/235 transitions.
[2024-05-30 13:53:34] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:53:34] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:53:34] [INFO ] Input system was already deterministic with 197 transitions.
[2024-05-30 13:53:34] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:53:34] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:53:34] [INFO ] Time to serialize gal into /tmp/CTLFireability16289044335489682218.gal : 1 ms
[2024-05-30 13:53:34] [INFO ] Time to serialize properties into /tmp/CTLFireability17348471721800779161.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/CTLFireability16289044335489682218.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17348471721800779161.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.26042e+18,1.3751,50848,2,1844,5,129755,6,0,987,339994,0


Converting to forward existential form...Done !
original formula: AG(EX((p161==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((p161==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t45, t49, t54, t58, t61, t67, t72, t76, t81, ...401
(forward)formula 0,0,1.9944,51548,1,0,384,198695,410,200,5264,339994,401
FORMULA ShieldRVt-PT-005B-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 235/235 places, 235/235 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 234 transition count 164
Reduce places removed 70 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 71 rules applied. Total rules applied 141 place count 164 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 142 place count 163 transition count 163
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 142 place count 163 transition count 138
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 192 place count 138 transition count 138
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 216 place count 114 transition count 114
Iterating global reduction 3 with 24 rules applied. Total rules applied 240 place count 114 transition count 114
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 240 place count 114 transition count 102
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 264 place count 102 transition count 102
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 338 place count 65 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 339 place count 65 transition count 64
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 341 place count 64 transition count 63
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 343 place count 62 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 344 place count 61 transition count 61
Applied a total of 344 rules in 21 ms. Remains 61 /235 variables (removed 174) and now considering 61/235 (removed 174) transitions.
// Phase 1: matrix 61 rows 61 cols
[2024-05-30 13:53:36] [INFO ] Computed 20 invariants in 0 ms
[2024-05-30 13:53:36] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-30 13:53:36] [INFO ] Invariant cache hit.
[2024-05-30 13:53:37] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-05-30 13:53:37] [INFO ] Redundant transitions in 0 ms returned []
Running 59 sub problems to find dead transitions.
[2024-05-30 13:53:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 61/122 variables, 61/81 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 0/122 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 81 constraints, problems are : Problem set: 0 solved, 59 unsolved in 673 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 61/122 variables, 61/81 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 59/140 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 140 constraints, problems are : Problem set: 0 solved, 59 unsolved in 647 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
After SMT, in 1326ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 1326ms
Starting structural reductions in SI_CTL mode, iteration 1 : 61/235 places, 61/235 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1431 ms. Remains : 61/235 places, 61/235 transitions.
[2024-05-30 13:53:38] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:53:38] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:53:38] [INFO ] Input system was already deterministic with 61 transitions.
[2024-05-30 13:53:38] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:53:38] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:53:38] [INFO ] Time to serialize gal into /tmp/CTLFireability10977148280849897340.gal : 0 ms
[2024-05-30 13:53:38] [INFO ] Time to serialize properties into /tmp/CTLFireability14869378574124427166.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/CTLFireability10977148280849897340.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14869378574124427166.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,2.35322e+09,0.030223,4916,2,121,5,5690,6,0,307,8125,0


Converting to forward existential form...Done !
original formula: AF((p34==1))
=> equivalent forward existential formula: [FwdG(Init,!((p34==1)))] = FALSE
Hit Full ! (commute/partial/dont) 59/0/2
(forward)formula 0,0,0.050188,5180,1,0,9,8492,20,3,1555,8125,8
FORMULA ShieldRVt-PT-005B-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 235/235 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 201 transition count 201
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 201 transition count 201
Applied a total of 68 rules in 9 ms. Remains 201 /235 variables (removed 34) and now considering 201/235 (removed 34) transitions.
// Phase 1: matrix 201 rows 201 cols
[2024-05-30 13:53:38] [INFO ] Computed 21 invariants in 1 ms
[2024-05-30 13:53:38] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-30 13:53:38] [INFO ] Invariant cache hit.
[2024-05-30 13:53:38] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-30 13:53:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-30 13:53:39] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-30 13:53:40] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:53:40] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-05-30 13:53:40] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:53:40] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:53:40] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:53:40] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 201/402 variables, 201/229 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 0/402 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 229 constraints, problems are : Problem set: 0 solved, 200 unsolved in 6890 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 201/402 variables, 201/229 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 200/429 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-30 13:53:47] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:53:47] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 2 ms to minimize.
[2024-05-30 13:53:47] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:53:47] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:53:47] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:53:47] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:53:47] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:53:47] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 2 ms to minimize.
[2024-05-30 13:53:47] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:53:48] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:53:48] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:53:48] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:53:48] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:53:48] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:53:48] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:53:48] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:53:48] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:53:48] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:53:48] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-30 13:53:48] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 20/449 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-30 13:53:49] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:53:49] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:53:49] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:53:50] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:53:50] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:53:50] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:53:50] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-30 13:53:50] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:53:50] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:53:50] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:53:50] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:53:50] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:53:51] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:53:51] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
[2024-05-30 13:53:51] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:53:51] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 16/465 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-30 13:53:52] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:53:53] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:53:53] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:53:53] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 2 ms to minimize.
[2024-05-30 13:53:53] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:53:53] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:53:53] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:53:53] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 8/473 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-30 13:53:55] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:53:56] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:53:56] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 3/476 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-30 13:53:58] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:53:58] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-30 13:54:01] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 2 ms to minimize.
[2024-05-30 13:54:01] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:54:02] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/402 variables, 3/481 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-30 13:54:05] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/402 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-30 13:54:07] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:54:07] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:54:08] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:54:08] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:54:08] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/402 variables, 5/487 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/402 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 15 (OVERLAPS) 0/402 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/402 variables, and 487 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 65/65 constraints]
After SMT, in 36917ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 36919ms
Starting structural reductions in LTL mode, iteration 1 : 201/235 places, 201/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37084 ms. Remains : 201/235 places, 201/235 transitions.
[2024-05-30 13:54:15] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:54:15] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:54:15] [INFO ] Input system was already deterministic with 201 transitions.
[2024-05-30 13:54:15] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:54:15] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:54:15] [INFO ] Time to serialize gal into /tmp/CTLFireability1381086296495338864.gal : 1 ms
[2024-05-30 13:54:15] [INFO ] Time to serialize properties into /tmp/CTLFireability10398679673700729783.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/CTLFireability1381086296495338864.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10398679673700729783.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.86241e+18,1.46468,53868,2,2540,5,142989,6,0,1007,358186,0


Converting to forward existential form...Done !
original formula: AG(!(A(((EX((p0==1)) + !(((p23==1)&&(p62==1)))) * ((((p238==1)&&(p67==1))&&((p120==1)&&(p59==1)))||(((!(((p190==1)&&(p202==1))&&(p234==1)...245
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!((E((p116==1) U E(TRUE U (p36==1))) * !(EG(!(((p156==1)&&(p232==1)))))))))) * !(E(!((...477
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t17, t19, t20, t23, t27, t31, t32, t38, t42, t47, t51, t56, t60, t63, t67, t73, ...429
Detected timeout of ITS tools.
[2024-05-30 13:54:45] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:54:45] [INFO ] Applying decomposition
[2024-05-30 13:54:45] [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/graph8560520485189384760.txt' '-o' '/tmp/graph8560520485189384760.bin' '-w' '/tmp/graph8560520485189384760.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8560520485189384760.bin' '-l' '-1' '-v' '-w' '/tmp/graph8560520485189384760.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:54:45] [INFO ] Decomposing Gal with order
[2024-05-30 13:54:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:54:45] [INFO ] Removed a total of 51 redundant transitions.
[2024-05-30 13:54:45] [INFO ] Flatten gal took : 9 ms
[2024-05-30 13:54:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-30 13:54:45] [INFO ] Time to serialize gal into /tmp/CTLFireability1993939009479074485.gal : 2 ms
[2024-05-30 13:54:45] [INFO ] Time to serialize properties into /tmp/CTLFireability13672667553689300480.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/CTLFireability1993939009479074485.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13672667553689300480.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,1.86241e+18,0.193682,11620,465,23,14965,268,419,27042,40,502,0


Converting to forward existential form...Done !
original formula: AG(!(A(((EX((i11.i0.u0.p0==1)) + !(((i1.u5.p23==1)&&(i5.u22.p62==1)))) * ((((i16.u76.p238==1)&&(i5.u21.p67==1))&&((i10.u40.p120==1)&&(i0....378
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!((E((i10.u39.p116==1) U E(TRUE U (i3.u15.p36==1))) * !(EG(!(((i15.i0.u51.p156==1)&&(i...678
Reverse transition relation is NOT exact ! Due to transitions t187, t189, i0.i0.u2.t178, i1.t171, i1.u6.t175, i2.t168, i2.t164, i3.t158, i3.u12.t154, i3.u1...704
Detected timeout of ITS tools.
[2024-05-30 13:55:15] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:55:15] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:55:15] [INFO ] Applying decomposition
[2024-05-30 13:55:15] [INFO ] Flatten gal took : 4 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/graph25127247200654695.txt' '-o' '/tmp/graph25127247200654695.bin' '-w' '/tmp/graph25127247200654695.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph25127247200654695.bin' '-l' '-1' '-v' '-w' '/tmp/graph25127247200654695.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:55:15] [INFO ] Decomposing Gal with order
[2024-05-30 13:55:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:55:15] [INFO ] Removed a total of 35 redundant transitions.
[2024-05-30 13:55:15] [INFO ] Flatten gal took : 10 ms
[2024-05-30 13:55:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-30 13:55:15] [INFO ] Time to serialize gal into /tmp/CTLFireability10648963053086234580.gal : 2 ms
[2024-05-30 13:55:15] [INFO ] Time to serialize properties into /tmp/CTLFireability15011043916494396113.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/CTLFireability10648963053086234580.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15011043916494396113.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 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.05679e+19,0.711184,29000,794,39,45297,241,472,93787,51,614,0


Converting to forward existential form...Done !
original formula: EG((((AX((i9.u44.p110==1)) * AG(AF((i9.u41.p115==0)))) * ((i16.u73.p203==0) + (!(E((((i9.u41.p114==1)&&(i13.u61.p168==1))&&(i16.u74.p202=...360
=> equivalent forward existential formula: [FwdG(Init,(((!(EX(!((i9.u44.p110==1)))) * !(E(TRUE U !(!(EG(!((i9.u41.p115==0)))))))) * ((i16.u73.p203==0) + (!...433
Reverse transition relation is NOT exact ! Due to transitions i0.t210, i0.t204, i0.u6.t208, i1.t195, i1.u11.t199, i1.u11.t201, i2.i0.u2.t212, i2.i2.t184, i...1075
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
Using saturation style SCC detection
Using saturation style SCC detection
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
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
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,0,877.86,13916752,1,0,1.59323e+07,488,1009,6.35137e+07,114,1203,907575
FORMULA ShieldRVt-PT-005B-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX((AX((((A((i10.u45.p126==1) U (i9.u41.p115==1)) * EX((i18.i1.u86.p226==1))) + (i12.u55.p150==1)) + ((i12.u56.p145==0)||(i15.u68.p181==0...191
=> equivalent forward existential formula: [((EY(Init) * !(EX(!((((!((E(!((i9.u41.p115==1)) U (!((i10.u45.p126==1)) * !((i9.u41.p115==1)))) + EG(!((i9.u41....321
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
Using saturation style SCC detection
ITS-tools command line returned an error code 137
[2024-05-30 14:19:48] [INFO ] Applying decomposition
[2024-05-30 14:19:48] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:19:48] [INFO ] Decomposing Gal with order
[2024-05-30 14:19:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:19:48] [INFO ] Removed a total of 5 redundant transitions.
[2024-05-30 14:19:48] [INFO ] Flatten gal took : 15 ms
[2024-05-30 14:19:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-30 14:19:48] [INFO ] Time to serialize gal into /tmp/CTLFireability11164291419789783657.gal : 2 ms
[2024-05-30 14:19:48] [INFO ] Time to serialize properties into /tmp/CTLFireability9439013812549782453.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/CTLFireability11164291419789783657.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9439013812549782453.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 7 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.05679e+19,9.26912,239836,1236,450,381526,1039,319,1.97791e+06,133,11907,0


Converting to forward existential form...Done !
original formula: EX((AX((((A((i0.i0.i1.i0.i0.u24.p126==1) U (i0.i0.i1.i0.i0.u23.p115==1)) * EX((i1.i0.i0.u38.p226==1))) + (i0.i0.i1.u26.p150==1)) + ((i0.i...240
=> equivalent forward existential formula: [((EY(Init) * !(EX(!((((!((E(!((i0.i0.i1.i0.i0.u23.p115==1)) U (!((i0.i0.i1.i0.i0.u24.p126==1)) * !((i0.i0.i1.i0...394
Reverse transition relation is NOT exact ! Due to transitions i0.i0.i0.i0.u5.t212, i0.i0.i0.i0.i1.u12.t173, i0.i0.i0.i0.i1.u12.t174, i0.i0.i0.i0.i1.u12.t17...1879
ITS-tools command line returned an error code 137
[2024-05-30 14:36:16] [INFO ] Flatten gal took : 14 ms
[2024-05-30 14:36:16] [INFO ] Input system was already deterministic with 235 transitions.
[2024-05-30 14:36:16] [INFO ] Transformed 235 places.
[2024-05-30 14:36:16] [INFO ] Transformed 235 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-30 14:36:16] [INFO ] Time to serialize gal into /tmp/CTLFireability18359021845748780767.gal : 1 ms
[2024-05-30 14:36:16] [INFO ] Time to serialize properties into /tmp/CTLFireability16567478326068539033.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/CTLFireability18359021845748780767.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16567478326068539033.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 7 CTL formulae.

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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

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