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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 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.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 21:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 11 21:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 21:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 11 21:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 119K 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-010B-CTLCardinality-2024-00
FORMULA_NAME ShieldRVt-PT-010B-CTLCardinality-2024-01
FORMULA_NAME ShieldRVt-PT-010B-CTLCardinality-2024-02
FORMULA_NAME ShieldRVt-PT-010B-CTLCardinality-2024-03
FORMULA_NAME ShieldRVt-PT-010B-CTLCardinality-2024-04
FORMULA_NAME ShieldRVt-PT-010B-CTLCardinality-2024-05
FORMULA_NAME ShieldRVt-PT-010B-CTLCardinality-2024-06
FORMULA_NAME ShieldRVt-PT-010B-CTLCardinality-2024-07
FORMULA_NAME ShieldRVt-PT-010B-CTLCardinality-2024-08
FORMULA_NAME ShieldRVt-PT-010B-CTLCardinality-2024-09
FORMULA_NAME ShieldRVt-PT-010B-CTLCardinality-2024-10
FORMULA_NAME ShieldRVt-PT-010B-CTLCardinality-2024-11
FORMULA_NAME ShieldRVt-PT-010B-CTLCardinality-2023-12
FORMULA_NAME ShieldRVt-PT-010B-CTLCardinality-2023-13
FORMULA_NAME ShieldRVt-PT-010B-CTLCardinality-2023-14
FORMULA_NAME ShieldRVt-PT-010B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717076851241

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-010B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-30 13:47:32] [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:47:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 13:47:32] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-05-30 13:47:32] [INFO ] Transformed 503 places.
[2024-05-30 13:47:32] [INFO ] Transformed 503 transitions.
[2024-05-30 13:47:32] [INFO ] Found NUPN structural information;
[2024-05-30 13:47:32] [INFO ] Parsed PT model containing 503 places and 503 transitions and 1186 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
FORMULA ShieldRVt-PT-010B-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 76 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 503/503 transitions.
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 79 place count 424 transition count 424
Iterating global reduction 0 with 79 rules applied. Total rules applied 158 place count 424 transition count 424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 159 place count 423 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 160 place count 423 transition count 423
Applied a total of 160 rules in 88 ms. Remains 423 /503 variables (removed 80) and now considering 423/503 (removed 80) transitions.
// Phase 1: matrix 423 rows 423 cols
[2024-05-30 13:47:32] [INFO ] Computed 41 invariants in 22 ms
[2024-05-30 13:47:32] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-05-30 13:47:33] [INFO ] Invariant cache hit.
[2024-05-30 13:47:33] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
Running 422 sub problems to find dead transitions.
[2024-05-30 13:47:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (OVERLAPS) 1/423 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-05-30 13:47:38] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 11 ms to minimize.
[2024-05-30 13:47:38] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 2 ms to minimize.
[2024-05-30 13:47:38] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-30 13:47:38] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
[2024-05-30 13:47:38] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-30 13:47:39] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:47:39] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:47:39] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 1 ms to minimize.
[2024-05-30 13:47:39] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2024-05-30 13:47:39] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:47:39] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:47:39] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-30 13:47:39] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:47:39] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:47:40] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:47:40] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:47:40] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:47:40] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:47:40] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:47:40] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-05-30 13:47:41] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:47:41] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:47:41] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 2 ms to minimize.
[2024-05-30 13:47:42] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:47:42] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:47:42] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:47:42] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:47:43] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 2 ms to minimize.
[2024-05-30 13:47:43] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 2 ms to minimize.
[2024-05-30 13:47:43] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:47:43] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:47:43] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:47:43] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:47:43] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:47:43] [INFO ] Deduced a trap composed of 29 places in 24 ms of which 2 ms to minimize.
[2024-05-30 13:47:43] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:47:43] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:47:43] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:47:43] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:47:43] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/423 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-05-30 13:47:47] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 2 ms to minimize.
[2024-05-30 13:47:48] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:47:48] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-30 13:47:48] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:47:48] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 5/86 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (OVERLAPS) 423/846 variables, 423/509 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-05-30 13:47:57] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 3 ms to minimize.
[2024-05-30 13:47:59] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:48:00] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-05-30 13:48:00] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:48:00] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:48:00] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:48:00] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/846 variables, 7/516 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 846/846 variables, and 516 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 423/423 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 422 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (OVERLAPS) 1/423 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 52/93 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-05-30 13:48:07] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:48:07] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/423 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-05-30 13:48:10] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:48:10] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:48:11] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (OVERLAPS) 423/846 variables, 423/521 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/846 variables, 422/943 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-05-30 13:48:16] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 3 ms to minimize.
[2024-05-30 13:48:16] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 2 ms to minimize.
[2024-05-30 13:48:17] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 3 ms to minimize.
[2024-05-30 13:48:17] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 3 ms to minimize.
[2024-05-30 13:48:17] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 3 ms to minimize.
[2024-05-30 13:48:17] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
[2024-05-30 13:48:17] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 3 ms to minimize.
[2024-05-30 13:48:18] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
[2024-05-30 13:48:18] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 3 ms to minimize.
[2024-05-30 13:48:18] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:48:18] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
[2024-05-30 13:48:18] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 2 ms to minimize.
[2024-05-30 13:48:18] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
[2024-05-30 13:48:19] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-30 13:48:19] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-05-30 13:48:19] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 2 ms to minimize.
[2024-05-30 13:48:19] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-05-30 13:48:19] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-05-30 13:48:20] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:48:20] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/846 variables, 20/963 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-05-30 13:48:24] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
[2024-05-30 13:48:24] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 2 ms to minimize.
[2024-05-30 13:48:24] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-05-30 13:48:24] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 3 ms to minimize.
[2024-05-30 13:48:25] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-05-30 13:48:25] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-05-30 13:48:25] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 3 ms to minimize.
[2024-05-30 13:48:25] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 2 ms to minimize.
[2024-05-30 13:48:25] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-05-30 13:48:25] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-30 13:48:26] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 2 ms to minimize.
[2024-05-30 13:48:26] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 3 ms to minimize.
[2024-05-30 13:48:27] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
[2024-05-30 13:48:27] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2024-05-30 13:48:27] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-05-30 13:48:27] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 2 ms to minimize.
[2024-05-30 13:48:28] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 2 ms to minimize.
[2024-05-30 13:48:28] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 2 ms to minimize.
[2024-05-30 13:48:28] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 2 ms to minimize.
[2024-05-30 13:48:28] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/846 variables, 20/983 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-05-30 13:48:31] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 2 ms to minimize.
[2024-05-30 13:48:33] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2024-05-30 13:48:33] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 2 ms to minimize.
[2024-05-30 13:48:33] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 846/846 variables, and 987 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 423/423 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 101/101 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 422 unsolved
Search for dead transitions found 0 dead transitions in 60136ms
Starting structural reductions in LTL mode, iteration 1 : 423/503 places, 423/503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60825 ms. Remains : 423/503 places, 423/503 transitions.
Support contains 76 out of 423 places after structural reductions.
[2024-05-30 13:48:33] [INFO ] Flatten gal took : 57 ms
[2024-05-30 13:48:33] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldRVt-PT-010B-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 13:48:33] [INFO ] Flatten gal took : 21 ms
[2024-05-30 13:48:33] [INFO ] Input system was already deterministic with 423 transitions.
Support contains 66 out of 423 places (down from 76) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1141 ms. (35 steps per ms) remains 1/45 properties
BEST_FIRST walk for 40003 steps (8 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
[2024-05-30 13:48:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 386/423 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 423/846 variables, 423/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/846 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/846 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 846/846 variables, and 464 constraints, problems are : Problem set: 0 solved, 1 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 423/423 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 386/423 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 13:48:34] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-05-30 13:48:34] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 2 ms to minimize.
[2024-05-30 13:48:34] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 2 ms to minimize.
[2024-05-30 13:48:34] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-05-30 13:48:34] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
[2024-05-30 13:48:34] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-05-30 13:48:34] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-30 13:48:34] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 423/846 variables, 423/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/846 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 13:48:35] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
[2024-05-30 13:48:35] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/846 variables, 2/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/846 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/846 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 846/846 variables, and 475 constraints, problems are : Problem set: 0 solved, 1 unsolved in 943 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 423/423 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 1134ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 2 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 423/423 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 423 transition count 305
Reduce places removed 118 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 121 rules applied. Total rules applied 239 place count 305 transition count 302
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 242 place count 302 transition count 302
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 242 place count 302 transition count 236
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 374 place count 236 transition count 236
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 396 place count 214 transition count 214
Iterating global reduction 3 with 22 rules applied. Total rules applied 418 place count 214 transition count 214
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 418 place count 214 transition count 201
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 444 place count 201 transition count 201
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 616 place count 115 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 617 place count 115 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 619 place count 114 transition count 113
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 675 place count 86 transition count 139
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 676 place count 86 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 677 place count 85 transition count 137
Applied a total of 677 rules in 80 ms. Remains 85 /423 variables (removed 338) and now considering 137/423 (removed 286) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 85/423 places, 137/423 transitions.
RANDOM walk for 40000 steps (10 resets) in 402 ms. (99 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1579641 steps, run timeout after 3001 ms. (steps per millisecond=526 ) properties seen :0 out of 1
Probabilistic random walk after 1579641 steps, saw 824749 distinct states, run finished after 3004 ms. (steps per millisecond=525 ) properties seen :0
// Phase 1: matrix 137 rows 85 cols
[2024-05-30 13:48:38] [INFO ] Computed 41 invariants in 3 ms
[2024-05-30 13:48:38] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/33 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 54/87 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 9/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/87 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 69/156 variables, 28/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/156 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/156 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/156 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 44/200 variables, 16/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/200 variables, 8/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/200 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 19/219 variables, 10/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/219 variables, 5/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/219 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 3/222 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/222 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/222 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/222 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 132 constraints, problems are : Problem set: 0 solved, 1 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 85/85 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/33 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 54/87 variables, 18/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/87 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/87 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 69/156 variables, 28/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/156 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/156 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/156 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 44/200 variables, 16/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/200 variables, 8/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/200 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 19/219 variables, 10/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/219 variables, 5/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/219 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 3/222 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/222 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/222 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/222 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 85/85 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 200ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 137/137 transitions.
Applied a total of 0 rules in 16 ms. Remains 85 /85 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 85/85 places, 137/137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 137/137 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-30 13:48:38] [INFO ] Invariant cache hit.
[2024-05-30 13:48:38] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-30 13:48:38] [INFO ] Invariant cache hit.
[2024-05-30 13:48:38] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-30 13:48:38] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-05-30 13:48:38] [INFO ] Redundant transitions in 3 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-30 13:48:38] [INFO ] Invariant cache hit.
[2024-05-30 13:48:38] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/222 variables, 85/126 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/222 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 132 constraints, problems are : Problem set: 0 solved, 136 unsolved in 2204 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 85/85 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/222 variables, 85/126 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 136/268 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 268 constraints, problems are : Problem set: 0 solved, 136 unsolved in 2106 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 85/85 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
After SMT, in 4355ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 4358ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4537 ms. Remains : 85/85 places, 137/137 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 39 edges and 85 vertex of which 4 / 85 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 266 edges and 83 vertex of which 80 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 79 transition count 128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 77 transition count 127
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 13 place count 77 transition count 123
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 77 transition count 122
Applied a total of 14 rules in 21 ms. Remains 77 /85 variables (removed 8) and now considering 122/137 (removed 15) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 122 rows 77 cols
[2024-05-30 13:48:43] [INFO ] Computed 37 invariants in 1 ms
[2024-05-30 13:48:43] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 13:48:43] [INFO ] [Nat]Absence check using 37 positive place invariants in 4 ms returned sat
[2024-05-30 13:48:43] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-30 13:48:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-30 13:48:43] [INFO ] After 4ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 13:48:43] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-30 13:48:43] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 133 ms.
[2024-05-30 13:48:43] [INFO ] Flatten gal took : 17 ms
[2024-05-30 13:48:43] [INFO ] Flatten gal took : 17 ms
[2024-05-30 13:48:43] [INFO ] Input system was already deterministic with 423 transitions.
Computed a total of 131 stabilizing places and 131 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 423/423 places, 423/423 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 422 transition count 302
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 302 transition count 302
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 240 place count 302 transition count 237
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 370 place count 237 transition count 237
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 392 place count 215 transition count 215
Iterating global reduction 2 with 22 rules applied. Total rules applied 414 place count 215 transition count 215
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 414 place count 215 transition count 201
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 442 place count 201 transition count 201
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 594 place count 125 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 595 place count 125 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 597 place count 124 transition count 123
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 599 place count 122 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 600 place count 121 transition count 121
Applied a total of 600 rules in 35 ms. Remains 121 /423 variables (removed 302) and now considering 121/423 (removed 302) transitions.
// Phase 1: matrix 121 rows 121 cols
[2024-05-30 13:48:43] [INFO ] Computed 40 invariants in 1 ms
[2024-05-30 13:48:43] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-30 13:48:43] [INFO ] Invariant cache hit.
[2024-05-30 13:48:43] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2024-05-30 13:48:43] [INFO ] Redundant transitions in 2 ms returned []
Running 119 sub problems to find dead transitions.
[2024-05-30 13:48:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 121/242 variables, 121/161 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 0/242 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 161 constraints, problems are : Problem set: 0 solved, 119 unsolved in 2187 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 121/242 variables, 121/161 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 119/280 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 280 constraints, problems are : Problem set: 0 solved, 119 unsolved in 2180 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
After SMT, in 4383ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 4385ms
Starting structural reductions in SI_CTL mode, iteration 1 : 121/423 places, 121/423 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4581 ms. Remains : 121/423 places, 121/423 transitions.
[2024-05-30 13:48:48] [INFO ] Flatten gal took : 9 ms
[2024-05-30 13:48:48] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:48:48] [INFO ] Input system was already deterministic with 121 transitions.
RANDOM walk for 7 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
FORMULA ShieldRVt-PT-010B-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-30 13:48:48] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:48:48] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:48:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality103848277817788252.gal : 3 ms
[2024-05-30 13:48:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11751180898821763918.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/ReachabilityCardinality103848277817788252.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11751180898821763918.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 : 423/423 places, 423/423 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 394 transition count 394
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 394 transition count 394
Applied a total of 58 rules in 13 ms. Remains 394 /423 variables (removed 29) and now considering 394/423 (removed 29) transitions.
// Phase 1: matrix 394 rows 394 cols
[2024-05-30 13:48:48] [INFO ] Computed 41 invariants in 2 ms
[2024-05-30 13:48:48] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-30 13:48:48] [INFO ] Invariant cache hit.
[2024-05-30 13:48:48] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 393 sub problems to find dead transitions.
[2024-05-30 13:48:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (OVERLAPS) 1/394 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-05-30 13:48:52] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:48:53] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:48:53] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:48:53] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:48:53] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:48:54] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:48:54] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:48:54] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:48:54] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:48:54] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:48:55] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:48:55] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:48:55] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 13/54 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-05-30 13:48:57] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:48:58] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (OVERLAPS) 394/788 variables, 394/450 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-05-30 13:49:06] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/788 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/788 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 8 (OVERLAPS) 0/788 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 788/788 variables, and 451 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 394/394 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (OVERLAPS) 1/394 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 4 (OVERLAPS) 394/788 variables, 394/451 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/788 variables, 393/844 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-05-30 13:49:24] [INFO ] Deduced a trap composed of 20 places in 120 ms of which 2 ms to minimize.
[2024-05-30 13:49:24] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 3 ms to minimize.
[2024-05-30 13:49:24] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 2 ms to minimize.
[2024-05-30 13:49:25] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 3 ms to minimize.
[2024-05-30 13:49:25] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 3 ms to minimize.
[2024-05-30 13:49:25] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 3 ms to minimize.
[2024-05-30 13:49:25] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 3 ms to minimize.
[2024-05-30 13:49:25] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 3 ms to minimize.
[2024-05-30 13:49:25] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:49:26] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 2 ms to minimize.
[2024-05-30 13:49:26] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 2 ms to minimize.
[2024-05-30 13:49:26] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
[2024-05-30 13:49:26] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 2 ms to minimize.
[2024-05-30 13:49:27] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 3 ms to minimize.
[2024-05-30 13:49:27] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
[2024-05-30 13:49:27] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 2 ms to minimize.
[2024-05-30 13:49:27] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2024-05-30 13:49:27] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:49:28] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-05-30 13:49:28] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/788 variables, 20/864 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-05-30 13:49:30] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 2 ms to minimize.
[2024-05-30 13:49:30] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 3 ms to minimize.
[2024-05-30 13:49:30] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 2 ms to minimize.
[2024-05-30 13:49:30] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 3 ms to minimize.
[2024-05-30 13:49:30] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 3 ms to minimize.
[2024-05-30 13:49:30] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2024-05-30 13:49:30] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-05-30 13:49:31] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 2 ms to minimize.
[2024-05-30 13:49:31] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 2 ms to minimize.
[2024-05-30 13:49:31] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 3 ms to minimize.
[2024-05-30 13:49:31] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 3 ms to minimize.
[2024-05-30 13:49:31] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
[2024-05-30 13:49:32] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 2 ms to minimize.
[2024-05-30 13:49:32] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
[2024-05-30 13:49:32] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 2 ms to minimize.
[2024-05-30 13:49:32] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2024-05-30 13:49:32] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-05-30 13:49:32] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 2 ms to minimize.
[2024-05-30 13:49:32] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-05-30 13:49:33] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/788 variables, 20/884 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-05-30 13:49:36] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 2 ms to minimize.
[2024-05-30 13:49:36] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
[2024-05-30 13:49:36] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2024-05-30 13:49:36] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-30 13:49:36] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-05-30 13:49:37] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2024-05-30 13:49:37] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 3 ms to minimize.
[2024-05-30 13:49:38] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 2 ms to minimize.
[2024-05-30 13:49:38] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-05-30 13:49:38] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-05-30 13:49:38] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-05-30 13:49:38] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 3 ms to minimize.
[2024-05-30 13:49:39] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 2 ms to minimize.
[2024-05-30 13:49:39] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-30 13:49:39] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 3 ms to minimize.
[2024-05-30 13:49:40] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 3 ms to minimize.
[2024-05-30 13:49:40] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 3 ms to minimize.
[2024-05-30 13:49:40] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-05-30 13:49:40] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-05-30 13:49:40] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/788 variables, 20/904 constraints. Problems are: Problem set: 0 solved, 393 unsolved
[2024-05-30 13:49:43] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
[2024-05-30 13:49:44] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 2 ms to minimize.
[2024-05-30 13:49:46] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-05-30 13:49:46] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-05-30 13:49:46] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 2 ms to minimize.
[2024-05-30 13:49:46] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2024-05-30 13:49:47] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 3 ms to minimize.
[2024-05-30 13:49:47] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 3 ms to minimize.
[2024-05-30 13:49:48] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 2 ms to minimize.
[2024-05-30 13:49:48] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 788/788 variables, and 914 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 394/394 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 86/86 constraints]
After SMT, in 60057ms problems are : Problem set: 0 solved, 393 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Starting structural reductions in LTL mode, iteration 1 : 394/423 places, 394/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60393 ms. Remains : 394/423 places, 394/423 transitions.
[2024-05-30 13:49:48] [INFO ] Flatten gal took : 13 ms
[2024-05-30 13:49:48] [INFO ] Flatten gal took : 13 ms
[2024-05-30 13:49:48] [INFO ] Input system was already deterministic with 394 transitions.
[2024-05-30 13:49:48] [INFO ] Flatten gal took : 13 ms
[2024-05-30 13:49:48] [INFO ] Flatten gal took : 12 ms
[2024-05-30 13:49:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality9590269771851910994.gal : 3 ms
[2024-05-30 13:49:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality11870225918375959627.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9590269771851910994.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11870225918375959627.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.43459e+35,14.6741,401344,2,8726,5,1.03293e+06,6,0,1972,3.03914e+06,0


Converting to forward existential form...Done !
original formula: AF(EX(((AG((p275==1)) + ((p184==0)&&(p187==1))) * ((AX((((p315==0)||(p149==1))&&((p320==0)||(p367==1)))) + EF((p473==0))) + (p83==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(((!(E(TRUE U !((p275==1)))) + ((p184==0)&&(p187==1))) * ((!(EX(!((((p315==0)||(p149==1))&&((p320...223
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t45, t49, t54, t58, t61, t65, t71, t75, t80, ...689
Detected timeout of ITS tools.
[2024-05-30 13:50:18] [INFO ] Flatten gal took : 13 ms
[2024-05-30 13:50:18] [INFO ] Applying decomposition
[2024-05-30 13:50:18] [INFO ] Flatten gal took : 13 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/graph1883994749718270724.txt' '-o' '/tmp/graph1883994749718270724.bin' '-w' '/tmp/graph1883994749718270724.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1883994749718270724.bin' '-l' '-1' '-v' '-w' '/tmp/graph1883994749718270724.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:50:18] [INFO ] Decomposing Gal with order
[2024-05-30 13:50:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:50:18] [INFO ] Removed a total of 97 redundant transitions.
[2024-05-30 13:50:18] [INFO ] Flatten gal took : 54 ms
[2024-05-30 13:50:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-30 13:50:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality13454117580573544162.gal : 7 ms
[2024-05-30 13:50:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality1177645015496575243.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/CTLCardinality13454117580573544162.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1177645015496575243.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,7.43459e+35,1.14563,42052,1175,27,71275,499,622,183689,43,1182,0


Converting to forward existential form...Done !
original formula: AF(EX(((AG((i11.u86.p275==1)) + ((i8.u55.p184==0)&&(i6.u58.p187==1))) * ((AX((((i15.u97.p315==0)||(i4.u47.p149==1))&&((i15.u97.p320==0)||...224
=> equivalent forward existential formula: [FwdG(Init,!(EX(((!(E(TRUE U !((i11.u86.p275==1)))) + ((i8.u55.p184==0)&&(i6.u58.p187==1))) * ((!(EX(!((((i15.u9...293
Reverse transition relation is NOT exact ! Due to transitions t355, t357, t359, t361, t364, t366, t368, t370, t372, i0.t341, i0.t337, i0.t328, i0.t323, i0....1164
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 423/423 places, 423/423 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 422 transition count 303
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 303 transition count 303
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 238 place count 303 transition count 236
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 372 place count 236 transition count 236
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 393 place count 215 transition count 215
Iterating global reduction 2 with 21 rules applied. Total rules applied 414 place count 215 transition count 215
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 414 place count 215 transition count 202
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 440 place count 202 transition count 202
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 594 place count 125 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 595 place count 125 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 597 place count 124 transition count 123
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 599 place count 122 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 600 place count 121 transition count 121
Applied a total of 600 rules in 40 ms. Remains 121 /423 variables (removed 302) and now considering 121/423 (removed 302) transitions.
// Phase 1: matrix 121 rows 121 cols
[2024-05-30 13:50:49] [INFO ] Computed 40 invariants in 2 ms
[2024-05-30 13:50:49] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-30 13:50:49] [INFO ] Invariant cache hit.
[2024-05-30 13:50:49] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2024-05-30 13:50:49] [INFO ] Redundant transitions in 2 ms returned []
Running 119 sub problems to find dead transitions.
[2024-05-30 13:50:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 121/242 variables, 121/161 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 0/242 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 161 constraints, problems are : Problem set: 0 solved, 119 unsolved in 2198 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 121/242 variables, 121/161 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 119/280 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 280 constraints, problems are : Problem set: 0 solved, 119 unsolved in 2295 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
After SMT, in 4508ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 4509ms
Starting structural reductions in SI_CTL mode, iteration 1 : 121/423 places, 121/423 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4698 ms. Remains : 121/423 places, 121/423 transitions.
[2024-05-30 13:50:53] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:50:53] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:50:53] [INFO ] Input system was already deterministic with 121 transitions.
[2024-05-30 13:50:53] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:50:53] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:50:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality17161759282045994877.gal : 1 ms
[2024-05-30 13:50:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality9103905675651394670.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/CTLCardinality17161759282045994877.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9103905675651394670.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,8.10513e+18,0.055103,5832,2,242,5,9715,6,0,607,13208,0


Converting to forward existential form...Done !
original formula: EG((p147==0))
=> equivalent forward existential formula: [FwdG(Init,(p147==0))] != FALSE
Hit Full ! (commute/partial/dont) 119/0/2
(forward)formula 0,1,0.11779,7680,1,0,9,22615,19,3,3062,14450,8
FORMULA ShieldRVt-PT-010B-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 423/423 places, 423/423 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 422 transition count 301
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 301 transition count 301
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 242 place count 301 transition count 235
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 374 place count 235 transition count 235
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 395 place count 214 transition count 214
Iterating global reduction 2 with 21 rules applied. Total rules applied 416 place count 214 transition count 214
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 416 place count 214 transition count 200
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 444 place count 200 transition count 200
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 596 place count 124 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 597 place count 124 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 599 place count 123 transition count 122
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 601 place count 121 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 602 place count 120 transition count 120
Applied a total of 602 rules in 29 ms. Remains 120 /423 variables (removed 303) and now considering 120/423 (removed 303) transitions.
// Phase 1: matrix 120 rows 120 cols
[2024-05-30 13:50:53] [INFO ] Computed 40 invariants in 2 ms
[2024-05-30 13:50:53] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-30 13:50:53] [INFO ] Invariant cache hit.
[2024-05-30 13:50:54] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2024-05-30 13:50:54] [INFO ] Redundant transitions in 3 ms returned []
Running 119 sub problems to find dead transitions.
[2024-05-30 13:50:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 120/240 variables, 120/160 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 0/240 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 160 constraints, problems are : Problem set: 0 solved, 119 unsolved in 1732 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 120/240 variables, 120/160 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 119/279 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 0/240 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 279 constraints, problems are : Problem set: 0 solved, 119 unsolved in 2538 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
After SMT, in 4281ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 4283ms
Starting structural reductions in SI_CTL mode, iteration 1 : 120/423 places, 120/423 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4459 ms. Remains : 120/423 places, 120/423 transitions.
[2024-05-30 13:50:58] [INFO ] Flatten gal took : 9 ms
[2024-05-30 13:50:58] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:50:58] [INFO ] Input system was already deterministic with 120 transitions.
[2024-05-30 13:50:58] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:50:58] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:50:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality17803466105497777502.gal : 1 ms
[2024-05-30 13:50:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality7463397946946255738.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/CTLCardinality17803466105497777502.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7463397946946255738.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.08068e+19,0.043183,5300,2,201,5,7601,6,0,603,9438,0


Converting to forward existential form...Done !
original formula: EF(AG(AF((p265==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!((p265==1))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 118/0/2
Detected timeout of ITS tools.
[2024-05-30 13:51:28] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:51:28] [INFO ] Applying decomposition
[2024-05-30 13:51: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/graph6772098616443421964.txt' '-o' '/tmp/graph6772098616443421964.bin' '-w' '/tmp/graph6772098616443421964.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6772098616443421964.bin' '-l' '-1' '-v' '-w' '/tmp/graph6772098616443421964.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:51:28] [INFO ] Decomposing Gal with order
[2024-05-30 13:51:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:51:28] [INFO ] Removed a total of 29 redundant transitions.
[2024-05-30 13:51:28] [INFO ] Flatten gal took : 12 ms
[2024-05-30 13:51:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 13:51:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality5845425830909263654.gal : 2 ms
[2024-05-30 13:51:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality9196754781832114200.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/CTLCardinality5845425830909263654.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9196754781832114200.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.08068e+19,0.034356,4744,27,8,2267,61,204,4011,33,127,0


Converting to forward existential form...Done !
original formula: EF(AG(AF((i5.u21.p265==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!((i5.u21.p265==1))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 423/423 places, 423/423 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 422 transition count 303
Reduce places removed 119 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 120 rules applied. Total rules applied 239 place count 303 transition count 302
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 240 place count 302 transition count 302
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 240 place count 302 transition count 237
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 370 place count 237 transition count 237
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 391 place count 216 transition count 216
Iterating global reduction 3 with 21 rules applied. Total rules applied 412 place count 216 transition count 216
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 412 place count 216 transition count 202
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 440 place count 202 transition count 202
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 590 place count 127 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 591 place count 127 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 593 place count 126 transition count 125
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 595 place count 124 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 596 place count 123 transition count 123
Applied a total of 596 rules in 34 ms. Remains 123 /423 variables (removed 300) and now considering 123/423 (removed 300) transitions.
// Phase 1: matrix 123 rows 123 cols
[2024-05-30 13:51:58] [INFO ] Computed 40 invariants in 1 ms
[2024-05-30 13:51:58] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-30 13:51:58] [INFO ] Invariant cache hit.
[2024-05-30 13:51:58] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-05-30 13:51:58] [INFO ] Redundant transitions in 1 ms returned []
Running 121 sub problems to find dead transitions.
[2024-05-30 13:51:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 123/246 variables, 123/163 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 0/246 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 163 constraints, problems are : Problem set: 0 solved, 121 unsolved in 2303 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 123/246 variables, 123/163 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 121/284 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/246 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 284 constraints, problems are : Problem set: 0 solved, 121 unsolved in 2298 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
After SMT, in 4611ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 4612ms
Starting structural reductions in SI_CTL mode, iteration 1 : 123/423 places, 123/423 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4791 ms. Remains : 123/423 places, 123/423 transitions.
[2024-05-30 13:52:03] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:52:03] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:52:03] [INFO ] Input system was already deterministic with 123 transitions.
RANDOM walk for 59 steps (0 resets) in 4 ms. (11 steps per ms) remains 0/1 properties
FORMULA ShieldRVt-PT-010B-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-30 13:52:03] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:52:03] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:52:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17074951236171686461.gal : 1 ms
[2024-05-30 13:52:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8908448841038296209.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17074951236171686461.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8908448841038296209.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 423/423 places, 423/423 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 115 place count 422 transition count 307
Reduce places removed 115 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 117 rules applied. Total rules applied 232 place count 307 transition count 305
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 234 place count 305 transition count 305
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 234 place count 305 transition count 239
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 366 place count 239 transition count 239
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 386 place count 219 transition count 219
Iterating global reduction 3 with 20 rules applied. Total rules applied 406 place count 219 transition count 219
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 406 place count 219 transition count 206
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 432 place count 206 transition count 206
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 582 place count 131 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 583 place count 131 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 585 place count 130 transition count 129
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 587 place count 128 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 588 place count 127 transition count 127
Applied a total of 588 rules in 25 ms. Remains 127 /423 variables (removed 296) and now considering 127/423 (removed 296) transitions.
// Phase 1: matrix 127 rows 127 cols
[2024-05-30 13:52:03] [INFO ] Computed 40 invariants in 0 ms
[2024-05-30 13:52:03] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-30 13:52:03] [INFO ] Invariant cache hit.
[2024-05-30 13:52:03] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2024-05-30 13:52:03] [INFO ] Redundant transitions in 1 ms returned []
Running 123 sub problems to find dead transitions.
[2024-05-30 13:52:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 3/127 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-30 13:52:04] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 127/254 variables, 127/168 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 0/254 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 168 constraints, problems are : Problem set: 0 solved, 123 unsolved in 2658 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 3/127 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 127/254 variables, 127/168 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 123/291 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 0/254 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 291 constraints, problems are : Problem set: 0 solved, 123 unsolved in 2544 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 1/1 constraints]
After SMT, in 5214ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 5215ms
Starting structural reductions in SI_CTL mode, iteration 1 : 127/423 places, 127/423 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5384 ms. Remains : 127/423 places, 127/423 transitions.
[2024-05-30 13:52:08] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:52:08] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:52:08] [INFO ] Input system was already deterministic with 127 transitions.
[2024-05-30 13:52:08] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:52:08] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:52:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality16224596124261998417.gal : 1 ms
[2024-05-30 13:52:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality16303239920335867137.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/CTLCardinality16224596124261998417.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16303239920335867137.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.44091e+19,0.070327,6392,2,325,5,11824,6,0,635,17691,0


Converting to forward existential form...Done !
original formula: E(((p68==0)||(p179==1)) U ((p355==1) * AG(A((p295==0) U (p333==1)))))
=> equivalent forward existential formula: [((FwdU(Init,((p68==0)||(p179==1))) * (p355==1)) * !(E(TRUE U !(!((E(!((p333==1)) U (!((p295==0)) * !((p333==1))...192
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t10, t11, t13, t15, t17, t18, t21, t24, t28, t30, t33, t35, t37, t41, t43, t45, t49, ...328
Detected timeout of ITS tools.
[2024-05-30 13:52:38] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:52:38] [INFO ] Applying decomposition
[2024-05-30 13:52:38] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11075241808265258618.txt' '-o' '/tmp/graph11075241808265258618.bin' '-w' '/tmp/graph11075241808265258618.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11075241808265258618.bin' '-l' '-1' '-v' '-w' '/tmp/graph11075241808265258618.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:52:38] [INFO ] Decomposing Gal with order
[2024-05-30 13:52:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:52:38] [INFO ] Removed a total of 29 redundant transitions.
[2024-05-30 13:52:38] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:52:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-30 13:52:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality10001371779230014010.gal : 1 ms
[2024-05-30 13:52:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality12066817718709917274.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/CTLCardinality10001371779230014010.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12066817718709917274.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.44091e+19,0.046399,5604,101,22,3731,112,269,8264,42,235,0


Converting to forward existential form...Done !
original formula: E(((i1.u5.p68==0)||(i3.u15.p179==1)) U ((i7.i1.u31.p355==1) * AG(A((i5.u24.p295==0) U (i7.i0.u29.p333==1)))))
=> equivalent forward existential formula: [((FwdU(Init,((i1.u5.p68==0)||(i3.u15.p179==1))) * (i7.i1.u31.p355==1)) * !(E(TRUE U !(!((E(!((i7.i0.u29.p333==1...252
Reverse transition relation is NOT exact ! Due to transitions t75, t117, i0.i0.u1.t13, i0.i0.u3.t17, i0.i1.u2.t15, i0.i1.u4.t18, i1.u5.t4, i1.u6.t21, i1.u7...558
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 423/423 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 392 transition count 392
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 392 transition count 392
Applied a total of 62 rules in 7 ms. Remains 392 /423 variables (removed 31) and now considering 392/423 (removed 31) transitions.
// Phase 1: matrix 392 rows 392 cols
[2024-05-30 13:53:08] [INFO ] Computed 41 invariants in 5 ms
[2024-05-30 13:53:09] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-30 13:53:09] [INFO ] Invariant cache hit.
[2024-05-30 13:53:09] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 391 sub problems to find dead transitions.
[2024-05-30 13:53:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/391 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (OVERLAPS) 1/392 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:53:13] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:53:13] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:53:14] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:53:14] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:53:14] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:53:14] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-30 13:53:15] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:53:15] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:53:15] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:53:15] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:53:15] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:53:16] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:53:16] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 13/54 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:53:18] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:53:18] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:53:18] [INFO ] Deduced a trap composed of 31 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:53:23] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (OVERLAPS) 392/784 variables, 392/450 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/784 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 8 (OVERLAPS) 0/784 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 391 unsolved
No progress, stopping.
After SMT solving in domain Real declared 784/784 variables, and 450 constraints, problems are : Problem set: 0 solved, 391 unsolved in 28049 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 392/392 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/391 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (OVERLAPS) 1/392 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 392/784 variables, 392/450 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/784 variables, 391/841 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:53:42] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
[2024-05-30 13:53:42] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 2 ms to minimize.
[2024-05-30 13:53:43] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 2 ms to minimize.
[2024-05-30 13:53:43] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 3 ms to minimize.
[2024-05-30 13:53:43] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-30 13:53:43] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-05-30 13:53:43] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-05-30 13:53:44] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 2 ms to minimize.
[2024-05-30 13:53:44] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 3 ms to minimize.
[2024-05-30 13:53:44] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 3 ms to minimize.
[2024-05-30 13:53:44] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-05-30 13:53:44] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-05-30 13:53:44] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 2 ms to minimize.
[2024-05-30 13:53:44] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
[2024-05-30 13:53:45] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 3 ms to minimize.
[2024-05-30 13:53:45] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-05-30 13:53:45] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-05-30 13:53:46] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 3 ms to minimize.
[2024-05-30 13:53:46] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 2 ms to minimize.
[2024-05-30 13:53:46] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/784 variables, 20/861 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:53:48] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-05-30 13:53:48] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 3 ms to minimize.
[2024-05-30 13:53:48] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 3 ms to minimize.
[2024-05-30 13:53:49] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 2 ms to minimize.
[2024-05-30 13:53:49] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2024-05-30 13:53:49] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
[2024-05-30 13:53:50] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 2 ms to minimize.
[2024-05-30 13:53:50] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 3 ms to minimize.
[2024-05-30 13:53:50] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 9 ms to minimize.
[2024-05-30 13:53:50] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 2 ms to minimize.
[2024-05-30 13:53:51] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-30 13:53:51] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-05-30 13:53:51] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 3 ms to minimize.
[2024-05-30 13:53:51] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2024-05-30 13:53:51] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-30 13:53:52] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
[2024-05-30 13:53:52] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-05-30 13:53:52] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
[2024-05-30 13:53:52] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-05-30 13:53:52] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/784 variables, 20/881 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:53:55] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 3 ms to minimize.
[2024-05-30 13:53:55] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 2 ms to minimize.
[2024-05-30 13:53:55] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
[2024-05-30 13:53:55] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-05-30 13:53:56] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 2 ms to minimize.
[2024-05-30 13:53:56] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2024-05-30 13:53:56] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-05-30 13:53:56] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 3 ms to minimize.
[2024-05-30 13:53:57] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 2 ms to minimize.
[2024-05-30 13:53:57] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-30 13:53:57] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-05-30 13:53:57] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 1 ms to minimize.
[2024-05-30 13:53:57] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-30 13:53:57] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2024-05-30 13:53:59] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-05-30 13:53:59] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 2 ms to minimize.
[2024-05-30 13:53:59] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-05-30 13:53:59] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-05-30 13:53:59] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
[2024-05-30 13:54:00] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/784 variables, 20/901 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:54:03] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 2 ms to minimize.
[2024-05-30 13:54:05] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
[2024-05-30 13:54:05] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 2 ms to minimize.
[2024-05-30 13:54:05] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
[2024-05-30 13:54:07] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 784/784 variables, and 906 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 392/392 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 82/82 constraints]
After SMT, in 58099ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 58103ms
Starting structural reductions in LTL mode, iteration 1 : 392/423 places, 392/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58402 ms. Remains : 392/423 places, 392/423 transitions.
[2024-05-30 13:54:07] [INFO ] Flatten gal took : 14 ms
[2024-05-30 13:54:07] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:54:07] [INFO ] Input system was already deterministic with 392 transitions.
[2024-05-30 13:54:07] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:54:07] [INFO ] Flatten gal took : 9 ms
[2024-05-30 13:54:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality18349620695585310783.gal : 2 ms
[2024-05-30 13:54:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality15148653118702480402.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/CTLCardinality18349620695585310783.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15148653118702480402.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.98758e+35,13.1777,372532,2,8299,5,963544,6,0,1962,2.82774e+06,0


Converting to forward existential form...Done !
original formula: EG((AG((p145!=1)) + AX(((p485==0)||(p82==1)))))
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !((p145!=1)))) + !(EX(!(((p485==0)||(p82==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t45, t49, t54, t58, t61, t65, t71, t75, t80, ...683
Detected timeout of ITS tools.
[2024-05-30 13:54:37] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:54:37] [INFO ] Applying decomposition
[2024-05-30 13:54:37] [INFO ] Flatten gal took : 7 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/graph2261169370370854134.txt' '-o' '/tmp/graph2261169370370854134.bin' '-w' '/tmp/graph2261169370370854134.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2261169370370854134.bin' '-l' '-1' '-v' '-w' '/tmp/graph2261169370370854134.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:54:37] [INFO ] Decomposing Gal with order
[2024-05-30 13:54:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:54:37] [INFO ] Removed a total of 101 redundant transitions.
[2024-05-30 13:54:37] [INFO ] Flatten gal took : 17 ms
[2024-05-30 13:54:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 13:54:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality14197534293239908210.gal : 4 ms
[2024-05-30 13:54:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality5682584747597625058.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/CTLCardinality14197534293239908210.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5682584747597625058.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.98758e+35,1.22905,44268,1247,38,74291,691,610,207917,49,1848,0


Converting to forward existential form...Done !
original formula: EG((AG((i4.u45.p145!=1)) + AX(((i18.u148.p485==0)||(i3.u26.p82==1)))))
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !((i4.u45.p145!=1)))) + !(EX(!(((i18.u148.p485==0)||(i3.u26.p82==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t353, t355, t357, t359, t362, t364, t366, t368, t370, i0.t342, i0.u8.t346, i1.t339, i1.t335, ...1141
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 423/423 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 392 transition count 392
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 392 transition count 392
Applied a total of 62 rules in 7 ms. Remains 392 /423 variables (removed 31) and now considering 392/423 (removed 31) transitions.
// Phase 1: matrix 392 rows 392 cols
[2024-05-30 13:55:07] [INFO ] Computed 41 invariants in 9 ms
[2024-05-30 13:55:07] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-30 13:55:07] [INFO ] Invariant cache hit.
[2024-05-30 13:55:07] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 391 sub problems to find dead transitions.
[2024-05-30 13:55:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/391 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (OVERLAPS) 1/392 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:55:12] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:55:12] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:55:12] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:55:12] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:55:13] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:55:13] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:55:13] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:55:14] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:55:14] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:55:14] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:55:14] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:55:17] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (OVERLAPS) 392/784 variables, 392/445 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/784 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (OVERLAPS) 0/784 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 391 unsolved
No progress, stopping.
After SMT solving in domain Real declared 784/784 variables, and 445 constraints, problems are : Problem set: 0 solved, 391 unsolved in 25547 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 392/392 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/391 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (OVERLAPS) 1/392 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 12/53 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 392/784 variables, 392/445 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/784 variables, 391/836 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:55:39] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 3 ms to minimize.
[2024-05-30 13:55:39] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
[2024-05-30 13:55:39] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 2 ms to minimize.
[2024-05-30 13:55:39] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 3 ms to minimize.
[2024-05-30 13:55:39] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2024-05-30 13:55:39] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 2 ms to minimize.
[2024-05-30 13:55:40] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 2 ms to minimize.
[2024-05-30 13:55:40] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-05-30 13:55:40] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2024-05-30 13:55:40] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-30 13:55:40] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-05-30 13:55:40] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 2 ms to minimize.
[2024-05-30 13:55:40] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-05-30 13:55:41] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-05-30 13:55:41] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2024-05-30 13:55:41] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:55:41] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
[2024-05-30 13:55:41] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2024-05-30 13:55:41] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-05-30 13:55:41] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/784 variables, 20/856 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:55:43] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-30 13:55:43] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-05-30 13:55:44] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-05-30 13:55:44] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2024-05-30 13:55:44] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 3 ms to minimize.
[2024-05-30 13:55:44] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2024-05-30 13:55:45] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 3 ms to minimize.
[2024-05-30 13:55:45] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 2 ms to minimize.
[2024-05-30 13:55:45] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 2 ms to minimize.
[2024-05-30 13:55:45] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-05-30 13:55:46] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-05-30 13:55:46] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2024-05-30 13:55:46] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 3 ms to minimize.
[2024-05-30 13:55:46] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 2 ms to minimize.
[2024-05-30 13:55:47] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-05-30 13:55:47] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-05-30 13:55:47] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2024-05-30 13:55:47] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 2 ms to minimize.
[2024-05-30 13:55:47] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-05-30 13:55:48] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/784 variables, 20/876 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:55:51] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 3 ms to minimize.
[2024-05-30 13:55:51] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2024-05-30 13:55:51] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-05-30 13:55:51] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-05-30 13:55:51] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-05-30 13:55:52] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-05-30 13:55:52] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 2 ms to minimize.
[2024-05-30 13:55:52] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 2 ms to minimize.
[2024-05-30 13:55:53] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 2 ms to minimize.
[2024-05-30 13:55:53] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-05-30 13:55:53] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-05-30 13:55:53] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-05-30 13:55:54] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 2 ms to minimize.
[2024-05-30 13:55:54] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 2 ms to minimize.
[2024-05-30 13:55:54] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 2 ms to minimize.
[2024-05-30 13:55:54] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 ms to minimize.
[2024-05-30 13:55:55] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 2 ms to minimize.
[2024-05-30 13:55:55] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 3 ms to minimize.
[2024-05-30 13:55:55] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 3 ms to minimize.
[2024-05-30 13:55:55] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/784 variables, 20/896 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:55:58] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 2 ms to minimize.
[2024-05-30 13:55:59] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 3 ms to minimize.
[2024-05-30 13:55:59] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-30 13:55:59] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 3 ms to minimize.
[2024-05-30 13:56:00] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-05-30 13:56:02] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 3 ms to minimize.
[2024-05-30 13:56:02] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 2 ms to minimize.
[2024-05-30 13:56:02] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-05-30 13:56:02] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 2 ms to minimize.
[2024-05-30 13:56:02] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-05-30 13:56:03] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2024-05-30 13:56:03] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 2 ms to minimize.
[2024-05-30 13:56:03] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-05-30 13:56:03] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 2 ms to minimize.
SMT process timed out in 55639ms, After SMT, problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 55643ms
Starting structural reductions in LTL mode, iteration 1 : 392/423 places, 392/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55957 ms. Remains : 392/423 places, 392/423 transitions.
[2024-05-30 13:56:03] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:56:03] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:56:03] [INFO ] Input system was already deterministic with 392 transitions.
[2024-05-30 13:56:03] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:56:03] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:56:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality17355912643074670373.gal : 2 ms
[2024-05-30 13:56:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality15467175410194395894.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/CTLCardinality17355912643074670373.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15467175410194395894.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,6.08996e+35,12.7331,362388,2,7663,5,922754,6,0,1962,2.77323e+06,0


Converting to forward existential form...Done !
original formula: AG((EX((p125==0)) + (p9==0)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((p9==0))) * !(EX((p125==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t45, t49, t54, t58, t61, t65, t71, t75, t80, ...665
(forward)formula 0,1,22.5755,378156,1,0,758,2.0821e+06,802,397,10631,2.77323e+06,792
FORMULA ShieldRVt-PT-010B-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 423/423 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 396 transition count 396
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 396 transition count 396
Applied a total of 54 rules in 8 ms. Remains 396 /423 variables (removed 27) and now considering 396/423 (removed 27) transitions.
// Phase 1: matrix 396 rows 396 cols
[2024-05-30 13:56:26] [INFO ] Computed 41 invariants in 1 ms
[2024-05-30 13:56:26] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-30 13:56:26] [INFO ] Invariant cache hit.
[2024-05-30 13:56:26] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 395 sub problems to find dead transitions.
[2024-05-30 13:56:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/395 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (OVERLAPS) 1/396 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-05-30 13:56:30] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:56:31] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:56:31] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:56:31] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:56:31] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:56:31] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:56:32] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:56:32] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:56:32] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:56:33] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-05-30 13:56:33] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:56:33] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
[2024-05-30 13:56:33] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:56:33] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-05-30 13:56:34] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:56:34] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (OVERLAPS) 396/792 variables, 396/453 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-05-30 13:56:44] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/792 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/792 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 792/792 variables, and 454 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 396/396 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/395 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (OVERLAPS) 1/396 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-05-30 13:56:59] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (OVERLAPS) 396/792 variables, 396/455 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/792 variables, 395/850 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-05-30 13:57:04] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 2 ms to minimize.
[2024-05-30 13:57:05] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 2 ms to minimize.
[2024-05-30 13:57:05] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-05-30 13:57:05] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 2 ms to minimize.
[2024-05-30 13:57:05] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-30 13:57:06] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 3 ms to minimize.
[2024-05-30 13:57:06] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
[2024-05-30 13:57:06] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 3 ms to minimize.
[2024-05-30 13:57:06] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2024-05-30 13:57:06] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:57:06] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 3 ms to minimize.
[2024-05-30 13:57:07] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-30 13:57:07] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-30 13:57:07] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-05-30 13:57:07] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-05-30 13:57:08] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2024-05-30 13:57:08] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-30 13:57:08] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-05-30 13:57:08] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 2 ms to minimize.
[2024-05-30 13:57:08] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/792 variables, 20/870 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-05-30 13:57:10] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 2 ms to minimize.
[2024-05-30 13:57:11] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-05-30 13:57:11] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 2 ms to minimize.
[2024-05-30 13:57:12] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 2 ms to minimize.
[2024-05-30 13:57:12] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-05-30 13:57:12] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:57:12] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 2 ms to minimize.
[2024-05-30 13:57:13] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2024-05-30 13:57:13] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 2 ms to minimize.
[2024-05-30 13:57:13] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 2 ms to minimize.
[2024-05-30 13:57:13] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 2 ms to minimize.
[2024-05-30 13:57:13] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 2 ms to minimize.
[2024-05-30 13:57:14] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2024-05-30 13:57:14] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-05-30 13:57:14] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2024-05-30 13:57:14] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2024-05-30 13:57:14] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 2 ms to minimize.
[2024-05-30 13:57:14] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-05-30 13:57:14] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 2 ms to minimize.
[2024-05-30 13:57:15] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/792 variables, 20/890 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-05-30 13:57:17] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 2 ms to minimize.
[2024-05-30 13:57:19] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
[2024-05-30 13:57:20] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2024-05-30 13:57:20] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-30 13:57:20] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
[2024-05-30 13:57:20] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2024-05-30 13:57:20] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 2 ms to minimize.
[2024-05-30 13:57:21] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 3 ms to minimize.
[2024-05-30 13:57:21] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-05-30 13:57:22] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2024-05-30 13:57:22] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2024-05-30 13:57:22] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-05-30 13:57:22] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 2 ms to minimize.
[2024-05-30 13:57:22] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 1 ms to minimize.
[2024-05-30 13:57:22] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-05-30 13:57:22] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 2 ms to minimize.
[2024-05-30 13:57:22] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
[2024-05-30 13:57:23] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-05-30 13:57:23] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-05-30 13:57:23] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/792 variables, 20/910 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-05-30 13:57:26] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 3 ms to minimize.
SMT process timed out in 60063ms, After SMT, problems are : Problem set: 0 solved, 395 unsolved
Search for dead transitions found 0 dead transitions in 60066ms
Starting structural reductions in LTL mode, iteration 1 : 396/423 places, 396/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60368 ms. Remains : 396/423 places, 396/423 transitions.
[2024-05-30 13:57:26] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:57:26] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:57:26] [INFO ] Input system was already deterministic with 396 transitions.
[2024-05-30 13:57:26] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:57:26] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:57:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality4619492182601936780.gal : 2 ms
[2024-05-30 13:57:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality15879951923987126506.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/CTLCardinality4619492182601936780.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15879951923987126506.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,8.72247e+35,22.2618,596232,2,8942,5,1.29841e+06,6,0,1982,4.88109e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-30 13:57:56] [INFO ] Flatten gal took : 14 ms
[2024-05-30 13:57:56] [INFO ] Applying decomposition
[2024-05-30 13:57:56] [INFO ] Flatten gal took : 7 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/graph6527393552444996422.txt' '-o' '/tmp/graph6527393552444996422.bin' '-w' '/tmp/graph6527393552444996422.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6527393552444996422.bin' '-l' '-1' '-v' '-w' '/tmp/graph6527393552444996422.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:57:56] [INFO ] Decomposing Gal with order
[2024-05-30 13:57:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:57:56] [INFO ] Removed a total of 98 redundant transitions.
[2024-05-30 13:57:56] [INFO ] Flatten gal took : 16 ms
[2024-05-30 13:57:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 13:57:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality9271793254582709569.gal : 3 ms
[2024-05-30 13:57:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality2575285294595413417.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/CTLCardinality9271793254582709569.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2575285294595413417.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.72247e+35,1.21839,41428,1560,38,66141,550,666,186696,49,1283,0


Converting to forward existential form...Done !
original formula: (EF(AG((i17.u138.p436==0))) * AF(((((i11.u90.p287==0)&&(i0.u10.p27==1)) * ((((i18.u131.p409==0)&&(i13.i1.i1.u109.p346==1)) + AG((i2.u32.p...283
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(E(TRUE U !((i17.u138.p436==0)))))))] = FALSE * [FwdG(Init,!(((((i11.u90.p287==0)&&(i0.u10...416
Reverse transition relation is NOT exact ! Due to transitions t357, t361, t363, t368, t370, t372, t374, i0.t351, i0.t342, i0.t338, i0.t324, i0.u9.t350, i0....1226
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 423/423 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 397 transition count 397
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 397 transition count 397
Applied a total of 52 rules in 8 ms. Remains 397 /423 variables (removed 26) and now considering 397/423 (removed 26) transitions.
// Phase 1: matrix 397 rows 397 cols
[2024-05-30 13:58:26] [INFO ] Computed 41 invariants in 3 ms
[2024-05-30 13:58:26] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-30 13:58:26] [INFO ] Invariant cache hit.
[2024-05-30 13:58:27] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-30 13:58:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (OVERLAPS) 1/397 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-30 13:58:31] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:58:31] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-30 13:58:32] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:58:32] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:58:32] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-30 13:58:32] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:58:32] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:58:32] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:58:33] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:58:33] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:58:33] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-05-30 13:58:33] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:58:33] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:58:34] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:58:34] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-30 13:58:36] [INFO ] Deduced a trap composed of 28 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (OVERLAPS) 397/794 variables, 397/454 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (OVERLAPS) 0/794 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 396 unsolved
No progress, stopping.
After SMT solving in domain Real declared 794/794 variables, and 454 constraints, problems are : Problem set: 0 solved, 396 unsolved in 26593 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 397/397 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (OVERLAPS) 1/397 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (OVERLAPS) 397/794 variables, 397/454 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 396/850 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-30 13:58:59] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 3 ms to minimize.
[2024-05-30 13:58:59] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 3 ms to minimize.
[2024-05-30 13:58:59] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-05-30 13:59:00] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-05-30 13:59:00] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-05-30 13:59:00] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 2 ms to minimize.
[2024-05-30 13:59:00] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2024-05-30 13:59:00] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-05-30 13:59:00] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 3 ms to minimize.
[2024-05-30 13:59:00] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
[2024-05-30 13:59:01] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
[2024-05-30 13:59:01] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-05-30 13:59:01] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 2 ms to minimize.
[2024-05-30 13:59:01] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
[2024-05-30 13:59:02] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2024-05-30 13:59:02] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
[2024-05-30 13:59:02] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 2 ms to minimize.
[2024-05-30 13:59:02] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-05-30 13:59:02] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-30 13:59:02] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 20/870 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-30 13:59:04] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 3 ms to minimize.
[2024-05-30 13:59:05] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2024-05-30 13:59:05] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-05-30 13:59:05] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 2 ms to minimize.
[2024-05-30 13:59:06] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2024-05-30 13:59:06] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 2 ms to minimize.
[2024-05-30 13:59:06] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-05-30 13:59:07] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 2 ms to minimize.
[2024-05-30 13:59:07] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
[2024-05-30 13:59:07] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-05-30 13:59:07] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-05-30 13:59:07] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2024-05-30 13:59:07] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 3 ms to minimize.
[2024-05-30 13:59:07] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-05-30 13:59:08] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2024-05-30 13:59:08] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
[2024-05-30 13:59:08] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-05-30 13:59:08] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2024-05-30 13:59:08] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-05-30 13:59:09] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/794 variables, 20/890 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-30 13:59:11] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-05-30 13:59:11] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-05-30 13:59:13] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:59:13] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-05-30 13:59:13] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 2 ms to minimize.
[2024-05-30 13:59:13] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 2 ms to minimize.
[2024-05-30 13:59:14] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-05-30 13:59:14] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-05-30 13:59:14] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-30 13:59:14] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 2 ms to minimize.
[2024-05-30 13:59:14] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 3 ms to minimize.
[2024-05-30 13:59:15] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 2 ms to minimize.
[2024-05-30 13:59:15] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 2 ms to minimize.
[2024-05-30 13:59:15] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 2 ms to minimize.
[2024-05-30 13:59:15] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 2 ms to minimize.
[2024-05-30 13:59:15] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
[2024-05-30 13:59:15] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 2 ms to minimize.
[2024-05-30 13:59:15] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 2 ms to minimize.
[2024-05-30 13:59:15] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 2 ms to minimize.
[2024-05-30 13:59:15] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/794 variables, 20/910 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-30 13:59:19] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 2 ms to minimize.
[2024-05-30 13:59:19] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 2 ms to minimize.
[2024-05-30 13:59:20] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-05-30 13:59:21] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-05-30 13:59:21] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
[2024-05-30 13:59:22] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-05-30 13:59:22] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 2 ms to minimize.
[2024-05-30 13:59:22] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 2 ms to minimize.
[2024-05-30 13:59:23] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-30 13:59:23] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
[2024-05-30 13:59:23] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 2 ms to minimize.
[2024-05-30 13:59:23] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
SMT process timed out in 56655ms, After SMT, problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 56658ms
Starting structural reductions in LTL mode, iteration 1 : 397/423 places, 397/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56973 ms. Remains : 397/423 places, 397/423 transitions.
[2024-05-30 13:59:23] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:59:23] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:59:23] [INFO ] Input system was already deterministic with 397 transitions.
[2024-05-30 13:59:23] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:59:23] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:59:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality6584075098882553115.gal : 1 ms
[2024-05-30 13:59:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality8006501836760656735.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/CTLCardinality6584075098882553115.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8006501836760656735.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.89112e+35,24.3863,663908,2,9722,5,1.49441e+06,6,0,1987,5.41049e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-30 13:59:53] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:59:53] [INFO ] Applying decomposition
[2024-05-30 13:59:53] [INFO ] Flatten gal took : 7 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/graph16240215596295588760.txt' '-o' '/tmp/graph16240215596295588760.bin' '-w' '/tmp/graph16240215596295588760.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16240215596295588760.bin' '-l' '-1' '-v' '-w' '/tmp/graph16240215596295588760.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:59:53] [INFO ] Decomposing Gal with order
[2024-05-30 13:59:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:59:53] [INFO ] Removed a total of 95 redundant transitions.
[2024-05-30 13:59:53] [INFO ] Flatten gal took : 16 ms
[2024-05-30 13:59:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 13:59:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality13418679480350328572.gal : 3 ms
[2024-05-30 13:59:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality17571710349809798635.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/CTLCardinality13418679480350328572.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17571710349809798635.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,9.89112e+35,2.05516,65112,1518,38,102034,641,674,318154,49,1801,0


Converting to forward existential form...Done !
original formula: EX((!(A((i21.u153.p487==0) U !(AX(((i15.u99.p311==0)||(i6.u46.p145==1)))))) * ((AG(((i19.u132.p423==0)||(i18.u131.p409==1))) + (i3.u23.p7...347
=> equivalent forward existential formula: (([((EY(Init) * !(!((E(!(!(!(EX(!(((i15.u99.p311==0)||(i6.u46.p145==1))))))) U (!((i21.u153.p487==0)) * !(!(!(EX...1605
Reverse transition relation is NOT exact ! Due to transitions t358, t360, t362, t364, t367, t371, t375, i0.t347, i0.t344, i0.t340, i0.t326, i0.u8.t351, i0....1223
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 423/423 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 392 transition count 392
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 392 transition count 392
Applied a total of 62 rules in 13 ms. Remains 392 /423 variables (removed 31) and now considering 392/423 (removed 31) transitions.
// Phase 1: matrix 392 rows 392 cols
[2024-05-30 14:00:24] [INFO ] Computed 41 invariants in 2 ms
[2024-05-30 14:00:24] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-30 14:00:24] [INFO ] Invariant cache hit.
[2024-05-30 14:00:24] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 391 sub problems to find dead transitions.
[2024-05-30 14:00:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/391 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (OVERLAPS) 1/392 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 14:00:28] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-30 14:00:28] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-30 14:00:29] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-30 14:00:29] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-05-30 14:00:29] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-30 14:00:29] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-30 14:00:30] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-30 14:00:30] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:00:30] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2024-05-30 14:00:30] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-30 14:00:31] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 392/784 variables, 392/444 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/784 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (OVERLAPS) 0/784 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 391 unsolved
No progress, stopping.
After SMT solving in domain Real declared 784/784 variables, and 444 constraints, problems are : Problem set: 0 solved, 391 unsolved in 22914 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 392/392 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/391 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (OVERLAPS) 1/392 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 14:00:51] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 14:00:54] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:00:54] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (OVERLAPS) 392/784 variables, 392/447 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/784 variables, 391/838 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 14:00:57] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2024-05-30 14:00:57] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 3 ms to minimize.
[2024-05-30 14:00:58] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 2 ms to minimize.
[2024-05-30 14:00:58] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-30 14:00:58] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 3 ms to minimize.
[2024-05-30 14:00:58] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 2 ms to minimize.
[2024-05-30 14:00:58] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 3 ms to minimize.
[2024-05-30 14:00:59] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-05-30 14:00:59] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 2 ms to minimize.
[2024-05-30 14:00:59] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 3 ms to minimize.
[2024-05-30 14:00:59] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 3 ms to minimize.
[2024-05-30 14:00:59] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
[2024-05-30 14:00:59] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 3 ms to minimize.
[2024-05-30 14:01:00] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 2 ms to minimize.
[2024-05-30 14:01:00] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-05-30 14:01:00] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 3 ms to minimize.
[2024-05-30 14:01:00] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-30 14:01:00] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-05-30 14:01:01] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-05-30 14:01:01] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/784 variables, 20/858 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 14:01:02] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-05-30 14:01:03] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 2 ms to minimize.
[2024-05-30 14:01:03] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 2 ms to minimize.
[2024-05-30 14:01:03] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 2 ms to minimize.
[2024-05-30 14:01:03] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 3 ms to minimize.
[2024-05-30 14:01:04] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-05-30 14:01:04] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 3 ms to minimize.
[2024-05-30 14:01:04] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 2 ms to minimize.
[2024-05-30 14:01:04] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-05-30 14:01:04] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
[2024-05-30 14:01:05] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
[2024-05-30 14:01:05] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 3 ms to minimize.
[2024-05-30 14:01:05] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-05-30 14:01:05] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-05-30 14:01:05] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 3 ms to minimize.
[2024-05-30 14:01:05] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 2 ms to minimize.
[2024-05-30 14:01:06] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 2 ms to minimize.
[2024-05-30 14:01:06] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
[2024-05-30 14:01:06] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-05-30 14:01:06] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/784 variables, 20/878 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 14:01:09] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-05-30 14:01:09] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 3 ms to minimize.
[2024-05-30 14:01:10] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 3 ms to minimize.
[2024-05-30 14:01:10] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 2 ms to minimize.
[2024-05-30 14:01:11] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-05-30 14:01:11] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2024-05-30 14:01:11] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-05-30 14:01:11] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 3 ms to minimize.
[2024-05-30 14:01:11] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 3 ms to minimize.
[2024-05-30 14:01:12] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-05-30 14:01:12] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2024-05-30 14:01:12] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 3 ms to minimize.
[2024-05-30 14:01:12] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 2 ms to minimize.
[2024-05-30 14:01:12] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-05-30 14:01:13] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 2 ms to minimize.
[2024-05-30 14:01:13] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 2 ms to minimize.
[2024-05-30 14:01:13] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2024-05-30 14:01:13] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
[2024-05-30 14:01:13] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2024-05-30 14:01:13] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/784 variables, 20/898 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 14:01:17] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 784/784 variables, and 899 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 392/392 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 75/75 constraints]
After SMT, in 52963ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 52966ms
Starting structural reductions in LTL mode, iteration 1 : 392/423 places, 392/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53263 ms. Remains : 392/423 places, 392/423 transitions.
[2024-05-30 14:01:17] [INFO ] Flatten gal took : 13 ms
[2024-05-30 14:01:17] [INFO ] Flatten gal took : 10 ms
[2024-05-30 14:01:17] [INFO ] Input system was already deterministic with 392 transitions.
[2024-05-30 14:01:17] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:01:17] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:01:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality12024300462430618102.gal : 1 ms
[2024-05-30 14:01:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality16822942873033193583.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/CTLCardinality12024300462430618102.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16822942873033193583.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,6.17957e+35,13.1717,365348,2,7889,5,927334,6,0,1962,2.78946e+06,0


Converting to forward existential form...Done !
original formula: AX(AF(AG(EX(((p201==0)&&(p92==1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(!(E(TRUE U !(EX(((p201==0)&&(p92==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t45, t49, t54, t58, t61, t65, t71, t75, t80, ...677
Detected timeout of ITS tools.
[2024-05-30 14:01:47] [INFO ] Flatten gal took : 12 ms
[2024-05-30 14:01:47] [INFO ] Applying decomposition
[2024-05-30 14:01:47] [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/graph12095036579070755249.txt' '-o' '/tmp/graph12095036579070755249.bin' '-w' '/tmp/graph12095036579070755249.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12095036579070755249.bin' '-l' '-1' '-v' '-w' '/tmp/graph12095036579070755249.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:01:47] [INFO ] Decomposing Gal with order
[2024-05-30 14:01:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:01:47] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-30 14:01:47] [INFO ] Flatten gal took : 14 ms
[2024-05-30 14:01:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 14:01:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality13660644771914191402.gal : 3 ms
[2024-05-30 14:01:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality10979669387236057115.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/CTLCardinality13660644771914191402.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10979669387236057115.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,6.17957e+35,0.635799,24924,606,22,36571,474,550,96007,38,1277,0


Converting to forward existential form...Done !
original formula: AX(AF(AG(EX(((i7.i3.u66.p201==0)&&(i4.u31.p92==1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(!(E(TRUE U !(EX(((i7.i3.u66.p201==0)&&(i4.u31.p92==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t353, t355, t357, t359, t362, t364, t366, t368, t370, i0.i2.t124, i0.i2.t128, i0.i3.t110, i0....1273
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 423/423 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 393 transition count 393
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 393 transition count 393
Applied a total of 60 rules in 8 ms. Remains 393 /423 variables (removed 30) and now considering 393/423 (removed 30) transitions.
// Phase 1: matrix 393 rows 393 cols
[2024-05-30 14:02:17] [INFO ] Computed 41 invariants in 3 ms
[2024-05-30 14:02:17] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-30 14:02:17] [INFO ] Invariant cache hit.
[2024-05-30 14:02:17] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Running 392 sub problems to find dead transitions.
[2024-05-30 14:02:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (OVERLAPS) 1/393 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-30 14:02:22] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-30 14:02:22] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 14:02:22] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-05-30 14:02:22] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-30 14:02:23] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-30 14:02:23] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-30 14:02:23] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-30 14:02:23] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-05-30 14:02:24] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-30 14:02:24] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-30 14:02:24] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-05-30 14:02:24] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 0 ms to minimize.
[2024-05-30 14:02:24] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
[2024-05-30 14:02:24] [INFO ] Deduced a trap composed of 37 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (OVERLAPS) 393/786 variables, 393/448 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/786 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-30 14:02:36] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/786 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/786 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 786/786 variables, and 449 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 392 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (OVERLAPS) 1/393 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (OVERLAPS) 393/786 variables, 393/449 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/786 variables, 392/841 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-30 14:02:53] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 2 ms to minimize.
[2024-05-30 14:02:53] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2024-05-30 14:02:53] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 2 ms to minimize.
[2024-05-30 14:02:53] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 3 ms to minimize.
[2024-05-30 14:02:54] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-05-30 14:02:54] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-30 14:02:54] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
[2024-05-30 14:02:54] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 3 ms to minimize.
[2024-05-30 14:02:54] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 3 ms to minimize.
[2024-05-30 14:02:54] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
[2024-05-30 14:02:55] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 2 ms to minimize.
[2024-05-30 14:02:55] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-30 14:02:55] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 2 ms to minimize.
[2024-05-30 14:02:55] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
[2024-05-30 14:02:55] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
[2024-05-30 14:02:55] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-30 14:02:56] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-05-30 14:02:56] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 3 ms to minimize.
[2024-05-30 14:02:56] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 3 ms to minimize.
[2024-05-30 14:02:56] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/786 variables, 20/861 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-30 14:02:58] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-05-30 14:02:59] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 3 ms to minimize.
[2024-05-30 14:02:59] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 3 ms to minimize.
[2024-05-30 14:02:59] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 2 ms to minimize.
[2024-05-30 14:03:00] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 3 ms to minimize.
[2024-05-30 14:03:00] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 2 ms to minimize.
[2024-05-30 14:03:00] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 3 ms to minimize.
[2024-05-30 14:03:00] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 3 ms to minimize.
[2024-05-30 14:03:01] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 2 ms to minimize.
[2024-05-30 14:03:01] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 2 ms to minimize.
[2024-05-30 14:03:01] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2024-05-30 14:03:01] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-05-30 14:03:01] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-30 14:03:02] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-05-30 14:03:02] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-05-30 14:03:02] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 2 ms to minimize.
[2024-05-30 14:03:02] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
[2024-05-30 14:03:02] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2024-05-30 14:03:02] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2024-05-30 14:03:03] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/786 variables, 20/881 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-30 14:03:05] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 3 ms to minimize.
[2024-05-30 14:03:06] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
[2024-05-30 14:03:06] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-05-30 14:03:07] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 2 ms to minimize.
[2024-05-30 14:03:07] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-30 14:03:08] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 3 ms to minimize.
[2024-05-30 14:03:08] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 3 ms to minimize.
[2024-05-30 14:03:08] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-05-30 14:03:09] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-05-30 14:03:10] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 2 ms to minimize.
[2024-05-30 14:03:10] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2024-05-30 14:03:10] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
[2024-05-30 14:03:10] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 3 ms to minimize.
[2024-05-30 14:03:10] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 2 ms to minimize.
[2024-05-30 14:03:10] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 2 ms to minimize.
[2024-05-30 14:03:10] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 2 ms to minimize.
[2024-05-30 14:03:10] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 2 ms to minimize.
[2024-05-30 14:03:10] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 3 ms to minimize.
[2024-05-30 14:03:11] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 2 ms to minimize.
[2024-05-30 14:03:11] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/786 variables, 20/901 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-30 14:03:14] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-30 14:03:14] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-05-30 14:03:14] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 3 ms to minimize.
[2024-05-30 14:03:14] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-05-30 14:03:15] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2024-05-30 14:03:16] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-30 14:03:16] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
[2024-05-30 14:03:17] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 786/786 variables, and 909 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 83/83 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 392 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Starting structural reductions in LTL mode, iteration 1 : 393/423 places, 393/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60365 ms. Remains : 393/423 places, 393/423 transitions.
[2024-05-30 14:03:17] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:03:17] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:03:17] [INFO ] Input system was already deterministic with 393 transitions.
[2024-05-30 14:03:17] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:03:17] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:03:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality1590561811520979318.gal : 3 ms
[2024-05-30 14:03:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality3836842302857630325.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/CTLCardinality1590561811520979318.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3836842302857630325.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.82673e+35,13.4826,375872,2,7835,5,953496,6,0,1967,2.88603e+06,0


Converting to forward existential form...Done !
original formula: AF((EX(TRUE) * !(E(((p300==0)||(p53==1)) U ((p379==0)||(p282==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((EX(TRUE) * !(E(((p300==0)||(p53==1)) U ((p379==0)||(p282==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t45, t49, t54, t58, t61, t65, t71, t75, t80, ...683
Detected timeout of ITS tools.
[2024-05-30 14:03:47] [INFO ] Flatten gal took : 11 ms
[2024-05-30 14:03:47] [INFO ] Applying decomposition
[2024-05-30 14:03:47] [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/graph18034553216600907628.txt' '-o' '/tmp/graph18034553216600907628.bin' '-w' '/tmp/graph18034553216600907628.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18034553216600907628.bin' '-l' '-1' '-v' '-w' '/tmp/graph18034553216600907628.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:03:48] [INFO ] Decomposing Gal with order
[2024-05-30 14:03:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:03:48] [INFO ] Removed a total of 98 redundant transitions.
[2024-05-30 14:03:48] [INFO ] Flatten gal took : 18 ms
[2024-05-30 14:03:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 14:03:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality7117535465682510385.gal : 3 ms
[2024-05-30 14:03:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality3839877002793568780.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/CTLCardinality7117535465682510385.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3839877002793568780.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,6.82673e+35,1.0635,38128,784,39,62841,733,573,147298,50,1937,0


Converting to forward existential form...Done !
original formula: AF((EX(TRUE) * !(E(((i12.i3.u94.p300==0)||(i2.i5.u19.p53==1)) U ((i15.i2.u118.p379==0)||(i12.i2.u89.p282==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((EX(TRUE) * !(E(((i12.i3.u94.p300==0)||(i2.i5.u19.p53==1)) U ((i15.i2.u118.p379==0)||(i12.i2.u89.p2...176
Reverse transition relation is NOT exact ! Due to transitions t354, t356, t358, t360, t363, t365, t367, t369, t371, i0.i1.t54, i0.i1.t58, i0.i2.t40, i0.i2....1292
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 423/423 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 393 transition count 393
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 393 transition count 393
Applied a total of 60 rules in 7 ms. Remains 393 /423 variables (removed 30) and now considering 393/423 (removed 30) transitions.
// Phase 1: matrix 393 rows 393 cols
[2024-05-30 14:04:18] [INFO ] Computed 41 invariants in 4 ms
[2024-05-30 14:04:18] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-30 14:04:18] [INFO ] Invariant cache hit.
[2024-05-30 14:04:18] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 392 sub problems to find dead transitions.
[2024-05-30 14:04:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (OVERLAPS) 1/393 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-30 14:04:22] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-30 14:04:22] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-05-30 14:04:23] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-30 14:04:23] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-30 14:04:23] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-30 14:04:23] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-30 14:04:23] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:04:24] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-30 14:04:24] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:04:24] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-05-30 14:04:24] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:04:25] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-30 14:04:25] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 13/54 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (OVERLAPS) 393/786 variables, 393/447 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/786 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 6 (OVERLAPS) 0/786 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Real declared 786/786 variables, and 447 constraints, problems are : Problem set: 0 solved, 392 unsolved in 23471 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 392 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (OVERLAPS) 1/393 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 13/54 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (OVERLAPS) 393/786 variables, 393/447 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/786 variables, 392/839 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-30 14:04:47] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 2 ms to minimize.
[2024-05-30 14:04:47] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 2 ms to minimize.
[2024-05-30 14:04:48] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 3 ms to minimize.
[2024-05-30 14:04:48] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 3 ms to minimize.
[2024-05-30 14:04:48] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 2 ms to minimize.
[2024-05-30 14:04:48] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 3 ms to minimize.
[2024-05-30 14:04:48] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 3 ms to minimize.
[2024-05-30 14:04:49] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 3 ms to minimize.
[2024-05-30 14:04:49] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 3 ms to minimize.
[2024-05-30 14:04:49] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 2 ms to minimize.
[2024-05-30 14:04:49] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-05-30 14:04:49] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 3 ms to minimize.
[2024-05-30 14:04:50] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 3 ms to minimize.
[2024-05-30 14:04:50] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 3 ms to minimize.
[2024-05-30 14:04:50] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-05-30 14:04:50] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2024-05-30 14:04:50] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-05-30 14:04:50] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-30 14:04:51] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-05-30 14:04:51] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/786 variables, 20/859 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-30 14:04:53] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 3 ms to minimize.
[2024-05-30 14:04:53] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 3 ms to minimize.
[2024-05-30 14:04:53] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 3 ms to minimize.
[2024-05-30 14:04:53] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 2 ms to minimize.
[2024-05-30 14:04:54] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-30 14:04:54] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 2 ms to minimize.
[2024-05-30 14:04:54] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 3 ms to minimize.
[2024-05-30 14:04:54] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
[2024-05-30 14:04:54] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 3 ms to minimize.
[2024-05-30 14:04:55] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 3 ms to minimize.
[2024-05-30 14:04:55] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 3 ms to minimize.
[2024-05-30 14:04:55] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-05-30 14:04:55] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 3 ms to minimize.
[2024-05-30 14:04:56] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 2 ms to minimize.
[2024-05-30 14:04:56] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
[2024-05-30 14:04:56] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-05-30 14:04:56] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2024-05-30 14:04:57] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2024-05-30 14:04:57] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-30 14:04:57] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/786 variables, 20/879 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-30 14:05:00] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-05-30 14:05:01] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
[2024-05-30 14:05:01] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-30 14:05:02] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 2 ms to minimize.
[2024-05-30 14:05:02] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 2 ms to minimize.
[2024-05-30 14:05:02] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-05-30 14:05:02] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
[2024-05-30 14:05:03] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 2 ms to minimize.
[2024-05-30 14:05:03] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-05-30 14:05:03] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
[2024-05-30 14:05:03] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-05-30 14:05:03] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 3 ms to minimize.
[2024-05-30 14:05:03] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 2 ms to minimize.
[2024-05-30 14:05:04] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
[2024-05-30 14:05:04] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 2 ms to minimize.
[2024-05-30 14:05:04] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2024-05-30 14:05:05] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-30 14:05:05] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
[2024-05-30 14:05:05] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 3 ms to minimize.
[2024-05-30 14:05:05] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/786 variables, 20/899 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-30 14:05:09] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 786/786 variables, and 900 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 74/74 constraints]
After SMT, in 53520ms problems are : Problem set: 0 solved, 392 unsolved
Search for dead transitions found 0 dead transitions in 53524ms
Starting structural reductions in LTL mode, iteration 1 : 393/423 places, 393/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53832 ms. Remains : 393/423 places, 393/423 transitions.
[2024-05-30 14:05:11] [INFO ] Flatten gal took : 8 ms
[2024-05-30 14:05:11] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:05:11] [INFO ] Input system was already deterministic with 393 transitions.
[2024-05-30 14:05:11] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:05:11] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:05:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality4551570266246031987.gal : 3 ms
[2024-05-30 14:05:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality1651607680642232865.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/CTLCardinality4551570266246031987.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1651607680642232865.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.64611e+35,13.2183,363940,2,9698,5,916640,6,0,1967,2.80106e+06,0


Converting to forward existential form...Done !
original formula: AX(EF(((AX(AF((p484==0))) * (p272==1)) * ((p488==0)||(p375==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((!(EX(!(!(EG(!((p484==0))))))) * (p272==1)) * ((p488==0)||(p375==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t17, t19, t22, t26, t30, t31, t37, t41, t46, t50, t55, t59, t62, t66, t72, t76, ...682
Detected timeout of ITS tools.
[2024-05-30 14:05:42] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:05:42] [INFO ] Applying decomposition
[2024-05-30 14:05:42] [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/graph3835790770278039993.txt' '-o' '/tmp/graph3835790770278039993.bin' '-w' '/tmp/graph3835790770278039993.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3835790770278039993.bin' '-l' '-1' '-v' '-w' '/tmp/graph3835790770278039993.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:05:42] [INFO ] Decomposing Gal with order
[2024-05-30 14:05:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:05:42] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-30 14:05:42] [INFO ] Flatten gal took : 14 ms
[2024-05-30 14:05:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 14:05:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality990310806000994834.gal : 3 ms
[2024-05-30 14:05:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality5873722193315092920.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/CTLCardinality990310806000994834.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5873722193315092920.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.64611e+35,1.11576,38936,760,25,60992,552,594,151606,43,1883,0


Converting to forward existential form...Done !
original formula: AX(EF(((AX(AF((i20.i3.u152.p484==0))) * (i13.u85.p272==1)) * ((i20.i3.u153.p488==0)||(i18.i1.u119.p375==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((!(EX(!(!(EG(!((i20.i3.u152.p484==0))))))) * (i13.u85.p272==1)) * ((i20.i3.u153.p488==0...193
Reverse transition relation is NOT exact ! Due to transitions t354, t358, t360, t363, t365, t367, t369, t371, i0.t46, i0.u137.t50, i1.i1.t266, i1.i1.t270, ...1303
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 423/423 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 395 transition count 395
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 395 transition count 395
Applied a total of 56 rules in 6 ms. Remains 395 /423 variables (removed 28) and now considering 395/423 (removed 28) transitions.
// Phase 1: matrix 395 rows 395 cols
[2024-05-30 14:06:12] [INFO ] Computed 41 invariants in 4 ms
[2024-05-30 14:06:12] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-30 14:06:12] [INFO ] Invariant cache hit.
[2024-05-30 14:06:12] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Running 394 sub problems to find dead transitions.
[2024-05-30 14:06:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (OVERLAPS) 1/395 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 394 unsolved
[2024-05-30 14:06:16] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-30 14:06:17] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-30 14:06:17] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-30 14:06:17] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:06:17] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-30 14:06:17] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-30 14:06:17] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-30 14:06:18] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-30 14:06:18] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:06:18] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-30 14:06:18] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2024-05-30 14:06:19] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:06:19] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-05-30 14:06:19] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-30 14:06:19] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/395 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 394 unsolved
[2024-05-30 14:06:20] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/395 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 5 (OVERLAPS) 395/790 variables, 395/452 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/790 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 7 (OVERLAPS) 0/790 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 394 unsolved
No progress, stopping.
After SMT solving in domain Real declared 790/790 variables, and 452 constraints, problems are : Problem set: 0 solved, 394 unsolved in 25738 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 395/395 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 394 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (OVERLAPS) 1/395 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/395 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 394 unsolved
[2024-05-30 14:06:41] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-05-30 14:06:41] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-30 14:06:41] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-30 14:06:42] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-30 14:06:42] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/395 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 5 (OVERLAPS) 395/790 variables, 395/457 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/790 variables, 394/851 constraints. Problems are: Problem set: 0 solved, 394 unsolved
[2024-05-30 14:06:46] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 3 ms to minimize.
[2024-05-30 14:06:46] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 2 ms to minimize.
[2024-05-30 14:06:47] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 3 ms to minimize.
[2024-05-30 14:06:47] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 2 ms to minimize.
[2024-05-30 14:06:47] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 3 ms to minimize.
[2024-05-30 14:06:47] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 2 ms to minimize.
[2024-05-30 14:06:47] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-05-30 14:06:47] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 3 ms to minimize.
[2024-05-30 14:06:47] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 2 ms to minimize.
[2024-05-30 14:06:48] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 3 ms to minimize.
[2024-05-30 14:06:48] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-05-30 14:06:49] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 3 ms to minimize.
[2024-05-30 14:06:49] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-30 14:06:49] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-05-30 14:06:49] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-30 14:06:49] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
[2024-05-30 14:06:49] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 3 ms to minimize.
[2024-05-30 14:06:49] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 2 ms to minimize.
[2024-05-30 14:06:50] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2024-05-30 14:06:50] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/790 variables, 20/871 constraints. Problems are: Problem set: 0 solved, 394 unsolved
[2024-05-30 14:06:52] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-05-30 14:06:52] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2024-05-30 14:06:53] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 3 ms to minimize.
[2024-05-30 14:06:53] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 3 ms to minimize.
[2024-05-30 14:06:54] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 2 ms to minimize.
[2024-05-30 14:06:54] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 2 ms to minimize.
[2024-05-30 14:06:54] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
[2024-05-30 14:06:54] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-05-30 14:06:55] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-05-30 14:06:55] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 2 ms to minimize.
[2024-05-30 14:06:55] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-05-30 14:06:55] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-05-30 14:06:55] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 2 ms to minimize.
[2024-05-30 14:06:55] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-05-30 14:06:56] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 2 ms to minimize.
[2024-05-30 14:06:56] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
[2024-05-30 14:06:56] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 2 ms to minimize.
[2024-05-30 14:06:56] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 2 ms to minimize.
[2024-05-30 14:06:56] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-05-30 14:06:56] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/790 variables, 20/891 constraints. Problems are: Problem set: 0 solved, 394 unsolved
[2024-05-30 14:06:59] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-05-30 14:06:59] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-05-30 14:06:59] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-05-30 14:07:01] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 2 ms to minimize.
[2024-05-30 14:07:01] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-05-30 14:07:01] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-05-30 14:07:01] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-30 14:07:02] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 2 ms to minimize.
[2024-05-30 14:07:02] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
[2024-05-30 14:07:03] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
[2024-05-30 14:07:03] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-30 14:07:03] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2024-05-30 14:07:03] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
[2024-05-30 14:07:03] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
[2024-05-30 14:07:03] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2024-05-30 14:07:04] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 3 ms to minimize.
[2024-05-30 14:07:04] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 2 ms to minimize.
[2024-05-30 14:07:04] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 2 ms to minimize.
[2024-05-30 14:07:04] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-05-30 14:07:04] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/790 variables, 20/911 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 790/790 variables, and 911 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 395/395 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 81/81 constraints]
After SMT, in 55787ms problems are : Problem set: 0 solved, 394 unsolved
Search for dead transitions found 0 dead transitions in 55791ms
Starting structural reductions in LTL mode, iteration 1 : 395/423 places, 395/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56100 ms. Remains : 395/423 places, 395/423 transitions.
[2024-05-30 14:07:08] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:07:08] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:07:08] [INFO ] Input system was already deterministic with 395 transitions.
[2024-05-30 14:07:08] [INFO ] Flatten gal took : 10 ms
[2024-05-30 14:07:08] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:07:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality1714891558158653808.gal : 2 ms
[2024-05-30 14:07:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality7751882802727492664.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/CTLCardinality1714891558158653808.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7751882802727492664.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,7.90406e+35,14.4008,397824,2,10401,5,983761,6,0,1977,3.07927e+06,0


Converting to forward existential form...Done !
original formula: (EX(EF((((p197==0) + EG(((p156==0)||(p457==1)))) + ((p488==0)||((p439==0)&&(p247==1)))))) * EF(((((p386==0)||(p422==1)) * EX(EF((p74==1))...206
=> equivalent forward existential formula: ([(EY((FwdU((Init * EX(E(TRUE U (((p197==0) + EG(((p156==0)||(p457==1)))) + ((p488==0)||((p439==0)&&(p247==1))))...454
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t17, t19, t22, t26, t30, t31, t37, t41, t46, t47, t51, t53, t56, t62, t64, t68, ...698
Detected timeout of ITS tools.
[2024-05-30 14:07:38] [INFO ] Flatten gal took : 12 ms
[2024-05-30 14:07:38] [INFO ] Applying decomposition
[2024-05-30 14:07:38] [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/graph5750781944615127574.txt' '-o' '/tmp/graph5750781944615127574.bin' '-w' '/tmp/graph5750781944615127574.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5750781944615127574.bin' '-l' '-1' '-v' '-w' '/tmp/graph5750781944615127574.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:07:38] [INFO ] Decomposing Gal with order
[2024-05-30 14:07:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:07:38] [INFO ] Removed a total of 98 redundant transitions.
[2024-05-30 14:07:38] [INFO ] Flatten gal took : 13 ms
[2024-05-30 14:07:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 14:07:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality8515517364329232606.gal : 3 ms
[2024-05-30 14:07:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality1336309253101451497.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/CTLCardinality8515517364329232606.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1336309253101451497.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,7.90406e+35,2.09703,68240,877,23,114176,554,592,266354,40,1932,0


Converting to forward existential form...Done !
original formula: (EX(EF((((i7.u61.p197==0) + EG(((i5.i3.u49.p156==0)||(i18.i0.u141.p457==1)))) + ((i18.i3.u151.p488==0)||((i17.u135.p439==0)&&(i8.i3.u77.p...328
=> equivalent forward existential formula: ([(EY((FwdU((Init * EX(E(TRUE U (((i7.u61.p197==0) + EG(((i5.i3.u49.p156==0)||(i18.i0.u141.p457==1)))) + ((i18.i...666
Reverse transition relation is NOT exact ! Due to transitions t356, t358, t360, t362, t367, t369, t371, t373, i0.i1.t92, i0.i1.t96, i0.i2.t83, i0.i2.u120.t...1346
Detected timeout of ITS tools.
[2024-05-30 14:08:08] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:08:08] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:08:08] [INFO ] Applying decomposition
[2024-05-30 14:08:08] [INFO ] Flatten gal took : 7 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/graph8920278106942330747.txt' '-o' '/tmp/graph8920278106942330747.bin' '-w' '/tmp/graph8920278106942330747.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8920278106942330747.bin' '-l' '-1' '-v' '-w' '/tmp/graph8920278106942330747.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:08:08] [INFO ] Decomposing Gal with order
[2024-05-30 14:08:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:08:08] [INFO ] Removed a total of 78 redundant transitions.
[2024-05-30 14:08:08] [INFO ] Flatten gal took : 14 ms
[2024-05-30 14:08:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 14:08:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality7861906289216101121.gal : 3 ms
[2024-05-30 14:08:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality4728642227691387585.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/CTLCardinality7861906289216101121.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4728642227691387585.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 10 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.35481e+36,2.34492,64812,1065,48,98778,616,763,266331,59,1439,0


Converting to forward existential form...Done !
original formula: AF(EX(((AG((i14.i2.u96.p275==1)) + ((i0.i1.u64.p184==0)&&(i10.u68.p187==1))) * ((AX((((i15.i1.u108.p315==0)||(i6.i2.u56.p149==1))&&((i15....248
=> equivalent forward existential formula: [FwdG(Init,!(EX(((!(E(TRUE U !((i14.i2.u96.p275==1)))) + ((i0.i1.u64.p184==0)&&(i10.u68.p187==1))) * ((!(EX(!(((...317
Reverse transition relation is NOT exact ! Due to transitions t384, t388, t390, t397, t401, i0.i1.t250, i0.i1.u66.t254, i0.i1.u66.t255, i0.i2.t234, i0.i2.t...1784
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Detected timeout of ITS tools.
[2024-05-30 14:35:00] [INFO ] Applying decomposition
[2024-05-30 14:35:00] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:35:00] [INFO ] Decomposing Gal with order
[2024-05-30 14:35:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:35:00] [INFO ] Removed a total of 21 redundant transitions.
[2024-05-30 14:35:00] [INFO ] Flatten gal took : 12 ms
[2024-05-30 14:35:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-30 14:35:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality18244505515844973207.gal : 2 ms
[2024-05-30 14:35:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality10406204048942649363.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/CTLCardinality18244505515844973207.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10406204048942649363.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 10 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.35481e+36,13.8152,362520,1404,358,577697,862,487,2.7261e+06,142,9671,0


Converting to forward existential form...Done !
original formula: AF(EX(((AG((i0.i0.i0.i0.i1.i0.i0.u50.p275==1)) + ((i0.i0.i0.i0.i0.i0.i1.i0.i0.u36.p184==0)&&(i0.i0.i0.i0.i0.i0.i1.i0.u37.p187==1))) * ((A...379
=> equivalent forward existential formula: [FwdG(Init,!(EX(((!(E(TRUE U !((i0.i0.i0.i0.i1.i0.i0.u50.p275==1)))) + ((i0.i0.i0.i0.i0.i0.i1.i0.i0.u36.p184==0)...448
Reverse transition relation is NOT exact ! Due to transitions t401, i0.t384, i0.i0.i0.i0.t397, i0.i0.i0.i0.i0.t388, i0.i0.i0.i0.i0.i0.i0.t390, i0.i0.i0.i0....3714

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

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

Sequence of Actions to be Executed by the VM

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

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

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