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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 20:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 20:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 50K 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 ShieldIIPt-PT-003B-CTLCardinality-2024-00
FORMULA_NAME ShieldIIPt-PT-003B-CTLCardinality-2024-01
FORMULA_NAME ShieldIIPt-PT-003B-CTLCardinality-2024-02
FORMULA_NAME ShieldIIPt-PT-003B-CTLCardinality-2024-03
FORMULA_NAME ShieldIIPt-PT-003B-CTLCardinality-2024-04
FORMULA_NAME ShieldIIPt-PT-003B-CTLCardinality-2024-05
FORMULA_NAME ShieldIIPt-PT-003B-CTLCardinality-2024-06
FORMULA_NAME ShieldIIPt-PT-003B-CTLCardinality-2024-07
FORMULA_NAME ShieldIIPt-PT-003B-CTLCardinality-2024-08
FORMULA_NAME ShieldIIPt-PT-003B-CTLCardinality-2024-09
FORMULA_NAME ShieldIIPt-PT-003B-CTLCardinality-2024-10
FORMULA_NAME ShieldIIPt-PT-003B-CTLCardinality-2024-11
FORMULA_NAME ShieldIIPt-PT-003B-CTLCardinality-2023-12
FORMULA_NAME ShieldIIPt-PT-003B-CTLCardinality-2023-13
FORMULA_NAME ShieldIIPt-PT-003B-CTLCardinality-2023-14
FORMULA_NAME ShieldIIPt-PT-003B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716925444223

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-003B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-28 19:44:05] [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-28 19:44:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 19:44:05] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-05-28 19:44:05] [INFO ] Transformed 213 places.
[2024-05-28 19:44:05] [INFO ] Transformed 198 transitions.
[2024-05-28 19:44:05] [INFO ] Found NUPN structural information;
[2024-05-28 19:44:05] [INFO ] Parsed PT model containing 213 places and 198 transitions and 492 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Support contains 105 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 198/198 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 203 transition count 188
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 203 transition count 188
Applied a total of 20 rules in 55 ms. Remains 203 /213 variables (removed 10) and now considering 188/198 (removed 10) transitions.
// Phase 1: matrix 188 rows 203 cols
[2024-05-28 19:44:05] [INFO ] Computed 28 invariants in 21 ms
[2024-05-28 19:44:06] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-28 19:44:06] [INFO ] Invariant cache hit.
[2024-05-28 19:44:06] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
Running 187 sub problems to find dead transitions.
[2024-05-28 19:44:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:44:07] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 13 ms to minimize.
[2024-05-28 19:44:07] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-28 19:44:07] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-28 19:44:07] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:44:08] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:44:08] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:44:08] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:44:08] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:44:08] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:44:08] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:44:08] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-28 19:44:08] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:44:08] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
[2024-05-28 19:44:08] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:44:08] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:44:08] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-28 19:44:08] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:44:08] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:44:08] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:44:08] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:44:08] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:44:08] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 2 ms to minimize.
[2024-05-28 19:44:09] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-28 19:44:09] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:44:09] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-28 19:44:09] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:44:09] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:44:09] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:44:09] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:44:09] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-28 19:44:09] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-28 19:44:09] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:44:09] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:44:09] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:44:09] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 5 ms to minimize.
[2024-05-28 19:44:09] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:44:09] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:44:09] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:44:09] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:44:09] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:44:10] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:44:10] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:44:10] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:44:10] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:44:11] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:44:11] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:44:11] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-28 19:44:11] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:44:11] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:44:11] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 10/78 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:44:11] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:44:12] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:44:12] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-28 19:44:12] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 188/391 variables, 203/285 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:44:14] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:44:15] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-28 19:44:15] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
[2024-05-28 19:44:15] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:44:15] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:44:15] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-28 19:44:15] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 7/292 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:44:16] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:44:18] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/391 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:44:21] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:44:21] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:44:21] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/391 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/391 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:44:23] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/391 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:44:26] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:44:26] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/391 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/391 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:44:28] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/391 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/391 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:44:30] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/391 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/391 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 22 (OVERLAPS) 0/391 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 302 constraints, problems are : Problem set: 0 solved, 187 unsolved in 28088 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 71/71 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 71/99 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:44:35] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:44:35] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:44:35] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:44:36] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (OVERLAPS) 188/391 variables, 203/306 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 187/493 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:44:38] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-28 19:44:38] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-28 19:44:39] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 3/496 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:44:41] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 19:44:41] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:44:41] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-28 19:44:42] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:44:42] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 5/501 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:44:44] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-05-28 19:44:45] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 2/503 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-28 19:44:48] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/391 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 13 (OVERLAPS) 0/391 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 504 constraints, problems are : Problem set: 0 solved, 187 unsolved in 25224 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 86/86 constraints]
After SMT, in 53376ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 53390ms
Starting structural reductions in LTL mode, iteration 1 : 203/213 places, 188/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53942 ms. Remains : 203/213 places, 188/198 transitions.
Support contains 105 out of 203 places after structural reductions.
[2024-05-28 19:44:59] [INFO ] Flatten gal took : 34 ms
[2024-05-28 19:44:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldIIPt-PT-003B-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 19:44:59] [INFO ] Flatten gal took : 14 ms
[2024-05-28 19:44:59] [INFO ] Input system was already deterministic with 188 transitions.
Support contains 93 out of 203 places (down from 105) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1472 ms. (27 steps per ms) remains 2/56 properties
BEST_FIRST walk for 40003 steps (8 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 186 ms. (213 steps per ms) remains 2/2 properties
[2024-05-28 19:45:00] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 94/102 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 101/203 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 188/391 variables, 203/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/391 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 231 constraints, problems are : Problem set: 0 solved, 2 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp25 is UNSAT
At refinement iteration 1 (OVERLAPS) 94/102 variables, 15/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 19:45:00] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-28 19:45:00] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
Problem AtomicPropp20 is UNSAT
After SMT solving in domain Int declared 102/391 variables, and 17 constraints, problems are : Problem set: 2 solved, 0 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 15/28 constraints, State Equation: 0/203 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 247ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2024-05-28 19:45:00] [INFO ] Flatten gal took : 10 ms
[2024-05-28 19:45:00] [INFO ] Flatten gal took : 10 ms
[2024-05-28 19:45:00] [INFO ] Input system was already deterministic with 188 transitions.
Computed a total of 54 stabilizing places and 54 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 203/203 places, 188/188 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 202 transition count 145
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 160 transition count 145
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 84 place count 160 transition count 129
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 116 place count 144 transition count 129
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 131 place count 129 transition count 114
Iterating global reduction 2 with 15 rules applied. Total rules applied 146 place count 129 transition count 114
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 146 place count 129 transition count 104
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 166 place count 119 transition count 104
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 260 place count 72 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 261 place count 72 transition count 56
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 263 place count 71 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 265 place count 69 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 267 place count 67 transition count 53
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 267 place count 67 transition count 52
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 269 place count 66 transition count 52
Applied a total of 269 rules in 49 ms. Remains 66 /203 variables (removed 137) and now considering 52/188 (removed 136) transitions.
// Phase 1: matrix 52 rows 66 cols
[2024-05-28 19:45:00] [INFO ] Computed 26 invariants in 1 ms
[2024-05-28 19:45:00] [INFO ] Implicit Places using invariants in 46 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 65/203 places, 52/188 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 64 transition count 51
Applied a total of 2 rules in 5 ms. Remains 64 /65 variables (removed 1) and now considering 51/52 (removed 1) transitions.
// Phase 1: matrix 51 rows 64 cols
[2024-05-28 19:45:00] [INFO ] Computed 25 invariants in 0 ms
[2024-05-28 19:45:00] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-28 19:45:00] [INFO ] Invariant cache hit.
[2024-05-28 19:45:01] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 64/203 places, 51/188 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 205 ms. Remains : 64/203 places, 51/188 transitions.
[2024-05-28 19:45:01] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:45:01] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:45:01] [INFO ] Input system was already deterministic with 51 transitions.
[2024-05-28 19:45:01] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:45:01] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:45:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality8427719868132151074.gal : 2 ms
[2024-05-28 19:45:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality5298784633047093468.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/CTLCardinality8427719868132151074.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5298784633047093468.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.44196e+09,0.046367,5296,2,186,5,8382,6,0,310,11051,0


Converting to forward existential form...Done !
original formula: EG((p20==0))
=> equivalent forward existential formula: [FwdG(Init,(p20==0))] != FALSE
Hit Full ! (commute/partial/dont) 49/0/2
(forward)formula 0,1,0.121338,6604,1,0,10,16488,19,4,1535,16175,8
FORMULA ShieldIIPt-PT-003B-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 203/203 places, 188/188 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 202 transition count 148
Reduce places removed 39 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 41 rules applied. Total rules applied 80 place count 163 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 82 place count 161 transition count 146
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 82 place count 161 transition count 131
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 112 place count 146 transition count 131
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 127 place count 131 transition count 116
Iterating global reduction 3 with 15 rules applied. Total rules applied 142 place count 131 transition count 116
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 142 place count 131 transition count 107
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 160 place count 122 transition count 107
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 252 place count 76 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 253 place count 76 transition count 60
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 255 place count 74 transition count 58
Applied a total of 255 rules in 47 ms. Remains 74 /203 variables (removed 129) and now considering 58/188 (removed 130) transitions.
// Phase 1: matrix 58 rows 74 cols
[2024-05-28 19:45:01] [INFO ] Computed 28 invariants in 3 ms
[2024-05-28 19:45:01] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-28 19:45:01] [INFO ] Invariant cache hit.
[2024-05-28 19:45:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:45:01] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2024-05-28 19:45:01] [INFO ] Redundant transitions in 1 ms returned []
Running 56 sub problems to find dead transitions.
[2024-05-28 19:45:01] [INFO ] Invariant cache hit.
[2024-05-28 19:45:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 2/74 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-28 19:45:01] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 58/132 variables, 74/103 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 104 constraints, problems are : Problem set: 0 solved, 56 unsolved in 775 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 2/74 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 58/132 variables, 74/103 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 56/160 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 160 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1081 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 1/1 constraints]
After SMT, in 1866ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 1867ms
Starting structural reductions in SI_CTL mode, iteration 1 : 74/203 places, 58/188 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2123 ms. Remains : 74/203 places, 58/188 transitions.
[2024-05-28 19:45:03] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:45:03] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:45:03] [INFO ] Input system was already deterministic with 58 transitions.
[2024-05-28 19:45:03] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:45:03] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:45:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality1699895774591843327.gal : 2 ms
[2024-05-28 19:45:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality3081822064117795499.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/CTLCardinality1699895774591843327.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3081822064117795499.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.04662e+10,0.05282,5964,2,324,5,11204,6,0,354,14581,0


Converting to forward existential form...Done !
original formula: A(!(((p174!=0) + AG(!(EG((p34==1)))))) U EF(AG(((p147==0)||(p61==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U !(E(TRUE U !(((p147==0)||(p61==1)))))))))) * !(E(!(E(TRUE U !(E(TRUE U !(((p147==0)||(...290
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t14, t16, t21, t24, t26, t28, t30, t32, t33, t36, t55, Intersection with reachable a...223
(forward)formula 0,1,0.115577,7812,1,0,144,25492,147,64,2190,17993,137
FORMULA ShieldIIPt-PT-003B-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 188/188 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 182 transition count 167
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 182 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 181 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 181 transition count 166
Applied a total of 44 rules in 9 ms. Remains 181 /203 variables (removed 22) and now considering 166/188 (removed 22) transitions.
// Phase 1: matrix 166 rows 181 cols
[2024-05-28 19:45:03] [INFO ] Computed 28 invariants in 3 ms
[2024-05-28 19:45:03] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-28 19:45:03] [INFO ] Invariant cache hit.
[2024-05-28 19:45:03] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-05-28 19:45:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:45:04] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:45:04] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:45:04] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:45:04] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-05-28 19:45:04] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:45:04] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:45:04] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:45:04] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-28 19:45:05] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-28 19:45:05] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:45:05] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:45:05] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:45:05] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:45:05] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-28 19:45:05] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:45:05] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-28 19:45:05] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:45:05] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:45:05] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:45:05] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:45:05] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-28 19:45:05] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:45:06] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:45:06] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:45:06] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:45:06] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:45:06] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/347 variables, 181/236 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:45:07] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 19:45:08] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:45:09] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:45:09] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:45:11] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:45:11] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/347 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:45:13] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:45:14] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:45:14] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:45:16] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/347 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/347 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 15 (OVERLAPS) 0/347 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 246 constraints, problems are : Problem set: 0 solved, 165 unsolved in 15602 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 37/65 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:45:20] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/347 variables, 181/247 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 165/412 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:45:22] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-28 19:45:22] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 2/414 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:45:23] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-28 19:45:23] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-28 19:45:24] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-28 19:45:24] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-28 19:45:24] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 5/419 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:45:26] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
[2024-05-28 19:45:26] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-28 19:45:26] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 3/422 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:45:29] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:45:29] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 2/424 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-28 19:45:33] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/347 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/347 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 14 (OVERLAPS) 0/347 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/347 variables, and 425 constraints, problems are : Problem set: 0 solved, 165 unsolved in 20594 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 51/51 constraints]
After SMT, in 36213ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 36215ms
Starting structural reductions in LTL mode, iteration 1 : 181/203 places, 166/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36385 ms. Remains : 181/203 places, 166/188 transitions.
[2024-05-28 19:45:39] [INFO ] Flatten gal took : 8 ms
[2024-05-28 19:45:39] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:45:39] [INFO ] Input system was already deterministic with 166 transitions.
[2024-05-28 19:45:39] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:45:39] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:45:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality9995773316093781958.gal : 4 ms
[2024-05-28 19:45:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality3916693469436133749.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/CTLCardinality9995773316093781958.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3916693469436133749.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.36812e+17,3.53859,117004,2,3315,5,338079,6,0,892,811431,0


Converting to forward existential form...Done !
original formula: AG((AX((((EF((p183==1)) + (p162==1)) + (((p139==0)&&(p170==1))||((p117==0)&&(p14==1)))) + (p198==0))) * (AG((((p68==1)||((p144==0)&&(p198...206
=> equivalent forward existential formula: ([((((EY(FwdU(Init,TRUE)) * !((p198==0))) * !((((p139==0)&&(p170==1))||((p117==0)&&(p14==1))))) * !((p162==1))) ...324
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t15, t20, t22, t25, t29, t34, t37, t39, t40, t41, t42, t43, t45, t46, t50, t54, t56,...415
(forward)formula 0,0,4.5652,117004,1,0,356,338079,356,172,5156,811431,345
FORMULA ShieldIIPt-PT-003B-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 188/188 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 181 transition count 166
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 181 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 180 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 180 transition count 165
Applied a total of 46 rules in 14 ms. Remains 180 /203 variables (removed 23) and now considering 165/188 (removed 23) transitions.
// Phase 1: matrix 165 rows 180 cols
[2024-05-28 19:45:44] [INFO ] Computed 28 invariants in 1 ms
[2024-05-28 19:45:44] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-28 19:45:44] [INFO ] Invariant cache hit.
[2024-05-28 19:45:44] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-05-28 19:45:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:45:45] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:45:45] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:45:45] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 2 ms to minimize.
[2024-05-28 19:45:45] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:45:45] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:45:45] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:45:46] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-28 19:45:46] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-28 19:45:46] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:45:46] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:45:46] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:45:46] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:45:46] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:45:46] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-28 19:45:46] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:45:46] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:45:46] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-28 19:45:46] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-28 19:45:46] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:45:46] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:45:46] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:45:47] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:45:48] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:45:48] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:45:49] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:45:49] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:45:50] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-28 19:45:50] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (OVERLAPS) 165/345 variables, 180/236 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:45:52] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:45:52] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:45:52] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:45:53] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:45:53] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 13 (OVERLAPS) 0/345 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 241 constraints, problems are : Problem set: 0 solved, 164 unsolved in 11751 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 33/61 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:45:57] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 165/345 variables, 180/242 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 164/406 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:45:58] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-28 19:45:59] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-28 19:45:59] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-28 19:45:59] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-28 19:45:59] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-28 19:46:00] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 6/412 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:46:01] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-28 19:46:01] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-28 19:46:01] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-28 19:46:01] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-28 19:46:01] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-28 19:46:02] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 6/418 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:46:04] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-28 19:46:04] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-28 19:46:04] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-28 19:46:05] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-28 19:46:05] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 5/423 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:46:06] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-28 19:46:07] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 2/425 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 12 (OVERLAPS) 0/345 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 425 constraints, problems are : Problem set: 0 solved, 164 unsolved in 16597 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 53/53 constraints]
After SMT, in 28364ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 28368ms
Starting structural reductions in LTL mode, iteration 1 : 180/203 places, 165/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28542 ms. Remains : 180/203 places, 165/188 transitions.
[2024-05-28 19:46:13] [INFO ] Flatten gal took : 11 ms
[2024-05-28 19:46:13] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:46:13] [INFO ] Input system was already deterministic with 165 transitions.
[2024-05-28 19:46:13] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:46:13] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:46:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality17524986687171379702.gal : 2 ms
[2024-05-28 19:46:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality17781994368683229272.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/CTLCardinality17524986687171379702.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17781994368683229272.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.02602e+17,3.88146,118788,2,2864,5,340013,6,0,887,822252,0


Converting to forward existential form...Done !
original formula: (A(!(((p80==0)||(p187==1))) U EX(E(((!((p189==0)||(p41==1)))&&(p209!=1)) U (((p152==0)&&((p154==0)||(p0==1)))||(!((p43==0)||(p149==1)))))...269
=> equivalent forward existential formula: [FwdG((Init * !((E(!(EX(E(((!((p189==0)||(p41==1)))&&(p209!=1)) U (((p152==0)&&((p154==0)||(p0==1)))||(!((p43==0...563
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t15, t19, t21, t25, t29, t34, t35, t38, t39, t40, t41, t42, t44, t45, t49, t53, t58,...416
Detected timeout of ITS tools.
[2024-05-28 19:46:43] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:46:43] [INFO ] Applying decomposition
[2024-05-28 19:46:43] [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/graph845278971426052955.txt' '-o' '/tmp/graph845278971426052955.bin' '-w' '/tmp/graph845278971426052955.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph845278971426052955.bin' '-l' '-1' '-v' '-w' '/tmp/graph845278971426052955.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:46:43] [INFO ] Decomposing Gal with order
[2024-05-28 19:46:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:46:43] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-28 19:46:43] [INFO ] Flatten gal took : 36 ms
[2024-05-28 19:46:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-28 19:46:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality16585304660022144372.gal : 3 ms
[2024-05-28 19:46:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality16979324674907464110.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/CTLCardinality16585304660022144372.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16979324674907464110.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.02602e+17,1.50566,44944,608,29,65748,276,431,207020,45,637,0


Converting to forward existential form...Done !
original formula: (A(!(((i8.i1.u25.p80==0)||(i12.u58.p187==1))) U EX(E(((!((i12.u59.p189==0)||(i2.u12.p41==1)))&&(i14.u65.p209!=1)) U (((i10.i1.u47.p152==0...422
=> equivalent forward existential formula: [FwdG((Init * !((E(!(EX(E(((!((i12.u59.p189==0)||(i2.u12.p41==1)))&&(i14.u65.p209!=1)) U (((i10.i1.u47.p152==0)&...860
Reverse transition relation is NOT exact ! Due to transitions t38, t86, t129, t131, i0.i1.t127, i0.i1.u5.t134, i0.i1.u9.t128, i0.i2.t97, i0.i2.u21.t93, i1....726
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 188/188 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 180 transition count 165
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 180 transition count 165
Applied a total of 46 rules in 10 ms. Remains 180 /203 variables (removed 23) and now considering 165/188 (removed 23) transitions.
// Phase 1: matrix 165 rows 180 cols
[2024-05-28 19:47:13] [INFO ] Computed 28 invariants in 2 ms
[2024-05-28 19:47:13] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-28 19:47:13] [INFO ] Invariant cache hit.
[2024-05-28 19:47:13] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-05-28 19:47:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:47:14] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-28 19:47:14] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:47:14] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-28 19:47:14] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:47:14] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:47:14] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:47:14] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:47:15] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-28 19:47:15] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:47:15] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-28 19:47:15] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-05-28 19:47:15] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:47:15] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-28 19:47:15] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:47:15] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:47:15] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:47:15] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:47:15] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2024-05-28 19:47:15] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:47:15] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:47:16] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:47:17] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 165/345 variables, 180/230 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:47:18] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:47:20] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:47:20] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/345 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:47:22] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:47:22] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-28 19:47:22] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:47:24] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:47:25] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/345 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/345 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 15 (OVERLAPS) 0/345 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 238 constraints, problems are : Problem set: 0 solved, 164 unsolved in 14571 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 30/58 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 165/345 variables, 180/238 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 164/402 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:47:29] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-05-28 19:47:29] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-28 19:47:30] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-28 19:47:30] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2024-05-28 19:47:30] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:47:30] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-28 19:47:30] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-28 19:47:30] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-28 19:47:31] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 9/411 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:47:32] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-28 19:47:32] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-28 19:47:32] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-28 19:47:32] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-28 19:47:32] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-28 19:47:32] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-28 19:47:33] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2024-05-28 19:47:33] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 8/419 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:47:35] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:47:37] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:47:39] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:47:39] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2024-05-28 19:47:39] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 3/424 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 12 (OVERLAPS) 0/345 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 424 constraints, problems are : Problem set: 0 solved, 164 unsolved in 17512 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 52/52 constraints]
After SMT, in 32104ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 32106ms
Starting structural reductions in LTL mode, iteration 1 : 180/203 places, 165/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32286 ms. Remains : 180/203 places, 165/188 transitions.
[2024-05-28 19:47:45] [INFO ] Flatten gal took : 9 ms
[2024-05-28 19:47:45] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:47:45] [INFO ] Input system was already deterministic with 165 transitions.
[2024-05-28 19:47:45] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:47:45] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:47:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality13248924152352496386.gal : 2 ms
[2024-05-28 19:47:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality1996827545029063549.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/CTLCardinality13248924152352496386.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1996827545029063549.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.76797e+17,4.12757,121152,2,2931,5,348902,6,0,887,840118,0


Converting to forward existential form...Done !
original formula: AF(EX((((p144==0)||(p208==1)) * (AG((p192==1)) + (AX((p128==1)) * AX((p168==0)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX((((p144==0)||(p208==1)) * (!(E(TRUE U !((p192==1)))) + (!(EX(!((p128==1)))) * !(EX(!((p168==0)))...171
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t15, t19, t21, t25, t29, t32, t35, t36, t39, t40, t41, t42, t43, t45, t46, t50, t54,...415
Detected timeout of ITS tools.
[2024-05-28 19:48:15] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:48:15] [INFO ] Applying decomposition
[2024-05-28 19:48:15] [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/graph15124085807174310733.txt' '-o' '/tmp/graph15124085807174310733.bin' '-w' '/tmp/graph15124085807174310733.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15124085807174310733.bin' '-l' '-1' '-v' '-w' '/tmp/graph15124085807174310733.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:48:15] [INFO ] Decomposing Gal with order
[2024-05-28 19:48:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:48:15] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-28 19:48:15] [INFO ] Flatten gal took : 11 ms
[2024-05-28 19:48:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 19:48:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality17337218388182787999.gal : 3 ms
[2024-05-28 19:48:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality7997198809507434421.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/CTLCardinality17337218388182787999.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7997198809507434421.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.76797e+17,0.626454,25952,496,29,42342,356,431,89735,47,892,0


Converting to forward existential form...Done !
original formula: AF(EX((((i11.u46.p144==0)||(i16.u68.p208==1)) * (AG((i15.u65.p192==1)) + (AX((i10.u41.p128==1)) * AX((i13.u56.p168==0)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX((((i11.u46.p144==0)||(i16.u68.p208==1)) * (!(E(TRUE U !((i15.u65.p192==1)))) + (!(EX(!((i10.u41....211
Reverse transition relation is NOT exact ! Due to transitions t39, t87, t127, i0.i0.u1.t135, i1.t131, i1.i0.t129, i1.i0.u6.t134, i1.i0.u9.t130, i1.i1.u7.t1...701
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 188/188 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 179 transition count 164
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 179 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 178 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 178 transition count 163
Applied a total of 50 rules in 8 ms. Remains 178 /203 variables (removed 25) and now considering 163/188 (removed 25) transitions.
// Phase 1: matrix 163 rows 178 cols
[2024-05-28 19:48:45] [INFO ] Computed 28 invariants in 1 ms
[2024-05-28 19:48:46] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-28 19:48:46] [INFO ] Invariant cache hit.
[2024-05-28 19:48:46] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-28 19:48:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:48:47] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:48:47] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 2 ms to minimize.
[2024-05-28 19:48:47] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:48:47] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:48:47] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-28 19:48:47] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-28 19:48:47] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:48:47] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-28 19:48:47] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:48:47] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:48:47] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-28 19:48:47] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
[2024-05-28 19:48:47] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:48:48] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:48:48] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:48:48] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:48:48] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:48:48] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-28 19:48:48] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-28 19:48:48] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:48:48] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:48:48] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:48:48] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:48:49] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:48:49] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 163/341 variables, 178/231 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:48:51] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:48:52] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:48:52] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (OVERLAPS) 0/341 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 234 constraints, problems are : Problem set: 0 solved, 162 unsolved in 9080 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:48:56] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 163/341 variables, 178/235 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 162/397 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:48:57] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-28 19:48:57] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-28 19:48:57] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:48:57] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-28 19:48:57] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:48:58] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-28 19:48:58] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:48:58] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 8/405 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:49:00] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-28 19:49:00] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-28 19:49:01] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:49:01] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 4/409 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:49:02] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:49:04] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:49:06] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 13 (OVERLAPS) 0/341 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 412 constraints, problems are : Problem set: 0 solved, 162 unsolved in 17902 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 44/44 constraints]
After SMT, in 27004ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 27006ms
Starting structural reductions in LTL mode, iteration 1 : 178/203 places, 163/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27335 ms. Remains : 178/203 places, 163/188 transitions.
[2024-05-28 19:49:13] [INFO ] Flatten gal took : 11 ms
[2024-05-28 19:49:13] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:49:13] [INFO ] Input system was already deterministic with 163 transitions.
[2024-05-28 19:49:13] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:49:13] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:49:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality13219348067432048939.gal : 1 ms
[2024-05-28 19:49:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality15441602809891213404.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/CTLCardinality13219348067432048939.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15441602809891213404.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.29062e+17,2.79107,99560,2,2450,5,292868,6,0,877,675011,0


Converting to forward existential form...Done !
original formula: EX(AG((p57==0)))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((p57==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t15, t19, t24, t28, t33, t34, t37, t38, t39, t40, t41, t43, t44, t48, t52, t57, t61,...405
Detected timeout of ITS tools.
[2024-05-28 19:49:43] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:49:43] [INFO ] Applying decomposition
[2024-05-28 19:49:43] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10671015665236218973.txt' '-o' '/tmp/graph10671015665236218973.bin' '-w' '/tmp/graph10671015665236218973.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10671015665236218973.bin' '-l' '-1' '-v' '-w' '/tmp/graph10671015665236218973.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:49:43] [INFO ] Decomposing Gal with order
[2024-05-28 19:49:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:49:43] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-28 19:49:43] [INFO ] Flatten gal took : 8 ms
[2024-05-28 19:49:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 19:49:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality16362069404771072159.gal : 2 ms
[2024-05-28 19:49:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality3525089327057515210.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/CTLCardinality16362069404771072159.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3525089327057515210.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.29062e+17,0.453967,21732,545,43,34768,400,457,79740,56,948,0


Converting to forward existential form...Done !
original formula: EX(AG((i5.u20.p57==0)))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((i5.u20.p57==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t37, t85, t125, i0.i0.u1.t133, i0.i2.u52.t38, i1.i1.u10.t126, i1.i2.t96, i1.i2.u21.t92, i2.t1...700
(forward)formula 0,0,6.30968,181452,1,0,262710,471,2374,826510,295,1478,341880
FORMULA ShieldIIPt-PT-003B-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 188/188 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 184 transition count 169
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 184 transition count 169
Applied a total of 38 rules in 9 ms. Remains 184 /203 variables (removed 19) and now considering 169/188 (removed 19) transitions.
// Phase 1: matrix 169 rows 184 cols
[2024-05-28 19:49:49] [INFO ] Computed 28 invariants in 1 ms
[2024-05-28 19:49:49] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-28 19:49:49] [INFO ] Invariant cache hit.
[2024-05-28 19:49:49] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2024-05-28 19:49:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-28 19:49:51] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-28 19:49:51] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:49:51] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-05-28 19:49:51] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:49:51] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-28 19:49:51] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-28 19:49:51] [INFO ] Deduced a trap composed of 16 places in 17 ms of which 1 ms to minimize.
[2024-05-28 19:49:51] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:49:51] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 0 ms to minimize.
[2024-05-28 19:49:51] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:49:51] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-28 19:49:51] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:49:51] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-28 19:49:51] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-05-28 19:49:51] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:49:51] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-28 19:49:51] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:49:51] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:49:51] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:49:52] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-28 19:49:52] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:49:52] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-28 19:49:52] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-28 19:49:52] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-28 19:49:52] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:49:52] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:49:52] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-28 19:49:52] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-28 19:49:52] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 169/353 variables, 184/241 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-28 19:49:54] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:49:54] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-28 19:49:54] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 3/244 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-28 19:49:56] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-28 19:49:56] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (OVERLAPS) 0/353 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 246 constraints, problems are : Problem set: 0 solved, 168 unsolved in 9978 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 34/62 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-28 19:50:00] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:50:00] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 169/353 variables, 184/248 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 168/416 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-28 19:50:02] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-28 19:50:02] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-28 19:50:02] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:50:02] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:50:03] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-28 19:50:03] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-28 19:50:03] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 19:50:03] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-28 19:50:03] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:50:03] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:50:03] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 11/427 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-28 19:50:04] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-28 19:50:05] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-28 19:50:05] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 3/430 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-28 19:50:07] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:50:07] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 2/432 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-28 19:50:10] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-28 19:50:14] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/353 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-28 19:50:16] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-28 19:50:16] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-28 19:50:16] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 3/437 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/353 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-28 19:50:21] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-28 19:50:21] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/353 variables, 2/439 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/353 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 17 (OVERLAPS) 0/353 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 353/353 variables, and 439 constraints, problems are : Problem set: 0 solved, 168 unsolved in 28619 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 59/59 constraints]
After SMT, in 38614ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 38616ms
Starting structural reductions in LTL mode, iteration 1 : 184/203 places, 169/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38796 ms. Remains : 184/203 places, 169/188 transitions.
[2024-05-28 19:50:28] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:50:28] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:50:28] [INFO ] Input system was already deterministic with 169 transitions.
[2024-05-28 19:50:28] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:50:28] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:50:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality7470756087474290011.gal : 7 ms
[2024-05-28 19:50:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality3866407897316613935.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/CTLCardinality7470756087474290011.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3866407897316613935.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.67882e+17,5.10101,158800,2,3663,5,455117,6,0,907,1.11426e+06,0


Converting to forward existential form...Done !
original formula: AX(((EG(EX(TRUE)) * E(EF((p72==0)) U E((p91==0) U ((p200==0)||(p179==1))))) * (((p110==0)||(p203==1)) + (EX(TRUE) * AG(E((p38==1) U ((p47...177
=> equivalent forward existential formula: (([(EY(Init) * !(EG(EX(TRUE))))] = FALSE * [(EY(Init) * !(E(E(TRUE U (p72==0)) U E((p91==0) U ((p200==0)||(p179=...348
Reverse transition relation is NOT exact ! Due to transitions t6, t11, t13, t17, t21, t22, t26, t30, t34, t38, t41, t42, t43, t44, t45, t47, t48, t52, t56,...445
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-28 19:50:58] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:50:58] [INFO ] Applying decomposition
[2024-05-28 19:50:58] [INFO ] Flatten gal took : 8 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/graph833874447736265066.txt' '-o' '/tmp/graph833874447736265066.bin' '-w' '/tmp/graph833874447736265066.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph833874447736265066.bin' '-l' '-1' '-v' '-w' '/tmp/graph833874447736265066.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:50:58] [INFO ] Decomposing Gal with order
[2024-05-28 19:50:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:50:58] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-28 19:50:58] [INFO ] Flatten gal took : 26 ms
[2024-05-28 19:50:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 19:50:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality2758861169404403385.gal : 2 ms
[2024-05-28 19:50:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality4868252866037313235.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/CTLCardinality2758861169404403385.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4868252866037313235.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,3.67882e+17,0.992278,35772,813,29,55780,250,465,165353,49,707,0


Converting to forward existential form...Done !
original formula: AX(((EG(EX(TRUE)) * E(EF((i5.u22.p72==0)) U E((i6.i0.u29.p91==0) U ((i14.u65.p200==0)||(i13.u57.p179==1))))) * (((i7.u32.p110==0)||(i15.u...249
=> equivalent forward existential formula: (([(EY(Init) * !(EG(EX(TRUE))))] = FALSE * [(EY(Init) * !(E(E(TRUE U (i5.u22.p72==0)) U E((i6.i0.u29.p91==0) U (...435
Reverse transition relation is NOT exact ! Due to transitions t45, t89, t135, i0.i1.t115, i0.i1.t119, i1.t133, i1.i0.t131, i1.i0.u5.t138, i1.i0.u9.t132, i1...787
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 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 188/188 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 180 transition count 165
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 180 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 179 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 179 transition count 164
Applied a total of 48 rules in 5 ms. Remains 179 /203 variables (removed 24) and now considering 164/188 (removed 24) transitions.
// Phase 1: matrix 164 rows 179 cols
[2024-05-28 19:51:28] [INFO ] Computed 28 invariants in 1 ms
[2024-05-28 19:51:28] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-28 19:51:28] [INFO ] Invariant cache hit.
[2024-05-28 19:51:29] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2024-05-28 19:51:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:51:29] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:51:30] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2024-05-28 19:51:30] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:51:30] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 11 ms to minimize.
[2024-05-28 19:51:30] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-28 19:51:30] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-28 19:51:30] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-28 19:51:30] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-28 19:51:30] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 19:51:30] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-28 19:51:30] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-28 19:51:30] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:51:30] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-28 19:51:30] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2024-05-28 19:51:30] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:51:30] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-28 19:51:30] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:51:31] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-05-28 19:51:31] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-28 19:51:31] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:51:31] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-28 19:51:31] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:51:31] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:51:31] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:51:31] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-28 19:51:31] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:51:32] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:51:32] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 164/343 variables, 179/235 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:51:34] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:51:34] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:51:36] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/343 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 11 (OVERLAPS) 0/343 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 238 constraints, problems are : Problem set: 0 solved, 163 unsolved in 10055 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 31/59 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/343 variables, 179/238 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 163/401 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:51:40] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-28 19:51:41] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-28 19:51:41] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:51:41] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-28 19:51:41] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 19:51:41] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-28 19:51:41] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-05-28 19:51:41] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-28 19:51:42] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 9/410 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:51:43] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-28 19:51:43] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-28 19:51:43] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:51:43] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:51:44] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-28 19:51:44] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 6/416 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 416 constraints, problems are : Problem set: 0 solved, 163 unsolved in 11986 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 46/46 constraints]
After SMT, in 22054ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 22056ms
Starting structural reductions in LTL mode, iteration 1 : 179/203 places, 164/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22236 ms. Remains : 179/203 places, 164/188 transitions.
[2024-05-28 19:51:51] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:51:51] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:51:51] [INFO ] Input system was already deterministic with 164 transitions.
[2024-05-28 19:51:51] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:51:51] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:51:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality6848301335790494778.gal : 1 ms
[2024-05-28 19:51:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality16604989462145842212.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/CTLCardinality6848301335790494778.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16604989462145842212.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.32406e+17,2.91939,100260,2,2458,5,296423,6,0,882,682633,0


Converting to forward existential form...Done !
original formula: E(!((((!((p58==0)||(p188==1)))&&(!((p209==0)||(p166==1)))) + EX(TRUE))) U AF((p98==1)))
=> equivalent forward existential formula: [(FwdU(Init,!((((!((p58==0)||(p188==1)))&&(!((p209==0)||(p166==1)))) + EX(TRUE)))) * !(EG(!((p98==1)))))] != FAL...157
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t15, t19, t25, t30, t34, t35, t38, t39, t40, t41, t42, t44, t45, t49, t53, t58, t62,...405
Detected timeout of ITS tools.
[2024-05-28 19:52:21] [INFO ] Flatten gal took : 9 ms
[2024-05-28 19:52:21] [INFO ] Applying decomposition
[2024-05-28 19:52:21] [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/graph6625672677746834504.txt' '-o' '/tmp/graph6625672677746834504.bin' '-w' '/tmp/graph6625672677746834504.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6625672677746834504.bin' '-l' '-1' '-v' '-w' '/tmp/graph6625672677746834504.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:52:21] [INFO ] Decomposing Gal with order
[2024-05-28 19:52:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:52:21] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-28 19:52:21] [INFO ] Flatten gal took : 8 ms
[2024-05-28 19:52:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 19:52:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality3900585317978793865.gal : 3 ms
[2024-05-28 19:52:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality14449803033816204068.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/CTLCardinality3900585317978793865.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14449803033816204068.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.32406e+17,0.68675,26740,548,30,42103,322,440,122237,50,853,0


Converting to forward existential form...Done !
original formula: E(!((((!((i4.u19.p58==0)||(i10.u56.p188==1)))&&(!((i12.i1.u64.p209==0)||(i12.i0.u52.p166==1)))) + EX(TRUE))) U AF((i5.i0.u31.p98==1)))
=> equivalent forward existential formula: [(FwdU(Init,!((((!((i4.u19.p58==0)||(i10.u56.p188==1)))&&(!((i12.i1.u64.p209==0)||(i12.i0.u52.p166==1)))) + EX(T...204
Reverse transition relation is NOT exact ! Due to transitions t42, t86, t130, i0.u1.t134, i1.i1.t126, i1.i1.t128, i1.i1.u5.t133, i1.i1.u8.t129, i1.i1.u9.t1...715
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 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 188/188 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 181 transition count 166
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 181 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 180 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 180 transition count 165
Applied a total of 46 rules in 13 ms. Remains 180 /203 variables (removed 23) and now considering 165/188 (removed 23) transitions.
// Phase 1: matrix 165 rows 180 cols
[2024-05-28 19:52:51] [INFO ] Computed 28 invariants in 2 ms
[2024-05-28 19:52:51] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-28 19:52:51] [INFO ] Invariant cache hit.
[2024-05-28 19:52:51] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-05-28 19:52:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:52:52] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-28 19:52:52] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:52:52] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-28 19:52:52] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-28 19:52:52] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:52:52] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:52:52] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:52:52] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:52:52] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 19:52:52] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:52:52] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-28 19:52:52] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-05-28 19:52:52] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-28 19:52:53] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-28 19:52:53] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:52:53] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-28 19:52:53] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:52:53] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:52:53] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:52:53] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:52:53] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-28 19:52:53] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-28 19:52:53] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-28 19:52:53] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 165/345 variables, 180/232 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:52:55] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 0/345 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 233 constraints, problems are : Problem set: 0 solved, 164 unsolved in 6746 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 25/53 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:52:58] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:52:59] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:52:59] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 165/345 variables, 180/236 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 164/400 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:53:00] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-28 19:53:00] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-28 19:53:00] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-28 19:53:01] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-28 19:53:01] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-28 19:53:01] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-28 19:53:01] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-28 19:53:01] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-28 19:53:01] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-28 19:53:01] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-28 19:53:01] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 11/411 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:53:02] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-28 19:53:03] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-28 19:53:03] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-05-28 19:53:03] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-28 19:53:03] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-28 19:53:03] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
[2024-05-28 19:53:04] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-28 19:53:04] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 8/419 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:53:05] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-28 19:53:05] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2024-05-28 19:53:05] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-28 19:53:05] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 4/423 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:53:07] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-28 19:53:09] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-05-28 19:53:10] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 2/426 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 13 (OVERLAPS) 0/345 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 426 constraints, problems are : Problem set: 0 solved, 164 unsolved in 18505 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 54/54 constraints]
After SMT, in 25265ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 25267ms
Starting structural reductions in LTL mode, iteration 1 : 180/203 places, 165/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25430 ms. Remains : 180/203 places, 165/188 transitions.
[2024-05-28 19:53:16] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:53:16] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:53:16] [INFO ] Input system was already deterministic with 165 transitions.
[2024-05-28 19:53:16] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:53:16] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:53:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality6571117867408033353.gal : 2 ms
[2024-05-28 19:53:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality7718410006792938413.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/CTLCardinality6571117867408033353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7718410006792938413.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.93694e+17,4.39508,116812,2,2650,5,335660,6,0,887,812233,0


Converting to forward existential form...Done !
original formula: (A(EX(E((p89!=1) U ((AF((p176==0)) * ((p136==0)||(p208==1))) * (p35==0)))) U (p6==1)) + AG((((p42==1)||(p130==0))||((p47==1)||((p47==0)&&...168
=> equivalent forward existential formula: [(FwdU((Init * !(!((E(!((p6==1)) U (!(EX(E((p89!=1) U ((!(EG(!((p176==0)))) * ((p136==0)||(p208==1))) * (p35==0)...274
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t15, t19, t24, t28, t32, t34, t35, t37, t38, t39, t40, t41, t42, t44, t45, t49, t53,...420
Detected timeout of ITS tools.
[2024-05-28 19:53:46] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:53:46] [INFO ] Applying decomposition
[2024-05-28 19:53:46] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8897355764718270464.txt' '-o' '/tmp/graph8897355764718270464.bin' '-w' '/tmp/graph8897355764718270464.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8897355764718270464.bin' '-l' '-1' '-v' '-w' '/tmp/graph8897355764718270464.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:53:46] [INFO ] Decomposing Gal with order
[2024-05-28 19:53:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:53:46] [INFO ] Removed a total of 28 redundant transitions.
[2024-05-28 19:53:46] [INFO ] Flatten gal took : 8 ms
[2024-05-28 19:53:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 19:53:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality12206172852512683709.gal : 1 ms
[2024-05-28 19:53:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality9415948905772722226.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/CTLCardinality12206172852512683709.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9415948905772722226.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.93694e+17,0.409593,18840,475,29,27929,350,432,60776,49,870,0


Converting to forward existential form...Done !
original formula: (A(EX(E((i6.i1.u30.p89!=1) U ((AF((i13.u57.p176==0)) * ((i10.u46.p136==0)||(i15.u67.p208==1))) * (i2.u11.p35==0)))) U (i1.i0.u2.p6==1)) +...264
=> equivalent forward existential formula: [(FwdU((Init * !(!((E(!((i1.i0.u2.p6==1)) U (!(EX(E((i6.i1.u30.p89!=1) U ((!(EG(!((i13.u57.p176==0)))) * ((i10.u...388
Reverse transition relation is NOT exact ! Due to transitions t38, t83, t127, t129, i0.t131, i0.i0.u6.t134, i0.i1.u7.t133, i0.i2.t112, i0.i2.t116, i1.i1.u1...730
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 188/188 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 179 transition count 164
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 179 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 178 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 178 transition count 163
Applied a total of 50 rules in 10 ms. Remains 178 /203 variables (removed 25) and now considering 163/188 (removed 25) transitions.
// Phase 1: matrix 163 rows 178 cols
[2024-05-28 19:54:16] [INFO ] Computed 28 invariants in 1 ms
[2024-05-28 19:54:17] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-28 19:54:17] [INFO ] Invariant cache hit.
[2024-05-28 19:54:17] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-28 19:54:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:54:18] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:54:18] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:54:18] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:54:18] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:54:18] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-28 19:54:18] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-28 19:54:18] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 19:54:18] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-28 19:54:18] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:54:18] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:54:18] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-05-28 19:54:18] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:54:18] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:54:18] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:54:18] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:54:18] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:54:18] [INFO ] Deduced a trap composed of 14 places in 16 ms of which 1 ms to minimize.
[2024-05-28 19:54:19] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:54:19] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:54:19] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:54:19] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:54:19] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-28 19:54:19] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:54:20] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:54:20] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 163/341 variables, 178/231 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:54:22] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:54:23] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-28 19:54:23] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (OVERLAPS) 0/341 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 234 constraints, problems are : Problem set: 0 solved, 162 unsolved in 9102 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:54:27] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 163/341 variables, 178/235 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 162/397 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:54:28] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-28 19:54:28] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:54:28] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 19:54:28] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:54:28] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:54:28] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 19:54:29] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:54:29] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 8/405 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:54:31] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2024-05-28 19:54:31] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-28 19:54:31] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-28 19:54:32] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 4/409 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:54:33] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:54:35] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:54:37] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 13 (OVERLAPS) 0/341 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 412 constraints, problems are : Problem set: 0 solved, 162 unsolved in 17934 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 44/44 constraints]
After SMT, in 27047ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 27049ms
Starting structural reductions in LTL mode, iteration 1 : 178/203 places, 163/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27284 ms. Remains : 178/203 places, 163/188 transitions.
[2024-05-28 19:54:44] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:54:44] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:54:44] [INFO ] Input system was already deterministic with 163 transitions.
[2024-05-28 19:54:44] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:54:44] [INFO ] Flatten gal took : 5 ms
[2024-05-28 19:54:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality16121409267793394807.gal : 1 ms
[2024-05-28 19:54:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality7256423184723340716.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/CTLCardinality16121409267793394807.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7256423184723340716.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.29062e+17,3.65473,99012,2,2450,5,292868,6,0,877,675011,0


Converting to forward existential form...Done !
original formula: AG(((EX(AG((p196!=0))) + (p208==1)) + AX(E(((p89==0)||(p82==1)) U (p114==1)))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !((EX(!(E(TRUE U !((p196!=0))))) + (p208==1))))) * !(E(((p89==0)||(p82==1)) U (p114==1))...166
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t15, t19, t24, t28, t33, t34, t37, t38, t39, t40, t41, t43, t44, t48, t52, t57, t61,...405
Detected timeout of ITS tools.
[2024-05-28 19:55:14] [INFO ] Flatten gal took : 6 ms
[2024-05-28 19:55:14] [INFO ] Applying decomposition
[2024-05-28 19:55:14] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17858268776064541247.txt' '-o' '/tmp/graph17858268776064541247.bin' '-w' '/tmp/graph17858268776064541247.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17858268776064541247.bin' '-l' '-1' '-v' '-w' '/tmp/graph17858268776064541247.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:55:14] [INFO ] Decomposing Gal with order
[2024-05-28 19:55:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:55:14] [INFO ] Removed a total of 33 redundant transitions.
[2024-05-28 19:55:14] [INFO ] Flatten gal took : 8 ms
[2024-05-28 19:55:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 19:55:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality9907623799339640571.gal : 2 ms
[2024-05-28 19:55:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality522334119424276991.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/CTLCardinality9907623799339640571.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality522334119424276991.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,2.29062e+17,0.454485,20676,481,29,29887,307,457,95380,47,699,0


Converting to forward existential form...Done !
original formula: AG(((EX(AG((i13.u61.p196!=0))) + (i10.i2.u64.p208==1)) + AX(E(((i7.i0.u29.p89==0)||(i9.i0.u26.p82==1)) U (i7.i1.u37.p114==1)))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !((EX(!(E(TRUE U !((i13.u61.p196!=0))))) + (i10.i2.u64.p208==1))))) * !(E(((i7.i0.u29.p8...215
Reverse transition relation is NOT exact ! Due to transitions t41, t85, t125, i0.i0.u10.t126, i0.i1.t101, i0.i1.u20.t105, i1.t129, i1.i0.t127, i1.i0.u6.t13...712
(forward)formula 0,0,1.76773,57900,1,0,81116,323,2494,335913,246,969,86601
FORMULA ShieldIIPt-PT-003B-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 203/203 places, 188/188 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 202 transition count 147
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 80 place count 162 transition count 147
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 80 place count 162 transition count 130
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 114 place count 145 transition count 130
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 128 place count 131 transition count 116
Iterating global reduction 2 with 14 rules applied. Total rules applied 142 place count 131 transition count 116
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 142 place count 131 transition count 106
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 162 place count 121 transition count 106
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 254 place count 75 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 255 place count 75 transition count 59
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 257 place count 74 transition count 58
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 259 place count 72 transition count 56
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 261 place count 70 transition count 56
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 261 place count 70 transition count 55
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 263 place count 69 transition count 55
Applied a total of 263 rules in 20 ms. Remains 69 /203 variables (removed 134) and now considering 55/188 (removed 133) transitions.
// Phase 1: matrix 55 rows 69 cols
[2024-05-28 19:55:16] [INFO ] Computed 26 invariants in 2 ms
[2024-05-28 19:55:16] [INFO ] Implicit Places using invariants in 47 ms returned [55]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 68/203 places, 55/188 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 67 transition count 54
Applied a total of 2 rules in 3 ms. Remains 67 /68 variables (removed 1) and now considering 54/55 (removed 1) transitions.
// Phase 1: matrix 54 rows 67 cols
[2024-05-28 19:55:16] [INFO ] Computed 25 invariants in 0 ms
[2024-05-28 19:55:16] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-28 19:55:16] [INFO ] Invariant cache hit.
[2024-05-28 19:55:16] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 67/203 places, 54/188 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 169 ms. Remains : 67/203 places, 54/188 transitions.
[2024-05-28 19:55:16] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:55:16] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:55:16] [INFO ] Input system was already deterministic with 54 transitions.
[2024-05-28 19:55:16] [INFO ] Flatten gal took : 1 ms
[2024-05-28 19:55:16] [INFO ] Flatten gal took : 2 ms
[2024-05-28 19:55:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality8190074703772565486.gal : 0 ms
[2024-05-28 19:55:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality18034389849472077213.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/CTLCardinality8190074703772565486.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18034389849472077213.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.44196e+09,0.047262,5424,2,264,5,9279,6,0,324,12490,0


Converting to forward existential form...Done !
original formula: EG(((p78==0)||(p109==1)))
=> equivalent forward existential formula: [FwdG(Init,((p78==0)||(p109==1)))] != FALSE
Hit Full ! (commute/partial/dont) 50/0/4
(forward)formula 0,1,0.069462,5688,1,0,9,10962,19,3,1625,12490,8
FORMULA ShieldIIPt-PT-003B-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 188/188 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 179 transition count 164
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 179 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 178 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 178 transition count 163
Applied a total of 50 rules in 6 ms. Remains 178 /203 variables (removed 25) and now considering 163/188 (removed 25) transitions.
// Phase 1: matrix 163 rows 178 cols
[2024-05-28 19:55:16] [INFO ] Computed 28 invariants in 2 ms
[2024-05-28 19:55:16] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-28 19:55:16] [INFO ] Invariant cache hit.
[2024-05-28 19:55:16] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-28 19:55:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:55:17] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:55:17] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 19:55:17] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:55:17] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:55:17] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-28 19:55:17] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:55:17] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:55:17] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-28 19:55:17] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:55:18] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:55:18] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-28 19:55:18] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-28 19:55:18] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:55:18] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:55:18] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-28 19:55:18] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-28 19:55:18] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:55:18] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-28 19:55:18] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:55:18] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:55:18] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:55:19] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:55:19] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:55:19] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-28 19:55:19] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 163/341 variables, 178/231 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:55:21] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:55:22] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:55:22] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (OVERLAPS) 0/341 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 234 constraints, problems are : Problem set: 0 solved, 162 unsolved in 9088 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 28/56 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:55:26] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 163/341 variables, 178/235 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 162/397 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:55:27] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:55:27] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:55:27] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:55:28] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:55:28] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 19:55:28] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-28 19:55:28] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-28 19:55:28] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 8/405 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:55:30] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-28 19:55:30] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-28 19:55:31] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-28 19:55:31] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 4/409 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:55:32] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:55:35] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-28 19:55:36] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 13 (OVERLAPS) 0/341 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 412 constraints, problems are : Problem set: 0 solved, 162 unsolved in 18326 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 44/44 constraints]
After SMT, in 27428ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 27429ms
Starting structural reductions in LTL mode, iteration 1 : 178/203 places, 163/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27601 ms. Remains : 178/203 places, 163/188 transitions.
[2024-05-28 19:55:44] [INFO ] Flatten gal took : 11 ms
[2024-05-28 19:55:44] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:55:44] [INFO ] Input system was already deterministic with 163 transitions.
[2024-05-28 19:55:44] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:55:44] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:55:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality9358498458070767663.gal : 1 ms
[2024-05-28 19:55:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality6339704326200092123.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/CTLCardinality9358498458070767663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6339704326200092123.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.29062e+17,3.23903,99888,2,2450,5,292868,6,0,877,675011,0


Converting to forward existential form...Done !
original formula: AX(EF(AX(((p195==1)&&((p86==0)||(p7==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(EX(!(((p195==1)&&((p86==0)||(p7==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t15, t19, t24, t28, t33, t34, t37, t38, t39, t40, t41, t43, t44, t48, t52, t57, t61,...405
Detected timeout of ITS tools.
[2024-05-28 19:56:14] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:56:14] [INFO ] Applying decomposition
[2024-05-28 19:56:14] [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/graph18444373532490145488.txt' '-o' '/tmp/graph18444373532490145488.bin' '-w' '/tmp/graph18444373532490145488.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18444373532490145488.bin' '-l' '-1' '-v' '-w' '/tmp/graph18444373532490145488.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:56:14] [INFO ] Decomposing Gal with order
[2024-05-28 19:56:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:56:14] [INFO ] Removed a total of 33 redundant transitions.
[2024-05-28 19:56:14] [INFO ] Flatten gal took : 8 ms
[2024-05-28 19:56:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 19:56:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality15860441796140988431.gal : 2 ms
[2024-05-28 19:56:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality2027755875269150628.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/CTLCardinality15860441796140988431.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2027755875269150628.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.29062e+17,0.713012,27516,533,29,41373,299,435,128520,47,716,0


Converting to forward existential form...Done !
original formula: AX(EF(AX(((i13.u60.p195==1)&&((i7.i0.u27.p86==0)||(i2.i0.u2.p7==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(EX(!(((i13.u60.p195==1)&&((i7.i0.u27.p86==0)||(i2.i0.u2.p7==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t41, t85, t127, t129, i0.u1.t133, i0.u8.t128, i1.t118, i1.u12.t122, i2.i1.t125, i2.i1.u5.t132...687
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 188/188 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 180 transition count 165
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 180 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 179 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 179 transition count 164
Applied a total of 48 rules in 6 ms. Remains 179 /203 variables (removed 24) and now considering 164/188 (removed 24) transitions.
// Phase 1: matrix 164 rows 179 cols
[2024-05-28 19:56:44] [INFO ] Computed 28 invariants in 6 ms
[2024-05-28 19:56:44] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-28 19:56:44] [INFO ] Invariant cache hit.
[2024-05-28 19:56:44] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2024-05-28 19:56:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:56:45] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:56:45] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 19:56:45] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:56:45] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:56:45] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-28 19:56:45] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:56:45] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:56:45] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-28 19:56:45] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:56:45] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:56:45] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:56:45] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:56:45] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:56:46] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:56:46] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-28 19:56:46] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:56:46] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:56:46] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:56:46] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:56:46] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:56:46] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:56:46] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:56:46] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:56:46] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 164/343 variables, 179/231 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:56:48] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
[2024-05-28 19:56:48] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:56:48] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-28 19:56:48] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 4/235 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:56:49] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 19:56:50] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-28 19:56:50] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 238 constraints, problems are : Problem set: 0 solved, 163 unsolved in 8427 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 31/59 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/343 variables, 179/238 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 163/401 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:56:54] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 2 ms to minimize.
[2024-05-28 19:56:54] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-28 19:56:54] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
[2024-05-28 19:56:54] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 19:56:55] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 19:56:55] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-28 19:56:55] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 7/408 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:56:56] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-28 19:56:57] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-28 19:56:57] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-28 19:56:57] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 4/412 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:56:59] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:57:01] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-05-28 19:57:01] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-28 19:57:02] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 3/416 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-28 19:57:03] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 12 (OVERLAPS) 0/343 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 417 constraints, problems are : Problem set: 0 solved, 163 unsolved in 16617 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 47/47 constraints]
After SMT, in 25066ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 25068ms
Starting structural reductions in LTL mode, iteration 1 : 179/203 places, 164/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25262 ms. Remains : 179/203 places, 164/188 transitions.
[2024-05-28 19:57:09] [INFO ] Flatten gal took : 7 ms
[2024-05-28 19:57:09] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:57:09] [INFO ] Input system was already deterministic with 164 transitions.
[2024-05-28 19:57:09] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:57:09] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:57:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality12106940324910629404.gal : 1 ms
[2024-05-28 19:57:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality2925408956668803949.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/CTLCardinality12106940324910629404.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2925408956668803949.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.58867e+17,3.78452,108704,2,2608,5,316186,6,0,882,746419,0


Converting to forward existential form...Done !
original formula: A(!(EX(EX((p53==1)))) U EF(!(AX((p46==0)))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U !(!(EX(!((p46==0)))))))))) * !(E(!(E(TRUE U !(!(EX(!((p46==0))))))) U (!(!(EX(EX((p53=...213
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t15, t19, t24, t28, t33, t34, t37, t38, t39, t40, t41, t43, t44, t48, t52, t57, t61,...411
Detected timeout of ITS tools.
[2024-05-28 19:57:39] [INFO ] Flatten gal took : 4 ms
[2024-05-28 19:57:39] [INFO ] Applying decomposition
[2024-05-28 19:57:39] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2390044080543825194.txt' '-o' '/tmp/graph2390044080543825194.bin' '-w' '/tmp/graph2390044080543825194.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2390044080543825194.bin' '-l' '-1' '-v' '-w' '/tmp/graph2390044080543825194.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:57:39] [INFO ] Decomposing Gal with order
[2024-05-28 19:57:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:57:39] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-28 19:57:39] [INFO ] Flatten gal took : 9 ms
[2024-05-28 19:57:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-28 19:57:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality14100617708967095552.gal : 2 ms
[2024-05-28 19:57:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality16521830909387439190.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/CTLCardinality14100617708967095552.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16521830909387439190.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,2.58867e+17,0.523757,21748,625,29,29130,264,459,109130,49,554,0


Converting to forward existential form...Done !
original formula: A(!(EX(EX((i4.u19.p53==1)))) U EF(!(AX((i0.i1.u15.p46==0)))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U !(!(EX(!((i0.i1.u15.p46==0)))))))))) * !(E(!(E(TRUE U !(!(EX(!((i0.i1.u15.p46==0))))))...250
Reverse transition relation is NOT exact ! Due to transitions t41, t85, t130, i0.i0.u7.t132, i0.i1.t111, i0.i1.t115, i1.t57, i1.u42.t61, i2.t128, i2.t126, ...713
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 188/188 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 185 transition count 170
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 185 transition count 170
Applied a total of 36 rules in 3 ms. Remains 185 /203 variables (removed 18) and now considering 170/188 (removed 18) transitions.
// Phase 1: matrix 170 rows 185 cols
[2024-05-28 19:58:09] [INFO ] Computed 28 invariants in 3 ms
[2024-05-28 19:58:09] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-28 19:58:09] [INFO ] Invariant cache hit.
[2024-05-28 19:58:09] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-05-28 19:58:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-28 19:58:10] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:58:10] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 19:58:10] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:58:10] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-28 19:58:11] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-28 19:58:11] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:58:11] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:58:11] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-28 19:58:11] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:58:11] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:58:11] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:58:11] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:58:11] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:58:11] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:58:11] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:58:11] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 19:58:11] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-28 19:58:11] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:58:11] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-28 19:58:11] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-28 19:58:12] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:58:12] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-28 19:58:13] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:58:13] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-28 19:58:14] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 19:58:14] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (OVERLAPS) 170/355 variables, 185/239 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (OVERLAPS) 0/355 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 239 constraints, problems are : Problem set: 0 solved, 169 unsolved in 8618 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 26/54 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (OVERLAPS) 170/355 variables, 185/239 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 169/408 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-28 19:58:20] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:58:20] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-28 19:58:20] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:58:20] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-28 19:58:20] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-28 19:58:20] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 19:58:20] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-28 19:58:20] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-28 19:58:21] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-28 19:58:21] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:58:21] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 19:58:21] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-28 19:58:21] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-28 19:58:21] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 14/422 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-28 19:58:23] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-28 19:58:23] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-28 19:58:23] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 19:58:23] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-28 19:58:23] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-28 19:58:24] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 6/428 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-28 19:58:26] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-28 19:58:28] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-28 19:58:28] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-28 19:58:28] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 2 ms to minimize.
[2024-05-28 19:58:29] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 4/433 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-28 19:58:30] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-28 19:58:33] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-28 19:58:33] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 2/436 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 13 (OVERLAPS) 0/355 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 355/355 variables, and 436 constraints, problems are : Problem set: 0 solved, 169 unsolved in 22178 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 54/54 constraints]
After SMT, in 30813ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 30815ms
Starting structural reductions in LTL mode, iteration 1 : 185/203 places, 170/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30980 ms. Remains : 185/203 places, 170/188 transitions.
[2024-05-28 19:58:40] [INFO ] Flatten gal took : 8 ms
[2024-05-28 19:58:40] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:58:40] [INFO ] Input system was already deterministic with 170 transitions.
[2024-05-28 19:58:40] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:58:40] [INFO ] Flatten gal took : 3 ms
[2024-05-28 19:58:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality15259886416339933988.gal : 1 ms
[2024-05-28 19:58:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality1969162641853540565.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/CTLCardinality15259886416339933988.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1969162641853540565.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.38801e+17,6.72447,189536,2,3775,5,504497,6,0,912,1.36498e+06,0


Converting to forward existential form...Done !
original formula: AF(((AG((p19==0)) * EG((((p152==0)||(p208==1))||(((p195==0)&&(p16==1))&&((p98==0)||(p162==1)))))) * ((E(AX((p172==0)) U !((((p72==0)||(p1...342
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(TRUE U !((p19==0)))) * EG((((p152==0)||(p208==1))||(((p195==0)&&(p16==1))&&((p98==0)||(p162==...417
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t15, t19, t24, t28, t32, t36, t39, t40, t41, t42, t43, t45, t46, t50, t54, t59, t63,...433
Detected timeout of ITS tools.
[2024-05-28 19:59:10] [INFO ] Flatten gal took : 8 ms
[2024-05-28 19:59:10] [INFO ] Applying decomposition
[2024-05-28 19:59:10] [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/graph11087501593102221837.txt' '-o' '/tmp/graph11087501593102221837.bin' '-w' '/tmp/graph11087501593102221837.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11087501593102221837.bin' '-l' '-1' '-v' '-w' '/tmp/graph11087501593102221837.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:59:10] [INFO ] Decomposing Gal with order
[2024-05-28 19:59:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:59:10] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-28 19:59:10] [INFO ] Flatten gal took : 9 ms
[2024-05-28 19:59:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 19:59:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality7528569235355821283.gal : 2 ms
[2024-05-28 19:59:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality1523813762418194738.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/CTLCardinality7528569235355821283.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1523813762418194738.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.38801e+17,0.412202,19156,567,29,26670,313,473,84122,49,753,0


Converting to forward existential form...Done !
original formula: AF(((AG((i0.i1.u7.p19==0)) * EG((((i10.i1.u53.p152==0)||(i10.i2.u70.p208==1))||(((i13.u67.p195==0)&&(i0.i0.u5.p16==1))&&((i8.i0.u32.p98==...541
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(TRUE U !((i0.i1.u7.p19==0)))) * EG((((i10.i1.u53.p152==0)||(i10.i2.u70.p208==1))||(((i13.u67....616
Reverse transition relation is NOT exact ! Due to transitions t43, t90, t132, t134, i0.t136, i0.i0.u5.t139, i0.i1.u6.t138, i0.i2.t116, i0.i2.t120, i1.i1.u0...762
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 188/188 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 182 transition count 167
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 182 transition count 167
Applied a total of 42 rules in 5 ms. Remains 182 /203 variables (removed 21) and now considering 167/188 (removed 21) transitions.
// Phase 1: matrix 167 rows 182 cols
[2024-05-28 19:59:40] [INFO ] Computed 28 invariants in 3 ms
[2024-05-28 19:59:40] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-28 19:59:40] [INFO ] Invariant cache hit.
[2024-05-28 19:59:40] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-28 19:59:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-28 19:59:41] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:59:42] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:59:42] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-28 19:59:42] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:59:42] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:59:42] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:59:42] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:59:42] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-28 19:59:42] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 2 ms to minimize.
[2024-05-28 19:59:42] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:59:42] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 19:59:42] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-28 19:59:42] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-28 19:59:42] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:59:42] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-05-28 19:59:42] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-28 19:59:42] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:59:42] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-28 19:59:42] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 19:59:42] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-28 19:59:43] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 19:59:43] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-28 19:59:43] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-28 19:59:43] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 19:59:43] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-28 19:59:43] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 19:59:43] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-28 19:59:43] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 19:59:43] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-28 19:59:43] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-28 19:59:43] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:59:43] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-28 19:59:44] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 167/349 variables, 182/243 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-28 19:59:46] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (OVERLAPS) 0/349 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 244 constraints, problems are : Problem set: 0 solved, 166 unsolved in 8512 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 34/62 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-28 19:59:50] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-28 19:59:50] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-28 19:59:51] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-28 19:59:51] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 167/349 variables, 182/248 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 166/414 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-28 19:59:53] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-28 19:59:53] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-28 19:59:53] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-28 19:59:53] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-28 19:59:54] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-28 19:59:54] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 6/420 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-28 19:59:55] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:59:55] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2024-05-28 19:59:55] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-28 19:59:55] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-28 19:59:56] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-28 19:59:56] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/349 variables, 6/426 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-28 19:59:58] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-28 19:59:58] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-28 19:59:58] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 19:59:59] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-28 19:59:59] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 5/431 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/349 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 13 (OVERLAPS) 0/349 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/349 variables, and 431 constraints, problems are : Problem set: 0 solved, 166 unsolved in 16332 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 55/55 constraints]
After SMT, in 24856ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 24858ms
Starting structural reductions in LTL mode, iteration 1 : 182/203 places, 167/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25029 ms. Remains : 182/203 places, 167/188 transitions.
[2024-05-28 20:00:05] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:00:05] [INFO ] Flatten gal took : 6 ms
[2024-05-28 20:00:05] [INFO ] Input system was already deterministic with 167 transitions.
[2024-05-28 20:00:05] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:00:05] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:00:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality17753883936556337690.gal : 1 ms
[2024-05-28 20:00:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality10612063378981855011.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/CTLCardinality17753883936556337690.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10612063378981855011.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.51317e+17,5.13459,152680,2,3827,5,440165,6,0,897,1.06923e+06,0


Converting to forward existential form...Done !
original formula: AG((((EF(AX(FALSE)) + AX(((p66==0)&&(p168==1)))) + (EF(((p5==0)||((((p122==1)||(p108==0))||(p146==1))&&((p210==0)||(p24==1))))) + (p103==...185
=> equivalent forward existential formula: [(EY((((FwdU(Init,TRUE) * !(((p160==0)||(p57==1)))) * !((E(TRUE U ((p5==0)||((((p122==1)||(p108==0))||(p146==1))...266
Reverse transition relation is NOT exact ! Due to transitions t6, t11, t13, t16, t20, t25, t29, t32, t35, t36, t39, t40, t41, t42, t43, t45, t46, t50, t54,...431
Detected timeout of ITS tools.
[2024-05-28 20:00:35] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:00:35] [INFO ] Applying decomposition
[2024-05-28 20:00:35] [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/graph7868031308381922822.txt' '-o' '/tmp/graph7868031308381922822.bin' '-w' '/tmp/graph7868031308381922822.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7868031308381922822.bin' '-l' '-1' '-v' '-w' '/tmp/graph7868031308381922822.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:00:35] [INFO ] Decomposing Gal with order
[2024-05-28 20:00:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:00:35] [INFO ] Removed a total of 28 redundant transitions.
[2024-05-28 20:00:35] [INFO ] Flatten gal took : 10 ms
[2024-05-28 20:00:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 20:00:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality11202061517512552026.gal : 2 ms
[2024-05-28 20:00:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality17197793747044412173.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/CTLCardinality11202061517512552026.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17197793747044412173.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.51317e+17,0.452863,19644,685,29,31092,321,461,70424,49,762,0


Converting to forward existential form...Done !
original formula: AG((((EF(AX(FALSE)) + AX(((i3.u21.p66==0)&&(i12.u55.p168==1)))) + (EF(((i4.i1.u1.p5==0)||((((i8.u42.p122==1)||(i5.u33.p108==0))||(i9.i0.u...275
=> equivalent forward existential formula: [(EY((((FwdU(Init,TRUE) * !(((i11.u52.p160==0)||(i4.i0.u17.p57==1)))) * !((E(TRUE U ((i4.i1.u1.p5==0)||((((i8.u4...356
Reverse transition relation is NOT exact ! Due to transitions t43, t88, t129, i0.i0.u9.t130, i0.i1.t114, i0.i1.t118, i1.t133, i1.i0.t131, i1.i0.u5.t136, i1...751
Detected timeout of ITS tools.
[2024-05-28 20:01:05] [INFO ] Flatten gal took : 7 ms
[2024-05-28 20:01:05] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:01:05] [INFO ] Applying decomposition
[2024-05-28 20:01:05] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14493146589948392325.txt' '-o' '/tmp/graph14493146589948392325.bin' '-w' '/tmp/graph14493146589948392325.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14493146589948392325.bin' '-l' '-1' '-v' '-w' '/tmp/graph14493146589948392325.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:01:06] [INFO ] Decomposing Gal with order
[2024-05-28 20:01:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:01:06] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-28 20:01:06] [INFO ] Flatten gal took : 8 ms
[2024-05-28 20:01:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 20:01:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality1418721643207804328.gal : 1 ms
[2024-05-28 20:01:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality9810295366154800949.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/CTLCardinality1418721643207804328.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9810295366154800949.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 9 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.08918e+18,3.60286,87336,1678,40,123620,262,482,434103,58,724,0


Converting to forward existential form...Done !
original formula: (A(!(((i7.u28.p80==0)||(i12.u68.p187==1))) U EX(E(((!((i12.u69.p189==0)||(i1.u14.p41==1)))&&(i14.i1.i1.u77.p209!=1)) U (((i14.i0.i0.u56.p...423
=> equivalent forward existential formula: [FwdG((Init * !((E(!(EX(E(((!((i12.u69.p189==0)||(i1.u14.p41==1)))&&(i14.i1.i1.u77.p209!=1)) U (((i14.i0.i0.u56....885
Reverse transition relation is NOT exact ! Due to transitions t50, t154, i0.t118, i0.u22.t111, i0.u22.t116, i0.u25.t112, i0.u25.t119, i1.t148, i1.u11.t147,...1050
Detected timeout of ITS tools.
[2024-05-28 20:26:46] [INFO ] Applying decomposition
[2024-05-28 20:26:46] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:26:46] [INFO ] Decomposing Gal with order
[2024-05-28 20:26:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:26:46] [INFO ] Flatten gal took : 6 ms
[2024-05-28 20:26:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-28 20:26:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality2660318261935321060.gal : 2 ms
[2024-05-28 20:26:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality5282279321064908253.ctl : 14 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/CTLCardinality2660318261935321060.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5282279321064908253.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 9 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.08918e+18,168.668,4840912,3440,372,8.56912e+06,946,311,3.95446e+07,130,10200,0


Converting to forward existential form...Done !
original formula: (A(!(((i0.i1.i0.i0.i0.i0.u79.p80==0)||(i1.i0.i0.u52.p187==1))) U EX(E(((!((i1.i0.i0.u52.p189==0)||(i0.i0.i1.i0.i0.i0.u17.p41==1)))&&(i1.u...593
=> equivalent forward existential formula: [FwdG((Init * !((E(!(EX(E(((!((i1.i0.i0.u52.p189==0)||(i0.i0.i1.i0.i0.i0.u17.p41==1)))&&(i1.u54.p209!=1)) U (((i...1155
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u3.t158, i0.i0.i1.u20.t111, i0.i0.i1.u20.t112, i0.i0.i1.u20.t116, i0.i0.i1.u20.t118, i0...1830
ITS-tools command line returned an error code 137
[2024-05-28 20:41:43] [INFO ] Flatten gal took : 12 ms
[2024-05-28 20:41:43] [INFO ] Input system was already deterministic with 188 transitions.
[2024-05-28 20:41:44] [INFO ] Transformed 203 places.
[2024-05-28 20:41:44] [INFO ] Transformed 188 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 20:41:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality11494121391500897692.gal : 2 ms
[2024-05-28 20:41:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality14451808252283356812.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/CTLCardinality11494121391500897692.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14451808252283356812.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.08918e+18,7.15877,178384,2,10720,5,646457,6,0,1002,1.06795e+06,0


Converting to forward existential form...Done !
original formula: (A(!(((p80==0)||(p187==1))) U EX(E(((!((p189==0)||(p41==1)))&&(p209!=1)) U (((p152==0)&&((p154==0)||(p0==1)))||(!((p43==0)||(p149==1)))))...269
=> equivalent forward existential formula: [FwdG((Init * !((E(!(EX(E(((!((p189==0)||(p41==1)))&&(p209!=1)) U (((p152==0)&&((p154==0)||(p0==1)))||(!((p43==0...563
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t11, t13, t17, t18, t22, t24, t25, t29, t33, t34, t37, t38, t44, t45, t46, t47, t48, ...563

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="ShieldIIPt-PT-003B"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-PT-003B, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683760600217"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-003B.tgz
mv ShieldIIPt-PT-003B execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;