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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 21:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 11 21:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 11 21:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 11 21:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 36K 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-003B-CTLCardinality-2024-00
FORMULA_NAME ShieldRVt-PT-003B-CTLCardinality-2024-01
FORMULA_NAME ShieldRVt-PT-003B-CTLCardinality-2024-02
FORMULA_NAME ShieldRVt-PT-003B-CTLCardinality-2024-03
FORMULA_NAME ShieldRVt-PT-003B-CTLCardinality-2024-04
FORMULA_NAME ShieldRVt-PT-003B-CTLCardinality-2024-05
FORMULA_NAME ShieldRVt-PT-003B-CTLCardinality-2024-06
FORMULA_NAME ShieldRVt-PT-003B-CTLCardinality-2024-07
FORMULA_NAME ShieldRVt-PT-003B-CTLCardinality-2024-08
FORMULA_NAME ShieldRVt-PT-003B-CTLCardinality-2024-09
FORMULA_NAME ShieldRVt-PT-003B-CTLCardinality-2024-10
FORMULA_NAME ShieldRVt-PT-003B-CTLCardinality-2024-11
FORMULA_NAME ShieldRVt-PT-003B-CTLCardinality-2023-12
FORMULA_NAME ShieldRVt-PT-003B-CTLCardinality-2023-13
FORMULA_NAME ShieldRVt-PT-003B-CTLCardinality-2023-14
FORMULA_NAME ShieldRVt-PT-003B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717075585146

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-003B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-30 13:26:26] [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:26:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 13:26:26] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2024-05-30 13:26:26] [INFO ] Transformed 153 places.
[2024-05-30 13:26:26] [INFO ] Transformed 153 transitions.
[2024-05-30 13:26:26] [INFO ] Found NUPN structural information;
[2024-05-30 13:26:26] [INFO ] Parsed PT model containing 153 places and 153 transitions and 360 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
FORMULA ShieldRVt-PT-003B-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-003B-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 79 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 153/153 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 145 transition count 145
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 145 transition count 145
Applied a total of 16 rules in 25 ms. Remains 145 /153 variables (removed 8) and now considering 145/153 (removed 8) transitions.
// Phase 1: matrix 145 rows 145 cols
[2024-05-30 13:26:26] [INFO ] Computed 13 invariants in 13 ms
[2024-05-30 13:26:26] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-30 13:26:26] [INFO ] Invariant cache hit.
[2024-05-30 13:26:26] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2024-05-30 13:26:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-30 13:26:27] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 25 ms to minimize.
[2024-05-30 13:26:28] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:26:28] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:26:28] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:26:28] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:26:28] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:26:28] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-30 13:26:28] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:26:28] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-30 13:26:28] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-30 13:26:28] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:26:28] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:26:28] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:26:28] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:26:28] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 0 ms to minimize.
[2024-05-30 13:26:28] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:26:28] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:26:28] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-30 13:26:29] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:26:29] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:26:29] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:26:29] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:26:29] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:26:29] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:26:29] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-30 13:26:29] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:26:30] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:26:30] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:26:30] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:26:30] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 145/290 variables, 145/188 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-30 13:26:31] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:26:31] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:26:31] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:26:31] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:26:31] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 2 ms to minimize.
[2024-05-30 13:26:31] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:26:31] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:26:32] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:26:32] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:26:32] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 2 ms to minimize.
[2024-05-30 13:26:32] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:26:32] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:26:32] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 13/201 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-30 13:26:33] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-30 13:26:33] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:26:33] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/290 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (OVERLAPS) 0/290 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 204 constraints, problems are : Problem set: 0 solved, 144 unsolved in 8952 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 46/59 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-30 13:26:36] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:26:36] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 145/290 variables, 145/206 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 144/350 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-30 13:26:37] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 2 ms to minimize.
[2024-05-30 13:26:37] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:26:37] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:26:37] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:26:37] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:26:37] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:26:38] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:26:38] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:26:38] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 7 ms to minimize.
[2024-05-30 13:26:38] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:26:38] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:26:38] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:26:38] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:26:38] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:26:38] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-05-30 13:26:38] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:26:39] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:26:39] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:26:39] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:26:39] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 20/370 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-30 13:26:39] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-05-30 13:26:39] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-30 13:26:40] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:26:40] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 4/374 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-30 13:26:42] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-30 13:26:45] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/290 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-30 13:26:49] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/290 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-30 13:26:50] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/290 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/290 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 16 (OVERLAPS) 0/290 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 378 constraints, problems are : Problem set: 0 solved, 144 unsolved in 20257 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 76/76 constraints]
After SMT, in 29254ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 29272ms
Starting structural reductions in LTL mode, iteration 1 : 145/153 places, 145/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29669 ms. Remains : 145/153 places, 145/153 transitions.
Support contains 79 out of 145 places after structural reductions.
[2024-05-30 13:26:56] [INFO ] Flatten gal took : 30 ms
[2024-05-30 13:26:56] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA ShieldRVt-PT-003B-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-003B-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 13:26:56] [INFO ] Flatten gal took : 12 ms
[2024-05-30 13:26:56] [INFO ] Input system was already deterministic with 145 transitions.
Support contains 71 out of 145 places (down from 79) after GAL structural reductions.
RANDOM walk for 40000 steps (11 resets) in 960 ms. (41 steps per ms) remains 0/51 properties
[2024-05-30 13:26:56] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:26:56] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:26:56] [INFO ] Input system was already deterministic with 145 transitions.
Computed a total of 42 stabilizing places and 42 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 145/145 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 127 transition count 127
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 127 transition count 127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 126 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 126 transition count 126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 125 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 125 transition count 125
Applied a total of 40 rules in 19 ms. Remains 125 /145 variables (removed 20) and now considering 125/145 (removed 20) transitions.
// Phase 1: matrix 125 rows 125 cols
[2024-05-30 13:26:56] [INFO ] Computed 13 invariants in 2 ms
[2024-05-30 13:26:56] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-30 13:26:56] [INFO ] Invariant cache hit.
[2024-05-30 13:26:57] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2024-05-30 13:26:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-30 13:26:57] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-30 13:26:57] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:26:57] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:26:58] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-30 13:26:58] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:26:58] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:26:58] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
[2024-05-30 13:26:58] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:26:58] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:26:58] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:26:58] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:26:58] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 125/250 variables, 125/150 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 0/250 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 150 constraints, problems are : Problem set: 0 solved, 124 unsolved in 3229 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-30 13:27:00] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 125/250 variables, 125/151 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 124/275 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-30 13:27:01] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:27:01] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2024-05-30 13:27:01] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:27:01] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:27:01] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:27:01] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-30 13:27:01] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:27:02] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:27:02] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:27:02] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:27:02] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-30 13:27:02] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:27:02] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 13/288 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-30 13:27:03] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:27:03] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:27:03] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:27:03] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-30 13:27:03] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:27:03] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:27:03] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 7/295 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-30 13:27:06] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/250 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-30 13:27:07] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:27:07] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2024-05-30 13:27:07] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-30 13:27:10] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/250 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 15 (OVERLAPS) 0/250 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 300 constraints, problems are : Problem set: 0 solved, 124 unsolved in 14268 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 38/38 constraints]
After SMT, in 17514ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 17516ms
Starting structural reductions in LTL mode, iteration 1 : 125/145 places, 125/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17687 ms. Remains : 125/145 places, 125/145 transitions.
[2024-05-30 13:27:14] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:27:14] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:27:14] [INFO ] Input system was already deterministic with 125 transitions.
[2024-05-30 13:27:14] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:27:14] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:27:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality11789362467389468396.gal : 3 ms
[2024-05-30 13:27:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality16620712891938002816.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11789362467389468396.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16620712891938002816.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.72067e+11,0.361617,17460,2,1375,5,42676,6,0,627,95730,0


Converting to forward existential form...Done !
original formula: AX(((EG((AX((p60==0)) + AG(((p67==0)||(p107==1))))) * AF(AX((p54==1)))) * (((p82==0)||(p71==1)) + E(AF(((p4==0)||(p84==0))) U ((EX(((p30=...222
=> equivalent forward existential formula: (([(EY(Init) * !(EG((!(EX(!((p60==0)))) + !(E(TRUE U !(((p67==0)||(p107==1)))))))))] = FALSE * [FwdG(EY(Init),!(...352
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t9, t13, t17, t22, t26, t30, t31, t37, t41, t42, t43, t47, t52, t53, t55, t58, t62, t...339
Detected timeout of ITS tools.
[2024-05-30 13:27:44] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:27:44] [INFO ] Applying decomposition
[2024-05-30 13:27:44] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12085594602850554304.txt' '-o' '/tmp/graph12085594602850554304.bin' '-w' '/tmp/graph12085594602850554304.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12085594602850554304.bin' '-l' '-1' '-v' '-w' '/tmp/graph12085594602850554304.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:27:44] [INFO ] Decomposing Gal with order
[2024-05-30 13:27:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:27:44] [INFO ] Removed a total of 25 redundant transitions.
[2024-05-30 13:27:45] [INFO ] Flatten gal took : 36 ms
[2024-05-30 13:27:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-30 13:27:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality13672511315615345483.gal : 4 ms
[2024-05-30 13:27:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality17062866983859971448.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/CTLCardinality13672511315615345483.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17062866983859971448.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.72067e+11,0.12672,6372,350,27,5327,210,324,8328,46,473,0


Converting to forward existential form...Done !
original formula: AX(((EG((AX((i6.u19.p60==0)) + AG(((i6.u19.p67==0)||(i10.i0.u34.p107==1))))) * AF(AX((i4.u15.p54==1)))) * (((i8.i0.u27.p82==0)||(i7.u21.p...336
=> equivalent forward existential formula: (([(EY(Init) * !(EG((!(EX(!((i6.u19.p60==0)))) + !(E(TRUE U !(((i6.u19.p67==0)||(i10.i0.u34.p107==1)))))))))] = ...466
Reverse transition relation is NOT exact ! Due to transitions t117, i0.i0.u1.t110, i1.t103, i1.u5.t107, i2.t96, i2.u9.t100, i2.u9.t101, i3.t86, i3.u12.t90,...534
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
(forward)formula 0,0,9.52616,289316,1,0,529336,409,1672,930192,223,1218,562104
FORMULA ShieldRVt-PT-003B-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 145/145 places, 145/145 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 144 transition count 110
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 70 place count 110 transition count 108
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 73 place count 109 transition count 106
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 75 place count 107 transition count 106
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 75 place count 107 transition count 92
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 103 place count 93 transition count 92
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 118 place count 78 transition count 77
Iterating global reduction 4 with 15 rules applied. Total rules applied 133 place count 78 transition count 77
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 133 place count 78 transition count 66
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 155 place count 67 transition count 66
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 195 place count 47 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 196 place count 46 transition count 45
Applied a total of 196 rules in 35 ms. Remains 46 /145 variables (removed 99) and now considering 45/145 (removed 100) transitions.
// Phase 1: matrix 45 rows 46 cols
[2024-05-30 13:27:54] [INFO ] Computed 13 invariants in 0 ms
[2024-05-30 13:27:54] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 13:27:54] [INFO ] Invariant cache hit.
[2024-05-30 13:27:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 13:27:54] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-30 13:27:54] [INFO ] Redundant transitions in 1 ms returned []
Running 42 sub problems to find dead transitions.
[2024-05-30 13:27:54] [INFO ] Invariant cache hit.
[2024-05-30 13:27:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 3/46 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-30 13:27:54] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 45/91 variables, 46/60 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 61 constraints, problems are : Problem set: 0 solved, 42 unsolved in 569 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 3/46 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 45/91 variables, 46/60 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 42/103 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-30 13:27:55] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (OVERLAPS) 0/91 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 104 constraints, problems are : Problem set: 0 solved, 42 unsolved in 595 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 2/2 constraints]
After SMT, in 1182ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1185ms
Starting structural reductions in SI_CTL mode, iteration 1 : 46/145 places, 45/145 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1319 ms. Remains : 46/145 places, 45/145 transitions.
[2024-05-30 13:27:55] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:27:55] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:27:55] [INFO ] Input system was already deterministic with 45 transitions.
[2024-05-30 13:27:55] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:27:55] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:27:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality8453795468030506042.gal : 6 ms
[2024-05-30 13:27:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality1632285877337568335.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/CTLCardinality8453795468030506042.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1632285877337568335.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG((!(A(EG((p55==1)) U !((((p118==0)||(p109==1))&&((p10==0)||(p152==1)))))) * (p35==0)))
=> equivalent forward existential formula: [FwdG(Init,(!(!((E(!(!((((p118==0)||(p109==1))&&((p10==0)||(p152==1))))) U (!(EG((p55==1))) * !(!((((p118==0)||(...278
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t7, t9, t11, t14, t16, t18, t20, t22, t23, t26, t28, t41, t42, Intersection with rea...231
(forward)formula 0,1,3.82387,159356,1,0,724,718726,122,360,1411,1.55888e+06,720
FORMULA ShieldRVt-PT-003B-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 145/145 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 121 transition count 121
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 121 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 120 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 120 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 119 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 119 transition count 119
Applied a total of 52 rules in 19 ms. Remains 119 /145 variables (removed 26) and now considering 119/145 (removed 26) transitions.
// Phase 1: matrix 119 rows 119 cols
[2024-05-30 13:27:59] [INFO ] Computed 13 invariants in 13 ms
[2024-05-30 13:27:59] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-30 13:27:59] [INFO ] Invariant cache hit.
[2024-05-30 13:27:59] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2024-05-30 13:27:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-30 13:28:00] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:28:00] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:28:00] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/238 variables, 119/135 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-30 13:28:02] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 2 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/238 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 0/238 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 136 constraints, problems are : Problem set: 0 solved, 118 unsolved in 3674 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/238 variables, 119/136 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 118/254 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-30 13:28:04] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:28:04] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:28:04] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 0 ms to minimize.
[2024-05-30 13:28:04] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:28:04] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-30 13:28:04] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:28:04] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:28:04] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:28:05] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:28:05] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:28:05] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:28:05] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:28:05] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:28:05] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:28:05] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:28:05] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:28:05] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 17/271 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-30 13:28:06] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:28:06] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:28:06] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-30 13:28:06] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:28:06] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 2 ms to minimize.
[2024-05-30 13:28:06] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-30 13:28:06] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 7/278 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-30 13:28:07] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-30 13:28:08] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:28:08] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:28:08] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 3/282 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-30 13:28:09] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:28:09] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-30 13:28:10] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 13 (OVERLAPS) 0/238 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 285 constraints, problems are : Problem set: 0 solved, 118 unsolved in 10066 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 35/35 constraints]
After SMT, in 13754ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 13755ms
Starting structural reductions in LTL mode, iteration 1 : 119/145 places, 119/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13907 ms. Remains : 119/145 places, 119/145 transitions.
[2024-05-30 13:28:13] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:28:13] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:28:13] [INFO ] Input system was already deterministic with 119 transitions.
[2024-05-30 13:28:13] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:28:13] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:28:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality13939181562978445017.gal : 1 ms
[2024-05-30 13:28:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality16881037686480424839.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/CTLCardinality13939181562978445017.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16881037686480424839.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.04966e+11,0.212606,13048,2,945,5,29622,6,0,597,62197,0


Converting to forward existential form...Done !
original formula: (AF(AG((p73==1))) * AX(((p5==0)||(p2==1))))
=> equivalent forward existential formula: ([FwdG(Init,!(!(E(TRUE U !((p73==1))))))] = FALSE * [(EY(Init) * !(((p5==0)||(p2==1))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t45, t49, t54, t58, t59, t62, t66, t72, t76, ...298
(forward)formula 0,0,0.849772,33104,1,0,286,125439,266,129,3502,164385,305
FORMULA ShieldRVt-PT-003B-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 145/145 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 120 transition count 120
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 120 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 119 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 119 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 118 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 118 transition count 118
Applied a total of 54 rules in 6 ms. Remains 118 /145 variables (removed 27) and now considering 118/145 (removed 27) transitions.
// Phase 1: matrix 118 rows 118 cols
[2024-05-30 13:28:14] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 13:28:14] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-30 13:28:14] [INFO ] Invariant cache hit.
[2024-05-30 13:28:14] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-05-30 13:28:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 13:28:15] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:28:15] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:28:15] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/236 variables, 118/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 0/236 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 134 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2472 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/236 variables, 118/134 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 117/251 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 13:28:17] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:28:18] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:28:18] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:28:18] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:28:18] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:28:18] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:28:18] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:28:18] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-30 13:28:18] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:28:18] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 10/261 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 13:28:19] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:28:19] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:28:19] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:28:19] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:28:19] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:28:19] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-30 13:28:19] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:28:19] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 8/269 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 13:28:20] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 0/236 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 270 constraints, problems are : Problem set: 0 solved, 117 unsolved in 5820 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 22/22 constraints]
After SMT, in 8303ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 8305ms
Starting structural reductions in LTL mode, iteration 1 : 118/145 places, 118/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8428 ms. Remains : 118/145 places, 118/145 transitions.
[2024-05-30 13:28:23] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:28:23] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:28:23] [INFO ] Input system was already deterministic with 118 transitions.
[2024-05-30 13:28:23] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:28:23] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:28:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality6691763755098815709.gal : 7 ms
[2024-05-30 13:28:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality2096757688385887565.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/CTLCardinality6691763755098815709.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2096757688385887565.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,9.5348e+10,0.215232,11984,2,934,5,27807,6,0,592,54532,0


Converting to forward existential form...Done !
original formula: AX(AF((p106==1)))
=> equivalent forward existential formula: [FwdG(EY(Init),!((p106==1)))] = FALSE
Hit Full ! (commute/partial/dont) 116/0/2
(forward)formula 0,1,0.416239,15416,1,0,57,55408,20,3,2712,54532,56
FORMULA ShieldRVt-PT-003B-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 145/145 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 125 transition count 125
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 125 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 124 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 124 transition count 124
Applied a total of 42 rules in 9 ms. Remains 124 /145 variables (removed 21) and now considering 124/145 (removed 21) transitions.
// Phase 1: matrix 124 rows 124 cols
[2024-05-30 13:28:23] [INFO ] Computed 13 invariants in 3 ms
[2024-05-30 13:28:23] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 13:28:23] [INFO ] Invariant cache hit.
[2024-05-30 13:28:23] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-30 13:28:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-30 13:28:24] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:28:24] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:28:24] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:28:24] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-30 13:28:24] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:28:24] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:28:24] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 3 ms to minimize.
[2024-05-30 13:28:24] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 124/248 variables, 124/145 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 0/248 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 145 constraints, problems are : Problem set: 0 solved, 123 unsolved in 2911 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-30 13:28:27] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:28:27] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 124/248 variables, 124/147 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 123/270 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-30 13:28:27] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:28:27] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:28:28] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:28:28] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 4/274 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-30 13:28:28] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:28:28] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:28:29] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:28:29] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:28:29] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:28:29] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 6/280 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-30 13:28:30] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:28:30] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:28:30] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 3/283 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/248 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-30 13:28:32] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:28:32] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/248 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-30 13:28:33] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2024-05-30 13:28:33] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:28:33] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/248 variables, 3/288 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-30 13:28:35] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:28:35] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:28:35] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/248 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/248 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 15 (OVERLAPS) 0/248 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 291 constraints, problems are : Problem set: 0 solved, 123 unsolved in 11451 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 31/31 constraints]
After SMT, in 14378ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 14381ms
Starting structural reductions in LTL mode, iteration 1 : 124/145 places, 124/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14516 ms. Remains : 124/145 places, 124/145 transitions.
[2024-05-30 13:28:38] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:28:38] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:28:38] [INFO ] Input system was already deterministic with 124 transitions.
[2024-05-30 13:28:38] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:28:38] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:28:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality6901495802721743697.gal : 2 ms
[2024-05-30 13:28:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality16944269382090840524.ctl : 9 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/CTLCardinality6901495802721743697.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16944269382090840524.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.53344e+11,0.321576,16240,2,1246,5,37469,6,0,622,86123,0


Converting to forward existential form...Done !
original formula: (A((((p148==1) + E(AX(((p135==0)||(p41==1))) U (((p152==0)||(p59==0))||(p148==1)))) + ((p70==1) * !(A((p38==1) U ((p32==0)||(p5==1)))))) ...300
=> equivalent forward existential formula: [FwdG((Init * !(!((E(!((!((E(!((((p9==0)||(p108==1))&&((p72==0)||(p56==1)))) U (!((p19!=1)) * !((((p9==0)||(p108...1005
Reverse transition relation is NOT exact ! Due to transitions t4, t9, t13, t17, t22, t26, t31, t32, t38, t39, t43, t45, t48, t49, t53, t55, t59, t63, t65, ...318
(forward)formula 0,0,27.1472,840084,1,0,1063,4.12357e+06,302,493,3750,6.43115e+06,1178
FORMULA ShieldRVt-PT-003B-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 145/145 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 127 transition count 127
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 127 transition count 127
Applied a total of 36 rules in 5 ms. Remains 127 /145 variables (removed 18) and now considering 127/145 (removed 18) transitions.
// Phase 1: matrix 127 rows 127 cols
[2024-05-30 13:29:05] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 13:29:05] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-30 13:29:05] [INFO ] Invariant cache hit.
[2024-05-30 13:29:05] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-05-30 13:29:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-30 13:29:06] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:29:06] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:29:06] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:29:06] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:29:06] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:29:06] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:29:06] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-30 13:29:07] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 127/254 variables, 127/148 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 0/254 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 148 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3351 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/254 variables, 127/148 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 126/274 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-30 13:29:09] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-30 13:29:09] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:29:10] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:29:10] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:29:10] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-05-30 13:29:10] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-30 13:29:10] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:29:10] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-30 13:29:10] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:29:10] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:29:10] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:29:10] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2024-05-30 13:29:10] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-30 13:29:10] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:29:10] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:29:11] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:29:11] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 17/291 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-30 13:29:11] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:29:11] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-30 13:29:12] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:29:12] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:29:12] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 5/296 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-30 13:29:13] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-30 13:29:13] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-30 13:29:14] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:29:14] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:29:14] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-30 13:29:16] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-30 13:29:16] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-30 13:29:16] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 13 (OVERLAPS) 0/254 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 304 constraints, problems are : Problem set: 0 solved, 126 unsolved in 11762 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 38/38 constraints]
After SMT, in 15132ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 15147ms
Starting structural reductions in LTL mode, iteration 1 : 127/145 places, 127/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15315 ms. Remains : 127/145 places, 127/145 transitions.
[2024-05-30 13:29:20] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:29:20] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:29:20] [INFO ] Input system was already deterministic with 127 transitions.
[2024-05-30 13:29:20] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:29:20] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:29:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality8930612932166545518.gal : 6 ms
[2024-05-30 13:29:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality11832661673833985166.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/CTLCardinality8930612932166545518.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11832661673833985166.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.20453e+11,0.27543,15200,2,1303,5,35557,6,0,637,77981,0


Converting to forward existential form...Done !
original formula: AG(((EF(!(A(((p111==0)||(p127==1)) U ((p74==0)||(p24==1))))) + EX((AX((p54==1)) + (AX((p1==0)) * AF((p13==1)))))) + (((AX((((p110==0)&&(p...266
=> equivalent forward existential formula: ((([(EY((FwdU(Init,TRUE) * !((E(TRUE U !(!((E(!(((p74==0)||(p24==1))) U (!(((p111==0)||(p127==1))) * !(((p74==0)...1146
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t17, t22, t26, t34, t36, t41, t45, t50, t54, t59, t63, t66, t70, t77, t81, ...327
Detected timeout of ITS tools.
[2024-05-30 13:29:50] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:29:50] [INFO ] Applying decomposition
[2024-05-30 13:29:50] [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/graph8495029485781926602.txt' '-o' '/tmp/graph8495029485781926602.bin' '-w' '/tmp/graph8495029485781926602.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8495029485781926602.bin' '-l' '-1' '-v' '-w' '/tmp/graph8495029485781926602.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:29:50] [INFO ] Decomposing Gal with order
[2024-05-30 13:29:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:29:51] [INFO ] Removed a total of 27 redundant transitions.
[2024-05-30 13:29:51] [INFO ] Flatten gal took : 16 ms
[2024-05-30 13:29:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 13:29:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality2205573474124458726.gal : 20 ms
[2024-05-30 13:29:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality12500776818676402278.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/CTLCardinality2205573474124458726.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12500776818676402278.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.20453e+11,0.137994,7480,390,25,8009,253,316,11959,43,513,0


Converting to forward existential form...Done !
original formula: AG(((EF(!(A(((i10.u38.p111==0)||(i9.u42.p127==1)) U ((i6.u24.p74==0)||(i0.i1.u9.p24==1))))) + EX((AX((i3.u18.p54==1)) + (AX((i4.i0.u0.p1=...398
=> equivalent forward existential formula: ((([(EY((FwdU(Init,TRUE) * !((E(TRUE U !(!((E(!(((i6.u24.p74==0)||(i0.i1.u9.p24==1))) U (!(((i10.u38.p111==0)||(...1565
Reverse transition relation is NOT exact ! Due to transitions t119, i0.i1.t101, i0.i1.t102, i0.i1.u9.t100, i0.i1.u12.t96, i1.t104, i1.u4.t109, i1.u7.t108, ...502
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 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
(forward)formula 0,0,6.83006,280548,1,0,542993,357,2054,940664,230,1073,499430
FORMULA ShieldRVt-PT-003B-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 145/145 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 122 transition count 122
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 122 transition count 122
Applied a total of 46 rules in 6 ms. Remains 122 /145 variables (removed 23) and now considering 122/145 (removed 23) transitions.
// Phase 1: matrix 122 rows 122 cols
[2024-05-30 13:29:57] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 13:29:57] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-30 13:29:57] [INFO ] Invariant cache hit.
[2024-05-30 13:29:58] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-30 13:29:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 13:29:58] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:29:58] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:29:59] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 13:29:59] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/244 variables, 122/139 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/244 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/244 variables, and 139 constraints, problems are : Problem set: 0 solved, 121 unsolved in 3056 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/244 variables, 122/139 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 121/260 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 13:30:01] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:30:02] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 2 ms to minimize.
[2024-05-30 13:30:02] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-30 13:30:02] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-30 13:30:02] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:30:02] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:30:02] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:30:02] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:30:02] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 2 ms to minimize.
[2024-05-30 13:30:02] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 4 ms to minimize.
[2024-05-30 13:30:03] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 11/271 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 13:30:03] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:30:03] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 0 ms to minimize.
[2024-05-30 13:30:03] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-30 13:30:04] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 21 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 4/275 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 13:30:04] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:30:05] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 13:30:05] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2024-05-30 13:30:05] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 13:30:07] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 13:30:07] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 13:30:08] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:30:09] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:30:09] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 3/284 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/244 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 14 (OVERLAPS) 0/244 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/244 variables, and 284 constraints, problems are : Problem set: 0 solved, 121 unsolved in 10645 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 28/28 constraints]
After SMT, in 13726ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 13728ms
Starting structural reductions in LTL mode, iteration 1 : 122/145 places, 122/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13932 ms. Remains : 122/145 places, 122/145 transitions.
[2024-05-30 13:30:11] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:30:11] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:30:11] [INFO ] Input system was already deterministic with 122 transitions.
[2024-05-30 13:30:11] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:30:11] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:30:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality8708249653148999881.gal : 1 ms
[2024-05-30 13:30:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality11553807591387606863.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/CTLCardinality8708249653148999881.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11553807591387606863.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.47745e+11,0.216482,12536,2,981,5,29300,6,0,612,58045,0


Converting to forward existential form...Done !
original formula: E(!(EF((EG(((p108==0)||(p77==1))) + ((p110==1)&&(p122==0))))) U E((p59==1) U ((EF((p112==1)) * !(EF((p38==1)))) * AX(EX(TRUE)))))
=> equivalent forward existential formula: [((FwdU(FwdU(Init,!(E(TRUE U (EG(((p108==0)||(p77==1))) + ((p110==1)&&(p122==0)))))),(p59==1)) * (E(TRUE U (p112...218
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t26, t29, t35, t40, t44, t49, t53, t58, t62, t65, t69, t75, t79, ...305
Detected timeout of ITS tools.
[2024-05-30 13:30:41] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:30:41] [INFO ] Applying decomposition
[2024-05-30 13:30:41] [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/graph16307755535986708915.txt' '-o' '/tmp/graph16307755535986708915.bin' '-w' '/tmp/graph16307755535986708915.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16307755535986708915.bin' '-l' '-1' '-v' '-w' '/tmp/graph16307755535986708915.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:30:41] [INFO ] Decomposing Gal with order
[2024-05-30 13:30:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:30:42] [INFO ] Removed a total of 28 redundant transitions.
[2024-05-30 13:30:42] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:30:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-30 13:30:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality17406334663317323076.gal : 5 ms
[2024-05-30 13:30:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality4898365556266709793.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/CTLCardinality17406334663317323076.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4898365556266709793.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.47745e+11,0.061903,6108,309,32,5369,291,293,7016,47,574,0


Converting to forward existential form...Done !
original formula: E(!(EF((EG(((i9.i1.u37.p108==0)||(i7.i1.u23.p77==1))) + ((i9.i0.u36.p110==1)&&(i10.u41.p122==0))))) U E((i6.u21.p59==1) U ((EF((i9.i1.u35...209
=> equivalent forward existential formula: [((FwdU(FwdU(Init,!(E(TRUE U (EG(((i9.i1.u37.p108==0)||(i7.i1.u23.p77==1))) + ((i9.i0.u36.p110==1)&&(i10.u41.p12...280
Reverse transition relation is NOT exact ! Due to transitions t111, t114, i0.i0.u1.t107, i1.t100, i1.u4.t104, i2.t97, i3.t84, i3.u12.t88, i4.t79, i4.u14.t7...462
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
(forward)formula 0,0,3.32404,125172,1,0,224389,478,1842,398594,259,1326,254031
FORMULA ShieldRVt-PT-003B-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 145/145 places, 145/145 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 144 transition count 108
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 74 place count 108 transition count 106
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 76 place count 107 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 77 place count 106 transition count 105
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 77 place count 106 transition count 90
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 107 place count 91 transition count 90
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 125 place count 73 transition count 72
Iterating global reduction 4 with 18 rules applied. Total rules applied 143 place count 73 transition count 72
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 143 place count 73 transition count 60
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 167 place count 61 transition count 60
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 207 place count 41 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 208 place count 40 transition count 39
Applied a total of 208 rules in 17 ms. Remains 40 /145 variables (removed 105) and now considering 39/145 (removed 106) transitions.
// Phase 1: matrix 39 rows 40 cols
[2024-05-30 13:30:45] [INFO ] Computed 13 invariants in 4 ms
[2024-05-30 13:30:45] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-30 13:30:45] [INFO ] Invariant cache hit.
[2024-05-30 13:30:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-30 13:30:45] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-30 13:30:45] [INFO ] Redundant transitions in 0 ms returned []
Running 37 sub problems to find dead transitions.
[2024-05-30 13:30:45] [INFO ] Invariant cache hit.
[2024-05-30 13:30:45] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 2/40 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-30 13:30:45] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 39/79 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 0/79 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 56 constraints, problems are : Problem set: 0 solved, 37 unsolved in 414 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 40/40 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 2/40 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 39/79 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 37/93 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (OVERLAPS) 0/79 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 93 constraints, problems are : Problem set: 0 solved, 37 unsolved in 375 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 40/40 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 1/1 constraints]
After SMT, in 795ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 796ms
Starting structural reductions in SI_CTL mode, iteration 1 : 40/145 places, 39/145 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 906 ms. Remains : 40/145 places, 39/145 transitions.
[2024-05-30 13:30:46] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:30:46] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:30:46] [INFO ] Input system was already deterministic with 39 transitions.
[2024-05-30 13:30:46] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:30:46] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:30:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality11330307826387305422.gal : 1 ms
[2024-05-30 13:30:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality13224602749992685499.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/CTLCardinality11330307826387305422.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13224602749992685499.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,590496,0.014781,3940,2,116,5,2570,6,0,198,3634,0


Converting to forward existential form...Done !
original formula: EF(EG(((p106==0)||(p80==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((p106==0)||(p80==1)))] != FALSE
Hit Full ! (commute/partial/dont) 35/0/4
(forward)formula 0,1,0.022348,4204,1,0,12,2997,19,3,996,3634,12
FORMULA ShieldRVt-PT-003B-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 145/145 places, 145/145 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 144 transition count 105
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 41 rules applied. Total rules applied 80 place count 105 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 104 transition count 103
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 81 place count 104 transition count 89
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 109 place count 90 transition count 89
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 127 place count 72 transition count 71
Iterating global reduction 3 with 18 rules applied. Total rules applied 145 place count 72 transition count 71
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 145 place count 72 transition count 61
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 165 place count 62 transition count 61
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 209 place count 40 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 211 place count 38 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 212 place count 37 transition count 37
Applied a total of 212 rules in 12 ms. Remains 37 /145 variables (removed 108) and now considering 37/145 (removed 108) transitions.
// Phase 1: matrix 37 rows 37 cols
[2024-05-30 13:30:46] [INFO ] Computed 12 invariants in 0 ms
[2024-05-30 13:30:46] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-30 13:30:46] [INFO ] Invariant cache hit.
[2024-05-30 13:30:46] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-30 13:30:46] [INFO ] Redundant transitions in 1 ms returned []
Running 35 sub problems to find dead transitions.
[2024-05-30 13:30:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 1/37 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 37/74 variables, 37/49 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 0/74 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/74 variables, and 49 constraints, problems are : Problem set: 0 solved, 35 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 1/37 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 37/74 variables, 37/49 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 35/84 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 0/74 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/74 variables, and 84 constraints, problems are : Problem set: 0 solved, 35 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
After SMT, in 631ms problems are : Problem set: 0 solved, 35 unsolved
Search for dead transitions found 0 dead transitions in 632ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/145 places, 37/145 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 755 ms. Remains : 37/145 places, 37/145 transitions.
[2024-05-30 13:30:47] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:30:47] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:30:47] [INFO ] Input system was already deterministic with 37 transitions.
RANDOM walk for 158 steps (0 resets) in 5 ms. (26 steps per ms) remains 0/1 properties
FORMULA ShieldRVt-PT-003B-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-30 13:30:47] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:30:47] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:30:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3910951251362330553.gal : 1 ms
[2024-05-30 13:30:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12371691064287020545.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/ReachabilityCardinality3910951251362330553.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12371691064287020545.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 LTL mode, iteration 0 : 145/145 places, 145/145 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 125 transition count 125
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 125 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 124 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 124 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 123 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 123 transition count 123
Applied a total of 44 rules in 3 ms. Remains 123 /145 variables (removed 22) and now considering 123/145 (removed 22) transitions.
// Phase 1: matrix 123 rows 123 cols
[2024-05-30 13:30:47] [INFO ] Computed 13 invariants in 0 ms
[2024-05-30 13:30:47] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-30 13:30:47] [INFO ] Invariant cache hit.
[2024-05-30 13:30:47] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-05-30 13:30:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-30 13:30:47] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-30 13:30:47] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:30:48] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:30:48] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:30:48] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-30 13:30:48] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/246 variables, 123/142 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-30 13:30:48] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-30 13:30:49] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/246 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 144 constraints, problems are : Problem set: 0 solved, 122 unsolved in 3651 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 123/246 variables, 123/144 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 122/266 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-30 13:30:51] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:30:51] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:30:51] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:30:51] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:30:51] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:30:52] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:30:52] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:30:52] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-05-30 13:30:52] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:30:52] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:30:52] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-05-30 13:30:52] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 12/278 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-30 13:30:53] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-30 13:30:53] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:30:53] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 3/281 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-30 13:30:54] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-30 13:30:55] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-30 13:30:55] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (OVERLAPS) 0/246 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 284 constraints, problems are : Problem set: 0 solved, 122 unsolved in 7935 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 26/26 constraints]
After SMT, in 11598ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 11599ms
Starting structural reductions in LTL mode, iteration 1 : 123/145 places, 123/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11713 ms. Remains : 123/145 places, 123/145 transitions.
[2024-05-30 13:30:58] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:30:58] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:30:58] [INFO ] Input system was already deterministic with 123 transitions.
[2024-05-30 13:30:58] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:30:58] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:30:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality7048786434470559125.gal : 1 ms
[2024-05-30 13:30:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality3022768281827774456.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/CTLCardinality7048786434470559125.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3022768281827774456.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.45824e+11,0.260383,14120,2,1271,5,34175,6,0,617,69651,0


Converting to forward existential form...Done !
original formula: EF(((p124==1) * (A(AF((p26==1)) U EF((p122==1))) + A(AX(((p0==0)||(p43==1))) U ((((p24==1)&&((p30==0)||(p29==1))) + A((p115==1) U ((p150=...203
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * (p124==1)) * !(EG(!(E(TRUE U (p122==1)))))) * !(E(!(E(TRUE U (p122==1))) U (!(!(EG(!((p26...843
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t10, t13, t17, t20, t22, t26, t27, t28, t31, t32, t38, t42, t47, t51, t56, t60, t63, ...323
Detected timeout of ITS tools.
[2024-05-30 13:31:28] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:31:28] [INFO ] Applying decomposition
[2024-05-30 13:31:28] [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/graph16722427227239461434.txt' '-o' '/tmp/graph16722427227239461434.bin' '-w' '/tmp/graph16722427227239461434.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16722427227239461434.bin' '-l' '-1' '-v' '-w' '/tmp/graph16722427227239461434.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:31:28] [INFO ] Decomposing Gal with order
[2024-05-30 13:31:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:31:28] [INFO ] Removed a total of 26 redundant transitions.
[2024-05-30 13:31:28] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:31:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 13:31:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality9441691234912717428.gal : 2 ms
[2024-05-30 13:31:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality5398920397096350764.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/CTLCardinality9441691234912717428.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5398920397096350764.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.45824e+11,0.066748,6628,342,31,6150,288,297,8479,49,614,0


Converting to forward existential form...Done !
original formula: EF(((i10.u36.p124==1) * (A(AF((i2.u7.p26==1)) U EF((i10.u38.p122==1))) + A(AX(((i0.i0.u0.p0==0)||(i3.u10.p43==1))) U ((((i2.u8.p24==1)&&(...299
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * (i10.u36.p124==1)) * !(EG(!(E(TRUE U (i10.u38.p122==1)))))) * !(E(!(E(TRUE U (i10.u38.p12...1175
Reverse transition relation is NOT exact ! Due to transitions t20, t112, i0.i0.u1.t108, i1.t101, i1.u5.t105, i2.t93, i2.u8.t97, i2.u8.t99, i3.t83, i3.u11.t...487
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,7.84299,297188,1,0,579722,489,1963,964744,280,1305,493768
FORMULA ShieldRVt-PT-003B-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 145/145 places, 145/145 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 144 transition count 113
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 64 place count 113 transition count 111
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 67 place count 112 transition count 109
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 69 place count 110 transition count 109
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 69 place count 110 transition count 94
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 99 place count 95 transition count 94
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 117 place count 77 transition count 76
Iterating global reduction 4 with 18 rules applied. Total rules applied 135 place count 77 transition count 76
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 135 place count 77 transition count 65
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 157 place count 66 transition count 65
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 197 place count 46 transition count 45
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 199 place count 44 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 200 place count 43 transition count 43
Applied a total of 200 rules in 21 ms. Remains 43 /145 variables (removed 102) and now considering 43/145 (removed 102) transitions.
// Phase 1: matrix 43 rows 43 cols
[2024-05-30 13:31:36] [INFO ] Computed 12 invariants in 1 ms
[2024-05-30 13:31:36] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-30 13:31:36] [INFO ] Invariant cache hit.
[2024-05-30 13:31:36] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-30 13:31:36] [INFO ] Redundant transitions in 1 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-30 13:31:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/43 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 13:31:37] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 43/86 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/86 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 56 constraints, problems are : Problem set: 0 solved, 40 unsolved in 453 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 2/43 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 43/86 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 40/96 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 96 constraints, problems are : Problem set: 0 solved, 40 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 1/1 constraints]
After SMT, in 854ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 855ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/145 places, 43/145 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 954 ms. Remains : 43/145 places, 43/145 transitions.
[2024-05-30 13:31:37] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:31:37] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:31:37] [INFO ] Input system was already deterministic with 43 transitions.
[2024-05-30 13:31:37] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:31:37] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:31:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality4692192726713217493.gal : 8 ms
[2024-05-30 13:31:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality13963809963856132157.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/CTLCardinality4692192726713217493.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13963809963856132157.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.62778e+06,0.019128,4224,2,108,5,2869,6,0,217,4091,0


Converting to forward existential form...Done !
original formula: EG(AF(((p44==1) + AF((((p46==1)&&((p50==0)||(p78==1)))&&(((p98==0)||(p45==1))||(p63==0)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((p44==1) + !(EG(!((((p46==1)&&((p50==0)||(p78==1)))&&(((p98==0)||(p45==1))||(p63==0))))))))))...166
Reverse transition relation is NOT exact ! Due to transitions t5, t8, t10, t19, t21, t30, Intersection with reachable at each step enabled. (destroyed/rev...187
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,8.33452,301232,1,0,640,1.4551e+06,120,356,1357,2.5551e+06,810
FORMULA ShieldRVt-PT-003B-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 145/145 places, 145/145 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 145 transition count 106
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 41 rules applied. Total rules applied 80 place count 106 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 105 transition count 104
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 81 place count 105 transition count 91
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 107 place count 92 transition count 91
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 124 place count 75 transition count 74
Iterating global reduction 3 with 17 rules applied. Total rules applied 141 place count 75 transition count 74
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 141 place count 75 transition count 64
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 161 place count 65 transition count 64
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 209 place count 41 transition count 40
Applied a total of 209 rules in 21 ms. Remains 41 /145 variables (removed 104) and now considering 40/145 (removed 105) transitions.
// Phase 1: matrix 40 rows 41 cols
[2024-05-30 13:31:46] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 13:31:46] [INFO ] Implicit Places using invariants in 39 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 40/145 places, 40/145 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 63 ms. Remains : 40/145 places, 40/145 transitions.
[2024-05-30 13:31:46] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:31:46] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:31:46] [INFO ] Input system was already deterministic with 40 transitions.
[2024-05-30 13:31:46] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:31:46] [INFO ] Flatten gal took : 1 ms
[2024-05-30 13:31:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality12118363298650650083.gal : 0 ms
[2024-05-30 13:31:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality6399469224652959937.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/CTLCardinality12118363298650650083.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6399469224652959937.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,829477,0.012222,3944,2,163,5,2180,6,0,202,2660,0


Converting to forward existential form...Done !
original formula: EG(AF(!(A(E((p28==0) U (p1==1)) U AF(((p82==0)||(p150==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(!((E(!(!(EG(!(((p82==0)||(p150==1)))))) U (!(E((p28==0) U (p1==1))) * !(!(EG(!(((p82==0)||(p...227
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t8, t18, t19, t22, t25, Intersection with reachable at each step enabled. (destroyed...191
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,4.62002,182504,1,0,564,816270,121,314,1324,1.57129e+06,596
FORMULA ShieldRVt-PT-003B-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-30 13:31:50] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:31:50] [INFO ] Flatten gal took : 5 ms
Total runtime 324745 ms.

BK_STOP 1717075911051

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-003B"
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-003B, 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-171683762100921"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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