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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.7K Apr 23 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Apr 12 20:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 20:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 20:36 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 67K 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-004B-CTLCardinality-2024-00
FORMULA_NAME ShieldIIPt-PT-004B-CTLCardinality-2024-01
FORMULA_NAME ShieldIIPt-PT-004B-CTLCardinality-2024-02
FORMULA_NAME ShieldIIPt-PT-004B-CTLCardinality-2024-03
FORMULA_NAME ShieldIIPt-PT-004B-CTLCardinality-2024-04
FORMULA_NAME ShieldIIPt-PT-004B-CTLCardinality-2024-05
FORMULA_NAME ShieldIIPt-PT-004B-CTLCardinality-2024-06
FORMULA_NAME ShieldIIPt-PT-004B-CTLCardinality-2024-07
FORMULA_NAME ShieldIIPt-PT-004B-CTLCardinality-2024-08
FORMULA_NAME ShieldIIPt-PT-004B-CTLCardinality-2024-09
FORMULA_NAME ShieldIIPt-PT-004B-CTLCardinality-2024-10
FORMULA_NAME ShieldIIPt-PT-004B-CTLCardinality-2024-11
FORMULA_NAME ShieldIIPt-PT-004B-CTLCardinality-2023-12
FORMULA_NAME ShieldIIPt-PT-004B-CTLCardinality-2023-13
FORMULA_NAME ShieldIIPt-PT-004B-CTLCardinality-2023-14
FORMULA_NAME ShieldIIPt-PT-004B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716926917172

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-004B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-28 20:08:38] [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 20:08:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 20:08:38] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-05-28 20:08:38] [INFO ] Transformed 283 places.
[2024-05-28 20:08:38] [INFO ] Transformed 263 transitions.
[2024-05-28 20:08:38] [INFO ] Found NUPN structural information;
[2024-05-28 20:08:38] [INFO ] Parsed PT model containing 283 places and 263 transitions and 654 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Support contains 127 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 263/263 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 261 transition count 241
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 261 transition count 241
Applied a total of 44 rules in 41 ms. Remains 261 /283 variables (removed 22) and now considering 241/263 (removed 22) transitions.
// Phase 1: matrix 241 rows 261 cols
[2024-05-28 20:08:38] [INFO ] Computed 37 invariants in 20 ms
[2024-05-28 20:08:38] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-28 20:08:38] [INFO ] Invariant cache hit.
[2024-05-28 20:08:39] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2024-05-28 20:08:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/261 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 20:08:41] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 10 ms to minimize.
[2024-05-28 20:08:41] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-28 20:08:41] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:08:41] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:08:41] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:08:41] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2024-05-28 20:08:41] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:08:41] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:08:41] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 0 ms to minimize.
[2024-05-28 20:08:41] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:08:41] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:08:41] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-28 20:08:41] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-28 20:08:42] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-05-28 20:08:42] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:08:42] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:08:42] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2024-05-28 20:08:42] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:08:42] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:08:42] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 20:08:42] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:08:42] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:08:43] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-28 20:08:43] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:08:43] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:08:43] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:08:43] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 2 ms to minimize.
[2024-05-28 20:08:43] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:08:43] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 20:08:43] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:08:43] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:08:43] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:08:43] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:08:43] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:08:43] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:08:43] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:08:43] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:08:43] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:08:44] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 19/76 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 20:08:45] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:08:46] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 20:08:46] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:08:47] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:08:47] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:08:47] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:08:47] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 5/83 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 20:08:47] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:08:47] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 20:08:50] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:08:50] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 20:08:52] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 20:08:52] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:08:53] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 11 (OVERLAPS) 241/502 variables, 261/351 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 20:08:56] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:08:56] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:08:57] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/502 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 20:08:59] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:09:00] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-28 20:09:00] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/502 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 20:09:01] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/502 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 20:09:02] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:09:03] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/502 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 20:09:06] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:09:06] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:09:06] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/502 variables, 3/363 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/502 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/502 variables, and 363 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 65/65 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/261 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 65/102 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (OVERLAPS) 241/502 variables, 261/363 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 240/603 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 20:09:12] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:09:12] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-05-28 20:09:13] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:09:13] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:09:13] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-28 20:09:13] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 20:09:13] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 20:09:13] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-28 20:09:13] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-28 20:09:14] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-05-28 20:09:14] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-28 20:09:14] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-28 20:09:14] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
[2024-05-28 20:09:14] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-28 20:09:15] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-28 20:09:15] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 20:09:15] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 17/620 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 20:09:18] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-05-28 20:09:19] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 2 ms to minimize.
[2024-05-28 20:09:19] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2024-05-28 20:09:19] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-28 20:09:19] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-28 20:09:20] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:09:21] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 7/627 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 20:09:24] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-28 20:09:25] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2024-05-28 20:09:25] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 3/630 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 20:09:28] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-28 20:09:30] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/502 variables, 2/632 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/502 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 20:09:38] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-28 20:09:38] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 502/502 variables, and 634 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 96/96 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in LTL mode, iteration 1 : 261/283 places, 241/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60601 ms. Remains : 261/283 places, 241/263 transitions.
Support contains 127 out of 261 places after structural reductions.
[2024-05-28 20:09:39] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 20:09:39] [INFO ] Flatten gal took : 40 ms
FORMULA ShieldIIPt-PT-004B-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 20:09:39] [INFO ] Flatten gal took : 17 ms
[2024-05-28 20:09:39] [INFO ] Input system was already deterministic with 241 transitions.
Support contains 105 out of 261 places (down from 127) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1727 ms. (23 steps per ms) remains 2/75 properties
BEST_FIRST walk for 40003 steps (8 resets) in 156 ms. (254 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
[2024-05-28 20:09:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 227/261 variables, 34/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 241/502 variables, 261/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/502 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 502/502 variables, and 298 constraints, problems are : Problem set: 0 solved, 1 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 227/261 variables, 34/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 20:09:40] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:09:40] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:09:40] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:09:40] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:09:40] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 241/502 variables, 261/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 20:09:40] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 0 ms to minimize.
[2024-05-28 20:09:40] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-28 20:09:40] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 3/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/502 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/502 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 502/502 variables, and 307 constraints, problems are : Problem set: 0 solved, 1 unsolved in 447 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 590ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 43 ms.
Support contains 3 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 241/241 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 261 transition count 184
Reduce places removed 57 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 58 rules applied. Total rules applied 115 place count 204 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 116 place count 203 transition count 183
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 116 place count 203 transition count 163
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 156 place count 183 transition count 163
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 170 place count 169 transition count 149
Iterating global reduction 3 with 14 rules applied. Total rules applied 184 place count 169 transition count 149
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 184 place count 169 transition count 139
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 204 place count 159 transition count 139
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 336 place count 93 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 337 place count 93 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 339 place count 92 transition count 71
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 361 place count 81 transition count 78
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 362 place count 81 transition count 77
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 366 place count 81 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 367 place count 80 transition count 76
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 369 place count 78 transition count 76
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 369 place count 78 transition count 75
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 371 place count 77 transition count 75
Applied a total of 371 rules in 63 ms. Remains 77 /261 variables (removed 184) and now considering 75/241 (removed 166) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 77/261 places, 75/241 transitions.
RANDOM walk for 40000 steps (8 resets) in 312 ms. (127 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1789405 steps, run timeout after 3001 ms. (steps per millisecond=596 ) properties seen :0 out of 1
Probabilistic random walk after 1789405 steps, saw 1283184 distinct states, run finished after 3004 ms. (steps per millisecond=595 ) properties seen :0
// Phase 1: matrix 75 rows 77 cols
[2024-05-28 20:09:43] [INFO ] Computed 35 invariants in 2 ms
[2024-05-28 20:09:43] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/17 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/42 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/80 variables, 18/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/81 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/81 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/81 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/82 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/82 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/82 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 44/126 variables, 22/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/126 variables, 9/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/126 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/128 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/128 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/128 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 4/132 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/132 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 20/152 variables, 16/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/152 variables, 6/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/152 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/152 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 115 constraints, problems are : Problem set: 0 solved, 1 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, State Equation: 77/77 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/17 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/42 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/80 variables, 18/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 20:09:44] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/80 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/80 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/81 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/81 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/81 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/82 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/82 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/82 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 44/126 variables, 22/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/126 variables, 9/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/126 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/128 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/128 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/128 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 4/132 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/132 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 20/152 variables, 16/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/152 variables, 6/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/152 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/152 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 117 constraints, problems are : Problem set: 0 solved, 1 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, State Equation: 77/77 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 228ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 77 /77 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 77/77 places, 75/75 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 77 /77 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2024-05-28 20:09:44] [INFO ] Invariant cache hit.
[2024-05-28 20:09:44] [INFO ] Implicit Places using invariants in 59 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 76/77 places, 75/75 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 75 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 75 transition count 74
Applied a total of 2 rules in 3 ms. Remains 75 /76 variables (removed 1) and now considering 74/75 (removed 1) transitions.
// Phase 1: matrix 74 rows 75 cols
[2024-05-28 20:09:44] [INFO ] Computed 34 invariants in 2 ms
[2024-05-28 20:09:44] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-28 20:09:44] [INFO ] Invariant cache hit.
[2024-05-28 20:09:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-28 20:09:44] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 75/77 places, 74/75 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 203 ms. Remains : 75/77 places, 74/75 transitions.
RANDOM walk for 40000 steps (9 resets) in 198 ms. (201 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1691829 steps, run timeout after 3001 ms. (steps per millisecond=563 ) properties seen :0 out of 1
Probabilistic random walk after 1691829 steps, saw 1237315 distinct states, run finished after 3001 ms. (steps per millisecond=563 ) properties seen :0
[2024-05-28 20:09:47] [INFO ] Invariant cache hit.
[2024-05-28 20:09:47] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/17 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/42 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 37/79 variables, 18/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 44/123 variables, 22/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/123 variables, 9/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/123 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/125 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/125 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/125 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/129 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/129 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 20/149 variables, 16/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/149 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/149 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/149 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 111 constraints, problems are : Problem set: 0 solved, 1 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 75/75 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/17 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/42 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 37/79 variables, 18/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 44/123 variables, 22/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/123 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/123 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/125 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/125 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/125 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/129 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/129 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 20/149 variables, 16/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/149 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/149 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/149 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 75/75 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 184ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 75/75 places, 74/74 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-28 20:09:47] [INFO ] Invariant cache hit.
[2024-05-28 20:09:47] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-28 20:09:47] [INFO ] Invariant cache hit.
[2024-05-28 20:09:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-28 20:09:47] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-05-28 20:09:47] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-28 20:09:47] [INFO ] Invariant cache hit.
[2024-05-28 20:09:47] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 2/75 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-28 20:09:48] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 74/149 variables, 75/110 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/149 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 112 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1026 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 75/75 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 2/75 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 74/149 variables, 75/110 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 72/184 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (OVERLAPS) 0/149 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 184 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1111 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 75/75 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 1/1 constraints]
After SMT, in 2153ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 2154ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2291 ms. Remains : 75/75 places, 74/74 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 75 transition count 74
Applied a total of 10 rules in 7 ms. Remains 75 /75 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 74 rows 75 cols
[2024-05-28 20:09:49] [INFO ] Computed 34 invariants in 1 ms
[2024-05-28 20:09:50] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 20:09:50] [INFO ] [Nat]Absence check using 34 positive place invariants in 13 ms returned sat
[2024-05-28 20:09:50] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 20:09:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-28 20:09:50] [INFO ] After 8ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 20:09:50] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 20:09:50] [INFO ] After 97ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 149 ms.
[2024-05-28 20:09:50] [INFO ] Flatten gal took : 11 ms
[2024-05-28 20:09:50] [INFO ] Flatten gal took : 13 ms
[2024-05-28 20:09:50] [INFO ] Input system was already deterministic with 241 transitions.
Computed a total of 71 stabilizing places and 71 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 241/241 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 241 transition count 221
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 241 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 240 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 240 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 239 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 239 transition count 219
Applied a total of 44 rules in 19 ms. Remains 239 /261 variables (removed 22) and now considering 219/241 (removed 22) transitions.
// Phase 1: matrix 219 rows 239 cols
[2024-05-28 20:09:50] [INFO ] Computed 37 invariants in 2 ms
[2024-05-28 20:09:50] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-28 20:09:50] [INFO ] Invariant cache hit.
[2024-05-28 20:09:50] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-05-28 20:09:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:09:52] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:09:52] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:09:52] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:09:52] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-28 20:09:52] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-28 20:09:52] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:09:52] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-28 20:09:52] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-05-28 20:09:52] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:09:52] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-28 20:09:52] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:09:52] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:09:52] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-28 20:09:52] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:09:53] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:09:53] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:09:53] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-28 20:09:53] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 20:09:53] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-28 20:09:53] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:09:53] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:09:53] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:09:54] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-28 20:09:54] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:09:54] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 20:09:54] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-28 20:09:54] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:09:54] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:09:54] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-28 20:09:54] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:09:54] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 11/68 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:09:56] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:09:57] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:09:57] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 219/458 variables, 239/310 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:10:00] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-28 20:10:00] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-28 20:10:00] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 2 ms to minimize.
[2024-05-28 20:10:01] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 4/314 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:10:03] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:10:05] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:10:05] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:10:06] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/458 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:10:09] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/458 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:10:12] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/458 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:10:14] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/458 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:10:15] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/458 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/458 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 19 (OVERLAPS) 0/458 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 322 constraints, problems are : Problem set: 0 solved, 218 unsolved in 29559 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 46/83 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/458 variables, 239/322 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 218/540 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:10:22] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-28 20:10:22] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-28 20:10:22] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 20:10:22] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:10:23] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-28 20:10:23] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-28 20:10:23] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-28 20:10:24] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-28 20:10:24] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-28 20:10:24] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-28 20:10:24] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-28 20:10:24] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:10:24] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-28 20:10:25] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 14/554 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:10:31] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-28 20:10:31] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-28 20:10:32] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/458 variables, 3/557 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (OVERLAPS) 0/458 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 557 constraints, problems are : Problem set: 0 solved, 218 unsolved in 24400 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 63/63 constraints]
After SMT, in 53981ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 53984ms
Starting structural reductions in LTL mode, iteration 1 : 239/261 places, 219/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54226 ms. Remains : 239/261 places, 219/241 transitions.
[2024-05-28 20:10:44] [INFO ] Flatten gal took : 11 ms
[2024-05-28 20:10:44] [INFO ] Flatten gal took : 10 ms
[2024-05-28 20:10:44] [INFO ] Input system was already deterministic with 219 transitions.
[2024-05-28 20:10:44] [INFO ] Flatten gal took : 10 ms
[2024-05-28 20:10:44] [INFO ] Flatten gal took : 10 ms
[2024-05-28 20:10:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality14214562490932425408.gal : 5 ms
[2024-05-28 20:10:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality5714595597639965206.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14214562490932425408.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5714595597639965206.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.10649e+23,9.5943,272708,2,3547,5,766669,6,0,1177,1.97093e+06,0


Converting to forward existential form...Done !
original formula: EG(E(EF((p117==0)) U ((AF((p170!=1)) * AF((p13==0))) * (E((p37!=1) U ((p139==1)&&(p198==0))) * A(AX((p63==1)) U (p38==0))))))
=> equivalent forward existential formula: [FwdG(Init,E(E(TRUE U (p117==0)) U ((!(EG(!((p170!=1)))) * !(EG(!((p13==0))))) * (E((p37!=1) U ((p139==1)&&(p198...255
Reverse transition relation is NOT exact ! Due to transitions t7, t11, t16, t20, t25, t29, t34, t35, t38, t39, t40, t41, t42, t44, t45, t49, t53, t58, t62,...505
Detected timeout of ITS tools.
[2024-05-28 20:11:14] [INFO ] Flatten gal took : 9 ms
[2024-05-28 20:11:14] [INFO ] Applying decomposition
[2024-05-28 20:11:14] [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/graph14734857910419582630.txt' '-o' '/tmp/graph14734857910419582630.bin' '-w' '/tmp/graph14734857910419582630.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14734857910419582630.bin' '-l' '-1' '-v' '-w' '/tmp/graph14734857910419582630.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:11:14] [INFO ] Decomposing Gal with order
[2024-05-28 20:11:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:11:14] [INFO ] Removed a total of 42 redundant transitions.
[2024-05-28 20:11:14] [INFO ] Flatten gal took : 43 ms
[2024-05-28 20:11:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-28 20:11:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality9934047036022368418.gal : 6 ms
[2024-05-28 20:11:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality5101836417286666058.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/CTLCardinality9934047036022368418.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5101836417286666058.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.10649e+23,3.17212,102448,656,29,166681,348,532,640758,49,863,0


Converting to forward existential form...Done !
original formula: EG(E(EF((i7.i1.u41.p117==0)) U ((AF((i10.u58.p170!=1)) * AF((i2.i2.u6.p13==0))) * (E((i3.u12.p37!=1) U ((i6.i2.u47.p139==1)&&(i0.u64.p198...208
=> equivalent forward existential formula: [FwdG(Init,E(E(TRUE U (i7.i1.u41.p117==0)) U ((!(EG(!((i10.u58.p170!=1)))) * !(EG(!((i2.i2.u6.p13==0))))) * (E((...334
Reverse transition relation is NOT exact ! Due to transitions t38, t131, t176, i0.t58, i0.u63.t62, i1.t153, i1.u23.t148, i2.t172, i2.i0.u2.t180, i2.i1.u11....946
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 261/261 places, 241/241 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 260 transition count 182
Reduce places removed 58 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 59 rules applied. Total rules applied 117 place count 202 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 118 place count 201 transition count 181
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 118 place count 201 transition count 161
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 158 place count 181 transition count 161
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 173 place count 166 transition count 146
Iterating global reduction 3 with 15 rules applied. Total rules applied 188 place count 166 transition count 146
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 188 place count 166 transition count 136
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 208 place count 156 transition count 136
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 330 place count 95 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 331 place count 95 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 333 place count 94 transition count 73
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 335 place count 92 transition count 71
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 337 place count 90 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 337 place count 90 transition count 70
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 339 place count 89 transition count 70
Applied a total of 339 rules in 38 ms. Remains 89 /261 variables (removed 172) and now considering 70/241 (removed 171) transitions.
// Phase 1: matrix 70 rows 89 cols
[2024-05-28 20:11:44] [INFO ] Computed 35 invariants in 0 ms
[2024-05-28 20:11:44] [INFO ] Implicit Places using invariants in 60 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 88/261 places, 70/241 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 87 transition count 69
Applied a total of 2 rules in 4 ms. Remains 87 /88 variables (removed 1) and now considering 69/70 (removed 1) transitions.
// Phase 1: matrix 69 rows 87 cols
[2024-05-28 20:11:44] [INFO ] Computed 34 invariants in 1 ms
[2024-05-28 20:11:44] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-28 20:11:44] [INFO ] Invariant cache hit.
[2024-05-28 20:11:45] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 87/261 places, 69/241 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 221 ms. Remains : 87/261 places, 69/241 transitions.
[2024-05-28 20:11:45] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:11:45] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:11:45] [INFO ] Input system was already deterministic with 69 transitions.
[2024-05-28 20:11:45] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:11:45] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:11:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality1120648446576097302.gal : 1 ms
[2024-05-28 20:11:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality17667940872436110075.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/CTLCardinality1120648446576097302.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17667940872436110075.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.20399e+13,0.048648,5760,2,249,5,10703,6,0,420,13592,0


Converting to forward existential form...Done !
original formula: !(A((p93!=0) U AG((p16==0))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,!(!(E(TRUE U !((p16==0)))))) * !((p93!=0))),TRUE) * !((p16==0)))] != FALSE + [FwdG(Init,!(!(E...189
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-28 20:12:15] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:12:15] [INFO ] Applying decomposition
[2024-05-28 20:12:15] [INFO ] Flatten gal took : 2 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/graph3754545515780266033.txt' '-o' '/tmp/graph3754545515780266033.bin' '-w' '/tmp/graph3754545515780266033.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3754545515780266033.bin' '-l' '-1' '-v' '-w' '/tmp/graph3754545515780266033.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:12:15] [INFO ] Decomposing Gal with order
[2024-05-28 20:12:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:12:15] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-28 20:12:15] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:12:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 20:12:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality16684239193463071658.gal : 1 ms
[2024-05-28 20:12:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality729448726973903297.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/CTLCardinality16684239193463071658.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality729448726973903297.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,2.20399e+13,0.028215,4656,29,13,2442,103,180,4570,39,487,0


Converting to forward existential form...Done !
original formula: !(A((i7.u10.p93!=0) U AG((i1.u1.p16==0))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,!(!(E(TRUE U !((i1.u1.p16==0)))))) * !((i7.u10.p93!=0))),TRUE) * !((i1.u1.p16==0)))] != FALSE...214
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 241/241 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 242 transition count 222
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 242 transition count 222
Applied a total of 38 rules in 8 ms. Remains 242 /261 variables (removed 19) and now considering 222/241 (removed 19) transitions.
// Phase 1: matrix 222 rows 242 cols
[2024-05-28 20:12:45] [INFO ] Computed 37 invariants in 2 ms
[2024-05-28 20:12:45] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-28 20:12:45] [INFO ] Invariant cache hit.
[2024-05-28 20:12:45] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-05-28 20:12:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/242 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-28 20:12:47] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 20:12:47] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:12:47] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:12:47] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-28 20:12:47] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-28 20:12:47] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:12:47] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-28 20:12:47] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:12:47] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-05-28 20:12:47] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 20:12:47] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:12:47] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-28 20:12:47] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-28 20:12:47] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:12:47] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:12:48] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-28 20:12:48] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:12:48] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:12:48] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-28 20:12:48] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-28 20:12:48] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:12:48] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:12:48] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:12:48] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:12:48] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:12:49] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:12:49] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:12:49] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:12:49] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:12:49] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 1 ms to minimize.
[2024-05-28 20:12:49] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:12:49] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-28 20:12:50] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-28 20:12:51] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:12:51] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-28 20:12:51] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 222/464 variables, 242/315 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-28 20:12:55] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-28 20:12:56] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:12:56] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 3/318 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-28 20:12:56] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:12:56] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-28 20:12:56] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-28 20:12:56] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 4/322 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-28 20:12:59] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-28 20:12:59] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-28 20:12:59] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:12:59] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/464 variables, 4/326 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/464 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-28 20:13:03] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/464 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/464 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-28 20:13:07] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:13:07] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:13:07] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/464 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/464 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 16 (OVERLAPS) 0/464 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 330 constraints, problems are : Problem set: 0 solved, 221 unsolved in 26633 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/242 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 51/88 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-28 20:13:13] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 222/464 variables, 242/331 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 221/552 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-28 20:13:16] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-28 20:13:16] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-28 20:13:16] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 2 ms to minimize.
[2024-05-28 20:13:17] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:13:17] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-28 20:13:17] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-28 20:13:17] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 20:13:17] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-28 20:13:18] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-28 20:13:18] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 10/562 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-28 20:13:20] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-28 20:13:20] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2024-05-28 20:13:20] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-28 20:13:20] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-05-28 20:13:21] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-05-28 20:13:21] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-28 20:13:21] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 7/569 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-28 20:13:24] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-28 20:13:30] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2024-05-28 20:13:30] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/464 variables, 2/572 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/464 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-28 20:13:40] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/464 variables, 1/573 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 573 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 73/73 constraints]
After SMT, in 56677ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 56679ms
Starting structural reductions in LTL mode, iteration 1 : 242/261 places, 222/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56883 ms. Remains : 242/261 places, 222/241 transitions.
[2024-05-28 20:13:42] [INFO ] Flatten gal took : 9 ms
[2024-05-28 20:13:42] [INFO ] Flatten gal took : 6 ms
[2024-05-28 20:13:42] [INFO ] Input system was already deterministic with 222 transitions.
[2024-05-28 20:13:42] [INFO ] Flatten gal took : 6 ms
[2024-05-28 20:13:42] [INFO ] Flatten gal took : 6 ms
[2024-05-28 20:13:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality15658690952537643573.gal : 2 ms
[2024-05-28 20:13:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality14889975460982120544.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/CTLCardinality15658690952537643573.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14889975460982120544.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.59778e+23,10.1928,300692,2,4250,5,799164,6,0,1192,2.23584e+06,0


Converting to forward existential form...Done !
original formula: E(AG(A(((!((p47==0)||(p0==1)))&&(((p87!=1)||(p60==1))||(p159==1))) U ((p172==0)||(p59==1)))) U ((p106==1) * !((!(((((((p150==0)||(p224==1...307
=> equivalent forward existential formula: ([((FwdU(Init,!(E(TRUE U !(!((E(!(((p172==0)||(p59==1))) U (!(((!((p47==0)||(p0==1)))&&(((p87!=1)||(p60==1))||(p...647
Reverse transition relation is NOT exact ! Due to transitions t7, t11, t13, t17, t21, t26, t30, t34, t38, t41, t42, t43, t44, t45, t47, t48, t52, t56, t61,...518
Detected timeout of ITS tools.
[2024-05-28 20:14:12] [INFO ] Flatten gal took : 11 ms
[2024-05-28 20:14:12] [INFO ] Applying decomposition
[2024-05-28 20:14:12] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2655594347819808464.txt' '-o' '/tmp/graph2655594347819808464.bin' '-w' '/tmp/graph2655594347819808464.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2655594347819808464.bin' '-l' '-1' '-v' '-w' '/tmp/graph2655594347819808464.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:14:12] [INFO ] Decomposing Gal with order
[2024-05-28 20:14:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:14:12] [INFO ] Removed a total of 41 redundant transitions.
[2024-05-28 20:14:12] [INFO ] Flatten gal took : 34 ms
[2024-05-28 20:14:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 20:14:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality16441051204471244638.gal : 4 ms
[2024-05-28 20:14:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality13114404613596625763.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/CTLCardinality16441051204471244638.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13114404613596625763.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.59778e+23,1.25686,42856,651,43,61872,656,507,253284,54,1451,0


Converting to forward existential form...Done !
original formula: E(AG(A(((!((i2.i1.u19.p47==0)||(i0.i0.u0.p0==1)))&&(((i4.i0.u31.p87!=1)||(i1.u23.p60==1))||(i9.i0.u52.p159==1))) U ((i8.u58.p172==0)||(i1...495
=> equivalent forward existential formula: ([((FwdU(Init,!(E(TRUE U !(!((E(!(((i8.u58.p172==0)||(i1.u22.p59==1))) U (!(((!((i2.i1.u19.p47==0)||(i0.i0.u0.p0...958
Reverse transition relation is NOT exact ! Due to transitions t45, t90, t134, t179, i0.t177, i0.i2.u2.t183, i0.i2.u10.t178, i0.i3.t175, i0.i3.u7.t182, i0.i...974
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 241/241 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 242 transition count 222
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 242 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 241 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 241 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 240 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 240 transition count 220
Applied a total of 42 rules in 20 ms. Remains 240 /261 variables (removed 21) and now considering 220/241 (removed 21) transitions.
// Phase 1: matrix 220 rows 240 cols
[2024-05-28 20:14:42] [INFO ] Computed 37 invariants in 1 ms
[2024-05-28 20:14:42] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-28 20:14:42] [INFO ] Invariant cache hit.
[2024-05-28 20:14:42] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-05-28 20:14:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 20:14:44] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:14:44] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:14:44] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:14:44] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-28 20:14:44] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-28 20:14:44] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:14:44] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:14:44] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:14:44] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-28 20:14:44] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-28 20:14:44] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-28 20:14:45] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:14:45] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:14:45] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 2 ms to minimize.
[2024-05-28 20:14:45] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 20:14:45] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:14:45] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:14:45] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:14:45] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:14:45] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 20:14:45] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:14:45] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:14:46] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:14:46] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 1 ms to minimize.
[2024-05-28 20:14:46] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:14:46] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:14:46] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:14:46] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:14:46] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:14:46] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 0 ms to minimize.
[2024-05-28 20:14:46] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-28 20:14:46] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 20:14:48] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-28 20:14:48] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 1 ms to minimize.
[2024-05-28 20:14:48] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 220/460 variables, 240/312 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 20:14:51] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 20:14:52] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (OVERLAPS) 0/460 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 314 constraints, problems are : Problem set: 0 solved, 219 unsolved in 15100 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 37/74 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 20:14:59] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 220/460 variables, 240/315 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 219/534 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 20:15:01] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-28 20:15:01] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-28 20:15:01] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-28 20:15:01] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-28 20:15:01] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-28 20:15:02] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-28 20:15:02] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-05-28 20:15:02] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-05-28 20:15:03] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
[2024-05-28 20:15:03] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-28 20:15:03] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-28 20:15:03] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-28 20:15:03] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-28 20:15:03] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 14/548 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 20:15:06] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-28 20:15:06] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-05-28 20:15:06] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-28 20:15:07] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-28 20:15:07] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 5/553 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 20:15:09] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-28 20:15:09] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-28 20:15:10] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 3/556 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 20:15:18] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/460 variables, 1/557 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 20:15:26] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-28 20:15:26] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-28 20:15:27] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:15:27] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/460 variables, and 561 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 65/65 constraints]
After SMT, in 45134ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 45144ms
Starting structural reductions in LTL mode, iteration 1 : 240/261 places, 220/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45518 ms. Remains : 240/261 places, 220/241 transitions.
[2024-05-28 20:15:27] [INFO ] Flatten gal took : 7 ms
[2024-05-28 20:15:27] [INFO ] Flatten gal took : 6 ms
[2024-05-28 20:15:27] [INFO ] Input system was already deterministic with 220 transitions.
[2024-05-28 20:15:27] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:15:27] [INFO ] Flatten gal took : 6 ms
[2024-05-28 20:15:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality2203365238439744583.gal : 1 ms
[2024-05-28 20:15:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality553392034712504421.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/CTLCardinality2203365238439744583.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality553392034712504421.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.28464e+23,10.1519,300344,2,3811,5,824586,6,0,1182,2.1984e+06,0


Converting to forward existential form...Done !
original formula: ((AF(((((p109==0)&&(p236==1))||((p5==0)&&(p145==1)))&&(p263==0))) * AX(((p110==0)||(p177==1)))) * EX(AF(!(A(EF((p156==1)) U A((p233==0) U...184
=> equivalent forward existential formula: (([FwdG(Init,!(((((p109==0)&&(p236==1))||((p5==0)&&(p145==1)))&&(p263==0))))] = FALSE * [(EY(Init) * !(((p110==0...607
Reverse transition relation is NOT exact ! Due to transitions t7, t11, t16, t20, t21, t26, t30, t35, t36, t39, t40, t41, t42, t43, t45, t46, t50, t54, t59,...510
Detected timeout of ITS tools.
[2024-05-28 20:15:57] [INFO ] Flatten gal took : 9 ms
[2024-05-28 20:15:57] [INFO ] Applying decomposition
[2024-05-28 20:15:57] [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/graph3734714212907758655.txt' '-o' '/tmp/graph3734714212907758655.bin' '-w' '/tmp/graph3734714212907758655.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3734714212907758655.bin' '-l' '-1' '-v' '-w' '/tmp/graph3734714212907758655.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:15:57] [INFO ] Decomposing Gal with order
[2024-05-28 20:15:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:15:58] [INFO ] Removed a total of 42 redundant transitions.
[2024-05-28 20:15:58] [INFO ] Flatten gal took : 11 ms
[2024-05-28 20:15:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 20:15:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality7487913789906236984.gal : 3 ms
[2024-05-28 20:15:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality211336390748554218.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/CTLCardinality7487913789906236984.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality211336390748554218.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.28464e+23,1.17821,43392,659,29,69414,324,552,234425,49,768,0


Converting to forward existential form...Done !
original formula: ((AF(((((i7.u37.p109==0)&&(i13.i1.u77.p236==1))||((i1.i0.u2.p5==0)&&(i13.i0.u48.p145==1)))&&(i16.u88.p263==0))) * AX(((i7.u37.p110==0)||(...289
=> equivalent forward existential formula: (([FwdG(Init,!(((((i7.u37.p109==0)&&(i13.i1.u77.p236==1))||((i1.i0.u2.p5==0)&&(i13.i0.u48.p145==1)))&&(i16.u88.p...910
Reverse transition relation is NOT exact ! Due to transitions t39, t43, t84, t133, t175, i0.t54, i0.u67.t50, i1.i0.u2.t181, i1.i0.u9.t176, i2.t177, i2.i1.u...943
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 261/261 places, 241/241 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 260 transition count 187
Reduce places removed 53 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 54 rules applied. Total rules applied 107 place count 207 transition count 186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 206 transition count 186
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 108 place count 206 transition count 165
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 150 place count 185 transition count 165
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 162 place count 173 transition count 153
Iterating global reduction 3 with 12 rules applied. Total rules applied 174 place count 173 transition count 153
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 174 place count 173 transition count 144
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 192 place count 164 transition count 144
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 316 place count 102 transition count 82
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 318 place count 100 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 319 place count 99 transition count 80
Applied a total of 319 rules in 28 ms. Remains 99 /261 variables (removed 162) and now considering 80/241 (removed 161) transitions.
// Phase 1: matrix 80 rows 99 cols
[2024-05-28 20:16:28] [INFO ] Computed 36 invariants in 1 ms
[2024-05-28 20:16:28] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-28 20:16:28] [INFO ] Invariant cache hit.
[2024-05-28 20:16:28] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2024-05-28 20:16:28] [INFO ] Redundant transitions in 1 ms returned []
Running 78 sub problems to find dead transitions.
[2024-05-28 20:16:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 2/99 variables, 8/36 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-28 20:16:28] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 80/179 variables, 99/136 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 0/179 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 136 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1383 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 2/99 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 80/179 variables, 99/136 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 78/214 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/179 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 214 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1333 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 1/1 constraints]
After SMT, in 2728ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 2730ms
Starting structural reductions in SI_CTL mode, iteration 1 : 99/261 places, 80/241 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2892 ms. Remains : 99/261 places, 80/241 transitions.
[2024-05-28 20:16:30] [INFO ] Flatten gal took : 6 ms
[2024-05-28 20:16:30] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:16:30] [INFO ] Input system was already deterministic with 80 transitions.
[2024-05-28 20:16:30] [INFO ] Flatten gal took : 2 ms
[2024-05-28 20:16:30] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:16:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality6298268541985498040.gal : 1 ms
[2024-05-28 20:16:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality11879875523429794815.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/CTLCardinality6298268541985498040.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11879875523429794815.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.60053e+14,0.162981,10324,2,487,5,28327,6,0,477,42967,0


Converting to forward existential form...Done !
original formula: E(AG(!(EG(AF((p270==1))))) U EG((((p54==0)||(p112==1)) + EF(((p58==0)||(p241==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,!(E(TRUE U !(!(EG(!(EG(!((p270==1)))))))))),(((p54==0)||(p112==1)) + E(TRUE U ((p58==0)||(p241==...171
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t7, t19, t20, t23, t24, t27, t29, t31, t32, t35, t37, t39, t42, t47, ...278
Detected timeout of ITS tools.
[2024-05-28 20:17:01] [INFO ] Flatten gal took : 2 ms
[2024-05-28 20:17:01] [INFO ] Applying decomposition
[2024-05-28 20:17:01] [INFO ] Flatten gal took : 2 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/graph3877132209080606564.txt' '-o' '/tmp/graph3877132209080606564.bin' '-w' '/tmp/graph3877132209080606564.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3877132209080606564.bin' '-l' '-1' '-v' '-w' '/tmp/graph3877132209080606564.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:17:01] [INFO ] Decomposing Gal with order
[2024-05-28 20:17:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:17:01] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-28 20:17:01] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:17:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-28 20:17:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality3325628138496714403.gal : 2 ms
[2024-05-28 20:17:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality10311757379523188626.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/CTLCardinality3325628138496714403.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10311757379523188626.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.60053e+14,0.05775,6104,126,28,5621,161,236,9986,47,698,0


Converting to forward existential form...Done !
original formula: E(AG(!(EG(AF((i12.u32.p270==1))))) U EG((((i2.i1.u7.p54==0)||(i4.u15.p112==1)) + EF(((i2.i1.u8.p58==0)||(i10.u29.p241==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,!(E(TRUE U !(!(EG(!(EG(!((i12.u32.p270==1)))))))))),(((i2.i1.u7.p54==0)||(i4.u15.p112==1)) + E(T...212
Reverse transition relation is NOT exact ! Due to transitions t63, t70, i0.u6.t20, i0.u9.t24, i1.u16.t31, i2.i1.u7.t7, i2.i1.u7.t23, i3.u2.t0, i3.u5.t47, i...437
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 241/241 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 241 transition count 221
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 241 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 240 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 240 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 239 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 239 transition count 219
Applied a total of 44 rules in 13 ms. Remains 239 /261 variables (removed 22) and now considering 219/241 (removed 22) transitions.
// Phase 1: matrix 219 rows 239 cols
[2024-05-28 20:17:31] [INFO ] Computed 37 invariants in 4 ms
[2024-05-28 20:17:31] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-28 20:17:31] [INFO ] Invariant cache hit.
[2024-05-28 20:17:31] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-05-28 20:17:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:17:32] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:17:33] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:17:33] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:17:33] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:17:33] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:17:33] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-28 20:17:33] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-28 20:17:33] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:17:33] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-28 20:17:33] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:17:33] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:17:33] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:17:33] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:17:33] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:17:33] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:17:33] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 20:17:33] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:17:33] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-28 20:17:34] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:17:34] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:17:34] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:17:34] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:17:34] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-28 20:17:34] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:17:34] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:17:34] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-28 20:17:34] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:17:34] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:17:35] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-28 20:17:35] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:17:36] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-05-28 20:17:36] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:17:37] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 219/458 variables, 239/309 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/458 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 309 constraints, problems are : Problem set: 0 solved, 218 unsolved in 12745 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 33/70 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:17:45] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:17:45] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:17:46] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:17:46] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 219/458 variables, 239/313 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 218/531 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:17:48] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 2 ms to minimize.
[2024-05-28 20:17:49] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-28 20:17:49] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-28 20:17:49] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-28 20:17:49] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:17:50] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-05-28 20:17:50] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:17:50] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-28 20:17:50] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:17:50] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-28 20:17:50] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-28 20:17:51] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-28 20:17:51] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-28 20:17:51] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:17:51] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 15/546 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:17:53] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-28 20:17:53] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-28 20:17:53] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-28 20:17:53] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-28 20:17:54] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-28 20:17:55] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 6/552 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:17:57] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-28 20:17:57] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-28 20:17:57] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-28 20:17:58] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 4/556 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:18:02] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2024-05-28 20:18:02] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 20:18:02] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-28 20:18:03] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 4/560 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:18:07] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 1/561 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:18:11] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/458 variables, 1/562 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/458 variables, and 562 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 68/68 constraints]
After SMT, in 42778ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 42780ms
Starting structural reductions in LTL mode, iteration 1 : 239/261 places, 219/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43006 ms. Remains : 239/261 places, 219/241 transitions.
[2024-05-28 20:18:14] [INFO ] Flatten gal took : 10 ms
[2024-05-28 20:18:14] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:18:14] [INFO ] Input system was already deterministic with 219 transitions.
[2024-05-28 20:18:14] [INFO ] Flatten gal took : 12 ms
[2024-05-28 20:18:14] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:18:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality913922914754117542.gal : 2 ms
[2024-05-28 20:18:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality15263479942497008917.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/CTLCardinality913922914754117542.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15263479942497008917.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.27782e+23,11.6353,265332,2,4012,5,738221,6,0,1177,1.91549e+06,0


Converting to forward existential form...Done !
original formula: AG(A(!((AX((p263==1)) * EX(((p107==0)||(p93==1))))) U (p67==1)))
=> equivalent forward existential formula: ([(EY(((FwdU(FwdU(Init,TRUE),!((p67==1))) * !((p67==1))) * !(EX(!((p263==1)))))) * ((p107==0)||(p93==1)))] = FAL...204
Hit Full ! (commute/partial/dont) 217/0/2
(forward)formula 0,0,13.0787,265332,1,0,89,738221,20,3,5481,1.91549e+06,88
FORMULA ShieldIIPt-PT-004B-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 241/241 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 240 transition count 220
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 240 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 239 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 239 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 238 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 238 transition count 218
Applied a total of 46 rules in 16 ms. Remains 238 /261 variables (removed 23) and now considering 218/241 (removed 23) transitions.
// Phase 1: matrix 218 rows 238 cols
[2024-05-28 20:18:27] [INFO ] Computed 37 invariants in 4 ms
[2024-05-28 20:18:27] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-28 20:18:27] [INFO ] Invariant cache hit.
[2024-05-28 20:18:27] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-05-28 20:18:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-28 20:18:30] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:18:30] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:18:30] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:18:30] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:18:30] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:18:30] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:18:30] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-28 20:18:30] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:18:30] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:18:30] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-28 20:18:30] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:18:31] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:18:31] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-28 20:18:31] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 20:18:31] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:18:31] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-28 20:18:31] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:18:33] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 218/456 variables, 238/305 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:18:36] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:18:36] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:18:38] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/456 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 308 constraints, problems are : Problem set: 0 solved, 217 unsolved in 15209 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 33/70 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/456 variables, 238/308 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 217/525 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:18:45] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-28 20:18:45] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:18:45] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-05-28 20:18:45] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
[2024-05-28 20:18:46] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-28 20:18:46] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-28 20:18:46] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:18:46] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-28 20:18:46] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:18:46] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-28 20:18:46] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:18:47] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-28 20:18:47] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-28 20:18:47] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 14/539 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:18:49] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-28 20:18:49] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-28 20:18:50] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-28 20:18:50] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-28 20:18:50] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-28 20:18:50] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-28 20:18:51] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 7/546 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:18:53] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-28 20:18:53] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
[2024-05-28 20:18:54] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 2 ms to minimize.
[2024-05-28 20:18:54] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-28 20:18:54] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:18:54] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:18:55] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-28 20:18:55] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 8/554 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:18:59] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-28 20:18:59] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 2/556 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:19:01] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-28 20:19:02] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 2/558 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:19:06] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 1/559 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:19:08] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 1/560 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/456 variables, and 560 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 68/68 constraints]
After SMT, in 45235ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 45237ms
Starting structural reductions in LTL mode, iteration 1 : 238/261 places, 218/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45473 ms. Remains : 238/261 places, 218/241 transitions.
[2024-05-28 20:19:12] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:19:12] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:19:12] [INFO ] Input system was already deterministic with 218 transitions.
[2024-05-28 20:19:12] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:19:12] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:19:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality7811984258135607108.gal : 1 ms
[2024-05-28 20:19:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality1215714092045393509.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/CTLCardinality7811984258135607108.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1215714092045393509.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.13752e+23,9.09961,240404,2,3561,5,681628,6,0,1172,1.71334e+06,0


Converting to forward existential form...Done !
original formula: (EF(((p81!=1) * EX((p185==0)))) * (AG(AF(((p44==0)&&(p62==1)))) + EX(EX(EF((p244==1))))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((p81!=1) * EX((p185==0))))))] = FALSE * [FwdG(FwdU((Init * !(EX(EX(E(TRUE U (p244==1))))))...196
Reverse transition relation is NOT exact ! Due to transitions t7, t11, t16, t20, t25, t29, t34, t35, t38, t39, t40, t41, t42, t44, t45, t49, t53, t58, t62,...501
Detected timeout of ITS tools.
[2024-05-28 20:19:42] [INFO ] Flatten gal took : 8 ms
[2024-05-28 20:19:42] [INFO ] Applying decomposition
[2024-05-28 20:19:42] [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/graph13290930780944659953.txt' '-o' '/tmp/graph13290930780944659953.bin' '-w' '/tmp/graph13290930780944659953.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13290930780944659953.bin' '-l' '-1' '-v' '-w' '/tmp/graph13290930780944659953.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:19:42] [INFO ] Decomposing Gal with order
[2024-05-28 20:19:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:19:42] [INFO ] Removed a total of 41 redundant transitions.
[2024-05-28 20:19:42] [INFO ] Flatten gal took : 9 ms
[2024-05-28 20:19:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 20:19:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality8581300972180357725.gal : 3 ms
[2024-05-28 20:19:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality13207230365657325446.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/CTLCardinality8581300972180357725.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13207230365657325446.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.13752e+23,0.690347,27512,617,29,45191,330,542,117963,47,824,0


Converting to forward existential form...Done !
original formula: (EF(((i6.i0.u26.p81!=1) * EX((i11.i1.u58.p185==0)))) * (AG(AF(((i2.i1.u16.p44==0)&&(i4.u19.p62==1)))) + EX(EX(EF((i15.i1.u77.p244==1)))))...156
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((i6.i0.u26.p81!=1) * EX((i11.i1.u58.p185==0))))))] = FALSE * [FwdG(FwdU((Init * !(EX(EX(E(...245
Reverse transition relation is NOT exact ! Due to transitions t42, t86, t130, t173, t175, i0.i0.u2.t179, i0.i0.u9.t174, i1.t164, i1.u12.t168, i2.i0.u7.t177...929
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,1,4.36309,119384,1,0,175192,351,3255,602038,269,1061,218843
FORMULA ShieldIIPt-PT-004B-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 241/241 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 240 transition count 220
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 240 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 239 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 239 transition count 219
Applied a total of 44 rules in 8 ms. Remains 239 /261 variables (removed 22) and now considering 219/241 (removed 22) transitions.
// Phase 1: matrix 219 rows 239 cols
[2024-05-28 20:19:47] [INFO ] Computed 37 invariants in 7 ms
[2024-05-28 20:19:47] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-28 20:19:47] [INFO ] Invariant cache hit.
[2024-05-28 20:19:47] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-05-28 20:19:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:19:49] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:19:49] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:19:49] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:19:49] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:19:49] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-28 20:19:49] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:19:49] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
[2024-05-28 20:19:49] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-28 20:19:49] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:19:49] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-28 20:19:49] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:19:49] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-28 20:19:50] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-28 20:19:50] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:19:50] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:19:50] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:19:50] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-28 20:19:50] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-28 20:19:50] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:19:50] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:19:50] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-28 20:19:50] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-28 20:19:50] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-28 20:19:50] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-28 20:19:50] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 1 ms to minimize.
[2024-05-28 20:19:51] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2024-05-28 20:19:51] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-28 20:19:51] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-28 20:19:51] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:19:51] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:19:51] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-05-28 20:19:51] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:19:51] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:19:53] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 219/458 variables, 239/310 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/458 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 310 constraints, problems are : Problem set: 0 solved, 218 unsolved in 10101 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 34/71 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:19:58] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:20:00] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 219/458 variables, 239/312 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 218/530 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:20:02] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:20:02] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-28 20:20:02] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 20:20:02] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-28 20:20:02] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-28 20:20:02] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:20:02] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2024-05-28 20:20:03] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-28 20:20:03] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-28 20:20:03] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 2 ms to minimize.
[2024-05-28 20:20:03] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 20:20:04] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-28 20:20:04] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:20:04] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
[2024-05-28 20:20:04] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 15/545 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:20:06] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-28 20:20:06] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:20:06] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-28 20:20:07] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-28 20:20:07] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-28 20:20:07] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-28 20:20:07] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 7/552 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:20:10] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-05-28 20:20:12] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 2/554 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:20:15] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 1/555 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:20:19] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/458 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/458 variables, and 556 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 62/62 constraints]
After SMT, in 40132ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 40134ms
Starting structural reductions in LTL mode, iteration 1 : 239/261 places, 219/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40353 ms. Remains : 239/261 places, 219/241 transitions.
[2024-05-28 20:20:27] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:20:27] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:20:27] [INFO ] Input system was already deterministic with 219 transitions.
[2024-05-28 20:20:27] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:20:27] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:20:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality8573662529179262386.gal : 2 ms
[2024-05-28 20:20:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality17394513769985328823.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/CTLCardinality8573662529179262386.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17394513769985328823.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18914e+23,9.78852,278104,2,3924,5,772201,6,0,1177,2.02009e+06,0


Converting to forward existential form...Done !
original formula: AF((EG((p243==0)) + (((EX((p238==1)) * EG(AX(((p13==0)||(p265==1))))) * (AG(E((p125==0) U (p159==1))) * (p184==0))) * (((p214==0)||(p168=...173
=> equivalent forward existential formula: [FwdG(Init,!((EG((p243==0)) + (((EX((p238==1)) * EG(!(EX(!(((p13==0)||(p265==1))))))) * (!(E(TRUE U !(E((p125==0...236
Reverse transition relation is NOT exact ! Due to transitions t7, t11, t16, t20, t25, t29, t32, t35, t36, t39, t40, t41, t42, t43, t45, t46, t50, t54, t59,...506
Detected timeout of ITS tools.
[2024-05-28 20:20:57] [INFO ] Flatten gal took : 9 ms
[2024-05-28 20:20:57] [INFO ] Applying decomposition
[2024-05-28 20:20:57] [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/graph4703174856830553086.txt' '-o' '/tmp/graph4703174856830553086.bin' '-w' '/tmp/graph4703174856830553086.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4703174856830553086.bin' '-l' '-1' '-v' '-w' '/tmp/graph4703174856830553086.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:20:57] [INFO ] Decomposing Gal with order
[2024-05-28 20:20:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:20:57] [INFO ] Removed a total of 41 redundant transitions.
[2024-05-28 20:20:57] [INFO ] Flatten gal took : 9 ms
[2024-05-28 20:20:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 20:20:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality13617751908858433776.gal : 3 ms
[2024-05-28 20:20:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality15109921571890071341.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/CTLCardinality13617751908858433776.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15109921571890071341.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18914e+23,1.08913,39664,717,29,58633,281,507,220966,47,697,0


Converting to forward existential form...Done !
original formula: AF((EG((i13.u80.p243==0)) + (((EX((i13.u79.p238==1)) * EG(AX(((i4.i2.u6.p13==0)||(i15.u88.p265==1))))) * (AG(E((i0.u43.p125==0) U (i10.i0...265
=> equivalent forward existential formula: [FwdG(Init,!((EG((i13.u80.p243==0)) + (((EX((i13.u79.p238==1)) * EG(!(EX(!(((i4.i2.u6.p13==0)||(i15.u88.p265==1)...328
Reverse transition relation is NOT exact ! Due to transitions t43, t87, t132, t176, i0.t103, i0.u43.t107, i0.u45.t108, i1.t165, i1.u13.t169, i2.i0.u8.t178,...937
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 261/261 places, 241/241 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 260 transition count 188
Reduce places removed 52 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 55 rules applied. Total rules applied 107 place count 208 transition count 185
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 110 place count 205 transition count 185
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 110 place count 205 transition count 167
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 146 place count 187 transition count 167
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 160 place count 173 transition count 153
Iterating global reduction 3 with 14 rules applied. Total rules applied 174 place count 173 transition count 153
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 174 place count 173 transition count 143
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 194 place count 163 transition count 143
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 306 place count 107 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 307 place count 107 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 309 place count 106 transition count 85
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 311 place count 104 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 313 place count 102 transition count 83
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 313 place count 102 transition count 82
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 315 place count 101 transition count 82
Applied a total of 315 rules in 29 ms. Remains 101 /261 variables (removed 160) and now considering 82/241 (removed 159) transitions.
// Phase 1: matrix 82 rows 101 cols
[2024-05-28 20:21:27] [INFO ] Computed 35 invariants in 0 ms
[2024-05-28 20:21:27] [INFO ] Implicit Places using invariants in 47 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 100/261 places, 82/241 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 99 transition count 81
Applied a total of 2 rules in 4 ms. Remains 99 /100 variables (removed 1) and now considering 81/82 (removed 1) transitions.
// Phase 1: matrix 81 rows 99 cols
[2024-05-28 20:21:27] [INFO ] Computed 34 invariants in 0 ms
[2024-05-28 20:21:28] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-28 20:21:28] [INFO ] Invariant cache hit.
[2024-05-28 20:21:28] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 99/261 places, 81/241 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 198 ms. Remains : 99/261 places, 81/241 transitions.
[2024-05-28 20:21:28] [INFO ] Flatten gal took : 2 ms
[2024-05-28 20:21:28] [INFO ] Flatten gal took : 2 ms
[2024-05-28 20:21:28] [INFO ] Input system was already deterministic with 81 transitions.
[2024-05-28 20:21:28] [INFO ] Flatten gal took : 2 ms
[2024-05-28 20:21:28] [INFO ] Flatten gal took : 2 ms
[2024-05-28 20:21:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality9284570283007778688.gal : 1 ms
[2024-05-28 20:21:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality17846768762453033859.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/CTLCardinality9284570283007778688.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17846768762453033859.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(A(!((AG(((p92==0)||(p94==1))) * !(((((p75==0)||(p58==1))||(p223==1))&&(p71==1))))) U !(((p107==1) * E((p150==0) U (p186==0))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!(((p107==1) * E((p150==0) U (p186==0))))) U (!(!((!(E(TRUE U !(((p92==0)||(p94==1))))) * !(((...315
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t5, t8, t10, t13, t23, t27, t30, t32, t34, t35, t38, t45, t48, t54, t64, t68, t71, t7...256
Detected timeout of ITS tools.
[2024-05-28 20:21:58] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:21:58] [INFO ] Applying decomposition
[2024-05-28 20:21:58] [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/graph10573950588893807513.txt' '-o' '/tmp/graph10573950588893807513.bin' '-w' '/tmp/graph10573950588893807513.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10573950588893807513.bin' '-l' '-1' '-v' '-w' '/tmp/graph10573950588893807513.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:21:58] [INFO ] Decomposing Gal with order
[2024-05-28 20:21:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:21:58] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-28 20:21:58] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:21:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-28 20:21:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality5215242361617982622.gal : 1 ms
[2024-05-28 20:21:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality7687426054330396217.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/CTLCardinality5215242361617982622.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7687426054330396217.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.56892e+14,0.066438,6632,122,24,6308,189,261,11545,53,623,0


Converting to forward existential form...Done !
original formula: EG(A(!((AG(((i3.u13.p92==0)||(i4.u14.p94==1))) * !(((((i2.u9.p75==0)||(i1.i1.u8.p58==1))||(i11.u30.p223==1))&&(i2.u10.p71==1))))) U !(((i...215
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!(((i6.u16.p107==1) * E((i9.u21.p150==0) U (i10.u27.p186==0))))) U (!(!((!(E(TRUE U !(((i3.u13...425
Reverse transition relation is NOT exact ! Due to transitions t64, t68, t71, u20.t34, i0.u2.t0, i0.u6.t27, i1.i1.u7.t48, i2.t13, i2.u10.t23, i3.u12.t1, i3....366
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 241/241 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 244 transition count 224
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 244 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 243 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 243 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 242 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 242 transition count 222
Applied a total of 38 rules in 16 ms. Remains 242 /261 variables (removed 19) and now considering 222/241 (removed 19) transitions.
// Phase 1: matrix 222 rows 242 cols
[2024-05-28 20:22:28] [INFO ] Computed 37 invariants in 1 ms
[2024-05-28 20:22:28] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-28 20:22:28] [INFO ] Invariant cache hit.
[2024-05-28 20:22:28] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-05-28 20:22:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/242 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-28 20:22:30] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:22:30] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:22:30] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-05-28 20:22:30] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:22:30] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:22:30] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 9 ms to minimize.
[2024-05-28 20:22:30] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-28 20:22:30] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-28 20:22:30] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:22:30] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:22:30] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:22:30] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:22:30] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-28 20:22:30] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:22:30] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-28 20:22:30] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:22:31] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:22:31] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:22:31] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:22:31] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-28 20:22:31] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:22:31] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-28 20:22:31] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:22:31] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
[2024-05-28 20:22:31] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-28 20:22:31] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:22:31] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-28 20:22:31] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2024-05-28 20:22:32] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:22:32] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:22:32] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2024-05-28 20:22:32] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:22:32] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-28 20:22:33] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-28 20:22:34] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 222/464 variables, 242/314 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-28 20:22:38] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-28 20:22:38] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:22:39] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/464 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-28 20:22:39] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:22:39] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:22:40] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:22:40] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:22:40] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 5/322 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/464 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-28 20:22:44] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:22:44] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/464 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-28 20:22:45] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-05-28 20:22:45] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/464 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 14 (OVERLAPS) 0/464 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 326 constraints, problems are : Problem set: 0 solved, 221 unsolved in 22121 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/242 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 47/84 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-28 20:22:51] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-28 20:22:52] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 222/464 variables, 242/328 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 221/549 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-28 20:22:54] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
[2024-05-28 20:22:54] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 20:22:54] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
[2024-05-28 20:22:54] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-28 20:22:55] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-28 20:22:55] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-28 20:22:55] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:22:55] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:22:56] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-28 20:22:56] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 20:22:56] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 20:22:56] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 12/561 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-28 20:22:59] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 20:22:59] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 2/563 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/464 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 464/464 variables, and 563 constraints, problems are : Problem set: 0 solved, 221 unsolved in 20590 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 63/63 constraints]
After SMT, in 42727ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 42729ms
Starting structural reductions in LTL mode, iteration 1 : 242/261 places, 222/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42961 ms. Remains : 242/261 places, 222/241 transitions.
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 10 ms
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:23:11] [INFO ] Input system was already deterministic with 222 transitions.
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:23:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality9080027500356908317.gal : 1 ms
[2024-05-28 20:23:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality17622816198558122116.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/CTLCardinality9080027500356908317.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17622816198558122116.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.69862e+23,14.0044,398320,2,4714,5,1.03593e+06,6,0,1192,2.98226e+06,0


Converting to forward existential form...Done !
original formula: AG((((AX((p37==1)) + A((p255==1) U (p85==1))) + (EF((p190==1)) * (EX((p114==0)) + ((p1==0)&&(p252==1))))) * (((p216==0)||(p273==1)) + (E(...233
=> equivalent forward existential formula: ([(EY(((FwdU(Init,TRUE) * !((E(TRUE U (p190==1)) * (EX((p114==0)) + ((p1==0)&&(p252==1)))))) * !(!((E(!((p85==1)...428
Reverse transition relation is NOT exact ! Due to transitions t7, t12, t14, t17, t21, t26, t30, t31, t32, t36, t37, t40, t41, t42, t43, t44, t46, t47, t52,...538
Detected timeout of ITS tools.
[2024-05-28 20:23:41] [INFO ] Flatten gal took : 10 ms
[2024-05-28 20:23:41] [INFO ] Applying decomposition
[2024-05-28 20:23:41] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8299478452832255473.txt' '-o' '/tmp/graph8299478452832255473.bin' '-w' '/tmp/graph8299478452832255473.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8299478452832255473.bin' '-l' '-1' '-v' '-w' '/tmp/graph8299478452832255473.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:23:41] [INFO ] Decomposing Gal with order
[2024-05-28 20:23:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:23:41] [INFO ] Removed a total of 35 redundant transitions.
[2024-05-28 20:23:41] [INFO ] Flatten gal took : 10 ms
[2024-05-28 20:23:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 20:23:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality14866234460990890466.gal : 2 ms
[2024-05-28 20:23:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality14559008057674238109.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/CTLCardinality14866234460990890466.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14559008057674238109.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.69862e+23,1.38644,47320,753,43,79911,707,531,224575,61,1622,0


Converting to forward existential form...Done !
original formula: AG((((AX((i3.u11.p37==1)) + A((i14.u79.p255==1) U (i6.i1.u27.p85==1))) + (EF((i10.i1.u60.p190==1)) * (EX((i5.i1.u37.p114==0)) + ((i0.i0.u...377
=> equivalent forward existential formula: ([(EY(((FwdU(Init,TRUE) * !((E(TRUE U (i10.i1.u60.p190==1)) * (EX((i5.i1.u37.p114==0)) + ((i0.i0.u0.p1==0)&&(i14...612
Reverse transition relation is NOT exact ! Due to transitions t44, t90, t135, t177, i0.i1.u2.t183, i0.i1.u9.t178, i1.t151, i1.u20.t155, i2.t179, i2.i1.t175...1033
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 261/261 places, 241/241 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 260 transition count 182
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 116 place count 202 transition count 182
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 116 place count 202 transition count 162
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 156 place count 182 transition count 162
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 171 place count 167 transition count 147
Iterating global reduction 2 with 15 rules applied. Total rules applied 186 place count 167 transition count 147
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 186 place count 167 transition count 137
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 206 place count 157 transition count 137
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 328 place count 96 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 329 place count 96 transition count 75
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 331 place count 95 transition count 74
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 332 place count 95 transition count 74
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 334 place count 93 transition count 72
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 336 place count 91 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 336 place count 91 transition count 71
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 338 place count 90 transition count 71
Applied a total of 338 rules in 23 ms. Remains 90 /261 variables (removed 171) and now considering 71/241 (removed 170) transitions.
// Phase 1: matrix 71 rows 90 cols
[2024-05-28 20:24:11] [INFO ] Computed 35 invariants in 0 ms
[2024-05-28 20:24:11] [INFO ] Implicit Places using invariants in 52 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 89/261 places, 71/241 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 88 transition count 70
Applied a total of 2 rules in 2 ms. Remains 88 /89 variables (removed 1) and now considering 70/71 (removed 1) transitions.
// Phase 1: matrix 70 rows 88 cols
[2024-05-28 20:24:11] [INFO ] Computed 34 invariants in 0 ms
[2024-05-28 20:24:11] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-28 20:24:11] [INFO ] Invariant cache hit.
[2024-05-28 20:24:11] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 88/261 places, 70/241 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 181 ms. Remains : 88/261 places, 70/241 transitions.
[2024-05-28 20:24:11] [INFO ] Flatten gal took : 1 ms
[2024-05-28 20:24:11] [INFO ] Flatten gal took : 2 ms
[2024-05-28 20:24:11] [INFO ] Input system was already deterministic with 70 transitions.
[2024-05-28 20:24:11] [INFO ] Flatten gal took : 2 ms
[2024-05-28 20:24:11] [INFO ] Flatten gal took : 2 ms
[2024-05-28 20:24:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality15971864740893536809.gal : 1 ms
[2024-05-28 20:24:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality13949012095852190939.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/CTLCardinality15971864740893536809.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13949012095852190939.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.93866e+13,0.063202,6296,2,277,5,12501,6,0,425,17263,0


Converting to forward existential form...Done !
original formula: EG(EF(((p29==0)||(p44==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((p29==0)||(p44==1))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.142458,8936,1,0,8,27519,18,5,2201,24526,10
FORMULA ShieldIIPt-PT-004B-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 241/241 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 240 transition count 220
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 240 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 239 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 239 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 238 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 238 transition count 218
Applied a total of 46 rules in 6 ms. Remains 238 /261 variables (removed 23) and now considering 218/241 (removed 23) transitions.
// Phase 1: matrix 218 rows 238 cols
[2024-05-28 20:24:11] [INFO ] Computed 37 invariants in 3 ms
[2024-05-28 20:24:11] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-28 20:24:11] [INFO ] Invariant cache hit.
[2024-05-28 20:24:11] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-05-28 20:24:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:24:13] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:24:13] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:24:13] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-28 20:24:13] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-28 20:24:13] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-05-28 20:24:13] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-28 20:24:13] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:24:14] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-28 20:24:14] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:24:14] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:24:14] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:24:14] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-05-28 20:24:14] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:24:14] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-05-28 20:24:14] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2024-05-28 20:24:14] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:24:14] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:24:14] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-28 20:24:14] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2024-05-28 20:24:14] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:24:14] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:24:15] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:24:15] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 0 ms to minimize.
[2024-05-28 20:24:15] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:24:15] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-28 20:24:15] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:24:15] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-05-28 20:24:15] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-28 20:24:15] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:24:15] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:24:17] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:24:17] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 218/456 variables, 238/307 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 0/456 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 307 constraints, problems are : Problem set: 0 solved, 217 unsolved in 10291 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 32/69 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/456 variables, 238/307 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 217/524 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:24:24] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-28 20:24:25] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-28 20:24:25] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-05-28 20:24:25] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-05-28 20:24:25] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-28 20:24:25] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-28 20:24:25] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-05-28 20:24:25] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-28 20:24:25] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
[2024-05-28 20:24:26] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
[2024-05-28 20:24:26] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 2 ms to minimize.
[2024-05-28 20:24:26] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 0 ms to minimize.
[2024-05-28 20:24:26] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:24:27] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 20:24:27] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-28 20:24:27] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 16/540 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:24:29] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-28 20:24:30] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-28 20:24:30] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:24:31] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 4/544 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:24:33] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-28 20:24:34] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-28 20:24:34] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-28 20:24:34] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:24:35] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 5/549 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:24:38] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 1/550 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:24:40] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-28 20:24:41] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 2/552 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 12 (OVERLAPS) 0/456 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 552 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 60/60 constraints]
After SMT, in 40317ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 40319ms
Starting structural reductions in LTL mode, iteration 1 : 238/261 places, 218/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40538 ms. Remains : 238/261 places, 218/241 transitions.
[2024-05-28 20:24:52] [INFO ] Flatten gal took : 9 ms
[2024-05-28 20:24:52] [INFO ] Flatten gal took : 6 ms
[2024-05-28 20:24:52] [INFO ] Input system was already deterministic with 218 transitions.
[2024-05-28 20:24:52] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:24:52] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:24:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality17571071969341327311.gal : 1 ms
[2024-05-28 20:24:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality12759643765935630481.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/CTLCardinality17571071969341327311.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12759643765935630481.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.11216e+23,8.65359,247656,2,3508,5,706765,6,0,1172,1.76872e+06,0


Converting to forward existential form...Done !
original formula: EX((AG((p104==0)) + EX(!(A((p149==1) U ((p141==0)||(p39==1)))))))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U !((p104==0)))))] != FALSE + ([(FwdU(EY(EY(Init)),!(((p141==0)||(p39==1)))) * (!((p149==...256
Reverse transition relation is NOT exact ! Due to transitions t7, t11, t16, t20, t25, t29, t34, t35, t38, t39, t40, t41, t42, t44, t45, t49, t53, t58, t62,...501
Detected timeout of ITS tools.
[2024-05-28 20:25:22] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:25:22] [INFO ] Applying decomposition
[2024-05-28 20:25:22] [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/graph1030626474624477052.txt' '-o' '/tmp/graph1030626474624477052.bin' '-w' '/tmp/graph1030626474624477052.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1030626474624477052.bin' '-l' '-1' '-v' '-w' '/tmp/graph1030626474624477052.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:25:22] [INFO ] Decomposing Gal with order
[2024-05-28 20:25:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:25:22] [INFO ] Removed a total of 42 redundant transitions.
[2024-05-28 20:25:22] [INFO ] Flatten gal took : 9 ms
[2024-05-28 20:25:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 20:25:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality5410142633596604503.gal : 3 ms
[2024-05-28 20:25:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality96880858471736468.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/CTLCardinality5410142633596604503.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality96880858471736468.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 -...260
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.11216e+23,0.684593,27524,649,29,44653,339,534,111404,50,1020,0


Converting to forward existential form...Done !
original formula: EX((AG((i4.u32.p104==0)) + EX(!(A((i11.i0.u47.p149==1) U ((i5.i2.u44.p141==0)||(i3.u12.p39==1)))))))
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U !((i4.u32.p104==0)))))] != FALSE + ([(FwdU(EY(EY(Init)),!(((i5.i2.u44.p141==0)||(i3.u12...325
Reverse transition relation is NOT exact ! Due to transitions t38, t82, t86, t130, t173, t175, i0.i1.u1.t179, i0.i1.u9.t174, i0.i2.t146, i0.i2.u19.t150, i1...935
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,0,3.60018,112004,1,0,195544,339,3179,449680,277,1026,245863
FORMULA ShieldIIPt-PT-004B-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 241/241 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 240 transition count 220
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 240 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 239 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 239 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 238 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 238 transition count 218
Applied a total of 46 rules in 13 ms. Remains 238 /261 variables (removed 23) and now considering 218/241 (removed 23) transitions.
// Phase 1: matrix 218 rows 238 cols
[2024-05-28 20:25:26] [INFO ] Computed 37 invariants in 1 ms
[2024-05-28 20:25:26] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-28 20:25:26] [INFO ] Invariant cache hit.
[2024-05-28 20:25:26] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-05-28 20:25:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:25:27] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 20:25:27] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:25:27] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:25:28] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-28 20:25:28] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-28 20:25:28] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-28 20:25:28] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:25:28] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-28 20:25:28] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:25:28] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-28 20:25:28] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:25:28] [INFO ] Deduced a trap composed of 13 places in 16 ms of which 0 ms to minimize.
[2024-05-28 20:25:28] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-28 20:25:28] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-28 20:25:28] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-28 20:25:28] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:25:28] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:25:28] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-28 20:25:28] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-28 20:25:28] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:25:29] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:25:29] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 0 ms to minimize.
[2024-05-28 20:25:29] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:25:29] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:25:29] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:25:29] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-28 20:25:29] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 1 ms to minimize.
[2024-05-28 20:25:29] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-28 20:25:29] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:25:31] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 218/456 variables, 238/305 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:25:34] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:25:35] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:25:36] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/456 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 308 constraints, problems are : Problem set: 0 solved, 217 unsolved in 14972 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 33/70 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/456 variables, 238/308 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 217/525 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:25:43] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:25:43] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:25:43] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2024-05-28 20:25:44] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-05-28 20:25:44] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 2 ms to minimize.
[2024-05-28 20:25:44] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-28 20:25:44] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:25:44] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:25:44] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:25:45] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-28 20:25:45] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:25:45] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:25:45] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:25:45] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 14/539 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:25:47] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-28 20:25:47] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-05-28 20:25:48] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:25:48] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-28 20:25:49] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-28 20:25:49] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 2 ms to minimize.
[2024-05-28 20:25:49] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 7/546 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:25:51] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-05-28 20:25:52] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-28 20:25:52] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-28 20:25:52] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-28 20:25:52] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-28 20:25:52] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-28 20:25:53] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-28 20:25:53] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 8/554 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:25:57] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:25:57] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 2/556 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:25:59] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-28 20:26:00] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 2/558 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:26:04] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 1/559 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:26:07] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 1/560 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/456 variables, and 560 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 68/68 constraints]
After SMT, in 45010ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 45012ms
Starting structural reductions in LTL mode, iteration 1 : 238/261 places, 218/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45227 ms. Remains : 238/261 places, 218/241 transitions.
[2024-05-28 20:26:11] [INFO ] Flatten gal took : 6 ms
[2024-05-28 20:26:11] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:26:11] [INFO ] Input system was already deterministic with 218 transitions.
[2024-05-28 20:26:11] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:26:11] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:26:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality3642887543589984605.gal : 1 ms
[2024-05-28 20:26:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality12183589530071748120.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/CTLCardinality3642887543589984605.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12183589530071748120.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.13752e+23,8.55223,240752,2,3561,5,681628,6,0,1172,1.71334e+06,0


Converting to forward existential form...Done !
original formula: EF((EG(AX(((p29!=0)&&(p44!=1)))) * !(E(E(AG((p19==1)) U (p115!=1)) U ((p74==1) * AG((p76==1)))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * EG(!(EX(!(((p29!=0)&&(p44!=1))))))) * !(E(E(!(E(TRUE U !((p19==1)))) U (p115!=1)) U ((p74==...198
Reverse transition relation is NOT exact ! Due to transitions t7, t11, t16, t20, t25, t29, t34, t35, t38, t39, t40, t41, t42, t44, t45, t49, t53, t58, t62,...501
Using saturation style SCC detection
(forward)formula 0,1,11.3631,240752,1,0,555,791267,478,235,6987,1.71334e+06,558
FORMULA ShieldIIPt-PT-004B-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 241/241 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 243 transition count 223
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 243 transition count 223
Applied a total of 36 rules in 4 ms. Remains 243 /261 variables (removed 18) and now considering 223/241 (removed 18) transitions.
// Phase 1: matrix 223 rows 243 cols
[2024-05-28 20:26:22] [INFO ] Computed 37 invariants in 7 ms
[2024-05-28 20:26:22] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-28 20:26:22] [INFO ] Invariant cache hit.
[2024-05-28 20:26:22] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2024-05-28 20:26:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/243 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-28 20:26:24] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:26:24] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-28 20:26:24] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 1 ms to minimize.
[2024-05-28 20:26:24] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:26:24] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-28 20:26:24] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:26:24] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:26:24] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-28 20:26:24] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-28 20:26:25] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
[2024-05-28 20:26:25] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:26:25] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:26:25] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 0 ms to minimize.
[2024-05-28 20:26:25] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:26:25] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:26:25] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-28 20:26:25] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:26:25] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:26:25] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-28 20:26:25] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-28 20:26:25] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:26:26] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:26:26] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:26:26] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:26:26] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:26:26] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:26:26] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-05-28 20:26:26] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-28 20:26:26] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:26:26] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:26:26] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 1 ms to minimize.
[2024-05-28 20:26:26] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:26:26] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:26:26] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 14/71 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 223/466 variables, 243/314 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-28 20:26:32] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/466 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-28 20:26:33] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:26:34] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-05-28 20:26:34] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 3/318 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-28 20:26:37] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-28 20:26:37] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/466 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-28 20:26:38] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:26:39] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/466 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/466 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 13 (OVERLAPS) 0/466 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/466 variables, and 322 constraints, problems are : Problem set: 0 solved, 222 unsolved in 21467 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/243 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 42/79 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-28 20:26:45] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 223/466 variables, 243/323 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 222/545 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-28 20:26:48] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-28 20:26:48] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
[2024-05-28 20:26:48] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-28 20:26:48] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-28 20:26:49] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
[2024-05-28 20:26:49] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:26:49] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2024-05-28 20:26:49] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:26:49] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:26:49] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2024-05-28 20:26:50] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 20:26:50] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2024-05-28 20:26:50] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-28 20:26:50] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:26:50] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:26:50] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:26:50] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 17/562 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-28 20:26:53] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-28 20:26:53] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 2 ms to minimize.
[2024-05-28 20:26:53] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 20:26:53] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-28 20:26:54] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:26:54] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 6/568 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-28 20:27:02] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:27:02] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/466 variables, 2/570 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/466 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 12 (OVERLAPS) 0/466 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Int declared 466/466 variables, and 570 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 68/68 constraints]
After SMT, in 51492ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 51494ms
Starting structural reductions in LTL mode, iteration 1 : 243/261 places, 223/241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51705 ms. Remains : 243/261 places, 223/241 transitions.
[2024-05-28 20:27:14] [INFO ] Flatten gal took : 11 ms
[2024-05-28 20:27:14] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:27:14] [INFO ] Input system was already deterministic with 223 transitions.
[2024-05-28 20:27:14] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:27:14] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:27:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality663410423203831114.gal : 1 ms
[2024-05-28 20:27:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality12105641849822550657.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/CTLCardinality663410423203831114.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12105641849822550657.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.8805e+23,11.6709,327660,2,4591,5,873383,6,0,1197,2.42387e+06,0


Converting to forward existential form...Done !
original formula: A(((p125==1) + (AX(((p275==0)||(p82==1))) * (!((((p12==0)&&(p13==1)) * ((p226==1) * EG(((p42==0)||(p154==1)))))) + ((A(EF(((p166==0)||(p1...383
=> equivalent forward existential formula: [((Init * !(EG(!(((!(EX(!(!(((p157==0)||(p93==1)))))) + EG((!(EX(!((p113==0)))) + E((p190!=1) U (((p153==0)||(p2...873
Reverse transition relation is NOT exact ! Due to transitions t7, t11, t12, t17, t21, t22, t27, t31, t35, t39, t42, t43, t44, t45, t46, t48, t49, t53, t57,...524
Detected timeout of ITS tools.
[2024-05-28 20:27:44] [INFO ] Flatten gal took : 10 ms
[2024-05-28 20:27:44] [INFO ] Applying decomposition
[2024-05-28 20:27:44] [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/graph17955363316926833494.txt' '-o' '/tmp/graph17955363316926833494.bin' '-w' '/tmp/graph17955363316926833494.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17955363316926833494.bin' '-l' '-1' '-v' '-w' '/tmp/graph17955363316926833494.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:27:44] [INFO ] Decomposing Gal with order
[2024-05-28 20:27:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:27:44] [INFO ] Removed a total of 40 redundant transitions.
[2024-05-28 20:27:44] [INFO ] Flatten gal took : 10 ms
[2024-05-28 20:27:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 20:27:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality17408921703257114593.gal : 2 ms
[2024-05-28 20:27:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality17128421956387698864.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/CTLCardinality17408921703257114593.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17128421956387698864.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.8805e+23,1.35152,47908,706,29,70408,374,579,286538,48,989,0


Converting to forward existential form...Done !
original formula: A(((i6.u43.p125==1) + (AX(((i15.u95.p275==0)||(i7.i1.u28.p82==1))) * (!((((i0.i2.u5.p12==0)&&(i0.i3.u6.p13==1)) * ((i13.i1.u75.p226==1) *...627
=> equivalent forward existential formula: [((Init * !(EG(!(((!(EX(!(!(((i10.i1.u53.p157==0)||(i5.i0.u30.p93==1)))))) + EG((!(EX(!((i5.i1.u38.p113==0)))) +...1341
Reverse transition relation is NOT exact ! Due to transitions t42, t86, t136, t180, i0.t178, i0.t176, i0.i0.u2.t184, i0.i0.u10.t179, i0.i2.u11.t177, i0.i3....989
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 261/261 places, 241/241 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 260 transition count 184
Reduce places removed 56 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 58 rules applied. Total rules applied 114 place count 204 transition count 182
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 116 place count 202 transition count 182
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 116 place count 202 transition count 162
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 156 place count 182 transition count 162
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 170 place count 168 transition count 148
Iterating global reduction 3 with 14 rules applied. Total rules applied 184 place count 168 transition count 148
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 184 place count 168 transition count 139
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 202 place count 159 transition count 139
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 322 place count 99 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 323 place count 99 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 325 place count 98 transition count 77
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 327 place count 96 transition count 75
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 329 place count 94 transition count 75
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 329 place count 94 transition count 74
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 331 place count 93 transition count 74
Applied a total of 331 rules in 13 ms. Remains 93 /261 variables (removed 168) and now considering 74/241 (removed 167) transitions.
// Phase 1: matrix 74 rows 93 cols
[2024-05-28 20:28:14] [INFO ] Computed 35 invariants in 0 ms
[2024-05-28 20:28:14] [INFO ] Implicit Places using invariants in 48 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 92/261 places, 74/241 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 91 transition count 73
Applied a total of 2 rules in 3 ms. Remains 91 /92 variables (removed 1) and now considering 73/74 (removed 1) transitions.
// Phase 1: matrix 73 rows 91 cols
[2024-05-28 20:28:14] [INFO ] Computed 34 invariants in 1 ms
[2024-05-28 20:28:14] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-28 20:28:14] [INFO ] Invariant cache hit.
[2024-05-28 20:28:14] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 91/261 places, 73/241 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 247 ms. Remains : 91/261 places, 73/241 transitions.
[2024-05-28 20:28:14] [INFO ] Flatten gal took : 1 ms
[2024-05-28 20:28:14] [INFO ] Flatten gal took : 1 ms
[2024-05-28 20:28:14] [INFO ] Input system was already deterministic with 73 transitions.
[2024-05-28 20:28:14] [INFO ] Flatten gal took : 2 ms
[2024-05-28 20:28:14] [INFO ] Flatten gal took : 1 ms
[2024-05-28 20:28:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality9170355458949656941.gal : 0 ms
[2024-05-28 20:28:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality5209045638485985034.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/CTLCardinality9170355458949656941.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5209045638485985034.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.9441e+13,0.109215,8688,2,437,5,21641,6,0,438,33060,0


Converting to forward existential form...Done !
original formula: AF(EG((((p271==0)||(p234==0)) + ((p94==0) + AG((p175==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG((((p271==0)||(p234==0)) + ((p94==0) + !(E(TRUE U !((p175==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t5, t15, t17, t19, t21, t23, t25, t27, t30, t31, t34, t36, t40, t43, t50, t57...260
Detected timeout of ITS tools.
[2024-05-28 20:28:44] [INFO ] Flatten gal took : 2 ms
[2024-05-28 20:28:44] [INFO ] Applying decomposition
[2024-05-28 20:28:44] [INFO ] Flatten gal took : 2 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/graph11821338062132662732.txt' '-o' '/tmp/graph11821338062132662732.bin' '-w' '/tmp/graph11821338062132662732.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11821338062132662732.bin' '-l' '-1' '-v' '-w' '/tmp/graph11821338062132662732.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:28:44] [INFO ] Decomposing Gal with order
[2024-05-28 20:28:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:28:44] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-28 20:28:44] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:28:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-28 20:28:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality16420282753070354037.gal : 5 ms
[2024-05-28 20:28:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality15220171015272712756.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/CTLCardinality16420282753070354037.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15220171015272712756.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.9441e+13,0.054599,5996,89,23,5133,154,210,9436,45,639,0


Converting to forward existential form...Done !
original formula: AF(EG((((i13.u29.p271==0)||(i14.u27.p234==0)) + ((i4.u11.p94==0) + AG((u21.p175==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG((((i13.u29.p271==0)||(i14.u27.p234==0)) + ((i4.u11.p94==0) + !(E(TRUE U !((u21.p175==1)))))))))]...163
Reverse transition relation is NOT exact ! Due to transitions t57, t63, u16.t27, u21.t4, i0.u8.t19, i1.u7.t43, i2.u15.t25, i3.u2.t0, i3.u6.t17, i4.u5.t40, ...383
Detected timeout of ITS tools.
[2024-05-28 20:29:14] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:29:14] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:29:14] [INFO ] Applying decomposition
[2024-05-28 20:29:14] [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/graph2380229137681800892.txt' '-o' '/tmp/graph2380229137681800892.bin' '-w' '/tmp/graph2380229137681800892.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2380229137681800892.bin' '-l' '-1' '-v' '-w' '/tmp/graph2380229137681800892.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:29:14] [INFO ] Decomposing Gal with order
[2024-05-28 20:29:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:29:14] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-28 20:29:15] [INFO ] Flatten gal took : 11 ms
[2024-05-28 20:29:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 20:29:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality17858300559510034791.gal : 3 ms
[2024-05-28 20:29:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality16670701603421242436.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/CTLCardinality17858300559510034791.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16670701603421242436.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.54258e+23,8.34026,185868,1377,36,285108,374,565,903982,51,1151,0


Converting to forward existential form...Done !
original formula: EG(E(EF((i6.i1.u43.p117==0)) U ((AF((i12.u65.p170!=1)) * AF((i5.i0.u5.p13==0))) * (E((i4.u14.p37!=1) U ((i9.i2.u52.p139==1)&&(i10.i1.u71....212
=> equivalent forward existential formula: [FwdG(Init,E(E(TRUE U (i6.i1.u43.p117==0)) U ((!(EG(!((i12.u65.p170!=1)))) * !(EG(!((i5.i0.u5.p13==0))))) * (E((...338
Reverse transition relation is NOT exact ! Due to transitions t95, t147, t198, i0.t44, i0.t43, i0.t39, i1.i1.u2.t202, i2.i0.u7.t200, i2.i1.t180, i2.i1.u16....1231
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
[2024-05-28 20:56:07] [INFO ] Applying decomposition
[2024-05-28 20:56:07] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:56:07] [INFO ] Decomposing Gal with order
[2024-05-28 20:56:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:56:07] [INFO ] Removed a total of 8 redundant transitions.
[2024-05-28 20:56:07] [INFO ] Flatten gal took : 8 ms
[2024-05-28 20:56:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 20:56:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality3673286331095068392.gal : 3 ms
[2024-05-28 20:56:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality11203335996581855504.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/CTLCardinality3673286331095068392.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11203335996581855504.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 10 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.54258e+23,81.0771,2458216,2139,363,4.14857e+06,983,357,2.12144e+07,138,10596,0


Converting to forward existential form...Done !
original formula: EG(E(EF((i0.i0.i1.i0.i0.u36.p117==0)) U ((AF((i0.i1.i0.i0.i0.u52.p170!=1)) * AF((i0.i0.i0.i1.i0.i0.i0.i0.i0.u83.p13==0))) * (E((i0.i0.i0....307
=> equivalent forward existential formula: [FwdG(Init,E(E(TRUE U (i0.i0.i1.i0.i0.u36.p117==0)) U ((!(EG(!((i0.i1.i0.i0.i0.u52.p170!=1)))) * !(EG(!((i0.i0.i...469
Reverse transition relation is NOT exact ! Due to transitions i0.i0.i0.u4.t202, i0.i0.i0.i1.u21.t155, i0.i0.i0.i1.u21.t159, i0.i0.i0.i1.u21.t161, i0.i0.i0....2313
ITS-tools command line returned an error code 137
[2024-05-28 21:05:53] [INFO ] Flatten gal took : 14 ms
[2024-05-28 21:05:53] [INFO ] Input system was already deterministic with 241 transitions.
[2024-05-28 21:05:53] [INFO ] Transformed 261 places.
[2024-05-28 21:05:53] [INFO ] Transformed 241 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 21:05:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality2150688929188458986.gal : 3 ms
[2024-05-28 21:05:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality14279343292615103548.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/CTLCardinality2150688929188458986.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14279343292615103548.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 -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.54258e+23,10.2903,276120,2,10695,5,911424,6,0,1287,1.82341e+06,0


Converting to forward existential form...Done !
original formula: EG(E(EF((p117==0)) U ((AF((p170!=1)) * AF((p13==0))) * (E((p37!=1) U ((p139==1)&&(p198==0))) * A(AX((p63==1)) U (p38==0))))))
=> equivalent forward existential formula: [FwdG(Init,E(E(TRUE U (p117==0)) U ((!(EG(!((p170!=1)))) * !(EG(!((p13==0))))) * (E((p37!=1) U ((p139==1)&&(p198...255
Reverse transition relation is NOT exact ! Due to transitions t8, t13, t15, t16, t20, t24, t26, t30, t34, t35, t36, t39, t43, t44, t47, t48, t49, t50, t51,...637

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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