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-171683762200937.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ShieldRVt-PT-004B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683762200937
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 21:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 11 21:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 21:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 11 21:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 48K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVt-PT-004B-CTLCardinality-2024-00
FORMULA_NAME ShieldRVt-PT-004B-CTLCardinality-2024-01
FORMULA_NAME ShieldRVt-PT-004B-CTLCardinality-2024-02
FORMULA_NAME ShieldRVt-PT-004B-CTLCardinality-2024-03
FORMULA_NAME ShieldRVt-PT-004B-CTLCardinality-2024-04
FORMULA_NAME ShieldRVt-PT-004B-CTLCardinality-2024-05
FORMULA_NAME ShieldRVt-PT-004B-CTLCardinality-2024-06
FORMULA_NAME ShieldRVt-PT-004B-CTLCardinality-2024-07
FORMULA_NAME ShieldRVt-PT-004B-CTLCardinality-2024-08
FORMULA_NAME ShieldRVt-PT-004B-CTLCardinality-2024-09
FORMULA_NAME ShieldRVt-PT-004B-CTLCardinality-2024-10
FORMULA_NAME ShieldRVt-PT-004B-CTLCardinality-2024-11
FORMULA_NAME ShieldRVt-PT-004B-CTLCardinality-2023-12
FORMULA_NAME ShieldRVt-PT-004B-CTLCardinality-2023-13
FORMULA_NAME ShieldRVt-PT-004B-CTLCardinality-2023-14
FORMULA_NAME ShieldRVt-PT-004B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717075774229

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-004B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-30 13:29:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 13:29:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 13:29:35] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2024-05-30 13:29:35] [INFO ] Transformed 203 places.
[2024-05-30 13:29:35] [INFO ] Transformed 203 transitions.
[2024-05-30 13:29:35] [INFO ] Found NUPN structural information;
[2024-05-30 13:29:35] [INFO ] Parsed PT model containing 203 places and 203 transitions and 478 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
FORMULA ShieldRVt-PT-004B-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-004B-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-004B-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 203/203 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 171 transition count 171
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 171 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 170 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 170 transition count 170
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 169 transition count 169
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 169 transition count 169
Applied a total of 68 rules in 46 ms. Remains 169 /203 variables (removed 34) and now considering 169/203 (removed 34) transitions.
// Phase 1: matrix 169 rows 169 cols
[2024-05-30 13:29:35] [INFO ] Computed 17 invariants in 16 ms
[2024-05-30 13:29:35] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-30 13:29:35] [INFO ] Invariant cache hit.
[2024-05-30 13:29:36] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2024-05-30 13:29:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-30 13:29:37] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 8 ms to minimize.
[2024-05-30 13:29:37] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 2 ms to minimize.
[2024-05-30 13:29:37] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:29:37] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:29:37] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:29:37] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2024-05-30 13:29:37] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:29:37] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:29:37] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:29:37] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:29:38] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:29:38] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-30 13:29:38] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-30 13:29:38] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:29:38] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 ms to minimize.
[2024-05-30 13:29:38] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 16/33 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 169/338 variables, 169/202 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 0/338 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 202 constraints, problems are : Problem set: 0 solved, 168 unsolved in 5655 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 16/33 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-30 13:29:42] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:29:42] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-30 13:29:42] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:29:42] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 169/338 variables, 169/206 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 168/374 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-30 13:29:43] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:29:43] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:29:43] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 2 ms to minimize.
[2024-05-30 13:29:44] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:29:44] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 2 ms to minimize.
[2024-05-30 13:29:44] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:29:44] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:29:44] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:29:44] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:29:44] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:29:44] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:29:44] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:29:44] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:29:44] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 2 ms to minimize.
[2024-05-30 13:29:44] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:29:45] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:29:45] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:29:45] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:29:45] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:29:45] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 20/394 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-30 13:29:45] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:29:45] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:29:46] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:29:46] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 2 ms to minimize.
[2024-05-30 13:29:46] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:29:46] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:29:46] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:29:46] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:29:46] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:29:46] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:29:47] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 2 ms to minimize.
[2024-05-30 13:29:47] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 12/406 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-30 13:29:48] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2024-05-30 13:29:48] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:29:49] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:29:49] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:29:49] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:29:49] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:29:49] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 7/413 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-30 13:29:51] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:29:51] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 2/415 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-30 13:29:54] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 2 ms to minimize.
[2024-05-30 13:29:54] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:29:54] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:29:54] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:29:54] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/338 variables, 5/420 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-30 13:29:57] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/338 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/338 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 14 (OVERLAPS) 0/338 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/338 variables, and 421 constraints, problems are : Problem set: 0 solved, 168 unsolved in 23792 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 67/67 constraints]
After SMT, in 29500ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 29518ms
Starting structural reductions in LTL mode, iteration 1 : 169/203 places, 169/203 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29984 ms. Remains : 169/203 places, 169/203 transitions.
Support contains 53 out of 169 places after structural reductions.
[2024-05-30 13:30:05] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-30 13:30:05] [INFO ] Flatten gal took : 33 ms
FORMULA ShieldRVt-PT-004B-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 13:30:05] [INFO ] Flatten gal took : 15 ms
[2024-05-30 13:30:05] [INFO ] Input system was already deterministic with 169 transitions.
Support contains 49 out of 169 places (down from 53) after GAL structural reductions.
FORMULA ShieldRVt-PT-004B-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 7895 steps (2 resets) in 208 ms. (37 steps per ms) remains 0/35 properties
[2024-05-30 13:30:05] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:30:06] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:30:06] [INFO ] Input system was already deterministic with 169 transitions.
Computed a total of 49 stabilizing places and 49 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 169/169 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 157 transition count 157
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 157 transition count 157
Applied a total of 24 rules in 7 ms. Remains 157 /169 variables (removed 12) and now considering 157/169 (removed 12) transitions.
// Phase 1: matrix 157 rows 157 cols
[2024-05-30 13:30:06] [INFO ] Computed 17 invariants in 5 ms
[2024-05-30 13:30:06] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-30 13:30:06] [INFO ] Invariant cache hit.
[2024-05-30 13:30:06] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2024-05-30 13:30:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-30 13:30:07] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:30:07] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:30:07] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:30:07] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:30:07] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 157/314 variables, 157/179 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 0/314 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 179 constraints, problems are : Problem set: 0 solved, 156 unsolved in 4237 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 157/314 variables, 157/179 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 156/335 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-30 13:30:11] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2024-05-30 13:30:11] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:30:11] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:30:12] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:30:12] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:30:12] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:30:12] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:30:12] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:30:12] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:30:12] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:30:12] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:30:13] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 12/347 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-30 13:30:13] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:30:13] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:30:13] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:30:13] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:30:14] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:30:14] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:30:14] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:30:14] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:30:14] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-30 13:30:14] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:30:14] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 11/358 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-30 13:30:15] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
[2024-05-30 13:30:15] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:30:16] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:30:16] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:30:16] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:30:16] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:30:16] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 7/365 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-30 13:30:17] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:30:18] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-30 13:30:21] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:30:21] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:30:21] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/314 variables, 3/370 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-30 13:30:23] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 156 unsolved
[2024-05-30 13:30:26] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-05-30 13:30:26] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/314 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 16 (OVERLAPS) 0/314 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 373 constraints, problems are : Problem set: 0 solved, 156 unsolved in 21277 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 43/43 constraints]
After SMT, in 25530ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 25534ms
Starting structural reductions in LTL mode, iteration 1 : 157/169 places, 157/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25693 ms. Remains : 157/169 places, 157/169 transitions.
[2024-05-30 13:30:31] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:30:31] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:30:31] [INFO ] Input system was already deterministic with 157 transitions.
[2024-05-30 13:30:31] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:30:31] [INFO ] Flatten gal took : 9 ms
[2024-05-30 13:30:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality9393749401206603082.gal : 4 ms
[2024-05-30 13:30:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality3144867645384589442.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/CTLCardinality9393749401206603082.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3144867645384589442.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.29193e+14,0.557956,24008,2,1363,5,63132,6,0,787,137563,0


Converting to forward existential form...Done !
original formula: AF(AG((EX((p165==1)) * (EX((p113==1)) + AG((p120==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((EX((p165==1)) * (EX((p113==1)) + !(E(TRUE U !((p120==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, t65, t71, t75, t80, ...347
(forward)formula 0,0,2.02128,65892,1,0,384,268410,342,173,4727,351408,409
FORMULA ShieldRVt-PT-004B-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 169/169 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 160 transition count 160
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 160 transition count 160
Applied a total of 18 rules in 6 ms. Remains 160 /169 variables (removed 9) and now considering 160/169 (removed 9) transitions.
// Phase 1: matrix 160 rows 160 cols
[2024-05-30 13:30:33] [INFO ] Computed 17 invariants in 1 ms
[2024-05-30 13:30:33] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 13:30:33] [INFO ] Invariant cache hit.
[2024-05-30 13:30:34] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2024-05-30 13:30:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:30:34] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:30:35] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:30:35] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:30:35] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:30:35] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-30 13:30:35] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:30:35] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:30:35] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:30:35] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (OVERLAPS) 160/320 variables, 160/186 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 0/320 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 186 constraints, problems are : Problem set: 0 solved, 159 unsolved in 5048 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:30:39] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (OVERLAPS) 160/320 variables, 160/187 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 159/346 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:30:40] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 3 ms to minimize.
[2024-05-30 13:30:41] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:30:41] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 2 ms to minimize.
[2024-05-30 13:30:41] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:30:41] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:30:41] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:30:41] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:30:41] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:30:41] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:30:41] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:30:41] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:30:42] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:30:42] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:30:42] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 14/360 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:30:42] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:30:42] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:30:43] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:30:43] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:30:43] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:30:43] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:30:43] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-05-30 13:30:43] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:30:43] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 2 ms to minimize.
[2024-05-30 13:30:43] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:30:44] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:30:44] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 12/372 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-30 13:30:45] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 11 (OVERLAPS) 0/320 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 373 constraints, problems are : Problem set: 0 solved, 159 unsolved in 11063 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 37/37 constraints]
After SMT, in 16126ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 16129ms
Starting structural reductions in LTL mode, iteration 1 : 160/169 places, 160/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16276 ms. Remains : 160/169 places, 160/169 transitions.
[2024-05-30 13:30:50] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:30:50] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:30:50] [INFO ] Input system was already deterministic with 160 transitions.
[2024-05-30 13:30:50] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:30:50] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:30:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality6828367738541670109.gal : 2 ms
[2024-05-30 13:30:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality7991316596567196185.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/CTLCardinality6828367738541670109.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7991316596567196185.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.15766e+14,0.755742,32248,2,1852,5,81205,6,0,802,203859,0


Converting to forward existential form...Done !
original formula: AX(((EX(EF((p83==1))) * (p63==0)) + ((AG((p115==0)) * !(A(EX((p132==1)) U AX((p33==1))))) * EG(((p91==0)&&(p140==1))))))
=> equivalent forward existential formula: (([(FwdU((EY(Init) * !((EX(E(TRUE U (p83==1))) * (p63==0)))),TRUE) * !((p115==0)))] = FALSE * [(((EY(Init) * !((...407
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t45, t50, t52, t55, t59, t62, t66, t72, t76, ...374
Detected timeout of ITS tools.
[2024-05-30 13:31:20] [INFO ] Flatten gal took : 10 ms
[2024-05-30 13:31:20] [INFO ] Applying decomposition
[2024-05-30 13:31:20] [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/graph1286948674455348285.txt' '-o' '/tmp/graph1286948674455348285.bin' '-w' '/tmp/graph1286948674455348285.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1286948674455348285.bin' '-l' '-1' '-v' '-w' '/tmp/graph1286948674455348285.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:31:20] [INFO ] Decomposing Gal with order
[2024-05-30 13:31:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:31:20] [INFO ] Removed a total of 41 redundant transitions.
[2024-05-30 13:31:20] [INFO ] Flatten gal took : 49 ms
[2024-05-30 13:31:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-30 13:31:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality9694340766742210190.gal : 14 ms
[2024-05-30 13:31:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality1265962786437807100.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/CTLCardinality9694340766742210190.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1265962786437807100.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.15766e+14,0.139906,8312,402,23,9192,267,357,13628,40,542,0


Converting to forward existential form...Done !
original formula: AX(((EX(EF((i7.u31.p83==1))) * (i6.u23.p63==0)) + ((AG((i9.u37.p115==0)) * !(A(EX((i11.u45.p132==1)) U AX((i1.u12.p33==1))))) * EG(((i7.u...189
=> equivalent forward existential formula: (([(FwdU((EY(Init) * !((EX(E(TRUE U (i7.u31.p83==1))) * (i6.u23.p63==0)))),TRUE) * !((i9.u37.p115==0)))] = FALSE...500
Reverse transition relation is NOT exact ! Due to transitions t148, t150, i0.i0.u2.t141, i1.t118, i1.u14.t122, i2.t134, i2.u6.t138, i3.i1.t127, i3.i1.t131,...586
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
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,1,13.7505,471384,1,0,825658,382,2517,1.44011e+06,236,1221,845548
FORMULA ShieldRVt-PT-004B-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 169/169 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 158 transition count 158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 158 transition count 158
Applied a total of 22 rules in 8 ms. Remains 158 /169 variables (removed 11) and now considering 158/169 (removed 11) transitions.
// Phase 1: matrix 158 rows 158 cols
[2024-05-30 13:31:34] [INFO ] Computed 17 invariants in 1 ms
[2024-05-30 13:31:34] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-30 13:31:34] [INFO ] Invariant cache hit.
[2024-05-30 13:31:34] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2024-05-30 13:31:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:31:35] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:31:35] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:31:35] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:31:35] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:31:35] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 158/316 variables, 158/180 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 0/316 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 180 constraints, problems are : Problem set: 0 solved, 157 unsolved in 4326 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 158/316 variables, 158/180 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 157/337 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:31:40] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:31:40] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:31:40] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-30 13:31:40] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:31:40] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:31:40] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:31:40] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:31:40] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:31:40] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:31:40] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:31:40] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:31:41] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:31:41] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:31:41] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 14/351 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:31:42] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:31:42] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:31:42] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-30 13:31:42] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:31:42] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:31:42] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:31:43] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:31:43] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:31:43] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:31:43] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:31:43] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:31:43] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 12/363 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:31:44] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:31:45] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:31:45] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 3/366 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:31:48] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/316 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:31:50] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:31:50] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/316 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 13 (OVERLAPS) 0/316 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 369 constraints, problems are : Problem set: 0 solved, 157 unsolved in 16367 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 37/37 constraints]
After SMT, in 20709ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 20711ms
Starting structural reductions in LTL mode, iteration 1 : 158/169 places, 158/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20876 ms. Remains : 158/169 places, 158/169 transitions.
[2024-05-30 13:31:55] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:31:55] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:31:55] [INFO ] Input system was already deterministic with 158 transitions.
[2024-05-30 13:31:55] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:31:55] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:31:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality2639327352371543644.gal : 1 ms
[2024-05-30 13:31:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality12538540831864513325.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/CTLCardinality2639327352371543644.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12538540831864513325.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EX(AX(AG((EF(((p7==0)||(p186==1))) * (((p175==0)||(p40==1))||((p77==1)||((p153==0)&&(p94==1))))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(!(E(TRUE U !((E(TRUE U ((p7==0)||(p186==1))) * (((p175==0)||(p40==1))||((p77==1)||((p153==0)...186
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t37, t42, t46, t50, t55, t59, t62, t66, t72, t76, t81, ...347
(forward)formula 0,0,5.26406,180216,1,0,369,925734,338,193,4539,1.1865e+06,405
FORMULA ShieldRVt-PT-004B-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 169/169 places, 169/169 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 168 transition count 127
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 83 place count 127 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 84 place count 126 transition count 126
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 84 place count 126 transition count 101
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 134 place count 101 transition count 101
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 145 place count 90 transition count 90
Iterating global reduction 3 with 11 rules applied. Total rules applied 156 place count 90 transition count 90
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 156 place count 90 transition count 81
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 174 place count 81 transition count 81
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 230 place count 53 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 231 place count 53 transition count 52
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 233 place count 51 transition count 50
Applied a total of 233 rules in 32 ms. Remains 51 /169 variables (removed 118) and now considering 50/169 (removed 119) transitions.
// Phase 1: matrix 50 rows 51 cols
[2024-05-30 13:32:00] [INFO ] Computed 17 invariants in 0 ms
[2024-05-30 13:32:00] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-30 13:32:00] [INFO ] Invariant cache hit.
[2024-05-30 13:32:00] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2024-05-30 13:32:00] [INFO ] Redundant transitions in 0 ms returned []
Running 49 sub problems to find dead transitions.
[2024-05-30 13:32:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 50/101 variables, 51/68 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 0/101 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 68 constraints, problems are : Problem set: 0 solved, 49 unsolved in 445 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 50/101 variables, 51/68 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 49/117 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 0/101 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 117 constraints, problems are : Problem set: 0 solved, 49 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
After SMT, in 895ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 896ms
Starting structural reductions in SI_CTL mode, iteration 1 : 51/169 places, 50/169 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1091 ms. Remains : 51/169 places, 50/169 transitions.
[2024-05-30 13:32:01] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:32:01] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:32:01] [INFO ] Input system was already deterministic with 50 transitions.
RANDOM walk for 11 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
FORMULA ShieldRVt-PT-004B-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-30 13:32:01] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:32:01] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:32:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12611076562870374004.gal : 16 ms
[2024-05-30 13:32:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15321814124480519437.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12611076562870374004.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15321814124480519437.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 169/169 places, 169/169 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 168 transition count 125
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 125 transition count 125
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 86 place count 125 transition count 100
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 136 place count 100 transition count 100
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 147 place count 89 transition count 89
Iterating global reduction 2 with 11 rules applied. Total rules applied 158 place count 89 transition count 89
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 158 place count 89 transition count 80
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 176 place count 80 transition count 80
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 232 place count 52 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 233 place count 52 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 235 place count 51 transition count 50
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 237 place count 49 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 238 place count 48 transition count 48
Applied a total of 238 rules in 43 ms. Remains 48 /169 variables (removed 121) and now considering 48/169 (removed 121) transitions.
// Phase 1: matrix 48 rows 48 cols
[2024-05-30 13:32:01] [INFO ] Computed 16 invariants in 0 ms
[2024-05-30 13:32:01] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-30 13:32:01] [INFO ] Invariant cache hit.
[2024-05-30 13:32:02] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2024-05-30 13:32:02] [INFO ] Redundant transitions in 0 ms returned []
Running 47 sub problems to find dead transitions.
[2024-05-30 13:32:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 48/96 variables, 48/64 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 0/96 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 64 constraints, problems are : Problem set: 0 solved, 47 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 48/96 variables, 48/64 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 47/111 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 0/96 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 111 constraints, problems are : Problem set: 0 solved, 47 unsolved in 509 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
After SMT, in 992ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 993ms
Starting structural reductions in SI_CTL mode, iteration 1 : 48/169 places, 48/169 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1353 ms. Remains : 48/169 places, 48/169 transitions.
[2024-05-30 13:32:03] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:32:03] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:32:03] [INFO ] Input system was already deterministic with 48 transitions.
[2024-05-30 13:32:03] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:32:03] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:32:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality2064601780981349688.gal : 1 ms
[2024-05-30 13:32:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality12082295857934045670.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/CTLCardinality2064601780981349688.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12082295857934045670.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.82638e+07,0.017417,4024,2,81,5,2603,6,0,243,3203,0


Converting to forward existential form...Done !
original formula: AG(AF((p49==0)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((p49==0)))] = FALSE
Hit Full ! (commute/partial/dont) 46/0/2
(forward)formula 0,0,0.026639,4288,1,0,9,4006,20,3,1203,3231,8
FORMULA ShieldRVt-PT-004B-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 169/169 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 162 transition count 162
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 162 transition count 162
Applied a total of 14 rules in 6 ms. Remains 162 /169 variables (removed 7) and now considering 162/169 (removed 7) transitions.
// Phase 1: matrix 162 rows 162 cols
[2024-05-30 13:32:03] [INFO ] Computed 17 invariants in 1 ms
[2024-05-30 13:32:03] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-30 13:32:03] [INFO ] Invariant cache hit.
[2024-05-30 13:32:03] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2024-05-30 13:32:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-30 13:32:04] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:32:04] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:32:04] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:32:04] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:32:04] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:32:04] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2024-05-30 13:32:04] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:32:04] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:32:04] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:32:04] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-30 13:32:05] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:32:05] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 162/324 variables, 162/191 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 0/324 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 191 constraints, problems are : Problem set: 0 solved, 161 unsolved in 5263 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/324 variables, 162/191 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 161/352 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-30 13:32:09] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:32:09] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 2 ms to minimize.
[2024-05-30 13:32:10] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 2 ms to minimize.
[2024-05-30 13:32:10] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:32:10] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:32:10] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:32:10] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:32:10] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:32:10] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 2 ms to minimize.
[2024-05-30 13:32:10] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 2 ms to minimize.
[2024-05-30 13:32:10] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:32:10] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 2 ms to minimize.
[2024-05-30 13:32:10] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:32:10] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:32:10] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:32:11] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:32:11] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:32:11] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:32:11] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:32:11] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 20/372 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-30 13:32:11] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:32:11] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 0 ms to minimize.
[2024-05-30 13:32:12] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:32:12] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:32:12] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:32:12] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 2 ms to minimize.
[2024-05-30 13:32:12] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:32:12] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 8/380 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-30 13:32:14] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-05-30 13:32:14] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:32:14] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:32:14] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-30 13:32:14] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 5/385 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-30 13:32:16] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 2 ms to minimize.
[2024-05-30 13:32:16] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 2/387 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-30 13:32:19] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/324 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/324 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 12 (OVERLAPS) 0/324 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 388 constraints, problems are : Problem set: 0 solved, 161 unsolved in 16732 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 48/48 constraints]
After SMT, in 22019ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 22021ms
Starting structural reductions in LTL mode, iteration 1 : 162/169 places, 162/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22225 ms. Remains : 162/169 places, 162/169 transitions.
[2024-05-30 13:32:25] [INFO ] Flatten gal took : 10 ms
[2024-05-30 13:32:25] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:32:25] [INFO ] Input system was already deterministic with 162 transitions.
[2024-05-30 13:32:25] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:32:25] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:32:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality14056280627300976005.gal : 1 ms
[2024-05-30 13:32:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality1028587983884473800.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/CTLCardinality14056280627300976005.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1028587983884473800.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(((((p150==1)||(p118==1)) + (E((p153==1) U (p46==1)) + AX(((p97==0)||(p183==1))))) + (EX(!(A((p115==0) U ((p7==0)||(p6==1))))) + E(((p8...196
=> equivalent forward existential formula: [FwdG(Init,((((p150==1)||(p118==1)) + (E((p153==1) U (p46==1)) + !(EX(!(((p97==0)||(p183==1))))))) + (EX(!(!((E(...322
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t17, t22, t26, t30, t31, t38, t43, t47, t51, t56, t60, t63, t67, t73, t77, ...386
Detected timeout of ITS tools.
[2024-05-30 13:32:55] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:32:55] [INFO ] Applying decomposition
[2024-05-30 13:32:55] [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/graph16970569067108757934.txt' '-o' '/tmp/graph16970569067108757934.bin' '-w' '/tmp/graph16970569067108757934.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16970569067108757934.bin' '-l' '-1' '-v' '-w' '/tmp/graph16970569067108757934.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:32:55] [INFO ] Decomposing Gal with order
[2024-05-30 13:32:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:32:55] [INFO ] Removed a total of 39 redundant transitions.
[2024-05-30 13:32:55] [INFO ] Flatten gal took : 10 ms
[2024-05-30 13:32:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-30 13:32:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality11470445272412796692.gal : 3 ms
[2024-05-30 13:32:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality10375517069761697581.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/CTLCardinality11470445272412796692.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10375517069761697581.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,4.93542e+14,0.14248,9928,419,23,12764,254,362,19619,43,507,0


Converting to forward existential form...Done !
original formula: EG(((((i12.u48.p150==1)||(i9.u37.p118==1)) + (E((i12.u46.p153==1) U (i3.u17.p46==1)) + AX(((i4.u33.p97==0)||(i15.i1.u60.p183==1))))) + (E...295
=> equivalent forward existential formula: [FwdG(Init,((((i12.u48.p150==1)||(i9.u37.p118==1)) + (E((i12.u46.p153==1) U (i3.u17.p46==1)) + !(EX(!(((i4.u33.p...457
Reverse transition relation is NOT exact ! Due to transitions t147, t150, t152, i0.i0.u2.t143, i0.i2.t120, i0.i2.u13.t124, i1.t136, i1.u5.t140, i2.t133, i2...605
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
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 169/169 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 159 transition count 159
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 159 transition count 159
Applied a total of 20 rules in 4 ms. Remains 159 /169 variables (removed 10) and now considering 159/169 (removed 10) transitions.
// Phase 1: matrix 159 rows 159 cols
[2024-05-30 13:33:25] [INFO ] Computed 17 invariants in 3 ms
[2024-05-30 13:33:25] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 13:33:25] [INFO ] Invariant cache hit.
[2024-05-30 13:33:25] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 158 sub problems to find dead transitions.
[2024-05-30 13:33:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-30 13:33:26] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:33:26] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:33:26] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:33:26] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:33:27] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (OVERLAPS) 159/318 variables, 159/181 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (OVERLAPS) 0/318 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 181 constraints, problems are : Problem set: 0 solved, 158 unsolved in 4423 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-30 13:33:30] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (OVERLAPS) 159/318 variables, 159/182 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 158/340 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-30 13:33:31] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:33:31] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:33:31] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:33:32] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:33:32] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:33:32] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:33:32] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:33:32] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:33:32] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:33:32] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:33:32] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:33:32] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:33:32] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:33:32] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:33:33] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:33:33] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 16/356 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-30 13:33:34] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 2 ms to minimize.
[2024-05-30 13:33:34] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:33:34] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:33:34] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:33:34] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:33:34] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:33:34] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:33:34] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-05-30 13:33:34] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:33:35] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 10/366 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-30 13:33:36] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:33:36] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 2 ms to minimize.
[2024-05-30 13:33:37] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 3/369 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-30 13:33:38] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
[2024-05-30 13:33:38] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:33:39] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 3/372 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-30 13:33:40] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:33:40] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:33:40] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/318 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-30 13:33:42] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/318 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-05-30 13:33:46] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/318 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/318 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 16 (OVERLAPS) 0/318 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 377 constraints, problems are : Problem set: 0 solved, 158 unsolved in 21492 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 43/43 constraints]
After SMT, in 25927ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 25929ms
Starting structural reductions in LTL mode, iteration 1 : 159/169 places, 159/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26083 ms. Remains : 159/169 places, 159/169 transitions.
[2024-05-30 13:33:51] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:33:51] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:33:51] [INFO ] Input system was already deterministic with 159 transitions.
[2024-05-30 13:33:51] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:33:51] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:33:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality1336294043181458109.gal : 1 ms
[2024-05-30 13:33:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality16451909795943856987.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/CTLCardinality1336294043181458109.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16451909795943856987.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(AX(EG((((EX(((p33==0)||(p137==1))) + EX((p54==1))) + ((p58==0)||(p63==1))) + (p195==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EG((((EX(((p33==0)||(p137==1))) + EX((p54==1))) + ((p58==0)||(p63==1))) + (p195==1)))...169
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...351
Detected timeout of ITS tools.
[2024-05-30 13:34:21] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:34:21] [INFO ] Applying decomposition
[2024-05-30 13:34:21] [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/graph5074106886767283875.txt' '-o' '/tmp/graph5074106886767283875.bin' '-w' '/tmp/graph5074106886767283875.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5074106886767283875.bin' '-l' '-1' '-v' '-w' '/tmp/graph5074106886767283875.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:34:21] [INFO ] Decomposing Gal with order
[2024-05-30 13:34:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:34:21] [INFO ] Removed a total of 39 redundant transitions.
[2024-05-30 13:34:21] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:34:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 13:34:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality14473054059607514629.gal : 7 ms
[2024-05-30 13:34:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality11246237437976670949.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/CTLCardinality14473054059607514629.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11246237437976670949.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.96639e+14,0.084762,7272,299,22,6898,264,340,10951,38,512,0


Converting to forward existential form...Done !
original formula: EF(AX(EG((((EX(((i4.u14.p33==0)||(i12.u46.p137==1))) + EX((i5.u16.p54==1))) + ((i1.i2.u19.p58==0)||(i7.u22.p63==1))) + (i16.u64.p195==1))...158
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EG((((EX(((i4.u14.p33==0)||(i12.u46.p137==1))) + EX((i5.u16.p54==1))) + ((i1.i2.u19.p...216
Reverse transition relation is NOT exact ! Due to transitions t147, t149, i0.t41, i0.u47.t37, i1.i0.u2.t140, i2.t133, i2.u6.t137, i3.t130, i4.t117, i4.u13....541
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
(forward)formula 0,1,7.50114,266660,1,0,413060,364,2227,1.0659e+06,210,1091,354643
FORMULA ShieldRVt-PT-004B-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 169/169 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 158 transition count 158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 158 transition count 158
Applied a total of 22 rules in 9 ms. Remains 158 /169 variables (removed 11) and now considering 158/169 (removed 11) transitions.
// Phase 1: matrix 158 rows 158 cols
[2024-05-30 13:34:29] [INFO ] Computed 17 invariants in 3 ms
[2024-05-30 13:34:29] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-30 13:34:29] [INFO ] Invariant cache hit.
[2024-05-30 13:34:29] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2024-05-30 13:34:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:34:30] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:34:30] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:34:30] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:34:30] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:34:30] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 158/316 variables, 158/180 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 0/316 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 180 constraints, problems are : Problem set: 0 solved, 157 unsolved in 4306 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 158/316 variables, 158/180 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 157/337 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:34:34] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:34:35] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:34:35] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:34:35] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:34:35] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:34:35] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:34:35] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 2 ms to minimize.
[2024-05-30 13:34:35] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:34:35] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:34:36] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:34:36] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:34:36] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:34:36] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:34:36] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 14/351 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:34:37] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:34:37] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:34:37] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:34:37] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 0 ms to minimize.
[2024-05-30 13:34:37] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:34:37] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:34:37] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:34:37] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:34:37] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:34:37] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:34:38] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:34:38] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:34:38] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 13/364 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:34:40] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:34:40] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:34:40] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:34:40] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 4/368 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:34:43] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/316 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:34:46] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:34:46] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:34:46] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:34:46] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:34:47] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/316 variables, 5/374 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:34:48] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:34:48] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:34:49] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:34:49] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
[2024-05-30 13:34:49] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/316 variables, 5/379 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/316 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:34:53] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/316 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:34:54] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:34:54] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:34:54] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:34:55] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/316 variables, 4/384 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/316 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:34:58] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:34:58] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/316 variables, 2/386 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:35:00] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/316 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:35:02] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/316 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/316 variables, and 388 constraints, problems are : Problem set: 0 solved, 157 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 56/56 constraints]
After SMT, in 34334ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 34337ms
Starting structural reductions in LTL mode, iteration 1 : 158/169 places, 158/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34491 ms. Remains : 158/169 places, 158/169 transitions.
[2024-05-30 13:35:03] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:35:03] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:35:03] [INFO ] Input system was already deterministic with 158 transitions.
[2024-05-30 13:35:03] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:35:03] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:35:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality9735069029462640598.gal : 1 ms
[2024-05-30 13:35:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality12765195644404547789.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/CTLCardinality9735069029462640598.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12765195644404547789.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG((EG(E(AF(((p103==0)||(p113==1))) U AX(((p0==0)||(p32==1))))) * AX(E(A((p112==1) U ((p10==0)||(p40==1))) U (p11!=1)))))
=> equivalent forward existential formula: [FwdG(Init,(EG(E(!(EG(!(((p103==0)||(p113==1))))) U !(EX(!(((p0==0)||(p32==1))))))) * !(EX(!(E(!((E(!(((p10==0)|...269
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t19, t21, t25, t29, t30, t36, t40, t45, t49, t54, t58, t61, t65, t66, t72, ...351
Detected timeout of ITS tools.
[2024-05-30 13:35:33] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:35:33] [INFO ] Applying decomposition
[2024-05-30 13:35:33] [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/graph9626598699924205217.txt' '-o' '/tmp/graph9626598699924205217.bin' '-w' '/tmp/graph9626598699924205217.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9626598699924205217.bin' '-l' '-1' '-v' '-w' '/tmp/graph9626598699924205217.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:35:34] [INFO ] Decomposing Gal with order
[2024-05-30 13:35:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:35:34] [INFO ] Removed a total of 43 redundant transitions.
[2024-05-30 13:35:34] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:35:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-30 13:35:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality6269499786629949108.gal : 2 ms
[2024-05-30 13:35:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality11245677268218341030.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/CTLCardinality6269499786629949108.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11245677268218341030.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,3.64549e+14,0.118858,9120,336,22,11340,262,348,16926,38,522,0


Converting to forward existential form...Done !
original formula: EG((EG(E(AF(((i8.u30.p103==0)||(i10.i1.u37.p113==1))) U AX(((i0.i1.u0.p0==0)||(i2.i1.u11.p32==1))))) * AX(E(A((i10.i0.u36.p112==1) U ((i2...209
=> equivalent forward existential formula: [FwdG(Init,(EG(E(!(EG(!(((i8.u30.p103==0)||(i10.i1.u37.p113==1))))) U !(EX(!(((i0.i1.u0.p0==0)||(i2.i1.u11.p32==...371
Reverse transition relation is NOT exact ! Due to transitions t19, t143, t146, i0.i0.u2.t139, i1.t132, i1.u5.t136, i2.i1.t129, i3.t116, i3.u14.t120, i4.t11...539
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
(forward)formula 0,1,16.0207,533536,1,0,851513,468,2746,2.00696e+06,223,1455,761307
FORMULA ShieldRVt-PT-004B-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 169/169 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 158 transition count 158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 158 transition count 158
Applied a total of 22 rules in 2 ms. Remains 158 /169 variables (removed 11) and now considering 158/169 (removed 11) transitions.
// Phase 1: matrix 158 rows 158 cols
[2024-05-30 13:35:50] [INFO ] Computed 17 invariants in 2 ms
[2024-05-30 13:35:50] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-30 13:35:50] [INFO ] Invariant cache hit.
[2024-05-30 13:35:50] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Running 157 sub problems to find dead transitions.
[2024-05-30 13:35:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:35:51] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-05-30 13:35:51] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:35:51] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:35:51] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:35:51] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 158/316 variables, 158/180 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 0/316 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 180 constraints, problems are : Problem set: 0 solved, 157 unsolved in 4357 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 158/316 variables, 158/180 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 157/337 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:35:55] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:35:56] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:35:56] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:35:56] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:35:56] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:35:56] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:35:56] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:35:56] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:35:56] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:35:56] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:35:56] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:35:56] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-30 13:35:57] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:35:57] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:35:57] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 15/352 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:35:58] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:35:58] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-30 13:35:58] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 2 ms to minimize.
[2024-05-30 13:35:58] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:35:58] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 5/357 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:35:59] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:35:59] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:36:00] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:36:00] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:36:00] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:36:00] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 6/363 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-30 13:36:01] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:36:01] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 2/365 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 11 (OVERLAPS) 0/316 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 365 constraints, problems are : Problem set: 0 solved, 157 unsolved in 11805 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 33/33 constraints]
After SMT, in 16175ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 16176ms
Starting structural reductions in LTL mode, iteration 1 : 158/169 places, 158/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16313 ms. Remains : 158/169 places, 158/169 transitions.
[2024-05-30 13:36:06] [INFO ] Flatten gal took : 10 ms
[2024-05-30 13:36:06] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:36:06] [INFO ] Input system was already deterministic with 158 transitions.
[2024-05-30 13:36:06] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:36:06] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:36:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality349929157696717646.gal : 0 ms
[2024-05-30 13:36:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality9223781403452753225.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/CTLCardinality349929157696717646.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9223781403452753225.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,3.29252e+14,0.49363,24112,2,1371,5,63448,6,0,792,138284,0


Converting to forward existential form...Done !
original formula: EF(AG(AX((A(((p20==0)||(p64==1)) U ((p92==0)||(p79==1))) + EG((p128==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EX(!((!((E(!(((p92==0)||(p79==1))) U (!(((p20==0)||(p64==1))) * !(((p92==0)||...233
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, t81, ...347
Detected timeout of ITS tools.
[2024-05-30 13:36:36] [INFO ] Flatten gal took : 10 ms
[2024-05-30 13:36:36] [INFO ] Applying decomposition
[2024-05-30 13:36:36] [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/graph13114975929007183776.txt' '-o' '/tmp/graph13114975929007183776.bin' '-w' '/tmp/graph13114975929007183776.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13114975929007183776.bin' '-l' '-1' '-v' '-w' '/tmp/graph13114975929007183776.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:36:36] [INFO ] Decomposing Gal with order
[2024-05-30 13:36:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:36:36] [INFO ] Removed a total of 43 redundant transitions.
[2024-05-30 13:36:36] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:36:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 13:36:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality10768071936094536226.gal : 2 ms
[2024-05-30 13:36:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality1021923320464538859.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/CTLCardinality10768071936094536226.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1021923320464538859.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,3.29252e+14,0.069715,6716,304,22,5860,268,337,8759,38,544,0


Converting to forward existential form...Done !
original formula: EF(AG(AX((A(((i1.u6.p20==0)||(i5.u22.p64==1)) U ((i6.u31.p92==0)||(i4.i1.u25.p79==1))) + EG((i9.u43.p128==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EX(!((!((E(!(((i6.u31.p92==0)||(i4.i1.u25.p79==1))) U (!(((i1.u6.p20==0)||(i5...304
Reverse transition relation is NOT exact ! Due to transitions t143, t146, t148, i0.i0.u2.t139, i0.i2.t116, i0.i2.u13.t120, i1.t132, i1.u6.t136, i2.t129, i3...516
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
(forward)formula 0,1,5.10857,176204,1,0,297061,357,2293,611112,208,1158,248006
FORMULA ShieldRVt-PT-004B-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 169/169 places, 169/169 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 168 transition count 126
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 85 place count 126 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 125 transition count 125
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 86 place count 125 transition count 100
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 136 place count 100 transition count 100
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 147 place count 89 transition count 89
Iterating global reduction 3 with 11 rules applied. Total rules applied 158 place count 89 transition count 89
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 158 place count 89 transition count 80
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 176 place count 80 transition count 80
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 228 place count 54 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 229 place count 54 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 231 place count 53 transition count 52
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 233 place count 51 transition count 50
Applied a total of 233 rules in 13 ms. Remains 51 /169 variables (removed 118) and now considering 50/169 (removed 119) transitions.
// Phase 1: matrix 50 rows 51 cols
[2024-05-30 13:36:41] [INFO ] Computed 17 invariants in 0 ms
[2024-05-30 13:36:41] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-30 13:36:41] [INFO ] Invariant cache hit.
[2024-05-30 13:36:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-30 13:36:41] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-30 13:36:41] [INFO ] Redundant transitions in 0 ms returned []
Running 49 sub problems to find dead transitions.
[2024-05-30 13:36:41] [INFO ] Invariant cache hit.
[2024-05-30 13:36:41] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 50/101 variables, 51/68 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/101 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 70 constraints, problems are : Problem set: 0 solved, 49 unsolved in 499 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 51/51 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 50/101 variables, 51/68 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 49/119 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/101 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 119 constraints, problems are : Problem set: 0 solved, 49 unsolved in 531 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 51/51 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
After SMT, in 1039ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 1039ms
Starting structural reductions in SI_CTL mode, iteration 1 : 51/169 places, 50/169 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1130 ms. Remains : 51/169 places, 50/169 transitions.
[2024-05-30 13:36:42] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:36:42] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:36:42] [INFO ] Input system was already deterministic with 50 transitions.
[2024-05-30 13:36:42] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:36:42] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:36:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality17517047848210692688.gal : 1 ms
[2024-05-30 13:36:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality15490210384297576551.ctl : 11 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/CTLCardinality17517047848210692688.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15490210384297576551.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.82638e+07,0.018666,4040,2,137,5,2682,6,0,254,3314,0


Converting to forward existential form...Done !
original formula: EG(((p180==0)||(p145==1)))
=> equivalent forward existential formula: [FwdG(Init,((p180==0)||(p145==1)))] != FALSE
Hit Full ! (commute/partial/dont) 46/0/4
(forward)formula 0,0,0.02896,4304,1,0,10,3984,19,3,1271,3314,10
FORMULA ShieldRVt-PT-004B-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 169/169 places, 169/169 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 168 transition count 129
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 129 transition count 129
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 78 place count 129 transition count 104
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 128 place count 104 transition count 104
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 139 place count 93 transition count 93
Iterating global reduction 2 with 11 rules applied. Total rules applied 150 place count 93 transition count 93
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 150 place count 93 transition count 84
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 168 place count 84 transition count 84
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 218 place count 59 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 219 place count 59 transition count 58
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 221 place count 58 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 222 place count 57 transition count 56
Applied a total of 222 rules in 14 ms. Remains 57 /169 variables (removed 112) and now considering 56/169 (removed 113) transitions.
// Phase 1: matrix 56 rows 57 cols
[2024-05-30 13:36:42] [INFO ] Computed 17 invariants in 0 ms
[2024-05-30 13:36:42] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-30 13:36:42] [INFO ] Invariant cache hit.
[2024-05-30 13:36:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-30 13:36:43] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2024-05-30 13:36:43] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2024-05-30 13:36:43] [INFO ] Invariant cache hit.
[2024-05-30 13:36:43] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (OVERLAPS) 3/57 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-30 13:36:43] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 56/113 variables, 57/75 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 0/113 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 77 constraints, problems are : Problem set: 0 solved, 53 unsolved in 618 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 57/57 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 3/57 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 56/113 variables, 57/75 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 53/130 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 0/113 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 130 constraints, problems are : Problem set: 0 solved, 53 unsolved in 656 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 57/57 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 1/1 constraints]
After SMT, in 1283ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 1284ms
Starting structural reductions in SI_CTL mode, iteration 1 : 57/169 places, 56/169 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1541 ms. Remains : 57/169 places, 56/169 transitions.
[2024-05-30 13:36:44] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:36:44] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:36:44] [INFO ] Input system was already deterministic with 56 transitions.
[2024-05-30 13:36:44] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:36:44] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:36:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality15898560526730646406.gal : 1 ms
[2024-05-30 13:36:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality4578959463194365600.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/CTLCardinality15898560526730646406.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4578959463194365600.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.06295e+08,0.019998,4340,2,187,5,3741,6,0,282,5141,0


Converting to forward existential form...Done !
original formula: AG(AF((((p156==0) * AF(((p185==0)&&(p130==1)))) + ((p57==0)&&(p101==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((((p156==0) * !(EG(!(((p185==0)&&(p130==1)))))) + ((p57==0)&&(p101==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t6, t10, t12, t15, t19, t21, t24, t26, t28, t36, t38, t40, t47, t50, t52, t55, Intersect...243
Detected timeout of ITS tools.
[2024-05-30 13:37:14] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:37:14] [INFO ] Applying decomposition
[2024-05-30 13:37:14] [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/graph3856605140230950428.txt' '-o' '/tmp/graph3856605140230950428.bin' '-w' '/tmp/graph3856605140230950428.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3856605140230950428.bin' '-l' '-1' '-v' '-w' '/tmp/graph3856605140230950428.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:37:14] [INFO ] Decomposing Gal with order
[2024-05-30 13:37:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:37:14] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-30 13:37:14] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:37:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-30 13:37:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality14261672875931781223.gal : 1 ms
[2024-05-30 13:37:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality11394965503180963313.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/CTLCardinality14261672875931781223.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11394965503180963313.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.06295e+08,0.012538,3920,69,13,914,71,164,1120,27,120,0


Converting to forward existential form...Done !
original formula: AG(AF((((i11.u16.p156==0) * AF(((i10.u19.p185==0)&&(i7.u13.p130==1)))) + ((i3.u5.p57==0)&&(i5.u10.p101==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((((i11.u16.p156==0) * !(EG(!(((i10.u19.p185==0)&&(i7.u13.p130==1)))))) + ((i3.u5.p57==0)...186
Reverse transition relation is NOT exact ! Due to transitions t50, t52, t55, u6.t19, u8.t40, u11.t24, u14.t47, u15.t28, i0.u1.t10, i0.u3.t15, i1.u2.t12, i1...315
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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,0,0.452576,30844,1,0,55556,85,888,102611,130,150,52308
FORMULA ShieldRVt-PT-004B-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-30 13:37:15] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:37:15] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:37:15] [INFO ] Applying decomposition
[2024-05-30 13:37:15] [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/graph13531831074754716775.txt' '-o' '/tmp/graph13531831074754716775.bin' '-w' '/tmp/graph13531831074754716775.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13531831074754716775.bin' '-l' '-1' '-v' '-w' '/tmp/graph13531831074754716775.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:37:15] [INFO ] Decomposing Gal with order
[2024-05-30 13:37:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:37:15] [INFO ] Removed a total of 37 redundant transitions.
[2024-05-30 13:37:15] [INFO ] Flatten gal took : 12 ms
[2024-05-30 13:37:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 13:37:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality9599289289399158034.gal : 2 ms
[2024-05-30 13:37:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality9550062503783002634.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/CTLCardinality9599289289399158034.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9550062503783002634.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,8.75831e+14,0.206341,12156,475,23,16530,274,388,27914,40,583,0


Converting to forward existential form...Done !
original formula: EG(((((i12.u51.p150==1)||(i10.i0.u42.p118==1)) + (E((i12.u55.p153==1) U (i5.u15.p46==1)) + AX(((i6.u35.p97==0)||(i15.u66.p183==1))))) + (...297
=> equivalent forward existential formula: [FwdG(Init,((((i12.u51.p150==1)||(i10.i0.u42.p118==1)) + (E((i12.u55.p153==1) U (i5.u15.p46==1)) + !(EX(!(((i6.u...459
Reverse transition relation is NOT exact ! Due to transitions t21, t157, i0.t64, i0.t60, i1.i1.u2.t150, i2.t143, i2.u7.t147, i3.i1.t136, i3.i1.t140, i4.t12...702
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
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,1,333.446,4332512,1,0,6.41632e+06,414,798,1.69814e+07,88,1311,5492240
FORMULA ShieldRVt-PT-004B-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 793852 ms.

BK_STOP 1717076569264

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-004B"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ShieldRVt-PT-004B, examination is CTLCardinality"
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-171683762200937"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-004B.tgz
mv ShieldRVt-PT-004B execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;